Image indexing and retrieval using signature trees

  • Authors:

  • Mario A. Nascimento;Eleni Tousidou;Vishal Chitkara;Yannis Manolopoulos

  • Affiliations:

  • Department of Computing Science, University of Alberta, Edmonton T6G 2E8, Canada;Department of Informatics, Aristotle University, 54006 Thessaloniki, Greece;Department of Computing Science, University of Alberta, Edmonton T6G 2E8, Canada;Department of Informatics, Aristotle University, 54006 Thessaloniki, Greece

  • Venue:
  • Data & Knowledge Engineering
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

Abstract

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 variable-bin allocation (VBA), based on signature bitstrings 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 specialized 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.