DMCA
Fast correspondence search for 3D surface matching (2005)
Cached
Download Links
| Venue: | International Archives of Photogrammetry, Remote Sensing and Spatial Information Sciences, 36 (Part 3/W19 |
| Citations: | 12 - 7 self |
BibTeX
@INPROCEEDINGS{Akca05fastcorrespondence,
author = {Devrim Akca and Armin Gruen},
title = {Fast correspondence search for 3D surface matching},
booktitle = {International Archives of Photogrammetry, Remote Sensing and Spatial Information Sciences, 36 (Part 3/W19},
year = {2005},
pages = {186--191}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
An algorithm for least squares matching of overlapping 3D surfaces is presented. It estimates the transformation parameters between two or more fully 3D surfaces, using the Generalized Gauss-Markoff model, minimizing the sum of squares of the Euclidean distances between the surfaces. This formulation gives the opportunity of matching arbitrarily oriented 3D surfaces simultaneously, without using explicit tie points. Besides the mathematical model and execution aspects we pay particular interest to the reduction of the computational expenses. An efficient space partitioning method is implemented in order to speed up the correspondence search, which is the main portion of the computational efforts. The simultaneous matching of sub-surface patches is given as another strategy. It provides a computationally effective solution, since it matches only relevant multi-subpatches rather then the whole overlapping area. A practical example including computation times is given for the demonstration of the method. 1.
Keyphrases
surface matching fast correspondence search computational effort euclidean distance relevant multi-subpatches computation time transformation parameter generalized gauss-markoff model effective solution computational expense mathematical model explicit tie point particular interest main portion practical example whole overlapping area correspondence search efficient space simultaneous matching execution aspect sub-surface patch
