See all by looking at a few: Sparse modeling for finding representative objects

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2012, Pages 1600-1607

  Elhamifar, Ehsan ^a   Sapiro, Guillermo ^b   Vidal, Rene ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER CENTERS; CONVEX HULL; DATA MATRICES; DATA POINTS; DATA SETS; LARGE DATASETS; LINEAR COMBINATIONS; REPRESENTATIVE OBJECT; SPARSE CODES; SPARSE MULTIPLES; THEORETICAL FOUNDATIONS; VIDEO SUMMARIZATION;

CONVEX OPTIMIZATION;

COMPUTER VISION;

EID: 84866685721     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2012.6247852     Document Type: Conference Paper

References (40)

1. M. Aharon, M. Elad, and A. M. Bruckstein. The k-svd: An algorithm for designing of overcomplete dictionaries for sparse representations. IEEE TIP, 2006. 2, 3, 6
2. L. Balzano, R. Nowak, and W. Bajwa. Column subset selection with missing data. NIPSWorkshop on Low-Rank Methods for Large-Scale Machine Learning, 2010. 1
3. R. Basri and D. Jacobs. Lambertian reflection and linear subspaces. IEEE TPAMI, 2003. 7
4. S. Bengio, F. Pereira, Y. Singer, and D. Strelow. Group sparse coding. NIPS, 2009. 2
5. C. Boutsidis, M.W. Mahoney, and P. Drineas. An improved approximation algorithm for the column subset selection problem. Proceedings of SODA, 2009. 1
6. T. Chan. Rank revealing qr factorizations. Lin. Alg. and its Appl., 1987. 1
7. R. Coifman and S. Lafon. Diffusion maps. Applied and Computational Harmonic Analysis, 2006. 1
8. D. L. Donoho. Neighborly polytopes and sparse solution of underdetermined linear equations. (preprint), 2004. 4
9. R. Duda, P. Hart, and D. Stork. Pattern Classification. Wiley-Interscience, 2004. 6
10. E. Elhamifar, G. Sapiro, and R. Vidal. Sparse modeling for finding representative objects. in preparation. 4, 6, 8
11. E. Elhamifar and R. Vidal. Sparse subspace clustering. CVPR, 2009. 2, 5
12. E. Elhamifar and R. Vidal. Robust classification using structured sparse representation. CVPR, 2011. 7
13. E. Elhamifar and R. Vidal. Sparse manifold clustering and embedding. NIPS, 2011. 7
14. E. Elhamifar and R. Vidal. Block-sparse recovery via convex optimization. IEEE TSP, 2012. 7
15. E. Elhamifar and R. Vidal. Sparse subspace clustering: Algorithm, theory, and applications. IEEE TPAMI, submitted., Available: http://arxiv.org/abs/1203. 1005. 2, 5, 7
16. K. Engan, S. O. Aase, and J. H. Husoy. Method of optimal directions for frame design. ICASSP, 1999. 3
17. E. Esser, M. Moller, S. Osher, G. Sapiro, and J. Xin. A convex model for non-negative matrix factorization and dimensionality reduction on physical space. Technical report, Available: http://arxiv.org/abs/1102.0844, 2011. 1, 2
18. P. Favaro, R. Vidal, and A. Ravichandran. A closed form solution to robust subspace estimation and clustering. CVPR, 2011. 2, 5
19. B. J. Frey and D. Dueck. Clustering by passing messages between data points. Science, 2007. 1
20. D. Gabay and B. Mercier. A dual algorithm for the solution of nonlinear variational problems via finite-element approximations. Comp. Math. Appl., 1976. 6
21. M. Gu and S. C. Eisenstat. Efficient algorithms for computing a strong rank-revealing qr factorization. SIAM Journal on Scientific Computing, 1996. 1
22. J. Ho, M. H. Yang, J. Lim, K. Lee, and D. Kriegman. Clustering appearances of objects under varying illumination conditions. CVPR, 2003. 6
23. J. J. Hull. A database for handwritten text recognition research. IEEE TPAMI, 1994. 6
24. R. Jenatton, J. Y. Audibert, and F. Bach. Structured variable selection with sparsity-inducing norms. JMLR, 2011. 2
25. I. Jolliffe. Principal Component Analysis. Springer, 2002. 1, 3
26. L. Kaufman and P. Rousseeuw. Clustering by means of medoids. In Y. Dodge (Ed.), Statistical Data Analysis based on the L1 Norm (North-Holland, Amsterdam), 1987. 1
27. N. Keshava and J. Mustard. Spectral unmixing. IEEE Signal Processing Magazine, 2002. 1
28. K. C. Lee, J. Ho, and D. Kriegman. Acquiring linear subspaces for face recognition under variable lighting. IEEE TPAMI, 2005. 6, 7
29. G. Liu, Z. Lin, and Y. Yu. Robust subspace segmentation by low-rank representation. ICML, 2010. 2, 5
30. J. Mairal, F. Bach, J. Ponce, G. Sapiro, and A. Zisserman. Discriminative learned dictionaries for local image analysis. CVPR, 2008. 2, 3
31. J. Mairal, F. Bach, J. Ponce, G. Sapiro, and A. Zisserman. Non-local sparse models for image restoration. ICCV, 2009. 2, 3
32. B. Nasihatkon and R. Hartley. Graph connectivity in sparse subspace clustering. In CVPR, 2011. 5
33. I. Ramirez, P. Sprechmann, and G. Sapiro. Classification and clustering via dictionary learning with structured incoherence and shared features. CVPR, 2010. 2, 3
34. S. Roweis and L. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 2000. 1
35. M. Soltanolkotabi and E. J. Candes. A geometric analysis of subspace clustering with outliers. Available: http://arxiv.org/abs/1112.4258. 5
36. J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 2000. 1
37. J. A. Tropp. Algorithms for simultaneous sparse approximation. part ii: Convex relaxation. Signal Processing, special issue "Sparse approximations in signal and image processing", 2006. 2
38. J. A. Tropp. Column subset selection, matrix factorization, and eigenvalue optimization. Proceedings of SODA, 2009. 1
39. R. Vidal. Recursive identification of switched ARX systems. Automatica, 2008. 6
40. J. Wright, A. Yang, A. Ganesh, S. Sastry, and Y. Ma. Robust face recognition via sparse representation. IEEE TPAMI, 2009. 6