By Topic

Automatic detection of rigid point matches

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
L. Moisan ; CMLA, Ecole Nonnale Superieure de Cachan, France ; B. Stival

The perspective projections of n physical points on two views (stereovision) are constrained as soon as n ≥ 8. However, to prove, in practice, the existence of a rigid motion between two images, more than 8 point matches are desirable in order to compensate for the limited accuracy of the matches. We propose a computational definition of rigidity and a probabilistic criterion to rate the meaningfulness of a rigid set as a function of both the number of pairs of points (n) and the accuracy of the matches.. This criterion yields an objective way to compare, say, precise matches of a few points and approximate matches of a lot of points. It gives a yes/no answer to the question: "Could this rigid point correspondence have occurred by chance?", since it guarantees that the expected number of rigid sets found by chance in a random distribution of points is as small as desired. We use it to build an optimized random sampling algorithm that is able to detect a rigid motion and estimate the fundamental matrix when the set of point matches contains up to 90% of outliers, which outperforms classical methods like M-estimators, LMedS and RANSAC, known to break down around or before 50% of outliers.

Published in:

Motion and Video Computing, 2002. Proceedings. Workshop on

Date of Conference:

5-6 Dec. 2002