The correspondence framework for 3D surface matching algorithms
Beyond the inherent technical challenges, current research into the three dimensional surface correspondence problem is hampered by a lack of uniform terminology, an abundance of application specific algorithms, and the absence of a consistent model for comparing existing approaches and developing n...
Saved in:
| Published in | Computer vision and image understanding Vol. 97; no. 3; pp. 347 - 383 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
San Diego, CA
Elsevier Inc
01.03.2005
Elsevier |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1077-3142 1090-235X |
| DOI | 10.1016/j.cviu.2004.08.001 |
Cover
| Summary: | Beyond the inherent technical challenges, current research into the three dimensional surface correspondence problem is hampered by a lack of uniform terminology, an abundance of application specific algorithms, and the absence of a consistent model for comparing existing approaches and developing new ones. This paper addresses these challenges by presenting a framework for analysing, comparing, developing, and implementing surface correspondence algorithms. The framework uses five distinct stages to establish correspondence between surfaces. It is general, encompassing a wide variety of existing techniques, and flexible, facilitating the synthesis of new correspondence algorithms. This paper presents a review of existing surface correspondence algorithms, and shows how they fit into the correspondence framework. It also shows how the framework can be used to analyse and compare existing algorithms and develop new algorithms using the framework’s modular structure. Six algorithms, four existing and two new, are implemented using the framework. Each implemented algorithm is used to match a number of surface pairs. Results demonstrate that the correspondence framework implementations are faithful implementations of existing algorithms, and that powerful new surface correspondence algorithms can be created. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 1077-3142 1090-235X |
| DOI: | 10.1016/j.cviu.2004.08.001 |