A framework for robust subspace learning. (English) Zbl 1076.68058

De la Torre, Fernando; Black, Michael J.

Int. J. Comput. Vis. 54, No. 1-3, 117-142 (2003).

Summary: Many computer vision, signal processing and statistical problems can be posed as problems of learning low dimensional linear or multi-linear models. These models have been widely used for the representation of shape, appearance, motion, etc., in computer vision applications. Methods for learning linear models can be seen as a special case of subspace fitting. One draw-back of previous learning methods is that they are based on least squares estimation techniques and hence fail to account for “outliers” which are common in realistic training sets. We review previous approaches for making linear learning methods robust to outliers and present a new method that uses an intra-sample outlier process to account for pixel outliers. We develop the theory of robust subspace learning for linear models within a continuous optimization framework based on robust M-estimation. The framework applies to a variety of linear learning problems in computer vision including eigen-analysis and structure from motion. Several synthetic and natural examples are used to develop and illustrate the theory and applications of robust subspace learning in computer vision.

MSC:

68T05	Learning and adaptive systems in artificial intelligence
68T45	Machine vision and scene understanding
68U10	Computing methodologies for image processing

Keywords:

principal component analysis; singular value decomposition; learning; robust statistics; subspace methods; structure from motion; robust PCA; robust SVD; computer vision.

Software:

VanHuffel