References

[AB98]

C.D. Aliprantis and O. Burkinshaw. Principles of real analysis. ACADEMIC PressINC, 1998. ISBN 9780120502578.

[Art91]

M. Artin. Algebra. Prentice Hall, 1991. ISBN 9780130047632.

[BDDH11]

Richard Baraniuk, M Davenport, M Duarte, and Chinmay Hegde. An introduction to compressive sensing. Connexions e-textbook, 2011.

[BJ03]

Ronen Basri and David W Jacobs. Lambertian reflectance and linear subspaces. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 25(2):218–233, 2003.

[BFH+07]

E. van den Berg, M. P. Friedlander, G. Hennenfent, F. Herrmann, R. Saab, and Ö. Yılmaz. Sparco: A testing framework for sparse reconstruction. Technical Report TR-2007-20, Dept. Computer Science, University of British Columbia, Vancouver, October 2007.

[BjorckG73]

Ȧke Björck and Gene H Golub. Numerical methods for computing angles between linear subspaces. Mathematics of computation, 27(123):579–594, 1973.

[BD09]

Thomas Blumensath and Mike E Davies. Iterative hard thresholding for compressed sensing. Applied and Computational Harmonic Analysis, 27(3):265–274, 2009.

[BB91]

Terrance E Boult and Lisa Gottesfeld Brown. Factorization-based segmentation of motions. In Visual Motion, 1991., Proceedings of the IEEE Workshop on, 179–186. IEEE, 1991.

[BM00]

Paul S Bradley and Olvi L Mangasarian. K-plane clustering. Journal of Global Optimization, 16(1):23–32, 2000.

[BK00]

DS Broomhead and Michael Kirby. A new approach to dimensionality reduction: theory and algorithms. SIAM Journal on Applied Mathematics, 60(6):2114–2142, 2000.

[BM13]

Joan Bruna and Stéphane Mallat. Invariant scattering convolution networks. IEEE transactions on pattern analysis and machine intelligence, 35(8):1872–1886, 2013.

[CR04]

Emmanuel J Candes and Justin Romberg. Practical signal recovery from random projections. Wavelet Applications in Signal and Image Processing XI Proc. SPIE Conf. 5914., 2004.

[CT05]

Emmanuel J Candes and Terence Tao. Decoding by linear programming. Information Theory, IEEE Transactions on, 51(12):4203–4215, 2005.

[CT06]

Emmanuel J Candes and Terence Tao. Near-optimal signal recovery from random projections: universal encoding strategies? Information Theory, IEEE Transactions on, 52(12):5406–5425, 2006.

[Cev09]

Volkan Cevher. Learning with compressible priors. In Advances in Neural Information Processing Systems, 261–269. 2009.

[CDS98]

Scott Shaobing Chen, David L Donoho, and Michael A Saunders. Atomic decomposition by basis pursuit. SIAM journal on scientific computing, 20(1):33–61, 1998.

[CK98]

João Paulo Costeira and Takeo Kanade. A multibody factorization method for independently moving objects. International Journal of Computer Vision, 29(3):159–179, 1998.

[DG99]

Sanjoy Dasgupta and Anupam Gupta. An elementary proof of the johnson-lindenstrauss lemma. International Computer Science Institute, Technical Report, pages 99–006, 1999.

[DLR77]

Arthur P Dempster, Nan M Laird, and Donald B Rubin. Maximum likelihood from incomplete data via the em algorithm. Journal of the royal statistical society. Series B (methodological), pages 1–38, 1977.

[Der07]

Harm Derksen. Hilbert series of subspace arrangements. Journal of pure and applied algebra, 209(1):91–98, 2007.

[Don06]

David L Donoho. For most large underdetermined systems of linear equations the minimal $l_1$-norm solution is also the sparsest solution. Communications on pure and applied mathematics, 59(6):797–829, 2006.

[DE03]

David L Donoho and Michael Elad. Optimally sparse representation in general (nonorthogonal) dictionaries via $l_1$ minimization. Proceedings of the National Academy of Sciences, 100(5):2197–2202, 2003.

[DET06]

David L Donoho, Michael Elad, and Vladimir N Temlyakov. Stable recovery of sparse overcomplete representations in the presence of noise. Information Theory, IEEE Transactions on, 52(1):6–18, 2006.

[DHS12]

Richard O Duda, Peter E Hart, and David G Stork. Pattern classification. John Wiley & Sons, 2012.

[DSB13]

Eva L Dyer, Aswin C Sankaranarayanan, and Richard G Baraniuk. Greedy feature selection for subspace clustering. The Journal of Machine Learning Research, 14(1):2487–2517, 2013.

[Ela10]

Michael Elad. Sparse and redundant representations. Springer, 2010.

[EV13]

Ehsan Elhamifar and Rene Vidal. Sparse subspace clustering: algorithm, theory, and applications. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 35(11):2765–2781, 2013.

[EV09]

Ehsan Elhamifar and René Vidal. Sparse subspace clustering. In Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on, 2790–2797. IEEE, 2009.

[FV+62]

David G Feingold, Richard S Varga, and others. Block diagonally dominant matrices and generalizations of the gerschgorin circle theorem. Pacific J. Math, 12(4):1241–1250, 1962.

[Gea98]

Charles William Gear. Multibody grouping from motion images. International Journal of Computer Vision, 29(2):133–150, 1998.

[GVL12]

Gene H Golub and Charles F Van Loan. Matrix computations. Volume 3. JHU Press, 2012.

[GH14]

Phillip Griffiths and Joseph Harris. Principles of algebraic geometry. John Wiley & Sons, 2014.

[Har13]

Joe Harris. Algebraic geometry: a first course. Volume 133. Springer Science & Business Media, 2013.

[Har75]

John A Hartigan. Clustering algorithms. 1975.

[Har77]

Robin Hartshorne. Algebraic geometry. Volume 52. Springer Science & Business Media, 1977.

[HYL+03]

Jeffrey Ho, Ming-Hsuan Yang, Jongwoo Lim, Kuang-Chih Lee, and David Kriegman. Clustering appearances of objects under varying illumination conditions. In Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on, volume 1, I–11. IEEE, 2003.

[HMV04]

Kun Huang, Yi Ma, and René Vidal. Minimum effective dimension for mixtures of subspaces: a robust gpca algorithm and its applications. In Computer Vision and Pattern Recognition, 2004. CVPR 2004. Proceedings of the 2004 IEEE Computer Society Conference on, volume 2, II–631. IEEE, 2004.

[Jol02]

Ian Jolliffe. Principal component analysis. Wiley Online Library, 2002.

[Kan01]

Kenichi Kanatani. Motion segmentation by subspace separation and model selection. image, 1:1, 2001.

[KW79]

Paul Joseph Kelly and Max L Weiss. Geometry and convexity: a study in mathematical methods. John Wiley & Sons, 1979.

[Lan02]

Serge Lang. Algebra revised third edition. Volume 1. Springer Science and Media, 2002.

[LBBH98]

Yann LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner. Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998.

[M+67]

James MacQueen and others. Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, volume 1, 281–297. Oakland, CA, USA., 1967.

[MZ93]

Stephane G Mallat and Zhifeng Zhang. Matching pursuits with time-frequency dictionaries. Signal Processing, IEEE Transactions on, 41(12):3397–3415, 1993.

[NT09]

Deanna Needell and Joel A Tropp. Cosamp: iterative signal recovery from incomplete and inaccurate samples. Applied and Computational Harmonic Analysis, 26(3):301–321, 2009.

[NJW+02]

Andrew Y Ng, Michael I Jordan, Yair Weiss, and others. On spectral clustering: analysis and an algorithm. Advances in neural information processing systems, 2:849–856, 2002.

[PRK93]

Yagyensh Chandra Pati, Ramin Rezaiifar, and PS Krishnaprasad. Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In Signals, Systems and Computers, 1993. 1993 Conference Record of The Twenty-Seventh Asilomar Conference on, 40–44. IEEE, 1993.

[PK97]

Conrad J Poelman and Takeo Kanade. A paraperspective factorization method for shape and motion recovery. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 19(3):206–218, 1997.

[RBE10]

Ron Rubinstein, Alfred M Bruckstein, and Michael Elad. Dictionaries for sparse representation modeling. Proceedings of the IEEE, 98(6):1045–1057, 2010.

[RZE08]

Ron Rubinstein, Michael Zibulevsky, and Michael Elad. Efficient implementation of the k-svd algorithm using batch orthogonal matching pursuit. Cs Technion, 40(8):1–15, 2008.

[SF13]

Robert Sedgewick and Philippe Flajolet. An introduction to the analysis of algorithms. Addison-Wesley, 2013.

[SM00]

Jianbo Shi and Jitendra Malik. Normalized cuts and image segmentation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 22(8):888–905, 2000.

[Str99]

Gilbert Strang. The discrete cosine transform. SIAM review, 41(1):135–147, 1999.

[TK91]

Carlo Tomasi and Takeo Kanade. Detection and tracking of point features. School of Computer Science, Carnegie Mellon Univ. Pittsburgh, 1991.

[TK92]

Carlo Tomasi and Takeo Kanade. Shape and motion from image streams under orthography: a factorization method. International Journal of Computer Vision, 9(2):137–154, 1992.

[TBI97]

Lloyd N Trefethen and David Bau III. Numerical linear algebra. Volume 50. Siam, 1997.

[Tro04]

Joel A Tropp. Greed is good: algorithmic results for sparse approximation. Information Theory, IEEE Transactions on, 50(10):2231–2242, 2004.

[TRO04]

JOEL A TROPP. Just relax: convex programming methods for subset selection and sparse approximation. 2004.

[Tro06]

Joel A Tropp. Just relax: convex programming methods for identifying sparse signals in noise. Information Theory, IEEE Transactions on, 52(3):1030–1051, 2006.

[TG07]

Joel A Tropp and Anna C Gilbert. Signal recovery from random measurements via orthogonal matching pursuit. Information Theory, IEEE Transactions on, 53(12):4655–4666, 2007.

[TW10]

Joel A Tropp and Stephen J Wright. Computational methods for sparse solution of linear inverse problems. Proceedings of the IEEE, 98(6):948–958, 2010.

[Vap13]

Vladimir Vapnik. The nature of statistical learning theory. Springer Science & Business Media, 2013.

[VMS05]

Rene Vidal, Yi Ma, and Shankar Sastry. Generalized principal component analysis (gpca). Pattern Analysis and Machine Intelligence, IEEE Transactions on, 27(12):1945–1959, 2005.

[Vid10]

René Vidal. A tutorial on subspace clustering. IEEE Signal Processing Magazine, 28(2):52–68, 2010.

[VH04]

René Vidal and Richard Hartley. Motion segmentation with missing data using powerfactorization and gpca. In Computer Vision and Pattern Recognition, 2004. CVPR 2004. Proceedings of the 2004 IEEE Computer Society Conference on, volume 2, II–310. IEEE, 2004.

[VMS03]

René Vidal, Yi Ma, and Shankar Sastry. Generalized principal component analysis (gpca). In Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on, volume 1, I–621. IEEE, 2003.

[VTH08]

René Vidal, Roberto Tron, and Richard Hartley. Multiframe motion segmentation with missing data using powerfactorization and gpca. International Journal of Computer Vision, 79(1):85–105, 2008.

[VL07]

Ulrike Von Luxburg. A tutorial on spectral clustering. Statistics and computing, 17(4):395–416, 2007.

[WW07]

Silke Wagner and Dorothea Wagner. Comparing clusterings: an overview. 2007.

[YRV16]

Chong You, D Robinson, and René Vidal. Scalable sparse subspace clustering by orthogonal matching pursuit. In IEEE Conference on Computer Vision and Pattern Recognition, volume 1. 2016.

[YV15]

Chong You and René Vidal. Sparse subspace clustering by orthogonal matching pursuit. arXiv preprint arXiv:1507.01238, 2015.

[ZMP04]

Lihi Zelnik-Manor and Pietro Perona. Self-tuning spectral clustering. In Advances in neural information processing systems, 1601–1608. 2004.