Abstract

This study addresses the problem of 3D shape retrieval. While this problem is interesting and emerging as the size of 3D object databases grows rapidly, the main two issues the community has to focus on are: computational efficiency of 3D object retrieval and the quality of retrieval results. In this study we deal with the two considerations, especially the first one namely computational efficiency, by proposing a new technique to retrieve efficiently the 3D-objects in the classified databases which contains 3D objects of different categories. This technique can be coupled with any 3D retrieval method. In this study, we use the Clock Matching Bag-of-Features 3D retrieval method proposed by Lian et al. (2010) since it gives the best result comparing with several methods in particular the view based methods. Instead of systematically matching the object-query with all 3D objects of the target database, our approach restricts the pattern matching on a subset of good candidates (the most similar to the query). For a database classified in several classes the retrieval will be oriented to the right class that contains similar objects to the query. In this case, the matching process will be not systematically performed with all objects among the database, but only with objects of right class. Our key idea is to represent each class by one representative that will be used to orient the retrieval process to the right class. Experimental results illustrate the efficiency of our approach.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.