Regularized mixed dimensionality and density learning in computer vision

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

Volumn , Issue , 2007, Pages

  Haro, Gloria ^a   Randall, Gregory ^b   Sapiro, Guillermo ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

^c UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATA REDUCTION; MATHEMATICAL MODELS; PARAMETER ESTIMATION;

SPATIAL CONTINUITY CONSTRAINTS; STRATIFICATION LEARNING;

COMPUTER VISION;

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

References (22)

1. C. Ambroise and G. Govaert. Clustering of spatial data by the EM algorithm. In geoENV I - Geostatistics for Environmental Applications, 1996.
2. C. Ambroise and G. Govaert. Convergence of an EM-type algorithm for spatial clustering. Pattern Recognition Letters, 19(10):919-927, 1998.
3. D. Barbara and P. Chen. Using the fractal dimension to cluster datasets. In Proceedings of the Sixth ACM SIGKDD, pages 260-264, 2000.
4. M. Belkin and P. Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering. In Advances in NIPS 14, 2002.
5. M. Brand. Charting a manifold. In Advances in NIPS 16, 2002.
6. W. Cao and R. Haralick. Nonlinear manifold clustering by dimensionality. In Proceedings of the 18th International Conference on Pattern Recognition, volume 1, pages 920-924, 2006.
7. J. A. Costa and A. O. Hero. Geodesic entropic graphs for dimension and entropy estimation in manifold learning. IEEE Trans. on Signal Processing, 52(8):2210-2221, 2004.
8. A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data. Journal of the Royal Statistical Society Ser. B, 39:1-38, 1977.
9. A. Gionis, A. Hinneburg, S. Papadimitriu, and P. Tsparas. Dimension induced clustering. In Proceeding of the Eleventh ACM SIGKDD, pages 51-60, 2005.
10. G. Haro, G. Randall, and G. Sapiro. Stratification learning: Detecting mixed density and dimensionality in high dimensional, point clouds. In Advances in NIPS 19, 2006.
11. R. Hathaway. Another interpretation of the EM algorithm for mixture distributions. Statistics and Probability Letters, 4(2):53-56, 1986.
12. K. Huang, Y. Ma, and R. Vidal. Minimum effective dimension for mixtures of subspaces: A robust GPCA algorithm and its applications. In Proceedings of CVPR, pages 631-638, 2004.
13. B. Kegl. Intrinsic dimension estimation using packing numbers. In Advances in NIPS 14, 2002.
14. E. Levina and P. Bickel. Maximum likelihood estimation of intrinsic dimension. In Advances in NIPS 17, 2005.
15. L. Lu and R. Vidal. Combined central and subspace clustering for computer vision applications. In Proceedings of the 23rd International Conference on Machine Learning, volume 148, pages 593-600, 2006.
16. P. Mordohai and G. Medioni. Unsupervised dimensionality estimation and manifold learning in high-dimensional spaces by tensor voting. In IJCAI, page 798, 2005.
17. S. T. Roweis and L. K. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500):2323-2326, 2000.
18. D.L. Snyder. Random Point Processes. Wiley, New York, 1975.
19. R. Souvenir and R. Pless. Manifold clustering. In ICCV, pages 648-653, 2005.
20. F. Takens. On the numerical determination of the dimension of an attractor. Lecture notes in mathematics. Dynamical systems and bifurcations, 1125:99-106, 1985.
21. J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319-2323, 2000.
22. R. Vidal, Y. Ma, and J. Piazzi. A new GPCA algorithm for clustering subspaces by fitting, differentiating and dividing polynomials. In IEEE CVPR, pages 769-775, 2004.