Geodesic entropic graphs for dimension and entropy estimation in Manifold learning

IEEE Transactions on Signal Processing

Volumn 52, Issue 8, 2004, Pages 2210-2221

  Costa, Jose A ^a   Hero, Alfred O ^a  

^a IEEE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; FACE RECOGNITION; GRAPH THEORY; LEARNING ALGORITHMS; MATHEMATICAL MODELS; SET THEORY; VECTORS;

CONFORMAL EMBEDDING; GEODESIC MINIMAL SPANNING TREE; INTRINSIC DIMENSION; INTRINSIC ENTROPY; MANIFOLD LEARNING; NONLINEAR DIMENSIONALITY REDUCTION;

LEARNING SYSTEMS;

EID: 3543131272     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2004.831130     Document Type: Article

References (38)

1. J. B. Tenenbaum, V. de Silva, and J. C. Langford, "A global geometric framework for nonlinear dimensionality reduction," Science, vol. 290, pp. 2319-2323, 2000.
2. S. Roweis and L. Saul, "Nonlinear dimensionality reduction by locally linear imbedding," Science, vol. 290, no. 1, pp. 2323-2326, 2000.
3. D. Donoho and C. Grimes, "Hessian eigenmaps: Locally linear embedding techniques for high dimensional data," Proc. Nat. Acad. Sci., vol. 100, no. 10, pp. 5591-5596, 2003.
4. M. Kirby, Geometric Data Analysis: An Empirical Approach to Dimensionality Reduction and the Study of Patterns. New York: Wiley-Inter-science, 2001.
5. B. Kégl, "Intrinsic dimension estimation using packing numbers," in Proc. Neural Inform. Process. Syst., Vancouver, BC, Canada, 2002.
6. P. Verveer and R. Duin, "An evaluation of intrinsic dimensionality estimators," IEEE Trans. Pattern Anal. Machine Intell., vol. 17, pp. 81-86, Jan. 1995.
7. V. I. Koltchinskii, "Empirical geometry of multivariate data: A deconvolution approach," Ann. Statist., vol. 28, no. 2, pp. 591-629, 2000.
8. A. O. Hero, B. Ma, O. Michel, and J. Gorman, "Applications of entropic spanning graphs," IEEE Signal Processing Mag., vol. 19, pp. 85-95, Oct. 2002.
9. A. Hero and O. Michel, "Asymptotic theory of greedy approximations to minimal k-point random graphs," IEEE Trans. Inform. Theory, vol. 45, pp. 921-1939, Sept. 1999.
10. A. Hero, J. Costa, and B. Ma, "Convergence rates of minimal graphs with random vertices," IEEE Trans. Inform. Theory, submitted for publication.
11. A. K. Jain and R. C. Dubes, Algorithms for Clustering Data. Englewood Cliffs, NJ: Prentice-Hall, 1988.
12. T. Cox and M. Cox, Multidimensional Scaling. London, U.K.: Chapman & Hall, 1994.
13. X. Huo and J. Chen, "Local linear projection (LLP)," in Proc. First Workshop Genomic Signal Process. Statist., 2002.
14. M. Belkin and P. Niyogi, "Laplacian eigenmaps and spectral techniques for embedding and clustering," in Advances in Neural Information Processing Systems, T. G. Diettrich, S. Becker, and Z. Ghahramani, Eds. Cambridge, U.K.: MIT Press, 2002, vol. 14.
15. V. de Silva and J. B. Tenenbaum, "Global versus local methods in nonlinear dimensionality reduction," in Proc. Neural Inform. Process. Syst. Vancouver, BC, Canada, 2002.
16. K. Pettis, T. Bailey, A. Jain, and R. Dubes, "An intrinsic dimensionality estimator from near-neighbor information," IEEE Trans. on Pattern Anal. Machine Intell., vol. PAMI-1, pp. 25-36, July 1979.
17. F. Camastra and A. Vinciarelli, "Estimating the intrinsic dimension of data with a fractal-based method," IEEE Trans. Pattern Anal. Machine Intell., vol. 24, pp. 1404-1407, Oct. 2002.
18. F. Memolia, G. Sapiro, and S. Osher, "Solving variational problems and partial differential equations mapping into general target manifolds," IMA, Tech. Rep. 1827, 2003.
19. F. Memoli and G. Sapiro, "Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces," J. Comput. Phys., vol. 73, pp. 730-764, 2001.
20. J. E. Yukich, Probability Theory of Classical Euclidean Optimization Problems. Berlin, Germany: Springer-Verlag, 1998, vol. 1675, Lecture Notes in Mathematics.
21. M. Carmo, Differential Geometry of Curves and Surfaces. Englewood Cliffs, NJ: Prentice-Hall, 1976.
22. M. Carmo, Riemannian Geometry. Boston, MA: Birkhäuser, 1992.
23. W. Boothby, An Introduction to Differentiable Manifolds and Riemannian Geometry, Second ed. San Diego, CA: Academic, 2003.
24. J. Beardwood, J. H. Halton, and J. M. Hammersley, "The shortest path through many points," in Proc. Cambridge Philo. Soc., vol. 55, 1959, pp. 299-327.
25. J. M. Steele, Probability Theory and Combinatorial Optimization. Philadelphia, PA: SIAM, 1997, vol. 69, CBMF-NSF Regional Conferences in Applied Mathematics.
26. A. Gersho, "Asymptotically optimal block quantization," IEEE Trans. Inform. Theory, vol. 28, pp. 373-380, 1979.
27. D. N. Neuhoff, "On the asymptotic distribution of the errors in vector quantization," IEEE Trans. Inform. Theory, vol. 42, pp. 461-468, Mar. 1996.
28. A. O. Hero and O. Michel, "Estimation of Rényi information divergence via pruned minimal spanning trees," in Proc. IEEE Workshop Higher Order Statistics, Caesaria, Israel, June 1999.
29. H. Neemuchwala, A. O. Hero, and P. Carson, "Image registration using entropy measures and entropic graphs," Eur. J. Signal Process., Special Issue on Content-based Visual Information Retrieval, 2003, to be published.
30. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
31. I. Csiszar, "Generalized cutoff rates and rényi's information measures," IEEE Trans. Inform. Theory, vol. 41, pp. 26-34, Jan. 1995.
32. M. Bernstein, V. de Silva, J. C. Langford, and J. B. Tenenbaum, "Graph approximations to geodesics on embedded manifolds," Dept. Psychol., Stanford Univ., Stanford, CA, 2000.
33. V. de Silva and J. B. Tenenbaum, "Unsupervised learning of curved manifolds," in Nonlinear Estimation and Classification, D. Denison, M. H. Hansen, C. C. Holmes, B. Mallick, and B. Yu, Eds. New York: Springer-Verlag, 2002.
34. K. S. Alexander, "The RSW theorem for continuum percolation and the CLT for euclidean minimal spanning trees," Ann. Applied Probab., vol. 6, pp, 466-494, 1996.
35. F. Avram and D. Bertsimas, "The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach," Ann. Applied Probab., vol. 9, pp. 223-231, 1990.
36. D. Bertsimas and G. van Ryzin, "An aysmptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability," Oper. Res. Lett., vol. 2, pp. 113-130, 1992.
37. A. Georghiades, P. Belhumeur, and D. Kriegman, "From few to many: Illumination cone models for face recognition under variable lighting and pose," IEEE Trans. Pattern Anal. Machine Intell., vol. 23, pp. 643-660, June 2001.
38. J. A. Costa and A. O. Hero, "Entropic graphs for manifold learning," in Proc. IEEE Asilomar Conf. Signals, Syst., Comput., Pacific Grove, CA, Nov. 2003.