By Topic

Fast similarity search in databases of 3D objects

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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiong Wang ; Dept. of Comput. & Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA ; Wang, J.T.L.

Given a database D of three dimensional (3D) objects and a target object Q, the similarity search problem (also known as good-match retrieval) is defined as finding the objects D in D that approximately match Q, possibly in the presence of rotation, translation, node insert, delete and relabeling in D or Q. This type of query arises in many AI applications. We study the similarity search problem and a class of related queries. We present a computer vision based technique called geometric hashing for processing these queries. Experimental results on a database of 3D molecules obtained from the National Cancer Institute indicate the good performance of the presented technique

Published in:

Tools with Artificial Intelligence, 1998. Proceedings. Tenth IEEE International Conference on

Date of Conference:

10-12 Nov 1998