To see the other types of publications on this topic, follow the link: Posel.
Dissertations / Theses on the topic 'Posel'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Posel.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Tokunaga, Daniel Makoto. "Local pose estimation of feature points for object based augmented reality." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-22092016-110832/.
Full textAbstract:
Usage of real objects as links between real and virtual information is one key aspect in augmented reality. A central issue to achieve this link is the estimation of the visuospatial information of the observed object, or in other words, estimating the object pose. Different objects can have different behaviors when used for interaction. This not only encompasses changes in position, but also folding or deformations. Traditional researches in the area solve those pose estimation problems using different approaches, depending on the type of the object. Additionally, some researches are based only on positional information of observed feature points, simplifying the object information. In this work, we explore the pose estimation of different objects by gathering more information from the observed feature points, and obtaining the local poses of such points, which are not explored in other researches. We apply this local pose estimation idea in two different capturing scenarios, reaching two novel approaches of pose estimation: one based on RGB-D cameras, and another based on RGB and machine learning methods. In the RGB-D based approach, we use the feature point orientation and near surface to obtain its normal; then, find the local 6 degrees-of-freedom (DoF) pose. This approach gives us not only the rigid object pose, but also the approximated pose of deformed objects. On the other hand, our RGB based approach explores machine learning with local appearance changes. Unlike other RGB based works, we replace the complex non-linear systems solvers with a fast and robust method, reaching local rotation of the observed feature points, as well as, full 6 DoF rigid object pose with dramatically lower real-time calculation demands. Both approaches show us that gathering local poses can bring information for the pose estimation of different types of objects.O uso de objetos reais como meio de conexão entre informações reais e virtuais é um aspecto chave dentro da realidade aumentada. Uma questão central para tal conexão é a estimativa de informações visuo-espaciais do objeto, ou em outras palavras, a detecção da pose do objeto. Diferentes objetos podem ter diferentes comportamentos quando utilizados em interações. Não somente incluindo a mudança de posição, mas também sendo dobradas ou deformadas. Pesquisas tradicionais solucionam tais problemas de detecção usando diferentes abordagens, dependendo do tipo de objeto. Adicionalmente, algumas pesquisas se baseiam somente na informação posicional dos pontos de interesse, simplificando a informação do objeto. Neste trabalho, a detecção de pose de diferente objetos é explorada coletando-se mais informações dos pontos de interesse observados e, por sua vez, obtendo as poses locais de tais pontos, poses que não são exploradas em outras pesquisas. Este conceito da detecção de pose locais é aplicada em dois ambientes de capturas, estendendo-se em duas abordagens inovadoras: uma baseada em câmeras RGB-D, e outra baseada em câmeras RGB e métodos de aprendizado de maquinas. Na abordagem baseada em RGB-D, a orientação e superfície ao redor do ponto de interesse são utilizadas para obter a normal do ponto. Através de tais informações a pose local é obtida. Esta abordagem não só permite a obtenção de poses de objetos rígidos, mas também a pose aproximada de objetos deformáveis. Por outro lado, a abordagem baseada em RGB explora o aprendizado de máquina aplicado em alterações das aparências locais. Diferentemente de outros trabalhos baseados em câmeras RGB, esta abordagem substitui solucionadores não lineares complexos com um método rápido e robusto, permitindo a obtenção de rotações locais dos pontos de interesse, assim como, a pose completa (com 6 graus-de-liberdade) de objetos rígidos, com uma demanda computacional muito menor para cálculos em tempo-real. Ambas as abordagens mostram que a coleta de poses locais podem gerar informações para a detecção de poses de diferentes tipos de objetos.
2
Schutte, Christoph. "Die Königliche Akademie in Posen (1903-1919) und andere kulturelle Einrichtungen im Rahmen der Politik zur "Hebung des Deutschtums" /." Marburg : Verl. Herder-Institut, 2008. http://d-nb.info/987276190/04.
Full text
3
Wahlberg, Fredrik. "Partizan Poset Games." Thesis, KTH, Matematik (Avd.), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-149180.
Full textAbstract:
This thesis analyzes a class of element-removal partizan games played on colored posets. In these games a player moves by removing an element of its color together with all greater elements in the poset. A player loses if it has no elements left to remove. It is shown that all such games are numbers and that the dominating game options are to remove elements not lower than any other element of the same color. In particular, the thesis concerns games played on posets that are chess-colored Young diagrams. It is shown that it is easy to compute the value for any such game with < 3 rows by proving a proposed formula for computing the value.I den här uppsatsen analyseras en klass av partiska spel som spelas på färgade pomängder. Spelen spelas i omgångar mellan två spelare där spelaren under sin tur väljer ut ett element i pomängden som är i spelarens färg och avlägsnar det elementet och alla större element i pomängden. En spelare förlorar om den inte längre har något element att avlägsna. I uppsatsen visas det att alla sådana spel är tal och att de dominerande spelalternativen är att avlägsna element som inte är mindre än något annat element av samma färg. I synnerhet fokuserar denna uppsats på spel som spelas på pomängder som är schackfärgade Young-diagram. Det visas att det är lätt att beräkna värdet på alla sådana spel med < 3 rader genom att bevisa en föreslagen formel för att räkna ut värdet.
4
Vaněk, Vojtěch. "Popel v očích." Master's thesis, Vysoké učení technické v Brně. Fakulta výtvarných umění, 2011. http://www.nusl.cz/ntk/nusl-232320.
Full text
5
Ramakrishna, Varun N. "Pose Machines: Estimating Articulated Pose in Images and Video." Research Showcase @ CMU, 2015. http://repository.cmu.edu/dissertations/627.
Full textAbstract:
The articulated motion of humans is varied and complex. We use the range of motion of our articulated structure for functional tasks such as transport, manipulation, communication, and self-expression. We use our limbs to gesture and signal intent. It is therefore crucial for an autonomous system operating and interacting in human environments to be able to reason about human behavior in natural, unconstrained settings. This requires reliably extracting compact representations of behavior from possibly noisy sensors in a computationally efficient manner. The goal of this thesis is to develop computational methods for extracting compact keypoint representations of human pose from unconstrained and uncontrolled real-world images and video. Estimating articulated human pose from unconstrained images is an extremely challenging task due to complexity arising from the large number of kinematic degrees of freedom of the human body, large appearance and viewpoint variability, imaging artifacts and the inherent ambiguity when reasoning about three dimensional objects from two dimensional images. A core characteristic of the problem is the trade-off between the complexity of the human pose model used and the tractability of drawing inferences from it: as we increase model fidelity by either incorporating structural and physical constraints or making fewer limiting assumptions, the problem of searching for the optimal pose configuration becomes increasingly difficult and intractable. Cognizant of this trade-off, in this thesis, we develop methods to reason about articulated human pose from single images by developing a modular sequential prediction framework called a Pose Machine. Pose Machines reduce the structured prediction problem of articulated pose estimation to supervised multi-class classification. The modular framework allows for integrating the latest advances in supervised prediction, incorporates informative cues across multiple resolutions, learns rich implicit spatial models by making fewer limiting assumptions, handles large real-world datasets, and can be trained in an end-to-end manner. Additionally we develop methods for estimating pose from image sequences and reconstructing pose in three dimensions by finding tractable substructures to incorporate physicial and structural constraints while maintaining tractability.
6
Moura, Allan de Oliveira. "Dualidade em espaços poset." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/305916.
Full textAbstract:
Orientador: Marcelo FirerTese (doutorado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica
Made available in DSpace on 2018-08-15T01:48:53Z (GMT). No. of bitstreams: 1 Moura_AllandeOliveira1_D.pdf: 766044 bytes, checksum: e752134a3aa77aa9bf3559d18a7f0a12 (MD5) Previous issue date: 2010
Resumo: Considerando uma generalização da métrica de Hamming, a métrica ponderada por uma ordem parcial, fazemos uma descrição sistemática para os espaços com a métrica ponderada, dando ênfase aos códigos poset e à hierarquia de pesos contextualizada nesse novo ambiente. Técnicas de multiconjunto, para códigos ponderados, são utilizadas para estender o Teorema da Dualidade de Wei, uma relação entre as hierarquias do código e do seu dual. Como consequência desta Dualidade estendemos certos resultados sobre a discrepância, códigos MDS e uma relação entre a condição cadeia do código e do seu dual.
Abstract: Considering a generalization of the Hamming metric, the metric weighted by a partial order, we make a systematic description of the spaces with those metrics, emphasizing poset codes and the weight hierarchy of weights of those codes. Techniques of multiset, for weighted codes, are used to extend the Duality Theorem of Wei, a relationship between the hierarchy of a code and its dual. As a consequence of Duality we extend some results about the discrepancy, MDS codes and a relationship between a chain code and its dual.
Doutorado
Matematica
Doutor em Matemática
7
Jakub, Nilsson. "Pose AR: Assessing Pose Based Input in an AR Context." Thesis, Linnéuniversitetet, Institutionen för datavetenskap och medieteknik (DM), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-89228.
Full textAbstract:
Despite the rapidly growing adoption of augmented reality (AR) applications, existing methods for interacting with AR content are rated poorly, with surveyors of the area calling for better means of interaction, while researchers strive to create more natural input methods, mainly focusing on gesture input. This thesis aims to contribute to the aforementioned efforts by recognizing that technologies for consumer-grade smartphone-based pose estimation have been rapidly improving in recent years and due to their increased accuracy may have untapped potential ready to be utilized for user input. To this end, a rudimentary system for pose based input is integrated into prototype applications, which are constructed with both pose based input and touch input in mind. In this work, pose, pose estimation, and posed based input refer to using the distance and orientation of the user (or more precisely, the distance and orientation of their device) in relation to the AR content. Using said prototypes within a user interaction study allowed the identification of user preferences which indicate the approaches that future efforts into utilizing pose for input in an AR context ought to adopt. By comparing questionnaire answers and logged positional data across four prototype scenarios, it can be clearly identified that to perceive pose input as intuitive, the AR experiences shouldn’t employ a scale which is so large that it requires substantial shifts in the position of the user, as opposed to merely shifts in the position of the user’s device.
8
Rosenhahn, Bodo. "Pose estimation revisited." Kiel Inst. für Informatik und Praktische Mathematik, 2003. http://e-diss.uni-kiel.de/diss_842/d842.pdf.
Full text
9
Weill, Georges Secret François. "Vie et caractère de Guillaume Postel /." Milano : Archè, 1987. http://catalogue.bnf.fr/ark:/12148/cb354699955.
Full text
10
Dyroff, Stefan Dyroff Stefan. "Erinnerungskultur im deutsch-polnischen Kontaktbereich : Bromberg und der Nordosten der Provinz Posen (Wojewodschaft Poznań) : 1871 - 1939." Osnabrück Fibre-Verl, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?id=2841811&prov=M&dokv̲ar=1&doke̲xt=htm.
Full text
11
Hähnel, Michael. "Modellbasierte posen- und mimikinvariante Gesichtserkennung." München Verl. Dr. Hut, 2007. http://d-nb.info/988229161/04.
Full text
12
Graham, Daniel B. "Pose-varying face recognition." Thesis, University of Manchester, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.488288.
Full text
13
Abi, Antoun Ramzi. "Pose-Tolerant Face Recognition." Research Showcase @ CMU, 2013. http://repository.cmu.edu/dissertations/244.
Full textAbstract:
Automatic face recognition performance has been steadily improving over years of active research, however it remains significantly affected by a number of external factors such as illumination, pose, expression, occlusion and resolution that can severely alter the appearance of a face and negatively impact recognition scores. The focus of this thesis is the pose problem which remains largely overlooked in most real-world applications. Specifically, we focus on one-to-one matching scenarios where a query face image of a random pose is matched against a set of “mugshot-style” near-frontal gallery images. We argue that in this scenario, a 3D face-modeling geometric approach is essential in tackling the pose problem. For this purpose, we utilize a recent technique for efficient synthesis of 3D face models called 3D General Elastic Model (3DGEM). It solved the pose synthesis problem from a single frontal image, but could not solve the pose correction problem because of missing face data due to self-occlusion. In this thesis, we extend the formulation of 3DGEM and cast this task as an occlusion-removal problem. We propose a sparse feature extraction approach using subspace-modeling and `1-minimization to find a representation of the geometrically 3D-corrected faces that we show is stable under varying pose and resolution. We then show how pose-tolerance can be achieved either in the feature space or in the reconstructed image space. We present two different algorithms that capitalize on the robustness of the sparse feature extracted from the pose-corrected faces to achieve high matching rates that are minimally impacted by the variation in pose. We also demonstrate high verification rates upon matching nonfrontal to non-frontal faces. Furthermore, we show that our pose-correction framework lends itself very conveniently to the task of super-resolution. By building a multiresolution subspace, we apply the same sparse feature extraction technique to achieve single-image superresolution with high magnification rates. We discuss how our layered framework can potentially solve both pose and resolution problems in a unified and systematic approach. The modularity of our framework also keeps it flexible, upgradable and expandable to handle other external factors such as illumination or expressions. We run extensive tests on the MPIE dataset to validate our findings.
14
Lincoln, Michael C. "Pose-independent face recognition." Thesis, University of Essex, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.250063.
Full text
15
Yurttagul, Berk. "Kinematic Calibration Of Industrial Robots Using Full Pose Measurements And Optimal Pose Selection." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12612829/index.pdf.
Full textAbstract:
This study focuses on kinematic calibration of industrial robots. Kinematic modeling, parameter
identification and optimal pose selection methods are presented. A computer simulation
of the kinematic calibration is performed using generated measurements with normally distributed
noise. Furthermore, kinematic calibration experiments are performed on an ABB
IRB 6600 industrial robot using full pose measurements taken by a laser tracking system.
The kinematic model of the robot is developed using the modified Denavit - Hartenberg convention.
A nonlinear least-squares method is employed during the parameter identification
stage. According to the experiment results, the initial robot positioning errors are reduced by
more than 80%.
16
Ochecová, Pavla. "Využití popela ze spalování biomasy." Doctoral thesis, Česká zemědělská univerzita v Praze, 2016. http://www.nusl.cz/ntk/nusl-261401.
Full textAbstract:
One of the most frequently used sources of renewable energy is biomass, mainly wood biomass. Incineration is the most common technology utilizing the energy from biomass to produce heat. A byproduct of these technologies is ash, whose composition depends on the feedstock composition and the incineration technologies. Due to the high content of valuable nutrients in ash, one of the suitable option for ash utilization seems to be application into agricultural or forestry land. Therefore, it is necessary to test response of soils and plants and look for the most suitable combination of soil additive (biomass ash), and plants. Experimental part of PhD thesis was divided into the incubation experiment and the vegetation pot experiments. The incubation experiment: The efficiency of ash addition at two application rates was tested for nutrients enrichment in different soils within period of 56 days. The vegetation pot experiments: The two plants Triticum aestivum L: (three-year experiment) and Lolium perenne L. (one-year experiment) were planted in the 5L pots. Soils were treated with ash or ash combinated by superphoshate and flue gas desulfurization gypsum. For both plants, we evaluated the plant growth, biomass production and content of macro, micro and toxic elements in the biomass and in the soils.
17
Joseph, Darel. "The Adversity Pop Culture Has Posed." ScholarWorks@UNO, 2014. http://scholarworks.uno.edu/td/1877.
Full textAbstract:
I am a collage artist working with multiple mediums such as paint, photography, video, audio, and performance. As a New Orleans’ native, I have a unique history that is unflattering, for my history echoes that of America’s historical misdeeds. I make sociopolitical art because I am of a historically oppressed people. I make art that celebrates my diverse culture that is a collage of Native American, African, and New Orleans’ French Creole.
18
Lucas, D'Oliveira Rafael Gregorio 1988. "Raio de empacotamento de códigos poset." [s.n.], 2012. http://repositorio.unicamp.br/jspui/handle/REPOSIP/305914.
Full textAbstract:
Orientador: Marcelo FirerDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica
Made available in DSpace on 2018-08-21T02:49:59Z (GMT). No. of bitstreams: 1 LucasD'Oliveira_RafaelGregorio_M.pdf: 16647897 bytes, checksum: a2258aca5a39f0a7d0bd2243b905a772 (MD5) Previous issue date: 2012
Resumo: Até o trabalho presente, só era conhecido o raio de empacotamento de um código poset nos casos do poset ser uma cadeia, hierárquico, a união disjunta de cadeias do mesmo tamanho, e para algumas famílias de códigos. Nosso objetivo é abordar o caso geral de um poset qualquer. Para isso, iremos dividir o problema em dois. A primeira parte consiste em encontrar o raio de empacotamento de um único vetor. Veremos que este problema é equivalente à uma generalização de um problema NP-difícil famoso conhecido como \o problema da partição". Veremos então os principais resultados conhecidos sobre este problema dando atenção especial aos algoritmos para resolvê-lo. A receita principal destes algoritmos é o método da diferenciação, e sendo assim, iremos estendê-la para o caso geral. A segunda parte consiste em encontrar o vetor que determina o raio de empacotamento do código. Para isso, mostraremos como é as vezes possível comparar o raio de empacotamento de dois vetores sem calculá-los explicitamente
Abstract: Until the present work, the packing radius of a poset code was only known in the cases where the poset was a chain, hierarchy, a union of disjoint chains of the same size, and for some families of codes. Our objective is to approach the general case of any poset. To do this, we will divide the problem into two parts. The first part consists in finding the packing radius of a single vector. We will show that this is equivalent to a generalization of a famous NP-hard problem known as \the partition problem". Then, we will review the main results known about this problem giving special attention to the algorithms to solve it. The main ingredient to these algorithms is what is known as the differentiating method, and therefore, we will extend it to the general case. The second part consists in finding the vector that determines the packing radius of the code. For this, we will show how it is sometimes possible to compare the packing radius of two vectors without calculating them explicitly
Mestrado
Matematica
Mestre em Matemática
19
Leocadio, Marcelo Augusto. "Código MDS com a métrica POSET." Universidade Federal de Viçosa, 2013. http://locus.ufv.br/handle/123456789/4927.
Full textAbstract:
Made available in DSpace on 2015-03-26T13:45:36Z (GMT). No. of bitstreams: 1
texto completo.pdf: 1755688 bytes, checksum: 33e268f82618cf29e2d1fa6df5c6fa6c (MD5)
Previous issue date: 2013-07-30Fundação de Amparo a Pesquisa do Estado de Minas Gerais
A poset metric is the generalization of the Hamming metric. In this work we make a detailed study of poset spaces, hierarchy of I -weights and I -distribution of P P weights, emphasizing the non-degenerate poset codes. We verify the duality relation between the hierarchy weights of poset code and its dual. In the sequel two new parameters are defined to a class of poset codes non-degenerate with dual code is too non-degenerate in the environment. As a result enunciated in the Minimality Theorem, the Variance Theorem and the Minimality Identity in the poset spaces.
Uma generalização da métrica de Hamming é a métrica poset. Faremos um estudo detalhado dos espaços poset, hierarquia de I-pesos e a I-distribuição de pesos, dando ênfase aos códigos poset não degenerados. Verificamos a relação de dualidade poset entre as hierarquias de um código e seu dual. Definimos dois novos parâmetros para a classe de códigos dualmente não degenerados no ambiente poset. Como consequência, enunciamos e mostramos o Teorema da Minimalidade, o Teorema da e Variância e a Identidade de Minimalidades no espaço poset.
20
Couto, Luiz Henrique de Almeida Pinto. "Códigos NMDS sob a métrica poset." Universidade Federal de Viçosa, 2014. http://locus.ufv.br/handle/123456789/4932.
Full textAbstract:
Made available in DSpace on 2015-03-26T13:45:37Z (GMT). No. of bitstreams: 1
texto completo.pdf: 727797 bytes, checksum: 105934c0f62e07cc0326f43884b69ff5 (MD5)
Previous issue date: 2014-02-17Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
In this Work, frorn a generalization of the metric Hamming for a Weighted metric by a partial order, We deñne the poset spaces and We study linear NMDS Codes in such spaces, gaining Characterizations for these. With the aid Of such Charac- terizations, We present tWO applications With respect to distributionsz the Weight distribution of a Code and, in particular Case Of the rnetric Obtained by a poset Rosenblomm-Tsfasman, the distribution of points in the unit Cube U" = [0,1) . We also provide sorne Constructions Of NMDS Codes in Rosenbloom-Tsfasman spaces.
Neste trabalho, a partir de uma generalização da métrica de Hamming por urna métrica ponderada por uma Ordem parciaL deñnimos os espaços poset e estu- damos os Códigos lineares NMDS em tais espaços, Obtendo Caracterizações para estes. Com 0 auxílio de tais Caracterizações, apresentamos duas aplicações Com respeito à distribuiçõesz a distribuição de pesos de um Código e, no Caso parti- Cular da métrica obtida por um poset Rosenblomm-Tsfasman, a distribuição de pontos no Cubo unitário U = [0,1)". Fornecemos também algumas Construções de Códigos NMDS em espaços Rosenbloom-Tsfasman.
21
Coutinho, João Manuel Mascarenhas. "Sistema de poses para modelos 2.5." reponame:Repositório Institucional da UFABC, 2017.
Find full textAbstract:
Orientador: Prof. Dr. João Paulo GoisDissertação (mestrado) - Universidade Federal do ABC, Programa de Pós-Graduação em Ciência da Computação, 2017.
Uma tarefa difícil para animadores é redesenhar modelos 2D para cada nova visão ou pose. Como consequência, várias aplicações têm sido propostas para tornar este processo mais fácil. Uma abordagem bem sucedida é a técnica de Modelagem Cartoon 2.5D. O objetivo desta ténica é automatizar o cálculo de novas visões ¿ pela simulação da rotação global 3D ¿ a partir de entradas 2D fornecidas pelo usuário. No entanto, os trabalhos anteriores de modelos 2.5D não apresentam esquemas para criar novas poses de maneira eficiente, i.e., o usuário redesenha as visões de entrada novamente na nova pose. Para esta finalidade, nós apresentamos uma nova abordagem que permite ao usuário criar novas visões e novas poses para os modelos 2.5D. Criamos uma estrutura hierárquica de ossos que explora a metodologia de modelos 2.5D, garantindo a coerência entre a estrutura de ossos e o modelo. A usabilidade da técnica apresentada é intuitiva, especialmente para usuários já familiarizados com outras ferramentas 2.5D.
A laborious task for animators is to redesign of 2D models for each new required view or pose. As a consequence, several applications have been proposed to make this task easier. A successful approach is the Cartoon 2.5D Models. Its goal is to automaticaly produce new views (by the simulation of 3D global rotation) from userprovided 2D models. However, previous works of 2.5D Models does not have support to calculate poses efficiently, i.e., the user redraws the input views again in the new pose. We present a novel approach that allows the user to produce both new views and poses easily for the 2.5D Models, thus puppeteering the 2.5D Models. It makes use of a hierarchical bone structure that explores the methodology of the 2.5D Models, ensuring coherence between the bone structures and the model. The usability of our approach is intuitive, especially for the users acquainted with previous 2.5D Modeling tools.
22
Marlow, Gregory. "Week 14, Video 04: Remaining Poses." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/digital-animation-videos-oer/91.
Full text
23
Shyshkov, Andriy. "NUMERICAL SOLUTION OF ILL-POSED PROBLEMS." Kent State University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=kent1271700548.
Full text
24
Neuman, Arthur James III. "Regularization Methods for Ill-posed Problems." Kent State University / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=kent1273611079.
Full text
25
Rosenhahn, Bodo [Verfasser]. "Pose Estimation Revisited / Bodo Rosenhahn." Kiel : Universitätsbibliothek Kiel, 2003. http://d-nb.info/1080332448/34.
Full text
26
Choi, Kwang Nam. "Methods for facial pose estimation." Thesis, University of York, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.270095.
Full text
27
Greenwood, David. "Predicting head pose from speech." Thesis, University of East Anglia, 2018. https://ueaeprints.uea.ac.uk/69976/.
Full textAbstract:
Speech animation, the process of animating a human-like model to give the impression it is talking, most commonly relies on the work of skilled animators, or performance capture. These approaches are time consuming, expensive, and lack the ability to scale. This thesis develops algorithms for content driven speech animation; models that learn visual actions from data without semantic labelling, to predict realistic speech animation from recorded audio. We achieve these goals by _rst forming a multi-modal corpus that represents the style of speech we want to model; speech that is natural, expressive and prosodic. This allows us to train deep recurrent neural networks to predict compelling animation. We _rst develop methods to predict the rigid head pose of a speaker. Predicting the head pose of a speaker from speech is not wholly deterministic, so our methods provide a large variety of plausible head pose trajectories from a single utterance. We then apply our methods to learn how to predict the head pose of the listener while in conversation, using only the voice of the speaker. Finally, we show how to predict the lip sync, facial expression, and rigid head pose of the speaker, simultaneously, solely from speech.
28
Sundberg, Patrik P. (Patrik Per) 1980. "Pose estimation using cascade trees." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/17985.
Full textAbstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.Includes bibliographical references (p. 57-58).
In this thesis, I implemented and extended a face detector, based on cascades of boosted features, for use in real time systems. The extensions are twofold. First, I designed a way of combining several cascades into a cascade tree, and showed how such a tree provides a powerful mechanism for combining detector efficiency and accuracy. When the training data has large variations, the cascade tree yields a faster detector, and when the data has only small variations, there is a distinct detection rate improvement. As a second extension, I designed a system for pose estimation based on an array of cascades. I performed an evaluation of this system and compared to normalized cross-correlation.
by Patrik Sundberg.
M.Eng.
29
Budaraju, Sri Datta. "Unsupervised 3D Human Pose Estimation." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-291435.
Full textAbstract:
The thesis proposes an unsupervised representation learning method to predict 3D human pose from a 2D skeleton via a VAEGAN (Variational Autoencoder Generative Adversarial Network) hybrid network. The method learns to lift poses from 2D to 3D using selfsupervision and adversarial learning techniques. The method does not use images, heatmaps, 3D pose annotations, paired/unpaired 2Dto3D skeletons, 3D priors, synthetic 2D skeletons, multiview or temporal information in any shape or form. The 2D skeleton input is taken by a VAE that encodes it in a latent space and then decodes that latent representation to a 3D pose. The 3D pose is then reprojected to 2D for a constrained, selfsupervised optimization using the input 2D pose. Parallelly, the 3D pose is also randomly rotated and reprojected to 2D to generate a ’novel’ 2D view for unconstrained adversarial optimization using a discriminator network. The combination of the optimizations of the original and the novel 2D views of the predicted 3D pose results in a ’realistic’ 3D pose generation. The thesis shows that the encoding and decoding process of the VAE addresses the major challenge of erroneous and incomplete skeletons from 2D detection networks as inputs and that the variance of the VAE can be altered to get various plausible 3D poses for a given 2D input. Additionally, the latent representation could be used for crossmodal training and many downstream applications. The results on Human3.6M datasets outperform previous unsupervised approaches with less model complexity while addressing more hurdles in scaling the task to the real world.Uppsatsen föreslår en oövervakad metod för representationslärande för att förutsäga en 3Dpose från ett 2D skelett med hjälp av ett VAE GAN (Variationellt Autoenkodande Generativt Adversariellt Nätverk) hybrid neuralt nätverk. Metoden lär sig att utvidga poser från 2D till 3D genom att använda självövervakning och adversariella inlärningstekniker. Metoden använder sig vare sig av bilder, värmekartor, 3D poseannotationer, parade/oparade 2D till 3D skelett, a priori information i 3D, syntetiska 2Dskelett, flera vyer, eller tidsinformation. 2Dskelettindata tas från ett VAE som kodar det i en latent rymd och sedan avkodar den latenta representationen till en 3Dpose. 3D posen är sedan återprojicerad till 2D för att genomgå begränsad, självövervakad optimering med hjälp av den tvådimensionella posen. Parallellt roteras dessutom 3Dposen slumpmässigt och återprojiceras till 2D för att generera en ny 2D vy för obegränsad adversariell optimering med hjälp av ett diskriminatornätverk. Kombinationen av optimeringarna av den ursprungliga och den nya 2Dvyn av den förutsagda 3Dposen resulterar i en realistisk 3Dposegenerering. Resultaten i uppsatsen visar att kodningsoch avkodningsprocessen av VAE adresserar utmaningen med felaktiga och ofullständiga skelett från 2D detekteringsnätverk som indata och att variansen av VAE kan modifieras för att få flera troliga 3D poser för givna 2D indata. Dessutom kan den latenta representationen användas för crossmodal träning och flera nedströmsapplikationer. Resultaten på datamängder från Human3.6M är bättre än tidigare oövervakade metoder med mindre modellkomplexitet samtidigt som de adresserar flera hinder för att skala upp uppgiften till verkliga tillämpningar.
30
Rangaprasad, Arun Srivatsan. "Probabilistic Approaches for Pose Estimation." Research Showcase @ CMU, 2018. http://repository.cmu.edu/dissertations/1218.
Full textAbstract:
Virtually all robotics and computer vision applications require some form of pose estimation; such as registration, structure from motion, sensor calibration, etc. This problem is challenging because it is highly nonlinear and nonconvex. A fundamental contribution of this thesis is the development of fast and accurate pose estimation by formulating in a parameter space where the problem is truly linear and thus globally optimal solutions can be guaranteed. It should be stressed that the approaches developed in this thesis are indeed inherently linear, as opposed to using linearization or other approximations, which are known to be computationally expensive and highly sensitive to initial estimation error. This thesis will demonstrate that the choice of probability distribution significantly impacts performance of the estimator. The distribution must respect the underlying structure of the parameter space to ensure any optimization, based on such a distribution, produces a globally optimal estimate, despite the inherent nonconvexity of the parameter space. Furthermore, in applications such as registration and 3D reconstruction, the correspondence between the measurements and the geometric model is typically unknown. In this thesis we develop probabilistic methods to deal with cases of unknown correspondence. While the resultant formulation does not guarantee global optimality, it increases the basin of convergence. Another contribution of this thesis is the development of a generalized framework for probabilistic point registration. By setting functional parameters such as sensor noise and prior uncertainties appropriately, our framework captures many prior registration methods. Additionally our framework is also capable of predicting scope for improvement in the existing algorithms, which are then verified experimentally. To tie the ideas together, we present results in the context of surgical robotics - in particular we demonstrate a surgical system that is capable of performing real-time tumor localization, hand-eye calibration, registration of preoperative models to the anatomy, and augmented reality.
31
Alismail, Hatem. "Direct Pose Estimation and Refinement." Research Showcase @ CMU, 2016. http://repository.cmu.edu/dissertations/754.
Full textAbstract:
We study a fundamental question in pose estimation from vision-only video data: should the pose of a camera be determined from fixed and known correspondences? Or should correspondences be simultaneously estimated alongside the pose? Determining pose from fixed correspondences is known as feature-based, where wellestablished tools from projective geometry are utilized to formulate and solve a plethora of pose estimation problems. Nonetheless, in degraded imaging conditions such as low light and blur, reliably detecting and precisely localizing interest points becomes challenging. Conversely, estimating correspondences alongside motion is known as the direct approach, where image data are used directly to determine geometric quantities without relying on sparse interest points as an intermediate representation. The approach is in general more precise by virtue of redundancy as many measurements are used to estimate a few degreesof- freedom. However, direct methods are more sensitive to changes in illumination. In this work, we combine the best of the feature-based approaches with the precision of direct methods. Namely, we make use of densely and sparsely evaluated local feature descriptors in a direct image alignment framework to address pose estimation in challenging conditions. Applications include tracking planar targets under sudden and drastic changes in illumination as well as visual odometry in poorly-lit subterranean mines. Motivated by the success of the proposed approach, we introduce a novel formulation for the joint refinement of pose and structure across multiple views akin to feature-based bundle adjustment (BA). In contrast to minimizing the reprojection error using BA, initial estimates are refined such that the photometric consistency of their image projections is maximized without the need for correspondences. The fundamentally different technique is evaluated on a range of datasets and is shown to improve upon the accuracy of the state-of-the-art in vision-based simultaneous localization and mapping (VSLAM).
32
Shafaei, Alireza. "Multiview depth-based pose estimation." Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/56180.
Full textAbstract:
Commonly used human motion capture systems require intrusive attachment of markers that are visually tracked with multiple cameras.
In this work we present an efficient and inexpensive solution to markerless motion capture using only a few Kinect sensors.
We use our system to design a smart home platform with a network of Kinects that are installed inside the house.
Our first contribution is a multiview pose estimation system.
Unlike the previous work on 3d pose estimation using a single depth camera, we relax constraints on the camera location and do not assume a co-operative user.
We apply recent image segmentation techniques with convolutional neural networks to depth images and use curriculum learning to train our system on purely synthetic data.
Our method accurately localizes body parts without requiring an explicit shape model.
The body joint locations are then recovered by combining evidence from multiple views in real-time.
Our second contribution is a dataset of 6 million synthetic depth frames for pose estimation from multiple cameras with varying levels of complexity to make curriculum learning possible.
We show the efficacy and applicability of our data generation process through various evaluations.
Our final system exceeds the state-of-the-art results on multiview pose estimation on the Berkeley MHAD dataset.
Our third contribution is a scalable software platform to coordinate Kinect devices in real-time over a network.
We use various compression techniques and develop software services that allow communication with multiple Kinects through TCP/IP.
The flexibility of our system allows real-time orchestration of up to 10 Kinect devices over Ethernet.Science, Faculty of
Computer Science, Department of
Graduate
33
Brégier, Romain. "Détection et estimation de pose d'instances d'objet rigide pour la manipulation robotisée." Thesis, Université Grenoble Alpes (ComUE), 2018. http://www.theses.fr/2018GREAM039.
Full textAbstract:
La capacité à détecter des objets dans une scène et à estimer leur pose constitue un préalable essentiel à l'automatisation d'un grand nombre de tâches, qu'il s'agisse d'analyser automatiquement une situation, de proposer une expérience de réalité augmentée, ou encore de permettre à un robot d'interagir avec son environnement.Dans cette thèse, nous nous intéressons à cette problématique à travers le scénario du dévracage industriel, dans lequel il convient de détecter des instances d'un objet rigide au sein d'un vrac et d'estimer leur pose -- c'est-à-dire leur position et orientation -- à des fins de manipulation robotisée.Nous développons pour ce faire une méthode basée sur l'exploitation d'une image de profondeur, procédant par agrégation d'hypothèses générées par un ensemble d'estimateurs locaux au moyen d'une forêt de décision.La pose d'un objet rigide est usuellement modélisée sous forme d'une transformation rigide 6D dans la littérature. Cette représentation se révèle cependant inadéquate lorsqu'il s'agit de traiter des objets présentant des symétries, pourtant nombreux parmi les objets manufacturés.Afin de contourner ces difficultés, nous introduisons une formulation de la notion de pose compatible avec tout objet rigide physiquement admissible, et munissons l'espace des poses d'une distance quantifiant la longueur du plus petit déplacement entre deux poses. Ces notions fournissent un cadre théorique rigoureux à partir duquel nous développons des outils permettant de manipuler efficacement le concept de pose, et constituent le socle de notre approche du problème du dévracage.Les standards d'évaluation utilisés dans l'état de l'art souffrant de certaines limitations et n'étant que partiellement adaptés à notre contexte applicatif, nous proposons une méthodologie d'évaluation adaptée à des scènes présentant un nombre variable d'instances d'objet arbitraire, potentiellement occultées. Nous mettons celle-ci en œuvre sur des données synthétiques et réelles, et montrons la viabilité de la méthode proposée, compatible avec les problématiques de temps de cycle, de performance et de simplicité de mise en œuvre du dévracage industrielVisual object detection and estimation of their poses -- i.e. position and orientation for a rigid object -- is of utmost interest for automatic scene understanding.In this thesis, we address this topic through the bin-picking scenario, in which instances of a rigid object have to be automatically detected and localized in bulk, so as to be manipulated by a robot for various industrial tasks such as machine feeding, assembling, packing, etc.To this aim, we propose a novel method for object detection and pose estimation given an input depth image, based on the aggregation of local predictions through an Hough forest technique, that is suitable with industrial constraints of performance and ease of use.Overcoming limitations of existing approaches that assume objects not to have any proper symmetries, we develop a theoretical and practical framework enabling us to consider any physical rigid object, thanks to a novel definition of the notion of pose and an associated distance.This framework provides tools to deal with poses efficiently for operations such as pose averaging or neighborhood queries, and is based on rigorous mathematical developments.Evaluation benchmarks used in the literature are not very representative of our application scenario and suffer from some intrinsic limitations, therefore we formalize a methodology suited for scenes in which many object instances, partially occluded, in arbitrary poses may be considered. We apply this methodology on real and synthetic data, and demonstrate the soundness of our approach compared to the state of the art
34
Potter, Scott Alton. "Full pose and partial pose calibration of a six degree of freedom robot manipulator arm." Thesis, Monterey, California. Naval Postgraduate School, 1991. http://hdl.handle.net/10945/26565.
Full text
35
Dicken, Volker, and Peter Maaß. "Wavelet-Galerkin methods for ill-posed problems." Universität Potsdam, 1995. http://opus.kobv.de/ubp/volltexte/2007/1389/.
Full textAbstract:
Projection methods based on wavelet functions combine optimal
convergence rates with algorithmic efficiency. The proofs in this paper utilize the approximation properties of wavelets and results from the general theory of regularization methods. Moreover, adaptive strategies can be incorporated
still leading to optimal convergence rates for the resulting algorithms. The so-called wavelet-vaguelette decompositions enable the realization of especially fast algorithms for certain operators.
36
Schäfer, Dietmar. "Die Schildkröten der Gattung Ptychogaster POMEL, 1847." Diss., Ludwig-Maximilians-Universität München, 2013. http://nbn-resolving.de/urn:nbn:de:bvb:19-163479.
Full textAbstract:
Die Gattung Ptychogaster POMEL, 1847 (REPTILIA, TESTUDINES) gehört zur Familie der Geoemydidae und wurde vom Mittel-Eozän bis zum Ober-Miozän in Mitteleuropa nachgewiesen. Es handelt sich um Sumpfschildkröten mit einer, je nach Spezies, mehr oder weniger terrestrisch/amphibischen Lebensweise. Wesentliche Charakteristika der Gattung sind der mobile Plastronhinterlappen, die frühe Ankylose der Knochenplatten des Panzers, die testudinide Neuralreihe, das emydine Pygale und die charakteristische Form der Epiplastrallippe. Im Laufe der langen Forschungsgeschichte kam es aufgrund der hohen individuellen Variabilität zur Aufstellung zahlreicher Synonyme und Nomina dubia. In dieser Arbeit wird von der Validität von 21 Arten ausgegangen, wobei 2 neue Arten vorgestellt werden. Synonyme (14) und Nomina dubia (7) werden erläutert. Es werden alle bekannten europäischen Ptychogaster-Fundorte aufgelistet und eine Merkmalstabelle präsentiert. Anatomie und Osteologie der Gattung werden eingehend dargestellt. Stratigraphische und geographische Verbreitung wie auch die Paläoökologie von Ptychogaster werden beschrieben. Die beiden neuen Ptychogaster-Arten werden mit Ptychogaster bavaricus n.sp. und Ptychogaster suntgowensis n.sp. benannt.The genus Ptychogaster POMEL, 1847 (REPTILIA, TESTUDINES) belongs to the family Geoemydidae and existed from the Middle-Eocene until the Upper-Miocene in Central Europe. Ptychogastrids were terrapins with, depending on the species, more or less terrestrial/amphibian way of living. Substantial characteristics of the genus are the mobile posterior lobe of the plastron, the early ancylosis of the bony shell, the testudinid neural series and the distinct shape of the epiplastral lip. During the long research history it came, due to the high individual variability, to the nomination of numerous synonyms and nomina dubia. In this thesis the validity of 21 species is assumed whereat 2 new species are introduced. Synonyms (14) and nomina dubia (7) are illustrated. The known European Ptychogaster sites are listed and a key to the species is presented. Functional anatomy and osteology of the genus are depicted in detail. Stratigraphic and geographic distributions as well as the paleoecology of Ptychogaster are described. The two new Ptychogaster-species are named Ptychogaster bavaricus n.sp. and Ptychogaster suntgowensis n.sp..
37
Fehrenbacher, Roland. "Theoretical problems posed by high-temperature superconductivity /." Zürich, 1993. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=10256.
Full text
38
Hansen, Christian. "Rank-deficient and discrete ill-posed problems /." Online version, 1996. http://bibpurl.oclc.org/web/23586.
Full text
39
Laobeul, N'Djekornom Dara. "REGULARIZATION METHODS FOR ILL-POSED POISSON IMAGING." The University of Montana, 2009. http://etd.lib.umt.edu/theses/available/etd-12092008-133704/.
Full textAbstract:
The noise contained in images collected by a charge coupled device (CCD) camera is predominantly of Poisson type. This motivates the use of the negative logarithm of the Poisson likelihood in place of the ubiquitous least squares t-to-data. However, if the underlying mathematical model is assumed to have the form z = Au, where A is a linear, compact operator, the problem of minimizing the negative log-Poisson likelihood function is ill-posed, and hence some form of regularization is required. In this work, it involves solving a variational problem of the form u def = arg min u0 `(Au; z) + J(u); where ` is the negative-log of a Poisson likelihood functional, and J is a regularization functional. The main result of this thesis is a theoretical analysis of this variational problem for four dierent regularization functionals. In addition, this work presents an ecient computational method for its solution, and the demonstration of the eectiveness of this approach in practice by applying the algorithm to simulated astronomical imaging data corrupted by the CCD camera noise model mentioned above.
40
Barker, Thomas. "Well-posed continuum modelling of granular flows." Thesis, University of Manchester, 2017. https://www.research.manchester.ac.uk/portal/en/theses/wellposed-continuum-modelling-of-granular-flows(bcb5fb47-31cb-4168-a49d-0be2e1599786).html.
Full textAbstract:
Inertial granular flows lie in a region of parameter space between quasi-static and collisional regimes. In each of these phases the mechanisms of energy dissipation are often taken to be the defining features. Frictional contacts between grains and the transmission of energy through co-operative force chains dominate slowly sheared flows. In the opposite extreme infrequent high-energy collisions are responsible for dissipation in so-called gaseous granular flows. Borrowing from each of these extremes, it is postulated that during liquid-like flow, grain energy is transferred through frequent frictional interactions as the particles rearrange. This thesis focuses on the μ(I)-rheology which generalises the simple Coulomb picture, where greater normal forces lead to greater tangential friction, by including dependence on the inertial number I, which reflects the frequency of grain rearrangements. The equations resulting from this rheology, assuming that the material is incompressible, are first examined with a maximal-order linear stability analysis. It is found that the equations are linearly well-posed when the inertial number is not too high or too low. For inertial numbers in which the equations are instead ill-posed numerical solutions are found to be grid-dependent with perturbations growing unboundedly as their wavelength is decreased. Interestingly, experimental results also diverge away from the original μ(I) curve in the ill-posed regions. A generalised well-posedness analysis is used alongside the experimental findings to suggest a new functional form for the curve. This is shown to regularise numerical computations for a selection of inclined plane flows. As the incompressibility assumption is known to break down more drastically in the high-I and low-I limits, compressible μ(I) equations are also considered. When the closure of these equations takes the form suggested by critical state soil mechanics, it is found that the resultant system is well-posed regardless of the details of the deformation. Well-posed equations can also be formed by depth-averaging the μ(I)-rheology. For three-dimensional chute flows experimental measurements are captured well by the depth-averaged model when the flows are shallow. Furthermore, numerical computations are much less expensive than those with the full μ(I) system.
41
Wojcik, Paul W. (Paul Walton). "A Bayesian analysis of ill-posed problems." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/38031.
Full textAbstract:
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.Includes bibliographical references (leaves 138-142).
by Paul W. Wojcik.
M.S.
42
Steingrímsson, Einar. "Permutations statistics of indexed and poset permutations." Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/1721.1/35952.
Full text
43
Tomba, Ivan <1985>. "Iterative regularization methods for ill-posed problems." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amsdottorato.unibo.it/5588/.
Full textAbstract:
This Ph.D thesis focuses on iterative regularization methods for regularizing linear and nonlinear ill-posed problems. Regarding linear problems, three new stopping rules for the Conjugate Gradient method applied to the normal equations are proposed and tested in many numerical simulations, including some tomographic images reconstruction problems.
Regarding nonlinear problems, convergence and convergence rate results are provided for a Newton-type method with a modified version of Landweber iteration as an
inner iteration in a Banach space setting.
44
Pinheiro, Jerry Anderson 1985. "Identidades de MacWilliams para métricas Poset-Block." [s.n.], 2011. http://repositorio.unicamp.br/jspui/handle/REPOSIP/305915.
Full textAbstract:
Orientador: Marcelo FirerDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica
Made available in DSpace on 2018-08-19T01:37:04Z (GMT). No. of bitstreams: 1 Pinheiro_JerryAnderson_M.pdf: 892573 bytes, checksum: 1be2db17f4d773a9b51d785a0fc55609 (MD5) Previous issue date: 2011
Resumo: Em 1963, F. J. MacWilliams desenvolveu as chamadas identidades de MacWilliams, que estabelecem, em particular, relações entre a distribuição de pesos de códigos possuindo alta taxa de informação e códigos com baixa dimensão. Consideramos neste trabalho a família de métricas poset-block, uma pouco explorada generalização tanto das métricas de bloco quanto das métricas poset, e consequentemente da clássica métrica de Hamming. Efetuamos uma descrição detalhada dos espaços munidos com tais métricas com ênfase na teoria de códigos e em seguida tratamos do problema que surge naturalmente neste contexto: a caracterização dos espaços que admitem uma identidade do tipo MacWilliams, ou seja, a classificação das métricas que permitem relacionar unicamente o espectro de um código com o de seu dual. A principal técnica utilizada nesta classificação é a teoria de caracteres sobre corpos finitos, incluindo aí a transformada de Hadamard, a fórmula da soma discreta de Poisson e as relações de ortogonalidade existente entre caracteres. Tal técnica foi proposta inicialmente por F. J. MacWilliams e utilizada posteriormente por H. K. Kim e D. H. Oh na classificação das métricas poset que admitem identidades do tipo MacWilliams. Nosso principal objetivo é portanto classificar os espaços poset-block que admitem uma identidade do tipo MacWilliams. Como conseqüência desta classificação, através dos polinômios de Krawtchouk, obteremos expressões explícitas para estas identidades
Abstract: In 1963, F. J. MacWilliams developed the so-called MacWilliams identities, which establish, in particular, relations between the weight distribution of codes having high information rate and codes with low dimension. In this work we consider the family of poset-block metrics, a little explored generalization of both error-block and poset metrics, and hence also of the classic Hamming metric. We perform a detailed description of the spaces equipped with such metrics with emphasis in the coding theory and then we treat the problem that arises naturally in this context: the characterization of the poset-block metrics that admit a MacWilliams-type identity, in other words, the classification of metrics that allow to relate uniquely the spectrum of a code with the spectrum of its dual. The main technique used in this classification is the theory of characters over finite fields, including the Hadamard transform, the discrete Poisson summation formula and the orthogonality relations between characters. Such techniques were proposed initially by F. J. MacWilliams and used posteriorly by H. K. Kim and D. H. Oh in the classification of the metrics that admit a type of MacWilliams identity. Our main goal is therefore to classify the poset-block spaces that admit a MacWilliams type identity. As consequence of this classification, through the Krawtchouk polynomials, we will obtain explicit expressions for those identities
Mestrado
Matematica
Mestre em Matemática
45
Santos, Neto Pedro Esperidião dos. "Códigos corretores de erros em espaços poset." Universidade Federal de Juiz de Fora (UFJF), 2016. https://repositorio.ufjf.br/jspui/handle/ufjf/3700.
Full textAbstract:
Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-03-17T11:12:12Z
No. of bitstreams: 1
pedroesperidiaodossantosneto.pdf: 630134 bytes, checksum: 788b1bde0483d09ec36a640572f67ad0 (MD5)Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-03-18T11:49:19Z (GMT) No. of bitstreams: 1 pedroesperidiaodossantosneto.pdf: 630134 bytes, checksum: 788b1bde0483d09ec36a640572f67ad0 (MD5)
Made available in DSpace on 2017-03-18T11:49:20Z (GMT). No. of bitstreams: 1 pedroesperidiaodossantosneto.pdf: 630134 bytes, checksum: 788b1bde0483d09ec36a640572f67ad0 (MD5) Previous issue date: 2016-12-14
CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Opresentetrabalhoversasobrecódigoscorretoresdeerroseseusduaissobreespaçosposet. Inicialmente,veremososconceitosdoqueéumcódigoeautilidadedeumcódigocorretorde erros em um sistema de comunicação e construiremos as principais propriedades de corpos finitos. Estesconceitoscombinadosserãoutilizadosparaaconstruiçãodecódigoscorretores de erros em espaços de Hamming, amplamente aplicados hoje. Em seguida, construiremos os códigos corretores de erros sobre espaços poset e algumas de suas consequências, como o surgimento de códigos P-MDS. Enunciaremos o Teorema da Dualidade para espaços poset e, por fim, analisaremosos códigos do tipo P-cadeia e algumas de suas propriedades provenientes do Teorema da Dualidade.
This piece of work treats of error correcting codes and their dual codes in poset spaces. Initially we will cover the concepts of what is a code and the need of an error correction code in a communication system and the main properties of finite fields. These concepts combined are used for building the error correction codes in Hamming spaces, which are currently largely applied. Poset spaces are proposed as a generalization of the Hamming spaces e we will build the codes over poset spaces and some of their consequences, as the occurrence of P-MDS codes. Then, we will state and prove the Duality Theorem for poset spaces. Lastly, we will analyze the P-chain codes some and of their properties derived from the Duality Theorem.
46
Yakura, Hidetaka. "Epistemological and metaphysical problems posed by immunology." Sorbonne Paris Cité, 2015. http://www.theses.fr/2015USPCC068.
Full textAbstract:
Dans cet essai, je tente de rechercher l'essence d'un phénomène biologique, appelé l'immunité. Les développements récents dans le domaine de l'immunologie démontrent plusieurs résultats importants qui nous font reconsidérer sérieusement ce que l'immunité et le système immunitaire signifient. En retraçant l'évolution des modèles et des théories avancées pour expliquer comment les réponses immunitaires sont diversifiées, déclenchées, et contrôlées, j'examine d'abord le processus par lequel le fonctionnement du système immunitaire est clarifié et illustre les paradoxes apparents qui ne peuvent pas être expliquées par une vue paradigmatique sur l'immunité. Des découvertes récentes montrent que la limite entre le système immunitaire et d'autres systèmes de l'organisme et entre l'immunité innée et adaptative du système immunitaire sont floues et que le système immunitaire, même si hétérogène dans sa structure, est coextensif avec la vie. Ces résultats suggèrent que l'immunité est essentielle pour tous les organismes vivants et une activité au niveau de l'organisme. Basé sur ces résultats, je discute de l'immunité en termes d'activités centrales de la vie, à savoir, la normativité de Georges Canguilhem et le conatus de Spinoza. Étant donné que les éléments fonctionnels fondamentaux du système immunitaire (reconnaissance, l'intégration de l'information, la réaction et la mémoire) sont complètement superposés sur ceux du système nerveux central, il peut être possible d'émettre l'hypothèse qu'il y a intrinsèquement une facette neuronale dans le système immunitaire. La conscience, l'une des fonctions fondamentales du système nerveux central, est inclusivement définie comme la capacité d'adaptation au milieu externe ou interne. Si cette définition est appliquée, la conscience est présente dans tous les êtres vivants, qui fourniront une base solide pour des arguments raisonnables contre les critiques du paradigme néo-darwinienne de la biologie moderneIn this essay, I try to search for the essence of a biological phenomenon, called immunity. Recent developments in the field of immunology demonstrate several important findings that make us seriously reconsider what immunity and the immune system signify. By tracing the evolution of models and theories put forward to explicate how immune responses are diversified, triggered, and controlled, I first examine the process by which the workings of the immune system are clarified and then illustrate the apparent paradoxes that may not be explained by a paradigmatic view on immunity. Recent findings show that the boundary between the immune system and other systems in the organism and between innate and adaptive immunity in the immune system are blurred and that the immune system, albeit heterogeneous in its structure, is coextensive with life. These results suggest that immunity is an organismal activity and is essential for ail living organisms. Based on these findings, I discuss immunity in terms of vital activities of life, namely, normativity of Georges Canguilhem and the conatus of Spinoza. Given that the fundamental functional elements of the immune system (recognition, integration of information, reaction, and memory) are completely superimposed or those of the central nervous system, it may be possible to hypothesize that there is inherently a neuronal facet in the immune system. Consciousness, one of the fundamental functions of the central nervous system, is inclusively defined as adaptive capability to the externat or internai milieu. If this definition is applied, consciousness is present in all living beings, which will provide a strong foundation for reasonable counter-arguments against the critiques of the neo-Darwinian paradigm of modern biology
47
Marlow, Gregory. "Week 14, Video 03: Other Contact Poses." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/digital-animation-videos-oer/90.
Full text
48
Park, Yonggi. "PARAMETER SELECTION RULES FOR ILL-POSED PROBLEMS." Kent State University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=kent1574079328985475.
Full text
49
Hoang, Nguyen Si. "Numerical solutions to some ill-posed problems." Diss., Kansas State University, 2011. http://hdl.handle.net/2097/9204.
Full textAbstract:
Doctor of PhilosophyDepartment of Mathematics
Alexander G. Ramm
Several methods for a stable solution to the equation $F(u)=f$ have been developed. Here $F:H\to H$ is an operator in a Hilbert space $H$, and we assume that noisy data $f_\delta$, $\|f_\delta-f\|\le \delta$, are given in place of the exact data $f$. When $F$ is a linear bounded operator, two versions of the Dynamical Systems Method (DSM) with stopping rules of Discrepancy Principle type are proposed and justified mathematically. When $F$ is a non-linear monotone operator, various versions of the DSM are studied. A Discrepancy Principle for solving the equation is formulated and justified. Several versions of the DSM for solving the equation are formulated. These methods consist of a Newton-type method, a gradient-type method, and a simple iteration method. A priori and a posteriori choices of stopping rules for these methods are proposed and justified. Convergence of the solutions, obtained by these methods, to the minimal norm solution to the equation $F(u)=f$ is proved. Iterative schemes with a posteriori choices of stopping rule corresponding to the proposed DSM are formulated. Convergence of these iterative schemes to a solution to the equation $F(u)=f$ is proved. This dissertation consists of six chapters which are based on joint papers by the author and his advisor Prof. Alexander G. Ramm. These papers are published in different journals. The first two chapters deal with equations with linear and bounded operators and the last four chapters deal with non-linear equations with monotone operators.
50
Dyroff, Stefan. "Erinnerungskultur im deutsch-polnischen Kontaktbereich Bromberg und der Nordosten der Provinz Posen (Wojewodschaft Poznań) 1871 - 1939." Osnabrück fibre, 2006. http://deposit.d-nb.de/cgi-bin/dokserv?id=2841811&prov=M&dok_var=1&dok_ext=htm.
Full text