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 that has been around in the computer vision community for a while. We follow two tracks.