ACM Home Page
Please provide us with feedback. Feedback
Estimating manifold dimension by inversion error
Full text PdfPdf (481 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2005 ACM symposium on Applied computing table of contents
Santa Fe, New Mexico
SESSION: AI and computational logic and image analysis (AI) table of contents
Pages: 22 - 26  
Year of Publication: 2005
ISBN:1-58113-964-0
Authors
Shawn Martin  Sandia National Laboratories, Albuquerque, NM
Alex Bäcker  Sandia National Laboratories & California Institute of Technology, Pasadena, California
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 53,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1066677.1066686
What is a DOI?

ABSTRACT

Video and image datasets can often be described by a small number of parameters, even though each image usually consists of hundreds or thousands of pixels. This observation is often exploited in computer vision and pattern recognition by the application of dimensionality reduction techniques. In particular, there has been recent interest in the application of a class of nonlinear dimensionality reduction algorithms which assume that an image dataset has been sampled from a manifold.From this assumption, it follows that estimating the dimension of the manifold is the first step in analyzing an image dataset. Typically, this estimate is obtained either by using a priori knowledge, or by applying one of the various statistical and geometrical methods available. Once an estimate is obtained, it is used as a parameter for the nonlinear dimensionality reduction algorithm.In this paper, we consider reversing this approach. Instead of estimating the dimension of the manifold in order to obtain a low dimensional representation, we consider producing low dimensional representations in order to estimate of the dimensionality of the manifold. By varying the dimensionality parameter, we obtain different low dimensional representations of the original dataset. The dimension of the best representation should then correspond to the actual dimension of the manifold.In order to determine the best representation, we propose a metric based on inversion. In particular, we propose that a good representation should be invertible, in that we should be able to reverse the reduction algorithm's transformation to obtain the original dataset. By coupling this metric with any reduction algorithm, we can estimate the dimensionality of an image manifold. We apply our method in the context of locally linear embedding (LLE) and Isomap to six frequently used examples and two image datasets.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
D. Banks and R. Olszewski. Estimating local dimensionality. In Proceedings of the Statistical Computing Section of the American Statistical Assocation. ASA, 1997.
 
2
 
3
D. Beymer and T. Poggio. Image representation for visual learning. Science, 272:1905--1909, 1996.
 
4
M. Brand. Charting a manifold. In Advances in Neural Information Processing Systems, volume 15, pages 961--968. MIT Press, 2003.
 
5
 
6
 
7
D. Donoho and C. Grimes. Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data. Proceedings of the National Academy of Science, 100:5591--5596, 2003.
 
8
K. Fukunaga and D. Olsen. An algorithm for finding intrinsic dimensionality of data. IEEE Transactions on Computers, 20(2):176--183, 1971.
 
9
 
10
D. Hundley and M. Kirby. Estimation of topological dimension. In SIAM International Conference on Data Mining, pages 194--202, 2003.
 
11
 
12
B. Kegl. Intrinsic dimension estimation using packing numbers. In Advances in Neural Information Processing Systems, volume 15. MIT Press, 2002.
 
13
 
14
H. Lu, Y. Fainman, and R. Hecht-Nielsen. Image manifolds. In Applications of Artificial Neural Networks in Image Processing III, Proceedings of SPIE, volume 3307, pages 52--63, 1998.
 
15
K. Pettis, T. Bailey, A. Jain, and R. Dubes. An intrinsic dimensionality estimator from near-neighbor information. IEEE Transacations on Pattern Analysis and Machine Intelligence, 1:25--37, 1979.
 
16
 
17
M. Polito and P. Perona. Grouping and dimensionality reduction by locally linear embedding. In Advances in Neural Information Processing Systems, volume 14. MIT Press, 2002.
 
18
S. Roweis. http://www.cs.toronto.edu/~roweis/data.html.
 
19
S. Roweis and L. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500):2323--2326, 2000.
 
20
 
21
 
22
H. Seung and D. Lee. The manifold ways of perception. Science, 290:2268--2269, 2000.
 
23
A. Smola and B. Scholkopf. A tutorial on support vector regression. Technical Report NC2-TR-1998-030, NeuroCOLT2, 1998.
 
24
J. Tenenbaum, V. de Silva, and J. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319--2323, 2000.
 
25
M. Turk and A. Pentland. Eigenfaces for recognition. Journal of Cognitive Neuroscience, 3(1):71--86, 1991.
 
26
 
27
K. Weinberger. http://www.seas.upenn.edu/~kilianw/sde/datasets.htm
 
28
K. Weinberger and L. Saul. Unsupervised learning of image manifolds by semidefinite programming. In Proceeding of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2004.
Collaborative Colleagues:
Shawn Martin: colleagues
Alex Bäcker: colleagues