Tertiary hash tree-based index structure for high dimensional multimedia data
- Authors
- Tak, Yoon-Sik; Rho, Seungmin; Hwang, Eenjun; Lee, Hanku
- Issue Date
- 11월-2012
- Publisher
- SPRINGER
- Keywords
- Tertiary hash tree; Extendible hash; Content-based; Image retrieval; Multidimensional data
- Citation
- MULTIMEDIA TOOLS AND APPLICATIONS, v.61, no.1, pp.51 - 68
- Indexed
- SCIE
SCOPUS
- Journal Title
- MULTIMEDIA TOOLS AND APPLICATIONS
- Volume
- 61
- Number
- 1
- Start Page
- 51
- End Page
- 68
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/107047
- DOI
- 10.1007/s11042-010-0687-8
- ISSN
- 1380-7501
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Electrical Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.