Random hypothesis generation underpins many geometric model fitting techniques. Unfortunately it is also computationally expensive. We propose a fundamentally new approach to accelerate hypothesis sampling by guiding it with information derived from residual sorting. We show that residual sorting innately encodes the probability of two points to have arisen from the same model and is obtained without recourse to domain knowledge (e.g. keypoint matching scores) typically used in previous sampling enhancement methods. More crucially our approach is naturally capable of handling data with multiple model instances and excels in applications (e.g. multi-homography fitting) which easily frustrate other techniques. Experiments show that our method provides superior efficiency on various geometric model estimation tasks. Implementation of our algorithm is available on the authors' homepage. © 2010 Springer-Verlag.
CITATION STYLE
Chin, T. J., Yu, J., & Suter, D. (2010). Accelerated hypothesis generation for multi-structure robust fitting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6315 LNCS, pp. 533–546). Springer Verlag. https://doi.org/10.1007/978-3-642-15555-0_39
Mendeley helps you to discover research relevant for your work.