ACM Home Page
Please provide us with feedback. Feedback
Partial matching of 3D shapes with priority-driven search
Full text Publisher SitePublisher Site
Source
ACM International Conference Proceeding Series; Vol. 256 archive
Proceedings of the fourth Eurographics symposium on Geometry processing table of contents
Cagliari, Sardinia, Italy
SESSION: Shape analysis table of contents
Pages: 131 - 142  
Year of Publication: 2006
ISBN ~ ISSN:1727-8384 , 30905673-36-3
Authors
T. Funkhouser  Princeton University, Princeton, NJ
P. Shilane  Princeton University, Princeton, NJ
Sponsors
Eurographics: Eurographics Association
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
Eurographics Association  Aire-la-Ville, Switzerland, Switzerland
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 1
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   

ABSTRACT

Priority-driven search is an algorithm for retrieving similar shapes from a large database of 3D objects. Given a query object and a database of target objects, all represented by sets of local 3D shape features, the algorithm produces a ranked list of the c best target objects sorted by how well any subset of k features on the query match features on the target object. To achieve this goal, the system maintains a priority queue of potential sets of feature correspondences (partial matches) sorted by a cost function accounting for both feature dissimilarity and the geometric deformation. Only partial matches that can possibly lead to the best full match are popped off the queue, and thus the system is able to find a provably optimal match while investigating only a small subset of potential matches. New methods based on feature distinction, feature correspondences at multiple scales, and feature difference ranking further improve search time and retrieval performance. In experiments with the Princeton Shape Benchmark, the algorithm provides significantly better classification rates than previously tested shape matching methods while returning the best matches in a few seconds per query.


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
{AFP00} Audette M. A., Ferrie F. P., Peters T. M.: An algorithmic overview of surface registration techniques for medical imaging. Medical Image Analysis 4, 3 (2000), 201--217.
 
2
 
3
{BB76} Barrow H., Burstall R.: Subgraph isomorphism, matching relational structures and maximal cliques. Inf. Process. Lett. 4 (1976), 83--84.
 
4
5
 
6
{BKS*06} Bustos B., Keim D., Saupe D., T. Schreck, Vranić D.: An experimental effectiveness comparison of methods for 3D similarity search. International Journal on Digital Libraries, Special issue on Multimedia Contents and Management in Digital Libraries 6, 1 (2006), 39--54.
 
7
 
8
{BMP01} Belongie S., Malik J., Puzicha J.: Matching shapes. ICCV (2001).
 
9
 
10
{COTS03} Chen D.-Y., Ouhyoung M., Tian X.-P., Shen Y.-T.: On visual similarity based 3D model retrieval. Computer Graphics Forum (2003), 223--232.
 
11
{CR00} Chui H., Rangarajan A.: A new algorithm for non-rigid point matching. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2000), 44--51.
12
 
13
{FHK*04} Frome A., Huber D., Kolluri R., Bulow T., Malik J.: Recognizing objects in range data using regional point descriptors. In European Conference on Computer Vision (ECCV) (May 2004), pp. 224--237.
14
15
 
16
 
17
 
18
{HKSV02} Heczko M., Keim D., Saupe D., Vranić D.: Methods for similarity search on 3D databases. In Datenbank-Spektrum (2002), vol. 2, pp. 54--63. (In German).
 
19
{IJL*05} Iyer N., Jayanti S., Lou K., Kalyanaraman Y., Ramani K.: Three dimensional shape searching: State-of-the-art review and future trends. Computer-Aided Design 37, 5 (2005), 509--530.
 
20
 
21
 
22
{KPNK03} Kortgen M., Park G.-J., Novotni M., Klein R.: 3D shape matching with 3D shape contexts. In 7th Central European Seminar on Computer Graphics (April 2003).
 
23
 
24
{LW88} Lamdam Y., Wolfson H.: Geometric hashing: a general and efficient model-based recognition scheme. In Proc. ICCV (December 1988).
 
25
{MBM01} Mori G., Belongie S., Malik J.: Shape contexts enable efficient retrieval of similar shapes. In IEEE Computer Vision and Pattern Recognition (CVPR) (December 2001).
26
 
27
{NDK05} Novotni M., Degener P., Klein R.: Correspondence Generation and Matching of 3D Shape Subparts. Tech. Rep. CG-2005-2, ISSN 1610--8892, Friedrich-Wilhelms-Universität Bonn, June 2005.
 
28
 
29
 
30
{SMS*04} Shan Y., Matei B., Sawhney H. S., Kumar R., Huber D., Hebert M.: Linear model hashing and batch ransac for rapid and accurate object recognition. In IEEE International Conference on Computer Vision and Pattern Recognition (2004).
 
31
 
32
{Vra06} Vranić D.: Tools for 3d model retrieval, 2006. http://merkur01.inf.uni-konstanz.de/3Dtools/.
 
33

Collaborative Colleagues:
T. Funkhouser: colleagues
P. Shilane: colleagues