Iterative point matching for registration of free-form curves

Zhengyou Zhang 1
1 ROBOTVIS - Computer Vision and Robotics
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in many pratical applications, some a priori knowledge exists which considerably simplifies the problem. In visual navigation, for example, the motion between successive positions is usually either small or approximately known, but a more precise registration is required for environment modeling. The algorithm described in this report meets this need. Objects are represented by free-form curves, i.e., arbitrary spaces curves of the type found in practice. A curve is available in the form of a set of chained points. The proposed algorithm is based on iteratively matching points on one curve to the closest points on the other. A least-squares technique is used to estimate 3-D motion from the point correspondences, which reduces the average distance between curves in two sets. Both synthetic and real data have been used to test the algorithm, and the results show that it is efficient and robust, and yields an accurate motion estimate. The algorithm can be easily extended to solve similar problems such as 2-D curve matching and 3-D surface matching.
Type de document :
[Research Report] RR-1658, INRIA. 1992, pp.42
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 16:50:01
Dernière modification le : samedi 27 janvier 2018 - 01:31:34
Document(s) archivé(s) le : dimanche 4 avril 2010 - 22:02:48



  • HAL Id : inria-00074899, version 1



Zhengyou Zhang. Iterative point matching for registration of free-form curves. [Research Report] RR-1658, INRIA. 1992, pp.42. 〈inria-00074899〉



Consultations de la notice


Téléchargements de fichiers