1 resultado para Template matching
em Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul
Filtro por publicador
- JISC Information Environment Repository (3)
- Aberdeen University (1)
- Aberystwyth University Repository - Reino Unido (2)
- Academic Research Repository at Institute of Developing Economies (2)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (4)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (3)
- Aquatic Commons (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (4)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (1)
- Archive of European Integration (2)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (33)
- Avian Conservation and Ecology - Eletronic Cientific Hournal - Écologie et conservation des oiseaux: (1)
- Biblioteca de Teses e Dissertações da USP (2)
- Biblioteca Digital da Câmara dos Deputados (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (4)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (6)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (55)
- Boston University Digital Common (3)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CaltechTHESIS (1)
- Cambridge University Engineering Department Publications Database (58)
- CentAUR: Central Archive University of Reading - UK (21)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (76)
- CiencIPCA - Instituto Politécnico do Cávado e do Ave, Portugal (1)
- Cochin University of Science & Technology (CUSAT), India (8)
- Collection Of Biostatistics Research Archive (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (61)
- Department of Computer Science E-Repository - King's College London, Strand, London (41)
- Digital Commons - Michigan Tech (1)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (2)
- Digital Peer Publishing (5)
- DigitalCommons - The University of Maine Research (1)
- DigitalCommons@The Texas Medical Center (2)
- DigitalCommons@University of Nebraska - Lincoln (1)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (9)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (1)
- eScholarship Repository - University of California (1)
- Greenwich Academic Literature Archive - UK (7)
- Helda - Digital Repository of University of Helsinki (11)
- Indian Institute of Science - Bangalore - Índia (47)
- Instituto Politécnico de Leiria (1)
- Instituto Politécnico do Porto, Portugal (2)
- Livre Saber - Repositório Digital de Materiais Didáticos - SEaD-UFSCar (4)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (12)
- Ministerio de Cultura, Spain (5)
- National Center for Biotechnology Information - NCBI (16)
- Open University Netherlands (2)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- Publishing Network for Geoscientific & Environmental Data (8)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (68)
- Queensland University of Technology - ePrints Archive (150)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (3)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional da Universidade de Brasília (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (26)
- Research Open Access Repository of the University of East London. (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (1)
- SAPIENTIA - Universidade do Algarve - Portugal (2)
- Scientific Open-access Literature Archive and Repository (1)
- SerWisS - Server für Wissenschaftliche Schriften der Fachhochschule Hannover (1)
- The Scholarly Commons | School of Hotel Administration; Cornell University Research (1)
- Universidad Autónoma de Nuevo León, Mexico (1)
- Universidad de Alicante (6)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (15)
- Universidade de Madeira (1)
- Universidade Federal do Pará (1)
- Universita di Parma (2)
- Universitat de Girona, Spain (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (4)
- University of Connecticut - USA (5)
- University of Michigan (6)
- University of Queensland eSpace - Australia (45)
- University of Southampton, United Kingdom (43)
- University of Washington (1)
- WestminsterResearch - UK (1)
Resumo:
Point pattern matching in Euclidean Spaces is one of the fundamental problems in Pattern Recognition, having applications ranging from Computer Vision to Computational Chemistry. Whenever two complex patterns are encoded by two sets of points identifying their key features, their comparison can be seen as a point pattern matching problem. This work proposes a single approach to both exact and inexact point set matching in Euclidean Spaces of arbitrary dimension. In the case of exact matching, it is assured to find an optimal solution. For inexact matching (when noise is involved), experimental results confirm the validity of the approach. We start by regarding point pattern matching as a weighted graph matching problem. We then formulate the weighted graph matching problem as one of Bayesian inference in a probabilistic graphical model. By exploiting the existence of fundamental constraints in patterns embedded in Euclidean Spaces, we prove that for exact point set matching a simple graphical model is equivalent to the full model. It is possible to show that exact probabilistic inference in this simple model has polynomial time complexity with respect to the number of elements in the patterns to be matched. This gives rise to a technique that for exact matching provably finds a global optimum in polynomial time for any dimensionality of the underlying Euclidean Space. Computational experiments comparing this technique with well-known probabilistic relaxation labeling show significant performance improvement for inexact matching. The proposed approach is significantly more robust under augmentation of the sizes of the involved patterns. In the absence of noise, the results are always perfect.