Shape based 3D model retrieval without query

  • Authors:
  • Susumu Endo;Takayuki Baba;Shuichi Shiitani;Yusuke Uehara;Daiki Masumoto;Shigemi Nagata

  • Affiliations:
  • FUJITSU Laboratories Ltd., Kanagawa, Japan;FUJITSU Laboratories Ltd., Kanagawa, Japan;FUJITSU Laboratories Ltd., Kanagawa, Japan;FUJITSU Laboratories Ltd., Kanagawa, Japan;FUJITSU Laboratories Ltd., Kanagawa, Japan;FUJITSU Laboratories Ltd., Kanagawa, Japan

  • Venue:
  • Proceedings of the 6th ACM international conference on Image and video retrieval
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe our shape based 3D model retrieval method that is based on a browsing technique. With this method, users can retrieve the desired 3D model efficiently without a query model. In previous retrieval systems, users should provide a 3D model as a query to the system. Then, the system retrieves similar 3D models and returns them to the user. However, the problem of how to obtain the query model remains. With our method, users can retrieve the desired 3D model by walking through a virtual 3D space without the query model. At first, 3D shape features are extracted from all the 3D models, and 3D models are arranged and classified in the virtual 3D space so that similar 3D models are placed near each other. This allows the user to easily grasp where the 3D models similar to the desired one are located. After approaching the 3D model that is similar to the desired one, users can focus on all the nearby models, which are usually similar to the desired one. So users can find the desired one efficiently. We also developed two functions to make our method more efficient. Firstly, our method needs to render a large number of 3D models at one time quickly, so we developed a high-speed rendering method. Secondly, to make it easier for the user to choose the desired one from many 3D models, we developed a method to make 3D models face the direction from which users can recognize the shape of the 3D models easily. In addition, we present the results of experiments to evaluate the retrieval efficiency, which shows that our method is four times as fast as a retrieval method using a query model.