Fast similarity search in databases of 3D objects

Document Type

Conference Proceeding

Publication Date

12-1-1998

Abstract

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. In this paper 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.

Identifier

0032285253 (Scopus)

Publication Title

Proceedings of the International Conference on Tools with Artificial Intelligence

ISSN

10636730

First Page

16

Last Page

23

This document is currently not available here.

Share

COinS