Abstract
In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The first one is a direct approach, where the intrinsic dimensionality is estimated directly from the OTPM. We argue that this approach suffers from both practical and theoretical pitfalls. The second is a new approach which combines OTPMs with an efficient local principal component analysis (PCA). Exploiting the OTPM, local PCA can be shown to have only linear time complexity w.r.t. the dimensionality of the input space (in contrast to the prohibitive cubic complexity of the conventional approach), and hence the method becomes applicable even for very high dimensional input spaces as frequently encountered in computer vision. A local ID estimate is then obtained as the local number of significant eigenvalues. In addition to ID estimation the local subspaces as revealed by our local PCA can be directly used for further data processing tasks including classification and regression. The workability of the new approach for ID estimation and subspace auto-association is demonstrated on a sequence of 64 x 64 pixel images (4096-dimensional input space).
Preview
Unable to display preview. Download preview PDF.
References
J. Bruske and G. Sommer. Intrinsic dimensionality estimation with optimally topology preserving maps. Technical Report 9703, Inst. f. Inf. u. Prakt. Math. Christian-Albrechts-Universitaet zu Kiel, 1997. (submitted to IEEE PAMI).
J.H. Conway and N.J.A. Sloane. Sphere Packings, Lattices and Groups. Grundlehren der mathematischen Wissenschaften 290. Springer Verlag NY, 1988.
F.Frisone, P.Morasso. F.Firenze, and L.Ricciardiello. Application of topologyrepresenting networks to the estimation of the intrinsic dimensionality of data. In Proc. of the International Conference on Artificial Neural Networks, volume 1, pages 323–327, 1995.
K. Fukunaga and D. R. Olsen. An algorithm for finding intrinsic dimensionality of data. IEEE Transactions on Computers, 20(2):176–183, 1911.
A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentince Hall, 1988.
N. Kambhatla and T.K. Leen. Fast non-linear dimension reduction. In Advances in Neural Information Processing Systems, NIPS 6, pages 152–159, 1994.
T. Martinetz and K. Schulten. Topology representing networks. In Neural Networks, volume 7, pages 505–522, 1994.
H. Murase and S. Nayar. Visual learning and recognition of 3-d objects from appearance. International Journal of Computer Vision, 14:5–24. 1995.
W.H. Press. S. A. Teukolsky. W.T. Vetterling, and B.P. Flannery.Numerical Recipes in C-The Art, of Scientific Computing. Cambridge University Press, 1988.
H. Ritter, T. Martinetz. and K. Schulten. Neuronale Netze. Addison-Wesley, 1991.
T. Villmann. R.. Der. and T. Martinetz. A novel aproach to measure the topology preservation of feature maps. ICANN. pages 289–301, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bruske, J., Sommer, G. (1997). Topology representing networks for intrinsic dimensionality estimation. In: Gerstner, W., Germond, A., Hasler, M., Nicoud, JD. (eds) Artificial Neural Networks — ICANN'97. ICANN 1997. Lecture Notes in Computer Science, vol 1327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020219
Download citation
DOI: https://doi.org/10.1007/BFb0020219
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63631-1
Online ISBN: 978-3-540-69620-9
eBook Packages: Springer Book Archive