An efficient indexing structure and image representation for content-based image retrieval

Hun Woo Yoo, Dong Sik Jang, Yoon Kyoon Na

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper, we present the following schemes for a content-based image search: (1) A fast image search algorithm that can significantly reduce similarity calculation compared to a full comparison of every database image. (2) A compact image representation scheme that can describe the global/local information of the images and provide successful retrieval performance. For fast searches, a tree is constructed by successfully dividing nodes into the desired depth level by working from the root to the leaf nodes using the k-means algorithm. When the query is completed, we traverse the tree top-down by minimizing the route taken between the query image and node centroid until we meet the undivided nodes. Within undivided nodes, the algorithm of triangle inequality is used to find the images most similar to the query. For compact image representation, RGB color histogram features which are quantized into 16 bins each of the R, G, and B channels are used for global information. Dominant hue, saturation, and value which are extracted from the HSV joint histogram in the localized regions within the image are used for local information. These features are sufficiently compact to index image features in large database systems. For experiments on the retrieval efficiency, the use of the proposed method provided substantial performance benefits by reducing the image similarity calculation up to an average of a 96% and for experiments on the retrieval effectiveness, in the best case, it provide a 36.8% recall rate for a whale query image and a 100% precision rate for an eagle query image. The overall performance was a 20.0% recall rate and a 72.5% precision rate.

Original languageEnglish
Pages (from-to)1390-1398
Number of pages9
JournalIEICE Transactions on Information and Systems
VolumeE85-D
Issue number9
Publication statusPublished - 2002 Sep 1

Fingerprint

Image retrieval
Bins
Experiments
Color

Keywords

  • Content-based image retrieval
  • Indexing structure
  • Triangle inequality

ASJC Scopus subject areas

  • Information Systems
  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

An efficient indexing structure and image representation for content-based image retrieval. / Yoo, Hun Woo; Jang, Dong Sik; Na, Yoon Kyoon.

In: IEICE Transactions on Information and Systems, Vol. E85-D, No. 9, 01.09.2002, p. 1390-1398.

Research output: Contribution to journalArticle

@article{5bac78962cb64c8d8d5c53d6dd9c361b,
title = "An efficient indexing structure and image representation for content-based image retrieval",
abstract = "In this paper, we present the following schemes for a content-based image search: (1) A fast image search algorithm that can significantly reduce similarity calculation compared to a full comparison of every database image. (2) A compact image representation scheme that can describe the global/local information of the images and provide successful retrieval performance. For fast searches, a tree is constructed by successfully dividing nodes into the desired depth level by working from the root to the leaf nodes using the k-means algorithm. When the query is completed, we traverse the tree top-down by minimizing the route taken between the query image and node centroid until we meet the undivided nodes. Within undivided nodes, the algorithm of triangle inequality is used to find the images most similar to the query. For compact image representation, RGB color histogram features which are quantized into 16 bins each of the R, G, and B channels are used for global information. Dominant hue, saturation, and value which are extracted from the HSV joint histogram in the localized regions within the image are used for local information. These features are sufficiently compact to index image features in large database systems. For experiments on the retrieval efficiency, the use of the proposed method provided substantial performance benefits by reducing the image similarity calculation up to an average of a 96{\%} and for experiments on the retrieval effectiveness, in the best case, it provide a 36.8{\%} recall rate for a whale query image and a 100{\%} precision rate for an eagle query image. The overall performance was a 20.0{\%} recall rate and a 72.5{\%} precision rate.",
keywords = "Content-based image retrieval, Indexing structure, Triangle inequality",
author = "Yoo, {Hun Woo} and Jang, {Dong Sik} and Na, {Yoon Kyoon}",
year = "2002",
month = "9",
day = "1",
language = "English",
volume = "E85-D",
pages = "1390--1398",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "9",

}

TY - JOUR

T1 - An efficient indexing structure and image representation for content-based image retrieval

AU - Yoo, Hun Woo

AU - Jang, Dong Sik

AU - Na, Yoon Kyoon

PY - 2002/9/1

Y1 - 2002/9/1

N2 - In this paper, we present the following schemes for a content-based image search: (1) A fast image search algorithm that can significantly reduce similarity calculation compared to a full comparison of every database image. (2) A compact image representation scheme that can describe the global/local information of the images and provide successful retrieval performance. For fast searches, a tree is constructed by successfully dividing nodes into the desired depth level by working from the root to the leaf nodes using the k-means algorithm. When the query is completed, we traverse the tree top-down by minimizing the route taken between the query image and node centroid until we meet the undivided nodes. Within undivided nodes, the algorithm of triangle inequality is used to find the images most similar to the query. For compact image representation, RGB color histogram features which are quantized into 16 bins each of the R, G, and B channels are used for global information. Dominant hue, saturation, and value which are extracted from the HSV joint histogram in the localized regions within the image are used for local information. These features are sufficiently compact to index image features in large database systems. For experiments on the retrieval efficiency, the use of the proposed method provided substantial performance benefits by reducing the image similarity calculation up to an average of a 96% and for experiments on the retrieval effectiveness, in the best case, it provide a 36.8% recall rate for a whale query image and a 100% precision rate for an eagle query image. The overall performance was a 20.0% recall rate and a 72.5% precision rate.

AB - In this paper, we present the following schemes for a content-based image search: (1) A fast image search algorithm that can significantly reduce similarity calculation compared to a full comparison of every database image. (2) A compact image representation scheme that can describe the global/local information of the images and provide successful retrieval performance. For fast searches, a tree is constructed by successfully dividing nodes into the desired depth level by working from the root to the leaf nodes using the k-means algorithm. When the query is completed, we traverse the tree top-down by minimizing the route taken between the query image and node centroid until we meet the undivided nodes. Within undivided nodes, the algorithm of triangle inequality is used to find the images most similar to the query. For compact image representation, RGB color histogram features which are quantized into 16 bins each of the R, G, and B channels are used for global information. Dominant hue, saturation, and value which are extracted from the HSV joint histogram in the localized regions within the image are used for local information. These features are sufficiently compact to index image features in large database systems. For experiments on the retrieval efficiency, the use of the proposed method provided substantial performance benefits by reducing the image similarity calculation up to an average of a 96% and for experiments on the retrieval effectiveness, in the best case, it provide a 36.8% recall rate for a whale query image and a 100% precision rate for an eagle query image. The overall performance was a 20.0% recall rate and a 72.5% precision rate.

KW - Content-based image retrieval

KW - Indexing structure

KW - Triangle inequality

UR - http://www.scopus.com/inward/record.url?scp=0036739512&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036739512&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0036739512

VL - E85-D

SP - 1390

EP - 1398

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 9

ER -