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

Yoon Sik Tak; Seungmin Rho; Eenjun Hwang; Hanku Lee

doi:10.1007/s11042-010-0687-8

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

Yoon Sik Tak, Seungmin Rho, Eenjun Hwang, Hanku Lee

Research output: Contribution to journal › Article › peer-review

4 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 language	English
Pages (from-to)	51-68
Number of pages	18
Journal	Multimedia Tools and Applications
Volume	61
Issue number	1
DOIs	https://doi.org/10.1007/s11042-010-0687-8
Publication status	Published - 2012 Nov

Bibliographical note

Funding Information:
Acknowledgement This research was supported by the MKE (Ministry of Knowledge Economy), Korea, under the ITRC (Information Technology Research Center) support program supervised by the NIPA (National IT Industry Promotion Agency) (NIPA-2010-C1090-1001-0008)

Keywords

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

ASJC Scopus subject areas

Software
Media Technology
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1007/s11042-010-0687-8

Cite this

@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 Eenjun Hwang and Hanku Lee",

note = "Funding Information: Acknowledgement This research was supported by the MKE (Ministry of Knowledge Economy), Korea, under the ITRC (Information Technology Research Center) support program supervised by the NIPA (National IT Industry Promotion Agency) (NIPA-2010-C1090-1001-0008)",

year = "2012",

month = nov,

doi = "10.1007/s11042-010-0687-8",

language = "English",

volume = "61",

pages = "51--68",

journal = "Multimedia Tools and Applications",

issn = "1380-7501",

publisher = "Springer",

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, Eenjun

AU - Lee, Hanku

N1 - Funding Information: Acknowledgement This research was supported by the MKE (Ministry of Knowledge Economy), Korea, under the ITRC (Information Technology Research Center) support program supervised by the NIPA (National IT Industry Promotion Agency) (NIPA-2010-C1090-1001-0008)

PY - 2012/11

Y1 - 2012/11

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

U2 - 10.1007/s11042-010-0687-8

DO - 10.1007/s11042-010-0687-8

M3 - Article

AN - SCOPUS:84864042956

SN - 1380-7501

VL - 61

SP - 51

EP - 68

JO - Multimedia Tools and Applications

JF - Multimedia Tools and Applications

IS - 1

ER -

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

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this