Optimal Geometric Fitting under the Truncated L2-Norm

Erik Ask, Olof Enqvist, Fredrik Kahl; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2013, pp. 1722-1729

Abstract


This paper is concerned with model fitting in the presence of noise and outliers. Previously it has been shown that the number of outliers can be minimized with polynomial complexity in the number of measurements. This paper improves on these results in two ways. First, it is shown that for a large class of problems, the statistically more desirable truncated L 2 -norm can be optimized with the same complexity. Then, with the same methodology, it is shown how to transform multi-model fitting into a purely combinatorial problem--with worst-case complexity that is polynomial in the number of measurements, though exponential in the number of models. We apply our framework to a series of hard registration and stitching problems demonstrating that the approach is not only of theoretical interest. It gives a practical method for simultaneously dealing with measurement noise and large amounts of outliers for fitting problems with lowdimensional models.

Related Material


[pdf]
[bibtex]
@InProceedings{Ask_2013_CVPR,
author = {Ask, Erik and Enqvist, Olof and Kahl, Fredrik},
title = {Optimal Geometric Fitting under the Truncated L2-Norm},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2013}
}