Combined central and subspace clustering for computer vision applications

ACM International Conference Proceeding Series

Volumn 148, Issue , 2006, Pages 593-600

  Le, Lu ^a   Vidal, René ^b  

^a Whiting School of Engineering   (United States)

^b Johns Hopkins University School of Medicine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; COST EFFECTIVENESS; DATA ACQUISITION; IMAGE SEGMENTATION; PROBLEM SOLVING;

CLUSTERING METHODS; KSUBSPACES; SEGMENTATION PROBLEMS;

CLUSTERING ALGORITHMS;

EID: 34250735067     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143844.1143919     Document Type: Conference Paper

References (7)

1. Dempster, A., Laird, N., & Rubin, D. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B, 39, 1-38.
2. Duda, R., Hart, P., & Stork, D. (2000). Pattern classification. Wiley, New York. 2nd edition.
3. Ho, J., Yang, M.-H., Lim, J., Lee, K.-C., & Kriegman, D. (2003). Clustering apperances of objects under varying illumination conditions. IEEE Conference on Computer Vision and Pattern Recognition (pp. 11-18).
4. Tipping, M., & Bishop, C. (1999). Mixtures of probabilistic principal component analyzers. Neural Computation, 11, 443-482.
5. Vidai, R., & Ma, Y. (2004). A unified algebraic approach to 2-D and 3-D motion segmentation. European Conference on Computer Vision (pp. 1-15).
6. Vidal, R., Ma, Y., & Sastry, S. (2005). Generalized Principal Component Analysis (GPCA). IEEE Trans. on Pattern Analysis and Machine Intelligence, 27, 1-15.
7. Weinberger, K. Q., & Saul, L. K. (2004). Unsupervised learning of image manifolds by semidefinite programming. IEEE Conference on Computer Vision and Pattern Recognition (pp. 988-995).