|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04) - Volume 2
Minimum Effective Dimension for Mixtures of Subspaces: A Robust GPCA Algorithm and Its Applications
Washington, D.C., USA
June 27-July 02
ISBN: 0-7695-2158-4
| ASCII Text | x | ||
| Kun Huang, Yi Ma, René Vidal, "Minimum Effective Dimension for Mixtures of Subspaces: A Robust GPCA Algorithm and Its Applications," 2012 IEEE Conference on Computer Vision and Pattern Recognition, vol. 2, pp. 631-638, 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04) - Volume 2, 2004. | |||
| BibTex | x | ||
| @article{ 10.1109/CVPR.2004.155, author = {Kun Huang and Yi Ma and René Vidal}, title = {Minimum Effective Dimension for Mixtures of Subspaces: A Robust GPCA Algorithm and Its Applications}, journal ={2012 IEEE Conference on Computer Vision and Pattern Recognition}, volume = {2}, year = {2004}, issn = {1063-6919}, pages = {631-638}, doi = {http://doi.ieeecomputersociety.org/10.1109/CVPR.2004.155}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE Conference on Computer Vision and Pattern Recognition TI - Minimum Effective Dimension for Mixtures of Subspaces: A Robust GPCA Algorithm and Its Applications SN - 1063-6919 SP631 EP638 A1 - Kun Huang, A1 - Yi Ma, A1 - René Vidal, PY - 2004 KW - null VL - 2 JA - 2012 IEEE Conference on Computer Vision and Pattern Recognition ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CVPR.2004.155
In this paper, we propose a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). Previous information-theoretic model selection criteria typically assume that data can be modelled with a parametric model of certain (possibly differing) dimension and a known error distribution. However, for mixtures of subspaces with different dimensions, a generalized notion of dimensionality is needed and hence introduced in this paper. The proposed MED criterion minimizes this geometric dimension subject to a given error tolerance (regardless of the noise distribution). Furthermore, combined with a purely algebraic approach to clustering mixtures of subspaces, namely the Generalized PCA (GPCA), the MED is designed to also respect the global algebraic and geometric structure of the data. The result is a non-iterative algorithm called robust GPCA that estimates from noisy data an unknown number of subspaces with unknown and possibly different dimensions subject to a maximum error bound. We test the algorithm on synthetic noisy data and in applications such as motion/image/video segmentation.
Citation:
Kun Huang, Yi Ma, René Vidal, "Minimum Effective Dimension for Mixtures of Subspaces: A Robust GPCA Algorithm and Its Applications," cvpr, vol. 2, pp.631-638, 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04) - Volume 2, 2004
Usage of this product signifies your acceptance of the Terms of Use.
