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 /spl les/ 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 2D imagery.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Generalized principal component analysis (GPCA)


    Contributors:
    Vidal, R. (author) / Yi Ma, (author) / Sastry, S. (author)


    Publication date :

    2003-01-01


    Size :

    634865 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Generalized Principal Component Analysis (GPCA)

    Vidal, R. / Ma, Y. / Sastry, S. et al. | British Library Conference Proceedings | 2003


    GPCA adds audit scheme

    Online Contents | 2014