Accelerated Hypothesis Generation for Multi-Structure Robust Fitting
Abstract
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.
Cite
Text
Chin et al. "Accelerated Hypothesis Generation for Multi-Structure Robust Fitting." European Conference on Computer Vision, 2010. doi:10.1007/978-3-642-15555-0_39Markdown
[Chin et al. "Accelerated Hypothesis Generation for Multi-Structure Robust Fitting." European Conference on Computer Vision, 2010.](https://mlanthology.org/eccv/2010/chin2010eccv-accelerated/) doi:10.1007/978-3-642-15555-0_39BibTeX
@inproceedings{chin2010eccv-accelerated,
title = {{Accelerated Hypothesis Generation for Multi-Structure Robust Fitting}},
author = {Chin, Tat-Jun and Yu, Jin and Suter, David},
booktitle = {European Conference on Computer Vision},
year = {2010},
pages = {533-546},
doi = {10.1007/978-3-642-15555-0_39},
url = {https://mlanthology.org/eccv/2010/chin2010eccv-accelerated/}
}