Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||RATSAC - Random tree sampling for maximum consensus estimation|
|Citation:||Proceedings DICTA 2017 - 2017 International Conference on Digital Image Computing: Techniques and Applications, 2017 / Guo, Y., Li, H., Cai, W., Murshed, M., Wang, Z., Gao, J., Feng, D. (ed./s), vol.2017-December, pp.1-8|
|Conference Name:||2017 International Conference on Digital Image Computing - Techniques and Applications (DICTA) (29 Nov 2017 - 01 Dec 2017 : Sydney)|
|Huu Le, Tat-Jun Chin and David Suter|
|Abstract:||The maximum consensus problem lies at the core of several important computer vision applications as it is one of the most popular criteria for robust estimation. Although considerable efforts have been devoted to solving this problem, exact algorithms are still impractical for real-world data. Randomized hypothesize-and-test approaches such as RANSAC and its variants are therefore still the key players in the field. Revolving around the original RANSAC algorithm, different sampling schemes have been proposed. Despite achieving substantial improvements, these RANSAC variants are still insufficient for highly contaminated data. With the aim to improve the class of randomized techniques, this paper contributes a novel approach to solve the maximum consensus problem using Monte Carlo Tree Search. Based on the theory of the LP-type problems, we reformulate the maximum consensus as an instance of tree search, which advocates the use of Monte Carlo Tree Search to explore the tree. We empirically demonstrate that our method outperforms other state- of-the-art methods in common geometric estimation problems.|
|Rights:||Copyright © 2017 by the Institute of Electrical and Electronics Engineers, Inc. All rights reserved.|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.