1 resultado para spaces of maps
em Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul
Filtro por publicador
- Academic Archive On-line (Stockholm University; Sweden) (2)
- Adam Mickiewicz University Repository (2)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (11)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Andina Digital - Repositorio UASB-Digital - Universidade Andina Simón Bolívar (2)
- Aquatic Commons (5)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (8)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (4)
- Aston University Research Archive (7)
- B-Digital - Universidade Fernando Pessoa - Portugal (1)
- Biblioteca de Teses e Dissertações da USP (10)
- Biblioteca Digital | Sistema Integrado de Documentación | UNCuyo - UNCUYO. UNIVERSIDAD NACIONAL DE CUYO. (10)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (13)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (12)
- Biblioteca Digital de la Universidad Católica Argentina (4)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (32)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (23)
- Boston University Digital Common (2)
- Brock University, Canada (4)
- Bucknell University Digital Commons - Pensilvania - USA (6)
- Bulgarian Digital Mathematics Library at IMI-BAS (21)
- CaltechTHESIS (4)
- Cambridge University Engineering Department Publications Database (2)
- CentAUR: Central Archive University of Reading - UK (44)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (5)
- Cochin University of Science & Technology (CUSAT), India (1)
- Coffee Science - Universidade Federal de Lavras (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (5)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (55)
- Digital Commons - Michigan Tech (4)
- Digital Commons at Florida International University (8)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (2)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (2)
- Ecology and Society (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (1)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Glasgow Theses Service (1)
- Greenwich Academic Literature Archive - UK (3)
- Harvard University (37)
- Helda - Digital Repository of University of Helsinki (5)
- Indian Institute of Science - Bangalore - Índia (12)
- Institutional Repository of Leibniz University Hannover (3)
- Instituto Politécnico do Porto, Portugal (6)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (2)
- Memoria Académica - FaHCE, UNLP - Argentina (48)
- Ministerio de Cultura, Spain (1)
- National Center for Biotechnology Information - NCBI (6)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (1)
- Portal de Revistas Científicas Complutenses - Espanha (6)
- Publishing Network for Geoscientific & Environmental Data (4)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (59)
- Queensland University of Technology - ePrints Archive (71)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositório Aberto da Universidade Aberta de Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (2)
- Repositório digital da Fundação Getúlio Vargas - FGV (5)
- Repositório Institucional da Universidade de Aveiro - Portugal (4)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (2)
- Repositório Institucional da Universidade Federal do Rio Grande do Norte (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (148)
- 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 (4)
- SAPIENTIA - Universidade do Algarve - Portugal (1)
- Universidad de Alicante (7)
- Universidad del Rosario, Colombia (14)
- Universidad Politécnica de Madrid (38)
- Universidade Complutense de Madrid (3)
- Universidade de Lisboa - Repositório Aberto (3)
- Universidade Federal do Pará (17)
- Universidade Federal do Rio Grande do Norte (UFRN) (40)
- Universidade Metodista de São Paulo (1)
- Universitat de Girona, Spain (2)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (3)
- Université de Montréal (2)
- Université de Montréal, Canada (18)
- University of Connecticut - USA (1)
- University of Michigan (34)
- University of Queensland eSpace - Australia (2)
- University of Washington (3)
- WestminsterResearch - UK (9)
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.