Browse > Article

Indexing and Matching Scheme for Content-based Image Retrieval based on Extendible Hash  

Tak, Yoon-Sik (School of Electrical Engineering, Korea University)
Hwang, Een-Jun (School of Electrical Engineering, Korea University)
Publication Information
Journal of IKEEE / v.14, no.4, 2010 , pp. 339-345 More about this Journal
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.
Keywords
Hash; Image Retrieval; Range Search; Shape Feature; Image Indexing;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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
2 T. Sellis, N. Roussopoulos, and C. Faloutsos, "The R+-Tree: A dynamic index for multi-dimensional objects," In Proc. of the Int. Conference on Very Large Databases, 1987.
3 Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger, "The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles," SIGMOD Conference pp.322-331, 1990.
4 D.A. White and R. Jain, "Similarity indexing with the SS-Tree," In Proc. of the 12th International Conference on Data Engineering, pp.516-523,1996
5 N. Katayama and S. Satoh, "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.
6 Yianilos and Peter N, "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.
7 H.Wang, C.-S.Perng, "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.
8 Y. Tak and E. Hwang, "A Leaf Image Retrieval Scheme Based on Partial Dynamic Time Warping and Two-Level Filtering," CIT'07, pp. 663-638, Oct. 2007
9 Yoon-Sik Tak and Eenjun Hwang, "An indexing scheme for efficient camera angle invariant image retrieval," CIT'08, pp.143-148, 2008
10 Eamonn Keogh, Li Wei, Xiaopeng Xi, Sang-Hee lee and Michail Vlachos, "LB_Keogh supports exact indexing of shapes under rotation invariance with arbitrary representations and distance measures," VLDB'06, pp.882 - 893, 2006
11 E. Keogh and C. Ratanamahatana, "Exact indexing of dynamic time warping," Knowledge and Information Systems, Vol.7, pp. 358-386, 2005   DOI   ScienceOn
12 Shu Lin, M. Tamer Özsu, Vincent Oria and Raymond T. Ng, "An Extendible Hash for Multi-Precision Similarity Querying of Image Databases," VLDB'01, pp. 221 - 230, 2001