@inproceedings{981178b127004606af41534ee7ee2fdb,
title = "Robust Fitting for Multiple View Geometry",
abstract = "How hard are geometric vision problems with outliers? We show that for most fitting problems, a solution that minimizes the num- ber of outliers can be found with an algorithm that has polynomial time- complexity in the number of points (independent of the rate of outliers). Further, and perhaps more interestingly, other cost functions such as the truncated L2 -norm can also be handled within the same framework with the same time complexity. We apply our framework to triangulation, relative pose problems and stitching, and give several other examples that fulfill the required condi- tions. Based on efficient polynomial equation solvers, it is experimentally demonstrated that these problems can be solved reliably, in particular for low-dimensional models. Comparisons to standard random sampling solvers are also given.",
keywords = "geometry, optimization, computer vision",
author = "Olof Enqvist and Erik Ask and Fredrik Kahl and Karl {\AA}str{\"o}m",
year = "2012",
doi = "10.1007/978-3-642-33718-5_53",
language = "English",
isbn = "978-3-642-33717-8 (print)",
volume = "7572",
publisher = "Springer",
pages = "738--751",
editor = "Andrew Fitzgibbon and Svetlana Lazebnik and Pietro Perona and Yoichi Sato and Cordelia Schmid",
booktitle = "Lecture Notes in Computer Science (Computer Vision - ECCV 2012, Proceedings of the 12th European Conference on Computer Vision, Florence, Italy, October 7-13, 2012, Part I )",
address = "Germany",
note = "12th European Conference on Computer Vision (ECCV 2012) ; Conference date: 07-10-2012 Through 13-10-2012",
}