Rozprawy doktorskie na temat „Object matching”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Object matching”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Lennartsson, Mattias. "Object Recognition with Cluster Matching". Thesis, Linköping University, Department of Electrical Engineering, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-51494.
Pełny tekst źródłaWithin this thesis an algorithm for object recognition called Cluster Matching has been developed, implemented and evaluated. The image information is sampled at arbitrary sample points, instead of interest points, and local image features are extracted. These sample points are used as a compact representation of the image data and can quickly be searched for prior known objects. The algorithm is evaluated on a test set of images and the result is surprisingly reliable and time efficient.
Anderson, R. "Phase-based object matching using complex wavelets". Thesis, University of Cambridge, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.595514.
Pełny tekst źródłaAhn, Yushin. "Object space matching and reconstruction using multiple images". Columbus, Ohio : Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1213375997.
Pełny tekst źródłaKwon, Ohkyu. "Similarity measures for object matching in computer vision". Thesis, University of Bolton, 2016. http://ubir.bolton.ac.uk/890/.
Pełny tekst źródłaTieu, Kinh H. (Kinh Han) 1976. "Statistical dependence estimation for object interaction and matching". Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/38316.
Pełny tekst źródłaIncludes bibliographical references (p. 97-103).
This dissertation shows how statistical dependence estimation underlies two key problems in visual surveillance and wide-area tracking. The first problem is to detect and describe interactions between moving objects. The goal is to measure the influence objects exert on one another. The second problem is to match objects between non-overlapping cameras. There, the goal is to pair the departures in one camera with the arrivals in a different camera so that the resulting distribution of relationships best models the data. Both problems have become important for scaling up surveillance systems to larger areas and expanding the monitoring to more interesting behaviors. We show how statistical dependence estimation generalizes previous work and may have applications in other areas. The two problems represent different applications of our thesis that statistical dependence estimation underlies the learning of the structure of probabilistic models. First, we analyze the relationship between Bayesian, information-theoretic, and classical statistical methods for statistical dependence estimation. Then, we apply these ideas to formulate object interaction in terms of dependency structure model selection.
(cont.) We describe experiments on simulated and real interaction data to validate our approach. Second, we formulate the matching problem in terms of maximizing statistical dependence. This allows us to generalize previous work on matching, and we show improved results on simulated and real data for non-overlapping cameras. We also prove an intractability result on exact maximally dependent matching.
by Kinh Tieu.
Ph.D.
Ko, Kwang Hee 1971. "Algorithms for three-dimensional free-form object matching". Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/29751.
Pełny tekst źródłaIncludes bibliographical references (leaves 117-126).
This thesis addresses problems of free-form object matching for the point vs. NURBS surface and the NURBS surface vs. NURBS surface cases, and its application to copyright protection. Two new methods are developed to solve a global and partial matching problem with no a priori information on correspondence or initial transformation and no scaling effects, namely the KH and the umbilic method. The KH method establishes a correspondence between two objects by utilizing the Gaussian and mean curvatures. The umbilic method uses the qualitative properties of umbilical points to find correspondence information between two objects. These two methods are extended to deal with uniform scaling effects. The umbilic method is enhanced with an algorithm for scaling factor estimation using the quantitative properties of umbilical points. The KH method is used as a building block of an optimization scheme based on the golden section search which recovers iteratively an optimum scaling factor. Since the golden section search only requires an initial interval for the scaling factor, the solution process is simplified compared to iterative optimization algorithms, which require good initial estimates of the scaling factor and the rigid body transformation. The matching algorithms are applied to problems of copyright protection.
(cont.) A suspect model is aligned to an original model through matching methods so that similarity between two geometric models can be assessed to determine if the suspect model contains part(s) of the original model. Three types of tests, the weak, intermediate and strong tests, are proposed for similarity assessment between two objects. The weak and intermediate tests are performed at node points obtained through shape intrinsic wireframing. The strong test relies on isolated umbilical points which can be used as fingerprints of an object for supporting an ownership claim to the original model. The three tests are organized in two decision algorithms so that they produce systematic and statistical measures for a similarity decision between two objects in a hierarchical manner. Based on the systematic statistical evaluation of similarity, a decision can be reached whether the suspect model is a copy of the original model.
by Kwang Hee Ko.
Ph.D.
Sangi, P. (Pekka). "Object motion estimation using block matching with uncertainty analysis". Doctoral thesis, Oulun yliopisto, 2013. http://urn.fi/urn:isbn:9789526200774.
Pełny tekst źródłaTiivistelmä Tässä väitöskirjassa tutkitaan yhtä videonkäsittelyn ja konenäön perusongelmaa, kaksiulotteisen liikkeen estimointia. Työ käsittelee kahta yleistä tehtävää taustan ja etualan kohteiden liikkeiden määrittämisessä: hallitsevan liikkeen estimointia ja liikepohjaista kuvan segmentointia. Tutkituissa ratkaisuissa lähtökohtana käytetään lohkosovitukseen perustuvaa paikallisen liikkeen määritystä, jossa sovituksen kriteerinä käytetään poikkeutettujen kehysten pikseliarvojen erotusta. Tähän liittyen tarkastellaan estimoinnin luotettavuuden analyysin tekniikoita ja näiden hyödyntämistä edellä mainittujen tehtävien ratkaisuissa. Yleensä ottaen paikallisen liikkeen estimointia vaikeuttaa apertuuriongelma. Tämän vuoksi tarvitaan analyysitekniikoita, jotka kykenevät antamaan täydentävää tietoa liike-estimaattien luotettavuudesta. Työn ensimmäisessä osassa kehitetty analyysimenetelmä käyttää lähtötietona lohkosovituksen kriteerin arvoja, jotka on saatu eri liikekandidaateille. Erotuksena aiempiin menetelmiin kehitetty ratkaisu ottaa huomioon kuvagradientin vaikutuksen. Työn toisessa osassa tutkitaan nelivaiheista piirrepohjaista ratkaisua hallitsevan liikkeen estimoimiseksi. Perushavaintoina mallissa käytetään liikepiirteitä, jotka koostuvat valittujen kuvapisteiden koordinaateista, näissä pisteissä lasketuista liike-estimaateista ja estimaattien epävarmuuden esityksestä. Jälkimmäinen esitetään parametrisessa muodossa käyttäen laskentaan työn ensimmäisessä osassa esitettyä menetelmää. Tätä epävarmuustietoa käytetään piirteiden painottamiseen hallitsevan liikkeen estimoinnissa. Lisäksi tutkitaan gradienttipohjaista piirteiden valintaa. Kokeellisessa osassa erilaisia suunnitteluvalintoja verrataan toisiinsa käyttäen synteettisiä ja todellisia kuvasekvenssejä. Väitöstyön kolmannessa osassa esitetään piirrepohjainen menetelmä taustan ja etualan kohteen liikkeiden erottamiseksi toisistaan. Algoritmi tekee analyysin kahta liikettä sisältävälle näkymälle käyttäen sekä spatiaalista että ajallista segmentointitiedon välittämistä. Piirteiden painotus hyödyntää epävarmuustietoa tässä yhteydessä, jonka osoitetaan kokeellisesti parantavan liike-estimoinnin suorituskykyä. Viimeisessä osassa kehitetään viitekehys liikepohjaisen kohteen ilmaisun, segmentoinnin ja seurannan toteutukselle. Se perustuu lohkopohjaiseen esitystapaan ja näytteistyksen soveltamiseen liikkeen estimoinnissa. Analyysitekniikka segmentoinnin määrittämiseksi esitellään. Lopuksi ratkaisu integroidaan työn kolmannessa osassa esitetyn menetelmän kanssa, ja menetelmien yhdistelmän osoitetaan kokeellisesti parantavan sekä näytteistyksen tehokkuutta että segmentoinnin tarkkuutta
Staniaszek, Michal. "Feature-Feature Matching For Object Retrieval in Point Clouds". Thesis, KTH, Datorseende och robotik, CVAP, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-170475.
Pełny tekst źródłaSim, Hak Chuah. "Invariant object matching with a modified dynamic link network". Thesis, University of Southampton, 1999. https://eprints.soton.ac.uk/256269/.
Pełny tekst źródłaKrupnik, Amnon. "Multiple-patch matching in the object space for aerotriangulation /". The Ohio State University, 1994. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487857546386844.
Pełny tekst źródłaSchellewald, Christian. "Convex Mathematical Programs for Relational Matching of Object Views". [S.l. : s.n.], 2005. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB11947807.
Pełny tekst źródłaSjahputera, Ozy. "Object registration in scene matching based on spatial relationships /". free to MU campus, to others for purchase, 2004. http://wwwlib.umi.com/cr/mo/fullcit?p3144457.
Pełny tekst źródłaSmith, David. "Parallel approximate string matching applied to occluded object recognition". PDXScholar, 1987. https://pdxscholar.library.pdx.edu/open_access_etds/3724.
Pełny tekst źródłaAhmadyfard, Alireza. "Object recognition by region matching using relaxation with relational constraints". Thesis, University of Surrey, 2003. http://epubs.surrey.ac.uk/843289/.
Pełny tekst źródłaJeong, Kideog. "OBJECT MATCHING IN DISJOINT CAMERAS USING A COLOR TRANSFER APPROACH". UKnowledge, 2007. http://uknowledge.uky.edu/gradschool_theses/434.
Pełny tekst źródłaZhang, Jian, i 张简. "Image point matching in multiple-view object reconstruction from imagesequences". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B48079856.
Pełny tekst źródłapublished_or_final_version
Electrical and Electronic Engineering
Doctoral
Doctor of Philosophy
Neal, Pamela J. "Finding and matching topographic features in 3-D object meshes /". Thesis, Connect to this title online; UW restricted, 1999. http://hdl.handle.net/1773/5949.
Pełny tekst źródłaSteliaros, Michael Konstantinos. "Motion compensation for 2D object-based video coding". Thesis, University of Warwick, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340917.
Pełny tekst źródłaGeller, Felix, Robert Hirschfeld i Gilad Bracha. "Pattern Matching for an object-oriented and dynamically typed programming language". Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4303/.
Pełny tekst źródłaJones, Michael J. (Michael Jeffrey) 1968. "Multidimensional morphable models : a framework for representing and matching object classes". Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/43399.
Pełny tekst źródłaIncludes bibliographical references (p. 129-133).
by Michel Jeffrey Jones.
Ph.D.
Lind, Anders. "High-speed View Matching using Region Descriptors". Thesis, Linköping University, Computer Vision, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-58843.
Pełny tekst źródłaThis thesis treats topics within the area of object recognition. A real-time view matching method has been developed to compute the transformation between two different images of the same scene. This method uses a color based region detector called MSCR and affine transformations of these regions to create affine-invariant patches that are used as input to the SIFT algorithm. A parallel method to compute the SIFT descriptor has been created with relaxed constraints so that the descriptor size and the number of histogram bins can be adjusted. Additionally, a matching step to deduce correspondences and a parallel RANSAC method have been created to estimate the undergone transformation between these descriptors. To achieve real-time performance, the implementation has been targeted to use the parallel nature of the GPU with CUDA as the programming language. Focus has been put on the architecture of the GPU to find the best way to parallelize the different processing steps. CUDA has also been combined with OpenGL to be able to use the hardware accelerated anisotropic sampling method for affine transformations of regions. Parts of the implementation can also be used individually from either Matlab or by using the provided C++ library directly. The method was also evaluated in terms of accuracy and speed. It was shown that our algorithm has similar or better accuracy at finding correspondences than SIFT when the 3D geometry changes are large but we get a slightly worse result on images with flat surfaces.
Rubio, Ballester Jose C. "Many-to-Many High Order Matching. Applications to Tracking and Object Segmentation". Doctoral thesis, Universitat Autònoma de Barcelona, 2012. http://hdl.handle.net/10803/96481.
Pełny tekst źródłaFeature matching is a fundamental problem in Computer Vision, having multiple applications such as tracking, image classification and retrieval, shape recognition and stereo fusion. In numerous domains, it is useful to represent the local structure of the matching features to increase the matching accuracy or to make the correspondence invariant to certain transformations (affine, homography, etc…). However, ncoding this knowledge requires complicating the model by establishing high-order relationships between the model elements, and therefore increasing the complexity of the optimization problem. The importance of many-to-many matching is sometimes dismissed in the literature. Most methods are restricted to perform one-to-one matching, and are usually validated on synthetic, or non-realistic datasets. In a real challenging environment, with scale, pose and illumination variations of the object of interest, as well as the presence of occlusions, clutter, and noisy observations, many-to-many matching is necessary to achieve satisfactory results. As a consequence, finding the most likely many-to-many correspondence often involves a challenging combinatorial optimization process. In this work, we design and demonstrate matching algorithms that compute many-to-many correspondences, applied to several challenging problems. Our goal is to make use of high-order representations to improve the expressive power of the matching, at the same time that we make feasible the process of inference or optimization of such models. We effectively use graphical models as our preferred representation because they provide an elegant probabilistic framework to tackle structured prediction problems. We introduce a matching-based tracking algorithm which performs matching between frames of a video sequence in order to solve the difficult problem of headlight tracking at night-time. We also generalize this algorithm to solve the problem of data association applied to various tracking scenarios. We demonstrate the effectiveness of such approach in real video sequences and we show that our tracking algorithm can be used to improve the accuracy of a headlight classification system. In the second part of this work, we move from single (point) matching to dense (region) matching and we introduce a new hierarchical image representation. We make use of such model to develop a high-order many-to-many matching between pairs of images. We show that the use of high-order models in comparison to simpler models improves not only the accuracy of the results, but also the convergence speed of the inference algorithm. Finally, we keep exploiting the idea of region matching to design a fully unsupervised image cosegmentation algorithm that is able to perform competitively with state-of-the-art supervised methods. Our method also overcomes the typical drawbacks of some of the past works, such as avoiding the necessity of variate appearances on the image backgrounds. The region matching in this case is applied to effectively exploit inter-image information. We also extend this work to perform co-segmentation of videos, being the first time that such problem is addressed, as a way to perform video object segmentation.
Boros, Peter. "Object Recognition: Modelling and the Interface to a Control Strategy for Matching". Doctoral thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2007. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-1690.
Pełny tekst źródłaAmodelling system for object recognition and pose estimation is presented in this work, based on approximating the aspect/appearance graph of arbitrary rigid objects for a spherical viewing surface using simulated image data. The approximation is achieved by adaptively subdividing the viewing sphere starting with an icosahedral tessellation and iteratively decreasing the patch size until the desired resolution is reached. The adaptive subdivision is controlled by both the required resolution and object detail. The decision whether a patch should be divided is based on a similarity measure, which is obtained from applying graph matching to attributed relational graphs generated from image features.
Patches surrounded by similar views are grouped together and reference classes for the aspects are established. The reference classes are indexed by contour types encountered in the views within the group, where the contour types are computed via unsupervised clustering performed on the complete set of contours for all views of a given object.
Classification of an unknown pose is done efficiently via simple or weighted bipartite matching of the contours extracted from the unknown pose to the equivalence classes. The best suggestions are selected by a scoring scheme applied to the match results.
Themodelling system is demonstrated by experimental results for a number of objects at varying levels of resolution. Pose estimation results from both synthetic and real images are also presented.
Mian, Ajmal Saeed. "Representations and matching techniques for 3D free-form object and face recognition". University of Western Australia. School of Computer Science and Software Engineering, 2007. http://theses.library.uwa.edu.au/adt-WU2007.0046.
Pełny tekst źródłaTa, Anh Phuong. "Inexact graph matching techniques : application to object detection and human action recognition". Lyon, INSA, 2010. http://theses.insa-lyon.fr/publication/2010ISAL0099/these.pdf.
Pełny tekst źródłaLa détection d’objets et la reconnaissance des activités humaines sont les deux domaines actifs dans la vision par ordinateur, qui trouve des applications en robotique, vidéo surveillance, analyse des images médicales, interaction homme-machine, annotation et recherche de la vidéo par le contenue. Actuellement, il reste encore très difficile de construire de tels systèmes, en raison des variations des classes d’objets et d’actions, les différents points de vue, ainsi que des changements d’illumination, des mouvements de caméra, des fonds dynamiques et des occlusions. Dans cette thèse, nous traitons le problème de la détection d’objet et d’activités dans la vidéo. Malgré ses différences de buts, les problèmes fondamentaux associés partagent de nombreuses propriétés, par exemple la nécessité de manipuler des transformations non-ridiges. En décrivant un modèle d’objet ou une vidéo par un ensemble des caractéristiques locales, nous formulons le problème de reconnaissance comme celui d’une mise en correspondance de graphes, dont les nœuds représentent les caractéristiques locales, et les arrêtes représentent les relations que l’on veut vérifier entre ces caractéristiques. Le problème de mise en correspondance inexacte de graphes est connu comme NP-difficile, nous avons donc porté notre effort sur des solutions approchées. Pour cela, le problème est transformé en problème d’optimisation d’une fonction d’énergie, qui contient un terme en rapport avec la distance entre les descripteurs locaux et d’autres termes en rapport avec les relations spatiales (ou/et temporelles) entre eux. Basé sur cette énergie, deux différentes solutions ont été proposées et validées pour les deux applications ciblées: la reconnaissance d’objets à partir d’images et la reconnaissance des activités dans la vidéo. En plus, nous avons également proposé un nouveaux descripteur pour améliorer les modèles de Sac-de-mots, qui sont largement utilisé dans la vision par ordinateur. Nos expérimentations sur deux bases standards, ainsi que sur nos bases démontrent que les méthodes proposées donnent de bons résultats en comparant avec l’état de l’art dans ces deux domaines
Mian, Ajmal Saeed. "Representations and matching techniques for 3D free-form object and face recognition /". Connect to this title, 2006. http://theses.library.uwa.edu.au/adt-WU2007.0046.
Pełny tekst źródłaPlanitz, Brigit Maria. "A correspondence framework for surface matching algorithms". Queensland University of Technology, 2004. http://eprints.qut.edu.au/16001/.
Pełny tekst źródłaPlanitz, Birgit. "A correspondence framework for surface matching algorithms". Thesis, Queensland University of Technology, 2004. https://eprints.qut.edu.au/16001/1/Brigit_Planitz_Thesis.pdf.
Pełny tekst źródłaBreuel, Thomas M. "Geometric Aspects of Visual Object Recognition". Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/1721.1/7342.
Pełny tekst źródłaThakkar, Chintan. "Ventricle slice detection in MRI images using Hough Transform and Object Matching techniques". [Tampa, Fla] : University of South Florida, 2006. http://purl.fcla.edu/usf/dc/et/SFE0001815.
Pełny tekst źródłaTewes, Andreas H. [Verfasser]. "A Flexible Object Model for Encoding and Matching Human Faces / Andreas H Tewes". Aachen : Shaker, 2006. http://d-nb.info/1170529097/34.
Pełny tekst źródłaSchrider, Christina Da-Wann. "Histogram-based template matching object detection in images with varying brightness and contrast". Wright State University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=wright1224044521.
Pełny tekst źródłaThompson, Emma. "Similar but Different: How Foraging Bumblebees ('Bombus Impatiens') Treat Flowers and Pictures of Flowers". Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/35032.
Pełny tekst źródłaSkalski, Tomasz, i Witold Zaborowski. "Object detection and pose estimation of randomly organized objects for a robotic bin picking system". Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2153.
Pełny tekst źródła+4915782529118
Nigri, Simone. "Ottimizzatore per configurazione automatica di algoritmi di pattern matching". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021.
Znajdź pełny tekst źródłaMonroy, Kuhn Juan Antonio [Verfasser], i Björn [Akademischer Betreuer] Ommer. "Morphological Analysis for Object Recognition, Matching, and Applications / Juan Antonio Monroy Kuhn ; Betreuer: Björn Ommer". Heidelberg : Universitätsbibliothek Heidelberg, 2013. http://d-nb.info/1177809354/34.
Pełny tekst źródłaMonroy, Juan Antonio [Verfasser], i Björn [Akademischer Betreuer] Ommer. "Morphological Analysis for Object Recognition, Matching, and Applications / Juan Antonio Monroy Kuhn ; Betreuer: Björn Ommer". Heidelberg : Universitätsbibliothek Heidelberg, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:16-heidok-156637.
Pełny tekst źródłaCui, Beibei. "Image processing applications in object detection and graph matching : from Matlab development to GPU framework". Thesis, Bourgogne Franche-Comté, 2020. http://www.theses.fr/2020UBFCA002.
Pełny tekst źródłaAutomatically finding correspondences between object features in images is of main interest for several applications, as object detection and tracking, flow velocity estimation, identification, registration, and many derived tasks. In this thesis, we address feature correspondence within the general framework of graph matching optimization and with the principal aim to contribute, at a final step, to the design of new and parallel algorithms and their implementation on GPU (Graphics Processing Unit) systems. Graph matching problems can have many declinations, depending on the assumptions of the application at hand. We observed a gap between applications based on local cost objective functions, and those applications with higher-order cost functions, that evaluate similarity between edges of the graphs, or hyperedges when considering hypergraphs. The former class provides convolution-based algorithms already having parallel GPU implementations. Whereas, the latter class puts the emphasis on geometric inter-feature relationships, transforming the correspondence problem to a purely geometric problem stated in a high dimensional space, generally modeled as an integer quadratic programming, for which we did not find GPU implementations available yet.Two complementary approaches were adopted in order to contribute to addressing higher-order geometric graph matching on GPU. Firstly, we study different declinations of feature correspondence problems by the use of the Matlab platform, in order to reuse and provide state-of-the-art solution methods, as well as experimental protocols and input data necessary for a GPU platform with evaluation and comparison tools against existing sequential algorithms, most of the time developed in Matlab framework. Then, the first part of this work concerns three contributions, respectively, to background and frame difference application, to feature extraction problem from images for local correspondences, and to the general graph matching problem, all based on the combination of methods derived from Matlab environment. Secondly, and based on the results of Matlab developments, we propose a new GPU framework written in CUDA C++ specifically dedicated to geometric graph matching but providing new parallel algorithms, with lower computational complexity, as the self-organizing map in the plane, derived parallel clustering algorithms, and distributed local search method. These parallel algorithms are then evaluated and compared to the state-of-the-art methods available for graph matching and following the same experimental protocol. This GPU platform constitutes our final and main proposal to contribute to bridging the gap between GPU development and higher-order graph matching
Mora, Leonardo. "Un algoritmo di pattern matching basato sull'estrazione di segmenti rettilinei". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2018.
Znajdź pełny tekst źródłaPettersson, Johan. "Real-time Object Recognition on a GPU". Thesis, Linköping University, Department of Electrical Engineering, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-10238.
Pełny tekst źródłaShape-Based matching (SBM) is a known method for 2D object recognition that is rather robust against illumination variations, noise, clutter and partial occlusion.
The objects to be recognized can be translated, rotated and scaled.
The translation of an object is determined by evaluating a similarity measure for all possible positions (similar to cross correlation).
The similarity measure is based on dot products between normalized gradient directions in edges.
Rotation and scale is determined by evaluating all possible combinations, spanning a huge search space.
A resolution pyramid is used to form a heuristic for the search that then gains real-time performance.
For SBM, a model consisting of normalized edge gradient directions, are constructed for all possible combinations of rotation and scale.
We have avoided this by using (bilinear) interpolation in the search gradient map, which greatly reduces the amount of storage required.
SBM is highly parallelizable by nature and with our suggested improvements it becomes much suited for running on a GPU.
This have been implemented and tested, and the results clearly outperform those of our reference CPU implementation (with magnitudes of hundreds).
It is also very scalable and easily benefits from future devices without effort.
An extensive evaluation material and tools for evaluating object recognition algorithms have been developed and the implementation is evaluated and compared to two commercial 2D object recognition solutions.
The results show that the method is very powerful when dealing with the distortions listed above and competes well with its opponents.
Ilestrand, Maja. "Automatic Eartag Recognition on Dairy Cows in Real Barn Environment". Thesis, Linköpings universitet, Datorseende, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-139245.
Pełny tekst źródłaThanikasalam, Kokul. "Appearance based online visual object tracking". Thesis, Queensland University of Technology, 2019. https://eprints.qut.edu.au/130875/1/Kokul_Thanikasalam_Thesis.pdf.
Pełny tekst źródłaDuchenne, Olivier. "Non-rigid image alignment for object recognition". Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2012. http://tel.archives-ouvertes.fr/tel-00906074.
Pełny tekst źródłaAleixo, Patrícia Nunes. "Object detection and recognition for robotic applications". Master's thesis, Universidade de Aveiro, 2014. http://hdl.handle.net/10773/13811.
Pełny tekst źródłaThe computer vision assumes an important relevance in the development of robotic applications. In several applications, robots need to use vision to detect objects, a challenging and sometimes difficult task. This thesis is focused on the study and development of algorithms to be used in detection and identification of objects on digital images to be applied on robots that will be used in practice cases. Three problems are addressed: Detection and identification of decorative stones for textile industry; Detection of the ball in robotic soccer; Detection of objects in a service robot, that operates in a domestic environment. In each case, different methods are studied and applied, such as, Template Matching, Hough transform and visual descriptors (like SIFT and SURF). It was chosen the OpenCv library in order to use the data structures to image manipulation, as well as other structures for all information generated by the developed vision systems. Whenever possible, it was used the implementation of the described methods and have been developed new approaches, both in terms of pre-processing algorithms and in terms of modification of the source code in some used functions. Regarding the pre-processing algorithms, were used the Canny edge detector, contours detection, extraction of color information, among others. For the three problems, there are presented and discussed experimental results in order to evaluate the best method to apply in each case. The best method for each application is already integrated or in the process of integration in the described robots.
A visão por computador assume uma importante relevância no desenvolvimento de aplicações robóticas, na medida em que há robôs que precisam de usar a visão para detetar objetos, uma tarefa desafiadora e por vezes difícil. Esta dissertação foca-se no estudo e desenvolvimento de algoritmos para a deteção e identificação de objetos em imagem digital para aplicar em robôs que serão usados em casos práticos. São abordados três problemas: Deteção e identificação de pedras decorativas para a indústria têxtil; Deteção da bola em futebol robótico; Deteção de objetos num robô de serviço, que opera em ambiente doméstico. Para cada caso, diferentes métodos são estudados e aplicados, tais como, Template Matching, transformada de Hough e descritores visuais (como SIFT e SURF). Optou-se pela biblioteca OpenCv com vista a utilizar as suas estruturas de dados para manipulação de imagem, bem como as demais estruturas para toda a informação gerada pelos sistemas de visão desenvolvidos. Sempre que possivel utilizaram-se as implementações dos métodos descritos tendo sido desenvolvidas novas abordagens, quer em termos de algoritmos de preprocessamento quer em termos de alteração do código fonte das funções utilizadas. Como algoritmos de pre-processamento foram utilizados o detetor de arestas Canny, deteção de contornos, extração de informação de cor, entre outros. Para os três problemas, são apresentados e discutidos resultados experimentais, de forma a avaliar o melhor método a aplicar em cada caso. O melhor método em cada aplicação encontra-se já integrado ou em fase de integração dos robôs descritos.
Li, Bo. "Interest Curves : Concept, Evaluation, Implementation and Applications". Doctoral thesis, Umeå universitet, Institutionen för tillämpad fysik och elektronik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-111175.
Pełny tekst źródłaBilddetaljer har en viktig roll i ett stort antal applikationer för datorseende, t.ex., bildregistrering, 3D-rekonstruktion, objektdetektering och videoförståelse. Dessa bilddetaljer inkluderar kanter, konturer, hörn, regioner, linjer, kurvor, intressepunkter, etc. Forskningen inom dessa områden är splittrad, särskilt för detektering av linjer och kurvor. I denna avhandling, strävar vi efter att hitta, integrera, utvärdera och sammanfatta tidigare forskning tillsammans med vår egen forskning inom området för bildegenskaper. Denna avhandling presenterar ett ramverk för begrepp, utvärdering, utförande och applikationer för bilddetaljer. För det första föreslår denna avhandling ett nytt koncept för intressekurvor. Intressekurvor är ett begrepp som härrör från intressepunkter och det är viktiga linjer och bågar i bilden som är repeterbara oberoende av olika bildtransformationer. Intressekurvor ger en tydlig vägledning och struktur för framtida algoritmer och relaterade tillämpningar för kurv- och linjedetektering. För det andra, presenterar denna avhandling en utvärderingsram för detektorer och beskrivningar av intressekurvor. Utvärderingsramverket utgör en ny paradigm för att jämföra resultatet för de bästa möjliga teknikerna för linje- och kurvdetektorer vid bildstörningar och bildtransformationer. För det tredje presenterar denna avhandling en detektor för intressekurvor (Distinctive curves, DICU), som förenar detektering av kanter, hörn, linjer och kurvor. DICU representerar vårt främsta bidrag inom området detektering av kanter, hörn, kurvor och linjer. Våra forskningsinsatser täcker de viktigaste attribut som krävs av dessa funktioner med avseende på robusthet och effektivitet. Intressekurvor innehåller en rikare geometrisk information än intressepunkter. Denna fördel öppnar för nya sätt att lösa problem för datorseende. Vi föreslår en enkel beskrivningsmetod för kurvmatchningsapplikationer och den föreslagna deskriptorn för intressekurvor överträffar de bästa tillgängliga deskriptorerna för intressepunkter (SIFT, SURF, BRISK, ORB, och FREAK). Dessutom utformar vi en ny objektdetekteringsalgoritm som bara använder geometri för DICU utan att använda det lokala utseendet. Vi organiserar bildobjekt som kurvkedjor och för att upptäcka ett objekt behöver vi endast söka efter denna kurvkedja i målbilden med hjälp av dynamisk programmering. Kurvkedjematchningen är oberoende av skala och rotationer samt robust vid bilddeformationer. Dessa egenskaper ger möjlighet att lösa problemet med rotationsberoende inom objektdetektering. Vårt ansiktsigenkänningsexperiment visar att kurvkedjematchning är oberoende av skala och rotationer och att den är mycket beräkningseffektiv.
INTRO – INteractive RObotics research network
HE, LEI. "A COMPARISON OF DEFORMABLE CONTOUR METHODS AND MODEL BASED APPROACH USING SKELETON FOR SHAPE RECOVERY FROM IMAGES". University of Cincinnati / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1059746287.
Pełny tekst źródłaMadi, Kamel. "Inexact graph matching : application to 2D and 3D Pattern Recognition". Thesis, Lyon, 2016. http://www.theses.fr/2016LYSE1315/document.
Pełny tekst źródłaGraphs are powerful mathematical modeling tools used in various fields of computer science, in particular, in Pattern Recognition. Graph matching is the main operation in Pattern Recognition using graph-based approach. Finding solutions to the problem of graph matching that ensure optimality in terms of accuracy and time complexity is a difficult research challenge and a topical issue. In this thesis, we investigate the resolution of this problem in two fields: 2D and 3D Pattern Recognition. Firstly, we address the problem of geometric graphs matching and its applications on 2D Pattern Recognition. Kite (archaeological structures) recognition in satellite images is the main application considered in this first part. We present a complete graph based framework for Kite recognition on satellite images. We propose mainly two contributions. The first one is an automatic process transforming Kites from real images into graphs and a process of generating randomly synthetic Kite graphs. This allowing to construct a benchmark of Kite graphs (real and synthetic) structured in different level of deformations. The second contribution in this part, is the proposition of a new graph similarity measure adapted to geometric graphs and consequently for Kite graphs. The proposed approach combines graph invariants with a geometric graph edit distance computation. Secondly, we address the problem of deformable 3D objects recognition, represented by graphs, i.e., triangular tessellations. We propose a new decomposition of triangular tessellations into a set of substructures that we call triangle-stars. Based on this new decomposition, we propose a new algorithm of graph matching to measure the distance between triangular tessellations. The proposed algorithm offers a better measure by assuring a minimum number of triangle-stars covering a larger neighbourhood, and uses a set of descriptors which are invariant or at least oblivious under most common deformations. Finally, we propose a more general graph matching approach founded on a new formalization based on the stable marriage problem. The proposed approach is optimal in term of execution time, i.e. the time complexity is quadratic O(n2) and flexible in term of applicability (2D and 3D). The analyze of the time complexity of the proposed algorithms and the extensive experiments conducted on Kite graph data sets (real and synthetic) and standard data sets (2D and 3D) attest the effectiveness, the high performance and accuracy of the proposed approaches and show that the proposed approaches are extensible and quite general
Baruzzi, Francesco. "Object detection in robot picking applications using 3d cameras". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/22594/.
Pełny tekst źródłaSadek, Rida. "Some problems on temporally consistent video editing and object recognition". Doctoral thesis, Universitat Pompeu Fabra, 2012. http://hdl.handle.net/10803/101413.
Pełny tekst źródłaLa edición de vídeo y el reconocimiento de objetos son dos áreas fundamentales en el campo de la visión por computador: la primera es de gran utilidad en los procesos de producción y post-producción digital de vídeo; la segunda es esencial para la clasificación o búsqueda de imágenes en grandes bases de datos (por ejemplo, en la web). En esta tesis se acometen ambos problemas, en concreto, se presenta una nueva formulación que aborda las tareas de edición de vídeo y se desarrolla un mecanismo que permite generar descriptores más robustos para los objetos de la imagen. Con respecto al primer problema, en esta tesis se proponen dos modelos variacionales para llevar a cabo la edición de vídeo de forma coherente en el tiempo. Estos modelos se aplican para cambiar la textura de un objeto (rígido o no) a lo largo de una secuencia de vídeo dada. Uno de los modelos está basado en la propagación de la información de color desde un determinado cuadro de la secuencia de vídeo (o entre dos cuadros dados) a lo largo de las trayectorias de movimiento del vídeo. El otro modelo está basado en la propagación de la información en el dominio del gradiente. Ambos modelos requieren una intervención mínima por parte del usuario y se ajustan de manera automática a los cambios de iluminación de la escena. Con respecto al segundo problema, esta tesis aborda el problema de la invariancia afín en el reconocimiento de objetos. Se introduce un nuevo método para generar cantidades geométricas afines que se utilizan en la generación de descriptores de características. También se demuestra que el uso de dichas cantidades proporciona mayor robustez al reconocimiento que los descriptores existentes actualmente en el estado del arte.
Revaud, Jérôme. "Contributions to a fast and robust object recognition in images". Phd thesis, INSA de Lyon, 2011. http://tel.archives-ouvertes.fr/tel-00694442.
Pełny tekst źródła