Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming

Qifa Ke and Takeo Kanade
IEEE Conference on Computer Vision and Pattern > Recognition (CVPR 2005), July, 2005.


Download
  • Adobe portable document format (pdf) (849KB)
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing data, which often happen in real measurements, SVD is no longer applicable. For robustness Iteratively Re-weighted Least Squares (IRLS) is often used for factorization by assigning a weight to each element in the measurements. Because it uses L2 norm, good initialization in IRLS is critical for success, but is non-trivial. In this paper, we formulate matrix factorization as a L1 norm minimization problem that is solved efficiently by alternative convex programming. Our formulation 1) is robust without requiring initial weighting, 2) handles missing data straightforwardly, and 3) provides a framework in which constraints and prior knowledge (if available) can be conveniently incorporated. In the experiments we apply our approach to factorization-based structure from motion. It is shown that our approach achieves better results than other approaches (including IRLS) on both synthetic and real data.

Notes
Associated Center(s) / Consortia: Vision and Autonomous Systems Center
Number of pages: 8

Text Reference
Qifa Ke and Takeo Kanade, "Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming," IEEE Conference on Computer Vision and Pattern > Recognition (CVPR 2005), July, 2005.

BibTeX Reference
@inproceedings{Ke_2005_5236,
   author = "Qifa Ke and Takeo Kanade",
   title = "Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming",
   booktitle = "IEEE Conference on Computer Vision and Pattern > Recognition (CVPR 2005)",
   month = "July",
   year = "2005",
}