Cart (Loading....) | Create Account
Close category search window
 

Regular polyhedral descriptor for 3-D object retrieval system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Duck Hoon Kim ; Sch. of Electr. Eng. & Comput. Sci., Seoul Nat. Univ., South Korea ; Il Dong Yun ; Sang Uk Lee

Recently, the 3-D object retrieval system attempts to integrate 2-D visual descriptors since some applications including e-shopping cannot employ 3-D object as a query. For an example, the multiple views have been developed in MPEG-7, but it cannot consider the spatial distribution of 3-D object and has heavy computational complexity because of the matching procedure in a combinatorial manner. In this paper, a novel descriptor for the 3-D object retrieval system, the regular polyhedral descriptor or regular polyhedron, is proposed. The proposed descriptor, which consists of the selection of equally distributed view positions and matching strategy using the regular polyhedron, is based on the multiple view, but it can improve the multiple view by using the property of the regular polyhedron. Experimental results show that the proposed descriptor has the retrieval performance comparable to the multiple views, in terms of the bull's eye performance (BEP) and average normalized modified retrieval rate (ANMRR).

Published in:

Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on  (Volume:3 )

Date of Conference:

14-17 Sept. 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.