This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Intrinsic Dimensionality Estimation With Optimally Topology Preserving Maps
May 1998 (vol. 20 no. 5)
pp. 572-575

Abstract—A new method for analyzing the intrinsic dimensionality (ID) of low-dimensional manifolds in high-dimensional feature spaces is presented. Compared to a previous approach by Fukunaga and Olsen, the method has only linear instead of cubic time complexity w.r.t. the dimensionality of the input space. Moreover, it is less sensitive to noise than the former approach. Experiments include ID estimation of synthetic data for comparison and illustration as well as ID estimation of an image sequence.

[1] B. Mandelbrot, Die fraktale Geometrie der Natur.Basel: Birkhaeuser Verlag, 1991.
[2] A. Heyting and H. Freudenthal, Collected Works of L.E.J. Brouwer.New York: NorthHolland Elsevier, 1975.
[3] A.K. Jain and R.C. Dubes, Algorithms for Clustering Data.Englewood Cliffs, N.J.: Prentice Hall, 1988.
[4] T. Kohonen, Self-Organizing Maps.New York: Springer, 1995.
[5] R. Duin, "Superlearning Capabilities of Neural Networks?" Proc. Eighth Scandinavian Conf. Image Analysis, pp. 547-554,Tromso, Norway, 1993.
[6] E. Oja, "Data Compression, Feature Extraction, and Autoassociation in Feedforward Neural Networks," Artificial Neural Networks.New York: Elsevier Sciences, 1991, pp. 737-745,
[7] N. Kambhatla and T.K. Leen, "Fast Non-Linear Dimension Reduction," Advances in Neural Information Processing Systems, NIPS 6, pp. 152-159, 1994.
[8] R.S. Bennet, The Intrinsic Dimensionality of Signal Collections IEEE Trans. Information Theory, vol. 15, no. 5, pp. 517-525, Sept. 1969.
[9] J.B. Kruskal, "Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis," Psychometrika, vol. 29, pp. 1-27, 1964.
[10] K. Pettis, T. Bailey, T. Jain, and R. Dubes, "An Intrinsic Dimensionality Estimator From Near-Neighbor Information," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 1, pp. 25-37, 1979.
[11] K. Fukunaga and D.R. Olsen, "An Algorithm for Finding Intrinsic Dimensionality of Data," IEEE Trans. Computers, vol. 20, no. 2, pp. 176-183, 1971.
[12] G.V. Trunk, "Statistical Estimation of the Intrinsic Dimensionality of a Noisy Signal Collection," IEEE Trans. Computers, vol. 25, pp. 165-171, 1976.
[13] P.J. Verveer and R.P.W. Duin, “An Evaluation of Intrinsic Dimensionality Estimators,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 1, pp. 81-86, Jan. 1995.
[14] T. Martinetz and K. Schulten, "Topology Representing Networks," Neural Networks, vol. 7, pp. 505-522, 1994.
[15] T. Villmann, R. Der, and T. Martinetz, "A Novel Approach to Measure the Topology Preservation of Feature Maps," ICANN, pp. 289-301, 1994.
[16] Y. Linde, A. Buzo, R.M. Gray, An Algorithm for Vector Quantizer Design IEEE Trans. Comm., vol. 28, no. 1, pp. 84-95, 1980.
[17] W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery, Numerical Recipes in C—The Art of Scientific Computing.Cambridge England: Cambridge Univ. Press, 1988.
[18] N. Wyse, R. Dubes, and A. Jain, "A Critical Evaluation of Intrinsic Dimensionality Algorithms," E. Gelsema and L. Kanal, eds., Pattern Recognition in Practice.New York: North-HollandPublishing Co., 1980, pp. 415-425.
[19] J. Bruske and G. Sommer, "Intrinsic Dimensionality Estimation With Optimally Topology Preserving Maps," Tech. Rep. 9,703, Inst. f. Inf. u. Prakt. Math., Christian-Albrechts-Universitaet zu Kiel, Kiel, Germany, 1997.

Index Terms:
Intrinsic dimensionality estimation, topology preservation, principal component analysis, vector quantization.
Citation:
J. Bruske, G. Sommer, "Intrinsic Dimensionality Estimation With Optimally Topology Preserving Maps," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 5, pp. 572-575, May 1998, doi:10.1109/34.682189
Usage of this product signifies your acceptance of the Terms of Use.