Motion from point matches : multiplicity of solutions

Abstract : In this paper, we study the multiplicity of solutions of the motion problem. Given n point matches between two frames, how many solutions are there to the motion problem ? We show that the maximum number of solutions is 10 when 5 point matches are available. This settles a question which has been around in the computer vision community for a while. We follow two tracks. The first one attempts to recover the motion parameters by studying the essential matrix and has been followed by a number of researchers in the field. A natural extension of this is to use algebraic geometry to characterize the set of possible essential matrices. We present some new results based on this approach. The second one, based on projective geometry, dates from the previous century. We show that the two approaches are compatible and yield the same result. We then describe a computer implementation of the second approach that uses Maple, a language for symbolic computation. The program allows us to compute exactly the solutions for any configuration of 5 points. Some experiments are described.
Type de document :
[Research Report] RR-1157, INRIA. 1990
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 18:08:58
Dernière modification le : samedi 27 janvier 2018 - 01:31:04
Document(s) archivé(s) le : mardi 12 avril 2011 - 22:57:38



  • HAL Id : inria-00075401, version 1



Olivier Faugeras, Steve Maybank. Motion from point matches : multiplicity of solutions. [Research Report] RR-1157, INRIA. 1990. 〈inria-00075401〉



Consultations de la notice


Téléchargements de fichiers