$l_1$-Penalized Robust Estimation for a Class of Inverse Problems Arising in Multiview Geometry

Abstract

We propose a new approach to the problem of robust estimation in multiview geometry. Inspired by recent advances in the sparse recovery problem of statistics, our estimator is defined as a Bayesian maximum a posteriori with multivariate Laplace prior on the vector describing the outliers. This leads to an estimator in which the fidelity to the data is measured by the $L_\infty$-norm while the regularization is done by the $L_1$-norm. The proposed procedure is fairly fast since the outlier removal is done by solving one linear program (LP). An important difference compared to existing algorithms is that for our estimator it is not necessary to specify neither the number nor the proportion of the outliers. The theoretical results, as well as the numerical example reported in this work, confirm the efficiency of the proposed approach.

Cite

Text

Dalalyan and Keriven. "$l_1$-Penalized Robust Estimation for a Class of Inverse Problems Arising in Multiview Geometry." Neural Information Processing Systems, 2009.

Markdown

[Dalalyan and Keriven. "$l_1$-Penalized Robust Estimation for a Class of Inverse Problems Arising in Multiview Geometry." Neural Information Processing Systems, 2009.](https://mlanthology.org/neurips/2009/dalalyan2009neurips-1penalized/)

BibTeX

@inproceedings{dalalyan2009neurips-1penalized,
  title     = {{$l_1$-Penalized Robust Estimation for a Class of Inverse Problems Arising in Multiview Geometry}},
  author    = {Dalalyan, Arnak and Keriven, Renaud},
  booktitle = {Neural Information Processing Systems},
  year      = {2009},
  pages     = {441-449},
  url       = {https://mlanthology.org/neurips/2009/dalalyan2009neurips-1penalized/}
}