Provable dimension detection using principal component analysis

International Journal of Computational Geometry and Applications

Volumn 18, Issue 5, 2008, Pages 415-440

  Cheng, Siu Wing ^a   Wang, Yajun ^a   Wu, Zhuangzhi ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b BEIHANG UNIVERSITY   (China)

Author keywords

Dimension detection; Principal component analysis; Sampling

Indexed keywords

EID: 54349084326     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195908002702     Document Type: Article

References (21)

1. N. Amenta and M. Bern, Surface reconstruction by Voronoi filtering, Discr. Comput. Geom., 22 (1999) 481-504.
2. N. Amenta, S. Choi, T. Dey and N. Leekha, A simple algorithm for homeomorphic surface reconstruction, Int. J. Comput. Geom. Appl. 12 (2002) 125-141.
3. N. Amenta, S. Choi and R. K. Kolluri, The power crust, unions of balls, and the medial axis transform, Comput. Geom.: Th. Appl. 19 (2001) 127-153.
4. D. Attali, J.-D. Boissonnat and A. Lieutier, Complexity of the Delaunay triangulation of points on surfaces: The smooth case, Proc. 19th Ann. ACM Symp. Comput. Geom., 2003, pp. 237-246.
5. S.-W. Cheng, T. K. Dey and E. A. Ramos, Manifold reconstruction from point samples, Proc. 16th Ann. ACM-SIAM Symp. Discrete Alg., 2005, pp. 1018-1027.
6. S.-W. Cheng, S. Funke, M. Golin, P. Kumar, S.-H. Poon and E. A. Ramos, Curve reconstruction from noisy samples, Comput. Geom.: Th. Appl., 31 (2005) 63-100.
7. S.-W. Cheng, Y. Wang and Z. Wu, Provable dimension detection using principal component analysis, Proc. 21st Ann. Symp. Comput. Geom., 2005, pp. 208-217.
8. T. K. Dey, Curve and surface reconstruction, Handbook of Discrete and Computational Geometry, eds. Goodman and O' Rourke, 2nd edition (CRC press, 2004).
9. T. K. Dey, J. Giesen, S. Goswami and W. Zhao, Shape dimension and approximation from samples, Discr. Comput. Geom. 29 (2003) 419-434.
10. T. K. Dey and S. Goswami, Provable surface reconstruction from noisy samples, Proc. 21th Ann. ACM Symp. Comput. Geom., 2004, pp. 330-339.
11. H. Edelsbrunner, Algorithms in Combinatorial Geometry (Springer-Verlag, 1987).
12. J. Friedman, Computing Betti numbers via combinatorial laplacians, Algorithmica, 21 (1998) 331-346.
13. K. Fukunaga, D. R. Olsen, An algorithm for finding intrinsic dimensionality of data, IEEE Trans. Comput. 20 (1971) 176-183.
14. J. Giesen and U. Wagner, Shape dimension and intrinsic metric from samples of manifolds with high co-dimension, Proc. 19th Ann. ACM Symp. Comput. Geom., 2003, pp. 329-337.
15. G. H. Golub and C. F. van Loan, Matrix Computations (The Johns Hopkins University Press, 1996).
16. I. Jolliffe, Principal Component Analysis (Springer-Verlag, New York, 1986).
17. R. K. Kolluri, Provable moving least squares surfaces, Proc. 16th Ann. ACM-SIAM Symp. Discrete Alg., 2005, pp. 1008-1017.
18. B. N. Parlett, The Symmetric Eigenvalue Problem (SIAM, 1998).
19. W. H. Press, S. A. Teukolsky, W. T. Vetterling and B. P. Flannery, Numerical Recipes in Fortran 77: The Art of Scientific Computing (Cambridge University Press, 1997).
20. J. B. Tenenbaum, V. de Silva and J. C. Langford, A global geometric framework for nonlinear dimensionality reduction, Science, 290 (2000) 2319-2323.
21. S.-T. Yau and Y. Y. Lu, Reducing the symmetric matrix eigenvalue problem to matrix multiplications, SIAM J. Scient. Comput., 14 (1993) 121-136.