ACM Home Page
Please provide us with feedback. Feedback
Shape distributions
Full text PdfPdf (3.46 MB)
Source ACM Transactions on Graphics (TOG) archive
Volume 21 ,  Issue 4  (October 2002) table of contents
Pages: 807 - 832  
Year of Publication: 2002
ISSN:0730-0301
Authors
Robert Osada  Princeton University, Princeton, NJ
Thomas Funkhouser  Princeton University, Princeton, NJ
Bernard Chazelle  Princeton University, Princeton, NJ
David Dobkin  Princeton University, Princeton, NJ
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 37,   Downloads (12 Months): 258,   Citation Count: 55
Additional Information:

abstract   references   cited by   index terms   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/571647.571648
What is a DOI?

ABSTRACT

Measuring the similarity between 3D shapes is a fundamental problem, with applications in computer graphics, computer vision, molecular biology, and a variety of other fields. A challenging aspect of this problem is to find a suitable shape signature that can be constructed and compared quickly, while still discriminating between similar and dissimilar shapes.In this paper, we propose and analyze a method for computing shape signatures for arbitrary (possibly degenerate) 3D polygonal models. The key idea is to represent the signature of an object as a shape distribution sampled from a shape function measuring global geometric properties of an object. The primary motivation for this approach is to reduce the shape matching problem to the comparison of probability distributions, which is simpler than traditional shape matching methods that require pose registration, feature correspondence, or model fitting.We find that the dissimilarities between sampled distributions of simple shape functions (e.g., the distance between two random points on a surface) provide a robust method for discriminating between classes of objects (e.g., cars versus airplanes) in a moderately sized database, despite the presence of arbitrary translations, rotations, scales, mirrors, tessellations, simplifications, and model degeneracies. They can be evaluated quickly, and thus the proposed method could be applied as a pre-classifier in a complete shape-based retrieval or analysis system concerned with finding similar whole objects. The paper describes our early experiences using shape distributions for object classification and for interactive web-based retrieval of 3D models.


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
Aherne, F., Thacker, N., and Rockett, P. 1997. Optimal pairwise geometric histograms. BMVC, 480--490.
 
2
Alt, H. and Guibas, L. J. 1996. Discrete geometric shapes: Matching, interpolation, and approximation: A survey. Tech. Rep. B 96-11, EVL-1996-142, Institute of Computer Science, Freie Universität Berlin.
 
3
Amit, Y., Grenander, U., and Piccioni, M. 1991. Structural image restoration through deformable templates. J. Am. Statistical Assn. 86, 440, 376--387.
 
4
 
5
 
6
 
7
8
 
9
Ashbrook, A., Rockett, P., and Thacker, N. 1995b. Multiple shape recognition using pairwise geometric histogram based algortihms. IEEE Image Processing.
 
10
Ashbrook, A., Thacker, N., and Rockett, P. 1995c. Pairwise geometric histograms: A scaleable solution for recognition of 2d rigid shapes. 9th SCIA 1, 271--278.
 
11
Bardinet, E., Vidal, S. F., Arroyo, S. D., Malandain, G., and de la Blanca Capilla, N. P. 2000. Structural object matching. Tech. Rep. DECSAI-000303, Dept. of Computer Science and AI, University of Granada, Spain. February.
 
12
 
13
Basri, R., Costa, L., Geiger, D., and Jacobs, D. 1998. Determining the similarity of deformable shapes. Vision Research 38, 2365--2385.
 
14
Belongie, S., Malik, J., and Puzicha, J. 2001. Matching shapes. ICCV.
 
15
16
 
17
Bhattacharyya, A. 1943. On a measure of divergence between two statistical populations defined by their probability distributions. Bulletin of the Calcutta Mathematics Society 35, 99--110.
 
18
Binford, T. 1971. Visual perception by computer. IEEE Conference on Systems Science and Cybernetics.
 
19
 
20
 
21
Chang, S. and Smith, J. 1995. Extracting multi-dimensional signal features for content-based visual query. SPIE Symposium on Visual Communications and Signal Processing 2501, 2 (May), 995--1006.
 
22
Chen, J. 2001. The Search for 3D Models. Junior Independent Work, Computer Science Department, Princeton University.
23
 
24
 
25
Delingette, H., Hebert, M., and Ikeuchi, K. 1993. A spherical representation for the recognition of curved objects. ICCV, 103--112.
 
26
 
27
 
28
Evans, A., Thacker, N., and Mayhew, J. 1992. Pairwise representation of shape. 11th ICPR 1. 133--136.
 
29
Evans, A., Thacker, N., and Mayhew, J. 1993. The use of geometric histograms for model-based object recognition. 4th BMVC, 429--438.
 
30
31
 
32
 
33
Helgason, S. 1999. The radon transform. Progress in Mathematics, Springer, 2nd ed. 5.
 
34
Holm, L. and Sander, C. 1998. Touring protein fold space with dali/fssp. Nucleic Acids Research 26, 316--319.
 
35
Horn, B. 1984. Extended gaussian images. Proc. of the IEEE 72, 12 (December), 1671--1686.
 
36
Huet, B. and Hancock, E. 1996. Structural indexing of infra-red images using statistical histogram comparison. IWISP, 653--656.
 
37
Igarashi, T., Matsuoka, S., and Tanaka, H. 1999. Teddy: A sketching interface for 3d freeform design. SIGGRAPH, 409--416. ISBN 0-20148-560-5. Held in Los Angeles, California.
 
38
39
 
40
 
41
 
42
Kullback, S. 1968. Information Theory and Statistics. Dover.
 
43
Stanford University Computer Graphics Laboratory 1996. http://graphics.stanford.edu/data.
 
44
Lamdam, Y. and Wolfson, H. 1988. Geometric hashing: a general and efficient model-based recognition scheme. ICCV.
 
45
 
46
Loncaric, S. 1998. A survey of shape analysis techniques. Pattern Recognition 31, 8, 983--1001.
 
47
Mori, G., Belongie, S., and Malik, J. 2001. Shape contexts enable efficient retrieval of similar shapes. CVPR.
48
 
49
 
50
 
51
 
52
 
53
 
54
Rann, A. G. and Katsevich, A. I. 1996. The Radon Transform and Local Tomography. CRC Press.
 
55
Riocreux, P., Thacker, N., and Yates, R. 1994. An analysis of pairwise geometric histograms for view-based object recognition. BMVC.
 
56
 
57
 
58
Shen, H. C. and Wong, A. K. C. 1983. Generalized texture representation and metric. Computer, Vision, Graphics, and Image Processing 23, 187--206.
 
59
60
 
61
62
 
63
Tappert, C. 1982. Cursive script recognition by elastic matching. IBM Res. Develop. 26, 6, 765--771.
 
64
 
65
 
66
Thacker, N., Riocreux, P., and Yates, R. 1995. Assessing the completeness properties of pairwise geometric histograms. Image and Vision Computing 13, 5, 423--429.
 
67
Tsai, W. and Yu, S. 1985. Attributive string matching with merging for shape recognition. IEEE Trans. Pattern Anal. Mach. Intell. 7, 453--462.
 
68
Uras, C. and Verri, A. 1994. On the recognition of the alphabet of the sign language through size functions. IAPR, 334--338.
 
69
 
70
Veltkamp, R. C. and Hagedoorn, M. 1999. State-of-the-art in shape matching. Tech. Rep. UU-CS-1999-27, Utrecht University, the Netherlands.
 
71
Werman, M., Peleg, S., and Rosenfeld, A. 1985. A distance metric for multi-dimensional histograms. Computer, Vision, Graphics, and Image Processing 32, 328--336.
 
72
Wu, K. and Levine, M. 1994. Recovering parametrics geons from multiview range data. CVPR, 159--166.
 
73
Young, I., Walker, J., and Bowie, J. 1974. An analysis technique for biological shape. Computer Graphics and Image Processing 25, 357--370.
 
74
Zhang, D. and Hebert, M. 1999. Harmonic maps and their applications in surface matching. IEEE Conference on Computer Vision and Pattern Recognition (CVPR '99).

CITED BY  56

Collaborative Colleagues:
Robert Osada: colleagues
Thomas Funkhouser: colleagues
Bernard Chazelle: colleagues
David Dobkin: colleagues