효과적인 이미지 검색을 위한 연장 해쉬 (Extendible hash) 기반 인덱싱 및 검색 기법
Indexing and Matching Scheme for Content-based Image Retrieval based on Extendible Hash
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
So far, many researches have been done to index high-dimensional feature values for fast content-based image 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 result with ‘high probability’ at the cost of accuracy. In this paper, we propose a new extendible hash-based indexing scheme for high-dimensional feature values. Our indexing scheme provides several advantages compared to the traditional high-dimensional index structures in terms of search performance and accuracy preservation. Through extensive experiments, we show that our proposed indexing scheme achieves outstanding performance.
Abstract
So far, many researches have been done to index high-dimensional feature values for fast content-based image 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 result with ‘high probability’ at the cost of accuracy. In this paper, we propose a new extendible hash-based indexing scheme for high-dimensional feature values. Our indexing scheme provides several advantages compared to the traditional high-dimensional index structures in terms of search performance and accuracy preservation. Through extensive experiments, we show that our proposed indexing scheme achieves outstanding performance.
참고문헌 (12)
- Eamonn Keogh, "LB_Keogh supports exact indexing of shapes under rotation invariance with arbitrary representations and distance measures", VLDB’06, pp.882~893 (2006)
- Yoon-Sik Tak, "An indexing scheme for efficient camera angle invariant image retrieval", CIT’08, pp.143~148 (2008)
- E.Keogh, "Exact indexing of dynamic time warping", Knowledge and Information Systems, 7, pp.358~386 (2005)
- Shu Lin, "An Extendible Hash for Multi-Precision Similarity Querying of Image Databases", VLDB’01, pp.221~230 (2001)
- Antonin Guttman, "R-trees:a dynamic index structure for spatial searching", Proceedings of the 1984 ACM SIGMOD international conference on Management of data, pp.47~57 (1984)
- T.Sellis, "The R+-Tree:A dynamic index for multi-dimensional objects", Proc.of the Int.Conference on Very Large Databases (1987)
- Norbert Beckmann, "The R*-Tree:An Efficient and Robust Access Method for Points and Rectangles", SIGMOD Conference, pp.322~331 (1990)
- D.A.White, "Similarity indexing with the SS-Tree", Proc.of the 12th International Conference on Data Engineering, pp.516~523 (1996)
- N.Katayama, "The SR-Tree:an index structure for high dimensional nearest neighbor queries", Iin Proc.of the ACM SIGMOD International Conference on Management of Data, pp.69~380 (1997)
- Yianilos, "Data structures and algorithms for nearest neighbor search in general metric spaces", Proc.of the fourth annual ACM-SIAM Symposium on Discrete algorithms, pp.311~321 (1993)
- H.Wang, "The S2-Tree:an index structure for subsequence matching of spatial objects", Iin Fifth Pacific-Asic Conference on Knowledge Discovery and Data Mining(PAKDD) (2001)
- Y.Tak, "A Leaf Image Retrieval Scheme Based on Partial Dynamic Time Warping and Two-Level Filtering", CIT’07, pp.663~638 (2007)