Tertiary hash tree-based index structure for high dimensional multimedia data

Yoon Sik Tak, Seungmin Rho, Een Jun Hwang, Hanku Lee

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Dominant features for the content-based image retrieval usually have high-dimensionality. So far, many researches have been done to index such values to support fast retrieval. Still, many existing indexing schemes are suffering from performance degradation due to the curse of dimensionality problem. As an alternative, heuristic algorithms have been proposed to calculate the answer with 'high probability' at the cost of accuracy. In this paper, we propose a new hash tree-based indexing structure called tertiary hash tree for indexing high-dimensional feature data. Tertiary hash tree provides several advantages compared to the traditional extendible hash structure in terms of resource usage and search performance. Through extensive experiments, we show that our proposed index structure achieves outstanding performance.

Original languageEnglish
Pages (from-to)51-68
Number of pages18
JournalMultimedia Tools and Applications
Volume61
Issue number1
DOIs
Publication statusPublished - 2012 Nov 1

Fingerprint

Image retrieval
Heuristic algorithms
Degradation
Experiments

Keywords

  • Content-based
  • Extendible hash
  • Image retrieval
  • Multi-dimensional data
  • Tertiary hash tree

ASJC Scopus subject areas

  • Media Technology
  • Hardware and Architecture
  • Computer Networks and Communications
  • Software

Cite this

Tertiary hash tree-based index structure for high dimensional multimedia data. / Tak, Yoon Sik; Rho, Seungmin; Hwang, Een Jun; Lee, Hanku.

In: Multimedia Tools and Applications, Vol. 61, No. 1, 01.11.2012, p. 51-68.

Research output: Contribution to journalArticle

Tak, Yoon Sik ; Rho, Seungmin ; Hwang, Een Jun ; Lee, Hanku. / Tertiary hash tree-based index structure for high dimensional multimedia data. In: Multimedia Tools and Applications. 2012 ; Vol. 61, No. 1. pp. 51-68.
@article{c1ff5f7f74ff48fd812b97015cf7c0d9,
title = "Tertiary hash tree-based index structure for high dimensional multimedia data",
abstract = "Dominant features for the content-based image retrieval usually have high-dimensionality. So far, many researches have been done to index such values to support fast retrieval. Still, many existing indexing schemes are suffering from performance degradation due to the curse of dimensionality problem. As an alternative, heuristic algorithms have been proposed to calculate the answer with 'high probability' at the cost of accuracy. In this paper, we propose a new hash tree-based indexing structure called tertiary hash tree for indexing high-dimensional feature data. Tertiary hash tree provides several advantages compared to the traditional extendible hash structure in terms of resource usage and search performance. Through extensive experiments, we show that our proposed index structure achieves outstanding performance.",
keywords = "Content-based, Extendible hash, Image retrieval, Multi-dimensional data, Tertiary hash tree",
author = "Tak, {Yoon Sik} and Seungmin Rho and Hwang, {Een Jun} and Hanku Lee",
year = "2012",
month = "11",
day = "1",
doi = "10.1007/s11042-010-0687-8",
language = "English",
volume = "61",
pages = "51--68",
journal = "Multimedia Tools and Applications",
issn = "1380-7501",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Tertiary hash tree-based index structure for high dimensional multimedia data

AU - Tak, Yoon Sik

AU - Rho, Seungmin

AU - Hwang, Een Jun

AU - Lee, Hanku

PY - 2012/11/1

Y1 - 2012/11/1

N2 - Dominant features for the content-based image retrieval usually have high-dimensionality. So far, many researches have been done to index such values to support fast retrieval. Still, many existing indexing schemes are suffering from performance degradation due to the curse of dimensionality problem. As an alternative, heuristic algorithms have been proposed to calculate the answer with 'high probability' at the cost of accuracy. In this paper, we propose a new hash tree-based indexing structure called tertiary hash tree for indexing high-dimensional feature data. Tertiary hash tree provides several advantages compared to the traditional extendible hash structure in terms of resource usage and search performance. Through extensive experiments, we show that our proposed index structure achieves outstanding performance.

AB - Dominant features for the content-based image retrieval usually have high-dimensionality. So far, many researches have been done to index such values to support fast retrieval. Still, many existing indexing schemes are suffering from performance degradation due to the curse of dimensionality problem. As an alternative, heuristic algorithms have been proposed to calculate the answer with 'high probability' at the cost of accuracy. In this paper, we propose a new hash tree-based indexing structure called tertiary hash tree for indexing high-dimensional feature data. Tertiary hash tree provides several advantages compared to the traditional extendible hash structure in terms of resource usage and search performance. Through extensive experiments, we show that our proposed index structure achieves outstanding performance.

KW - Content-based

KW - Extendible hash

KW - Image retrieval

KW - Multi-dimensional data

KW - Tertiary hash tree

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

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

U2 - 10.1007/s11042-010-0687-8

DO - 10.1007/s11042-010-0687-8

M3 - Article

AN - SCOPUS:84864042956

VL - 61

SP - 51

EP - 68

JO - Multimedia Tools and Applications

JF - Multimedia Tools and Applications

SN - 1380-7501

IS - 1

ER -