Shape Segmentation and Matching from Noisy Point Clouds

1st Symposium on Point Based Graphics, PBG 2004

Volumn , Issue , 2004, Pages 193-199

  Dey, Tamal K ^a   Giesen, Joachim ^b   Goswami, Samrat ^a  

^a OHIO STATE UNIVERSITY   (United States)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

INTERACTIVE COMPUTER GRAPHICS;

DELAUNAY TRIANGULATION; MATCHING METHODS; NOISY POINT; POINT SET; POINT-CLOUDS; SEGMENTATION TECHNIQUES; SHAPE MATCHING; SHAPE SEGMENTATION; SIMPLE++; TETRAHEDRA;

GEOMETRY;

EID: 84896781644     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. [ABCO 01] ALEXA M., BEHR J., COHEN-OR D., FLEISHMAN S., LEVIN D., SILVA C. T.: Point set surfaces. In Proc. IEEE Visualization (2001), pp. 21–28.
2. [ACK01] AMENTA N., CHOI S., KOLLURI R.: The power crust, union of balls, and the medial axis transform. Comput. Geom. Theory Appl. 19 (2001), 127–153.
3. [AG96] ALT H., GUIBAS L. J.: Discrete geometric shapes: matching, interpolation, and approximation: a survey. Tech. report B 96-11, EVL-1996-142, Institute of Computer Science, Freie Universität Berlin (1996).
4. [BM02] BELONGIE S., MALIK J.: Matching with shape contexts. IEEE Trans. PAMI 24 (2002), 509–522.
5. [DG04] DEY T. K., GOSWAMI S.: Provable surface reconstruction from noisy samples. In Proc. 20th Annu. Sympos. Comput. Geom., (2004).
6. [DGG03] DEY T. K., GIESEN J., GOSWAMI S.: Shape segmentation and matching with flow discretization. In Proc. Workshop Algorithms Data Structures, LNCS 2748 (2003), pp. 25–36.
7. [EFL98] EDELSBRUNNER H., FACELLO M. A., LIANG J.: On the definition and the construction of pockets in macromolecules. Discrete Apl. Math. 88 (1998), 83–102.
8. [GJ02] GIESEN J., JOHN M.: The flow complex: a data structure for geometric modeling. In Proc. 14th Annu. ACM-SIAM Sympos. Discrete Algorithms (2002), pp. 285–294.
9. [Gro93] GROVE K.: Critical point theory for distance functions. In Proc. Sympos. Pure Math. (1993), vol. 54, pp. 357–385.
10. [HKR93] HUTTELNOCHER D. P., KLANDERMAN G. A., RUCKLIDGE W. J.: Computing images using the hausdorff distance. IEEE Trans. PAMI 15 (1993), 850–863.
11. [HSKK01] HILAGA M., SHINAGAWA Y., KOMURA T., KUNNI T.: Topology matching for fully automatic similarity estimation of 3d shapes. In Proc. SIGGRAPH (2001), pp. 203–212.
12. [JH99] JOHNSON A. E., HEBERT M.: Using spin-images for efficient multiple model recognition in cluttered 3-d scenes. IEEE Trans. PAMI 21 (1999), 433–449.
13. [KT03] KATZ S., TAL A.: Hierarchical mesh decomposition using fuzzy clustering and cuts. In Proc. SIGGRAPH (2003), pp. 954–961.
14. [LK01] LEYMARIE F., KIMIA B.: The shock scaffold for representing 3d shape. In Proc. 4th Internat. Workshop Visual Form., LNCS 2059, Springer-Verlag (2001), pp. 216–229.
15. [OFCD01] OSADA R., FUNKHOUSER T., CHAZELLE B., DOBKIN D.: Matching 3d models with shape distribution. In Proc. Shape Modelling Internat. (2001).
16. [PKKG03] PAULY M., KEISER R., KOBBELT L. P., GROSS M. H.: Shape modeling with point-sampled geometry. In Proc. SIGGRAPH (2003), pp. 641–650.
17. [SKK01] SEBASTIAN T. B., KLEIN P. N., KIMIA B.: Recognition of shapes by editing shock graphs. In Proc. ICCV (2001), pp. 755–762.
18. [TC92] TAUBIN G., COOPER D.: Geometric invariance in computer vision, Ch. Object Recognition Based on Moment (of algebraic) Invariants. MIT press, 1992.