Skip to Main content Skip to Navigation
Journal articles

Using local planar geometric invariants to match and model images of line segments

Patrick Gros 1 Olivier Bournez 1, 2 Edmond Boyer 1
1 MOVI - Modeling, localization, recognition and interpretation in computer vision
GRAVIR - IMAG - Laboratoire d'informatique GRAphique, VIsion et Robotique de Grenoble, Inria Grenoble - Rhône-Alpes, CNRS - Centre National de la Recherche Scientifique : FR71
Abstract : Image matching consists of finding features in different images that represent the same feature of the observed scene. It is a basic process in vision whenever several images are used. This paper describes a matching algorithm is to assume that the apparent motion between the two images. The key-idea of the algorithm is to assume that the apparent motion between the two imagescan be approximated by a planar geometric transformation (a similartiy or an affine transformation) and to compute such an approximation. Under such an assumption, local planar invariants related the kind of transformation used as approximation, should have the same value in both images and matched according to their values. A global constraint is added to insure a global coherency between all the possible matches : all the local matches must define approximately the same geometric transformation between the two images. These first matches are verified and completed using a better and more global approximation of the apparent motion by a planar homography, and an estimate of the epipolar geometry. If more than two images are considered, they are initially matched pairwise, then global matches are deduced in a second step. Finally, from a set of images representing different aspects of an object, it is possible to compare them, and to compute a model of each aspect using the matching algorithm. This work uses in a new way many elements already known in vision : some of the local planar invariants used here were presented as quasi-invariants by Binford and studied by Ben-Arie in his work on the Peaking Effect. The algorithm itself uses other ideas coming from the geometric hashing and the Hough algorithms. Its main limitations come from the invariants used. They are really stable when they are computed for a planar object or for many man-made objects which contain many coplanar facets and elements. On the other hand, the algorithm will probably fail when used with images of very general polyhedrons. Its main advantages are that it still works even if the images are noisy and the polyhedral approximation of the contours is not exact, if the apparent motion between the images is not infinitesimal, if they are several different motions in the scene, and if the camera is uncalibrated and its motion unknown. The basic matching algorithm is presented in the section 2, the and completion stages in section 3, the matching of several images is studied in section 4 and the algorithm to model the different aspects of an object is presented in section 5. Results obtained with the different algorithms are shown in the corresponding sections.
Document type :
Journal articles
Complete list of metadata
Contributor : Olivier Bournez Connect in order to contact the contributor
Submitted on : Tuesday, May 31, 2011 - 11:39:18 AM
Last modification on : Saturday, September 11, 2021 - 3:16:50 AM
Long-term archiving on: : Friday, December 2, 2016 - 6:01:33 PM


Files produced by the author(s)



Patrick Gros, Olivier Bournez, Edmond Boyer. Using local planar geometric invariants to match and model images of line segments. Computer Vision and Image Understanding, Elsevier, 1998, 69 (2), pp.135-155. ⟨10.1006/cviu.1997.0565⟩. ⟨inria-00102944⟩



Record views


Files downloads