Efficient multi-structure robust fitting with incremental top-k lists comparison
Date
2010
Authors
Wong, H.
Chin, T.
Yu, J.
Suter, D.
Editors
Kimmel, R.
Klette, R.
Sugimoto, A.
Klette, R.
Sugimoto, A.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Computer Vision - ACCV 2010: Proceedings of 10th Asian Conference on Computer Vision, held in Queenstown, New Zealand, Nov 8-12 2010, revised selected papers, part 1 / R. Kimmel, R. Klette and A. Sugimoto (eds.): pp.1-12
Statement of Responsibility
Hoi Sim Wong, Tat-Jun Chin, Jin Yu and David Suter
Conference Name
Asian Conference on Computer Vision (10th : 2010 : Queenstown, New Zealand)
Abstract
Random hypothesis sampling lies at the core of many popular robust fitting techniques such as RANSAC. In this paper, we propose a novel hypothesis sampling scheme based on incremental computation of distances between partial rankings (top-k lists) derived from residual sorting information. Our method simultaneously (1) guides the sampling such that hypotheses corresponding to all true structures can be quickly retrieved and (2) filters the hypotheses such that only a small but very promising subset remain. This permits the usage of simple agglomerative clustering on the surviving hypotheses for accurate model selection. The outcome is a highly efficient multi-structure robust estimation technique. Experiments on synthetic and real data show the superior performance of our approach over previous methods.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright Springer-Verlag Berlin Heidelberg 2011