Guaranteed outlier removal with mixed integer linear programs
Files
(Restricted access)
Date
2016
Authors
Chin, T.
Kee, Y.
Eriksson, A.
Neumann, F.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings / CVPR, IEEE Computer Society Conference on Computer Vision and Pattern Recognition. IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2016, vol.2016, pp.5858-5866
Statement of Responsibility
Tat-Jun Chin, Yang Heng Kee, Anders Eriksson and Frank Neumann
Conference Name
29th IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2016) (26 Jun 2016 - 1 Jul 2016 : Las Vegas, NV)
Abstract
The maximum consensus problem is fundamentally important to robust geometric fitting in computer vision. Solving the problem exactly is computationally demanding, and the effort required increases rapidly with the problem size. Although randomized algorithms are much more efficient, the optimality of the solution is not guaranteed. Towards the goal of solving maximum consensus exactly, we present guaranteed outlier removal as a technique to reduce the runtime of exact algorithms. Specifically, before conducting global optimization, we attempt to remove data that are provably true outliers, i.e., those that do not exist in the maximum consensus set. We propose an algorithm based on mixed integer linear programming to perform the removal. The result of our algorithm is a smaller data instance that admits a much faster solution by subsequent exact algorithms, while yielding the same globally optimal result as the original problem. We demonstrate that overall speedups of up to 80% can be achieved on common vision problems1.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© 2016 IEEE