A barcode shape descriptor for curve point cloud data

Computers and Graphics (Pergamon)

Volumn 28, Issue 6, 2004, Pages 881-894

  Collins, Anne ^a   Zomorodian, Afra ^b   Carlsson, Gunnar ^a   Guibas, Leonidas J ^b  

^a STANFORD UNIVERSITY   (United States)

^b Stanford University   (United States)

Author keywords

Barcode; Curves; Descriptor; Persistence; Point cloud data; Tangent complex

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STRUCTURES; GRAPH THEORY; PATTERN RECOGNITION; PIPELINE PROCESSING SYSTEMS;

BARCODE SHAPE DESCRIPTOR; CURVES; PERSISTENCE; POINT CLOUD DATA (PCD); TANGENT COMPLEX;

BAR CODES;

EID: 7544240597     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cag.2004.08.015     Document Type: Article

References (31)

1. Duda RO, Hart PE, Stork DO. Pattern classification and scene analysis, 2nd ed. Hoboken, NJ: Wiley-Interscience; 2000.
2. Gonzalez RC, Woods RE. Digital image processing, 2nd ed. Boston, MA: Addison-Wesley; 2002.
3. Sebastian T, Klein P, Kimia B. Recognition of shapes by editing shock graphs. In: International Conference on Computer Vision; 2001. p. 755-62.
4. Fan T-J. Describing and recognizing 3D objects using surface properties. New York, NY: Springer; 1990.
5. Fisher RB. From surfaces to objects: computer vision and three-dimensional scene analysis. New York, NY: John Wiley; 1989.
6. Osada R, Funkhouser T, Chazella B, Dobkin D. Matching 3D models with shape distributions. In: International Conference on Shape Modeling & Application; 2001. p. 154-66.
7. Hilaga M, Shinagawa Y, Kohmura T, Kunii TL. Topology matching for fully automatic similarity estimation of 3D shapes. In: Proceedings of the ACM SIGGRAPH 2001; 2001. p. 203-12.
8. Levoy M, Whitted T. The use of points as display primitives, Tech. rep., The University of North Carolina at Chappel Hill, 1985.
9. Adamson A, Alexa M. Ray tracing point set surfaces. In: Proceedings of Shape Modeling International; 2003.
10. Rusinkiewicz S, Levoy M. QSplat: a multiresolution point rendering system for large meshes. In: Proceedings of ACM SIGGRAPH 2000; 2000. p. 343-52.
11. Alexa M, Behr J, Cohen-Or D, Fleishman S, Levin D, Silva CT. Point set surfaces. In: Proceedings of Vision; 2001.
12. Zwicker M, Pauly M, Knoll O, Gross M. Pointshop 3D: an interactive system for point-based surface editing. In: Proceedings of ACM SIGGRAPH 2002, vol. 21; 2002. p. 322-9.
13. Adams B, Duré P. Interactive boolean operations on surfel-bounded solids. ACM Trans Graph 2003;22(3):651-6.
14. Pauly M, Keiser R, Kobbelt LP, Gross M. Shape modeling with point-sampled geometry. In: Proceedings of ACM SIGGRAPH 2003, vol. 22; 2003. p. 641-50.
15. Donoho DL, Grimes C. Hessian eigenmaps: locally linear embedding techniques for high-dimensional data. PNAS 2003;100:5591-6.
16. Lee AB, Pedersen KS, Mumford D. The non-linear statistics of high contrast patches in natural images, Tech. rep., Brown University, Available online. 2001.
17. Tenenbaum JB, de Silva V, Langford JC. A global geometric frame-work for nonlinear dimensionality reduction. Science 2000;290:2319-23.
18. Carlsson G, Zomorodian A, Collins A, Guibas L. Persistence barcodes for shapes. In: Proceedings of Geometry Process; 2004. p. 127-38.
19. Munkres JR. Elements of algebraic topology. Red-wood City, California: Addison-Wesley, 1984.
20. Cormen TH, Leiserson CE, Rivest RL, Stein C. Introduction to algorithms. Cambridge, MA; MIT Press; 2001.
21. Edelsbrunner H, Letscher D, Zomorodian A. Topological persistence and simplification. Discrete Computational Geometry 2002;28:511-33.
22. Zomorodian A, Carlsson G. Computing persistent homology. Discrete Computational Geometry, to appear.
23. Mitra NJ, Nguyen A, Guibas L. Estimating surface normals in noisy point cloud data. International Journal of Computational Geometry and Applications 2004, to appear.
24. Gromov M. Hyperbolic groups. Ire Gersten S editor. Essays in group theory. New York, NY: Springer; 1987. p. 75-263.
25. de Berg M, van Kreveld M, Overmars M, Schwarzkopf O. Computational geometry: algorithms and applications. New York: Springer; 1997.
26. Edelsbrunner H. The union of balls and its dual shape. Discrete Computational Geometry 1995;13:415-40.
27. de Silva V, Carlsson G. Topological estimation using witness complexes. In: Proceedings of Symposium on Point-Based Graphics; 2004. p. 157-66.
28. Zomorodian A, Edelsbrunner H. Fast software for box intersection. International Journal of Computational Geometry and Applications 2002;12:143-72.
29. Algorithmic Solutions Software GmbH, LEDA, 2004.
30. Merdhorn K, Näher S. The LEDA platform of combinatorial and geometric computing. Cambridge, UK: Cambridge University Press; 1999.
31. LeCun Y. The MNIST database of handwritten digits. http://yann.lecum-com/exdb/mnist/.