Fast 3D shape retrieval method for classified databases

In this work, we present a new technique to speed up 3D shape retrieval. Instead of performing an exhaustive search over the whole database, which implies a systematic comparison of the query object with all 3D objects in the database, we restrict the pattern matching to a subset of “good candidates” (the most similar to the query). Assuming that the database has been partitioned into several classes, our retrieval algorithm focuses on the class containing objects that are similar to that of the query. Thus, the systematic pattern matching is performed within the selected class only. The key idea is to index each class by a suitable referent object that will be used to seek the right class on a search request with a given 3D object. In this paper, we describe how to choose the best representative within a class, and then couple it with a 3D retrieval method proposed in the literature. We illustrate the efficiency of our approach trough some experiments.

[1]  Ryutarou Ohbuchi,et al.  Salient local visual features for shape-based 3D model retrieval , 2008, 2008 IEEE International Conference on Shape Modeling and Applications.

[2]  Daniela Giorgi,et al.  A Comparison Framework for 3D Object Classification Methods , 2006, MRCS.

[3]  Thomas A. Funkhouser,et al.  The Princeton Shape Benchmark , 2004, Proceedings Shape Modeling Applications, 2004..

[4]  Remco C. Veltkamp,et al.  A Survey of Content Based 3D Shape Retrieval Methods , 2004, SMI.

[5]  Alberto Del Bimbo,et al.  Content-based retrieval of 3D models , 2006, TOMCCAP.

[6]  Daniel A. Keim,et al.  An experimental comparison of feature-based 3D retrieval methods , 2004, Proceedings. 2nd International Symposium on 3D Data Processing, Visualization and Transmission, 2004. 3DPVT 2004..

[7]  Titus B. Zaharia,et al.  3D versus 2D/3D shape descriptors: a comparative study , 2004, IS&T/SPIE Electronic Imaging.

[8]  Daniel A. Keim,et al.  An experimental comparison of feature-based 3D retrieval methods , 2004 .