Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||An adversarial optimization approach to efficient outlier removal|
|Citation:||Journal of Mathematical Imaging and Vision, 2014; 48(3):451-466|
|Publisher:||Kluwer Academic Publishers|
|Jin Yu, Anders Eriksson, Tat-Jun Chin, David Suter|
|Abstract:||This paper proposes a novel adversarial optimiza- tion approach to efficient outlier removal in computer vision. We characterize the outlier removal problem as a game that involves two players of conflicting interests, namely, model optimizer and outliers. Such an adversarial view not only brings new insights into some existing methods, but also gives rise to a general optimization framework that provably unifies them. Under the proposed framework, we develop a new outlier removal approach that is able to offer a much needed control over the trade-off between reliability and speed, which is usually not available in previous methods. Underlying the proposed approach is a mixed-integer minmax (convex-concave) problem formulation. Although a minmax problem is generally not amenable to efficient optimization, we show that for some commonly used vision objective functions, an equivalent Linear Program reformulation exists. This significantly simplifies the optimization. We demonstrate our method on two representative multiview geometry problems. Experiments on real image data illustrate superior practical performance of our method over recent techniques.|
|Keywords:||Mixed-integer optimization; convex relaxation; model fitting; outlier removal|
|Rights:||© Springer Science+Business Media New York 2013|
|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.