By Topic

A fast indexing and retrieval method for image databases

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

2 Author(s)
M. Sadooghi Yazdi ; Electrical and Computer Engineering Deprtment, Shahid Beheshti University, Velanjak Ave, Tehran, Iran ; Mohsen Ebrahimi Moghaddam

Image indexing is an important research issue nowadays. There are some ways to represent images such as 2D string. 2D string is a tool which represents spatial relationships among objects in symbolic image databases. 2D strings with respect to 3D hash functions are used in this paper to present a fast method for partial or total image retrieval. In the proposed method, a new data structure based on multi level linked lists is proposed to reduce algorithm time complexity. The proposed method overcame the constraint of other methods in image rotation. Because this method does not need to reconstruct data structures at new insertion, it can be extended toward dynamic databases. Simulation results showed the performance of our method. We concluded based on experimental results that our method time complexity tends to O(1).

Published in:

2008 15th International Conference on Systems, Signals and Image Processing

Date of Conference:

25-28 June 2008