Worst-case and smoothed analysis of the ICP algorithm, with an application to the k-means method

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 153-164

  Arthur, David ^a   Vassilvitskii, Sergei ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE CLOSEST POINT (ICP); K-MEANS METHOD; WORST-CASE LOWER BOUND;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; CRAMER-RAO BOUNDS; ITERATIVE METHODS; POLYNOMIALS;

ALGORITHMS;

EID: 38749098136     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.79     Document Type: Conference Paper

References (17)

1. P. K. Agarwal and N. H. Mustafa, k-means projective clustering. In PODS '04: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 155-165, New York, NY, USA, 2004. ACM Press.
2. D. Arthur and S. Vassilvitskii. How slow is the k-means method? In SCG '06: Proceedings of the twenty-second annual symposium on computational geometry. ACM Press, 2006.
3. L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, G. Schäer, and T. Vredeveld. Average case and smoothed competitive analysis of the multi-level feedback algorithm. In FOCS '03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, page 462, Washington, DC, USA, 2003. IEEE Computer Society.
4. R. Beier and B. Vöcking. Random knapsack in expected polynomial time. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03), pages 232-241, San Diego, USA, 2003. Association of Computing Machinery (ACM), ACM.
5. P. Berkhin. Survey of clustering data mining techniques. Technical report, Accrue Software, San Jose, CA, 2002.
6. P. J. Besl and N. D. McKay. A method for registration of 3-D shapes. IEEE Trans. Pattern Anal. Mach. Intell., 14(2):239-256, 1992.
7. E. Ezra, M. Sharir, and A. Efrat. On the ICP algorithm. In SCG '06: Proceedings of the twenty-second annual symposium on computational geometry. ACM Press, 2006.
8. N. Gelfand, L. Ikemoto, S. Rusinkiewicz, and M. Levoy. Geometrically stable sampling for the ICP algorithm. In Fourth International Conference on 3D Digital Imaging and Modeling (3DIM), pages 260-267, 2003.
9. S. Gupta, K. Sengupta, and A. A. Kassim. Compression of dynamic 3d geometry data using Iterative Closest Point algorithm. Comput. Vis. Image Underst., 87(1-3):116-130, 2002.
10. S. Har-Peled and B. Sadri. How fast is the k-means method? In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 877-885, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
11. M. Inaba, N. Katoh, and H. Imai. Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering (extended abstract). In Symposium on Computational Geometry, pages 332-339, 1994.
12. T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu. A local search approximation algorithm for k-means clustering. Comput. Geom., 28(2-3):89-112, 2004.
13. M. Levoy, K. Pulli, B. Curless, S. Rusinkiewicz, D. Koller, L. Pereira, M. Ginzton, S. Anderson, J. Davis, J. Ginsberg, J. Shade, and D. Fulk. The digital Michelangelo project: 3D scanning of large statues. In K. Akeley, editor, Siggraph 2000, Computer Graphics Proceedings, pages 131-144. ACM Press / ACM SIGGRAPH / Addison Wesley Longman, 2000.
14. S. P. Lloyd. Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2):129-136, 1982.
15. S. Rusinkiewicz and M. Levoy. Efficient variants of the ICP algorithm. In Proceedings of the Third Intl. Conf. on 3D Digital Imaging and Modeling, pages 145-152, 2001.
16. G. C. Sharp, S. W Lee, and D. K. Wehe. ICP registration using invariant features. IEEE Trans. Pattern Anal. Mach. Intell., 24(1):90-102, 2002.
17. D. A. Spielman and S.-H. Teng. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM, 51(3):385-463, 2004.