ERA

No preview available

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3Q52FG6D

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Computing Science, Department of

Collections

This file is in the following collections:

Technical Reports (Computing Science)

Color Based Image Retrieval Using Signature Trees Open Access

Descriptions

Author or creator
Nascimento, Mario
Tousidou, Eleni
Chitkara, Vishal
Manolopoulos, Yannis
Additional contributors
Subject/Keyword
color-based image retrieval
signature trees
Type of item
Computing Science Technical Report
Computing science technical report ID
TR01-02
Language
English
Place
Time
Description
Technical report TR01-02. Significant research has focused on determining efficient methodologies for effective and speedy retrieval in large image databases. Towards that goal, the first contribution of this paper is an image abstraction technique, called VBA, based on signature bit-strings and a corresponding similarity metric. The signature provides a compact representation of an image based on its color content and yields better retrieval effectiveness than when using classical global color histograms (GCHs) and comparable to the one obtained when using Color-Coherence Vectors (CCVs). More importantly however, the use of VBA signatures allows savings of 75% and 87.5% in storage overhead when compared to GCHs and CCVs, respectively. The second contribution is the improvement upon an access structure, the S-tree, exploring the concept of logical and physical pages and a new nearest-neighbor type of algorithm, in order to improve retrieval speed. We compared the S-tree performance when indexing the VBA signatures against the SR-tree indexing GCHs and CCVs, since SR-trees are arguably the most efficient access method for high-dimensional points. Our experimental results, using a large number of images and varying several parameters, have shown that the combination VBA/S-tree outperforms the GCH/SR-tree combination in terms of effectiveness, access speed and size (up to 45%, 25% and 70% respectively). Due to the very high-dimensionality of the CCVs their indexing, even using an efficient access structure, the SR-tree, did not seem to be a feasible alternative.
Date created
2001
DOI
doi:10.7939/R3Q52FG6D
License information
Creative Commons Attribution 3.0 Unported
Rights

Citation for previous publication

Source
Link to related item

File Details

Date Uploaded
Date Modified
2014-04-30T21:45:34.455+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: postscript (Postscript)
Mime type: application/postscript
File size: 304904
Last modified: 2015:10:12 16:47:40-06:00
Filename: TR01-02.ps
Original checksum: 4e4681e4b8e658f3efcbe598793a4e95
Activity of users you follow
User Activity Date