Sciweavers

Share
CVPR
2008
IEEE

A polynomial-time bound for matching and registration with outliers

10 years 5 months ago
A polynomial-time bound for matching and registration with outliers
We present a framework for computing optimal transformations, aligning one point set to another, in the presence of outliers. Example applications include shape matching and registration (using, for example, similarity, affine or projective transformations) as well as multiview reconstruction problems (triangulation, camera pose etc.). While standard methods like RANSAC essentially use heuristics to cope with outliers, we seek to find the largest possible subset of consistent correspondences and the globally optimal transformation aligning the point sets. Based on theory from computational geometry, we show that this is indeed possible to accomplish in polynomial-time. We develop several algorithms which make efficient use of convex programming. The scheme has been tested and evaluated on both synthetic and real data for several applications. 1
Carl Olsson, Olof Enqvist, Fredrik Kahl
Added 12 Oct 2009
Updated 28 Oct 2009
Type Conference
Year 2008
Where CVPR
Authors Carl Olsson, Olof Enqvist, Fredrik Kahl
Comments (0)
books