Motion from point matches : multiplicity of solutions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1990

Motion from point matches : multiplicity of solutions


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.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1157.pdf (1.8 Mo) Télécharger le fichier

Dates and versions

inria-00075401 , version 1 (24-05-2006)


  • 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⟩
250 View
1756 Download


Gmail Facebook Twitter LinkedIn More