A polynomial-time bound for matching and registration with outliers

Carl Olsson, Olof Enqvist, Fredrik Kahl

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceedingPeer review

Sammanfattning

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.
Originalspråkengelska
Titel på värdpublikation2008 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOLS 1-12
FörlagIEEE - Institute of Electrical and Electronics Engineers Inc.
Sidor3230-3237
StatusPublished - 2008
EvenemangIEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPR Workshops), 2008 - Anchorage, AK, Anchorage, Alaska, USA
Varaktighet: 2008 juni 232008 juni 28

Publikationsserier

Namn
ISSN (tryckt)1063-6919

Konferens

KonferensIEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPR Workshops), 2008
Land/TerritoriumUSA
OrtAnchorage, Alaska
Period2008/06/232008/06/28

Ämnesklassifikation (UKÄ)

  • Matematik

Fingeravtryck

Utforska forskningsämnen för ”A polynomial-time bound for matching and registration with outliers”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här