By Topic

Indexing by shape of image databases based on extended grid files

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
$33 $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

4 Author(s)
C. Combi ; Dept. of Math. & Comput. Sci., Udine Univ., Italy ; G. L. Foresti ; M. Franceschet ; A. Montanari

We propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailor it to obtain suitable representation structures for image databases. Then, in order to efficiently support image retrieval, we define an indexing structure based on grid files, since grid files were originally developed to speed up point (exact match) and range (nearest neighbors within a threshold) queries on multidimensional data with a fired number of attributes, we extend them to cope with data provided with a varying number of attributes and to deal with a new class of queries relevant to image databases, namely, nearest neighbor queries. We give a detailed description of the proposed search algorithms and a systematic analysis of their complexity, and discuss the outcomes of some experimental tests on sample image databases

Published in:

Multimedia Computing and Systems, 1999. IEEE International Conference on  (Volume:2 )

Date of Conference:

Jul 1999