Generalized principal component analysis (GPCA)

  • Authors:

  • René Vidal;Yi Ma;Shankar Sastry

  • Affiliations:

  • Department of EECS, University of California, Berkeley, CA;ECE Department, University of Illinois, Urbana, IL;Department of EECS, University of California, Berkeley, CA

  • Venue:
  • CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose an algebraic geometric approach to the problem of estimating a mixture of linear subspaces from sample data points, the so-called Generalized Principal Component Analysis (GPCA) problem. In the absence of noise, we show that GPCA is equivalent to factoring a homogeneous polynomial whose degree is the number of subspaces and whose factors (roots) represent normal vectors to each subspace. We derive a formula for the number of subspaces n and provide an analytic solution to the factorization problem using linear algebraic techniques. The solution is closed form if and only if n ≤ 4. In the presence of noise, we cast GPCA as a constrained nonlinear least squares problem and derive an optimal function from which the subspaces can be directly recovered using standard nonlinear optimization techniques. We apply GPCA to the motion segmentation problem in computer vision, i.e. the problem of estimating a mixture of motion models from 2-D imagery.