Hybrid linear modeling via local best-fit flats

International Journal of Computer Vision

Volumn 100, Issue 3, 2012, Pages 217-240

  Zhang, Teng ^a   Szlam, Arthur ^b   Wang, Yi ^a   Lerman, Gilad ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Face clustering; High dimensional data; Hybrid linear modeling; Local PCA; Motion segmentation; Spectral clustering; Subspace clustering

Indexed keywords

FACE CLUSTERING; HIGH DIMENSIONAL DATA; LINEAR MODELING; LOCAL PCA; MOTION SEGMENTATION; SPECTRAL CLUSTERING; SUBSPACE CLUSTERING;

ARTIFICIAL INTELLIGENCE; SOFTWARE ENGINEERING;

CLUSTERING ALGORITHMS;

EID: 84867053797     PISSN: 09205691     EISSN: 15731405     Source Type: Journal    
DOI: 10.1007/s11263-012-0535-6     Document Type: Article

References (45)

1. Arias-Castro, E., Chen, G., & Lerman, G. (2011). Spectral clustering based on local linear approximations. Electronic Journal of Statistics, 5, 1537-1587 (available at arXiv:1001.1323).
2. Basri, R., & Jacobs, D. (2003). Lambertian reflectance and linear subspaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(2), 218-233.
3. Boult, T. E., & Brown, L. G. (1991). Factorization-based segmentation of motions. In Proceedings of the IEEE workshop on visual motion (pp. 179-186).
4. Bradley, P., & Mangasarian, O. (2000). k-plane clustering. Journal of Global Optimization, 16(1), 23-32.
5. Chen, G., & Lerman, G. (2009). Foundations of a multi-way spectral clustering framework for hybrid linear modeling. Foundations of Computational Mathematics, 9(5), 517-558. doi:10.1007/s10208-009-9043-7.
6. Chen, G., & Lerman, G. (2009). Motion segmentation by SCC on the Hopkins 155 database. In Computer vision workshops (ICCV workshops), 2009 IEEE 12th international conference on computer vision (pp. 759-764), Kyoto, Japan, 2009. doi:10.1109/ICCVW.5457626.
7. Chen, G., & Lerman, G. (2009). Spectral curvature clustering (SCC). International Journal of Computer Vision, 81(3), 317-330.
8. Costeira, J., & Kanade, T. (1998). A multibody factorization method for independently moving objects. International Journal of Computer Vision, 29(3), 159-179. (Pubitemid 128517909)
9. Cox, T. F., & Cox, M. A. A. (2001). Multidimensional scaling (2nd ed.). London: Chapman and Hall.
10. David, G., & Semmes, S. (1991). Singular integrals and rectifiable sets in Rn: au-delà des graphes Lipschitziens. Astérisque, 193, 1-145.
11. Elhamifar, E., & Vidal, R. (2009). Sparse subspace clustering. In Proceedings of the 2009 IEEE computer society conference on computer vision and pattern recognition (CVPR 09) (pp. 2790-2797).
12. Epstein, R., Hallinan, P., & Yuille, A. (1995). 5 ± 2 eigenimages suffice: an empirical investigation of low-dimensional lighting models. In Proceedings of the workshop on physics-based modeling in computer vision, 1995 (p. 108). doi:10.1109/PBMCV.514675.
13. Fukunaga, K.,& Olsen, D. R. (1971). An algorithm for finding intrinsic dimensionality of data. IEEE Transactions on Computers, 20(2), 176-183. doi:10.1109/T-C.1971.223208.
14. Georghiades, A., Belhumeur, P., & Kriegman, D. (2001). From few to many: illumination cone models for face recognition under variable lighting and pose. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(6), 643-660. (Pubitemid 32585276)
15. Goh, A., & Vidal, R. (2007). Segmenting motions of different types by unsupervised manifold clustering. In IEEE conference on computer vision and pattern recognition, 2007, CVPR'07 (pp. 1-6). doi:10.1109/CVPR.2007.383235. (Pubitemid 47530080)
16. Ho, J., Yang, M., Lim, J., Lee, K., & Kriegman, D. (2003). Clustering appearances of objects under varying illumination conditions. In Proceedings of international conference on computer vision and pattern recognition (pp. 11-18).
17. Jones, P. (1990). Rectifiable sets and the traveling salesman problem. Inventiones Mathematicae, 102(1), 1-15.
18. Kanatani, K. (2001). Motion segmentation by subspace separation and model selection. In Proc. of 8th ICCV (Vol. 3, pp. 586-591). Vancouver, Canada 2001. (Pubitemid 32795109)
19. Kanatani, K. (2002). Evaluation and selection of models for motion segmentation. In 7th ECCV (Vol. 3, pp. 335-349).
20. Lauer, F., & Schnorr, C. (2009). Spectral clustering of linear subspaces for motion segmentation. In IEEE 12th international conference on computer vision, 2009 (pp. 678-685). doi:10.1109/ICCV.2009.5459173.
21. Lee, K., Ho, J., & Kriegman, D. (2005). Acquiring linear subspaces for face recognition under variable lighting. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(5), 684-698. (Pubitemid 40608402)
22. Lerman, G. (2003). Quantifying curvelike structures of measures by using L2 Jones quantities. Communications on Pure and Applied Mathematics, 56(9), 1294-1365.
23. Lerman, G., & Zhang, T. (2010) lp-Recovery of the most significant subspace among multiple subspaces with outliers. Available at arXiv:1012.4116.
24. Lerman, G., & Zhang, T. (2011). Robust recovery of multiple subspaces by geometric lp minimization. Annals of Statistics, 39(5), 2686-2715. doi:10.1214/11-AOS914.
25. Little, A. V., Jung, Y. M., & Maggioni, M. (2009a). Multiscale estimation of intrinsic dimensionality of data sets. In Manifold learning and its applications: papers from the AAAI fall symposium (pp. 26-33).
26. Little, A. V., Lee, J., Jung, Y. M., & Maggioni, M. (2009b). Estimation of intrinsic dimensionality of samples from noisy lowdimensional manifolds in high dimensions with multiscale SVD. In IEEE/SP 15th workshop on statistical signal processing, 2009. SSP'09 (pp. 85-88).
27. Ma, Y., Derksen, H., Hong, W., & Wright, J. (2007). Segmentation of multivariate mixed data via lossy coding and compression. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(9), 1546-1562. (Pubitemid 47299910)
28. Ma, Y., Yang, A. Y., Derksen, H., & Fossum, R. (2008). Estimation of subspace arrangements with applications in modeling and segmenting mixed data. SIAM Review, 50(3), 413-458.
29. Ng, A., Jordan, M., & Weiss, Y. (2001). On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems, 14, 849-856.
30. Rao, S., Tron, R., Vidal, R., & Ma, Y. (2010). Motion segmentation in the presence of outlying, incomplete, or corrupted trajectories. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(10), 1832-1845. doi:10.1109/TPAMI.2009.191.
31. Soltanolkotabi, M., & Candès, E. J. (2011) A geometric analysis of subspace clustering with outliers. arXiv:1112.4258.
32. Sugaya, Y., & Kanatani, K. (2004). Multi-stage unsupervised learning for multi-body motion segmentation. IEICE Transactions on Information and Systems, E87-D(7), 1935-1942.
33. Tenenbaum, J. B., Silva, V.D., & Langford, J.C. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500), 2319-2323. (Pubitemid 32041577)
34. Tipping, M., & Bishop, C. (1999). Mixtures of probabilistic principal component analysers. Neural Computation, 11(2), 443-482.
35. Tron, R., & Vidal, R. (2007). A benchmark for the comparison of 3-d motion segmentation algorithms. In IEEE conference on computer vision and pattern recognition, 2007, CVPR'07 (pp. 1-8). doi:10.1109/CVPR.2007.382974. (Pubitemid 47529878)
36. Tseng, P. (2000). Nearest q-flat to m points. Journal of Optimization Theory and Applications, 105, 249-252. doi:10.1023/A:1004678431677.
37. Vidal, R. (2011). Subspace clustering. IEEE Signal Processing Magazine, 28(2), 52-68. doi:10.1109/MSP.2010.939739.
38. Vidal, R., Ma, Y., & Sastry, S. (2005). Generalized principal component analysis (GPCA). IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(12).
39. Vidal, R., Tron, R., & Hartley, R. (2008). Multiframe motion segmentation with missing data using powerfactorization and GPCA. International Journal of Computer Vision, 79(1), 85-105. doi:10.1007/s11263-007-0099-z. (Pubitemid 351578661)
40. Yan, J., & Pollefeys, M. (2006). A general framework for motion segmentation: independent, articulated, rigid, non-rigid, degenerate and nondegenerate. In ECCV (Vol. 4, pp. 94-106).
41. Yang, A., Rao, S., & Ma, Y. (2006). Robust statistical estimation and segmentation of multiple subspaces. In Conference on computer vision and pattern recognition workshop, 2006. CVPRW'06 (p. 99). doi:10.1109/CVPRW.2006. 178. (Pubitemid 44925984)
42. Yang, A. Y., Rao, S. R., & Ma, Y. (2006). Robust statistical estimation and segmentation of multiple subspaces. In CVPRW '06: proceedings of the 2006 conference on computer vision and pattern recognition workshop (p. 99). Washington: IEEE Computer Society. doi:10.1109/CVPRW.2006.178. (Pubitemid 44925984)
43. Yue, S., Wang, X., & Wei, M. (2008). Application of two-order difference to gap statistic. Transactions of Tianjin University, 14, 217-221. doi:10.1007/s12209-008-0039-1.
44. Zhang, T., Szlam, A., & Lerman, G. (2009). Median K-flats for hybrid linear modeling with many outliers. In Computer vision workshops (ICCV workshops), 2009 IEEE 12th international conference on computer vision (pp. 234-241). Kyoto, Japan, 2009. doi:10.1109/ICCVW.5457695.
45. Zhang, T., Szlam, A.,Wang, Y., & Lerman, G. (2010). Randomized hybrid linear modeling by local best-fit flats. In IEEE conference on computer vision and pattern recognition (CVPR 2010), pp. 1927-1934. doi:10.1109/CVPR.2010. 5539866.