Fast indexing and searching strategies for feature-based image database systems

Because visual data require a large amount of memory and computing power for storage and processing, it is greatly de- sired to efficiently index and retrieve the visual information from im- age database systems. We propose efficient indexing and searching strategies for feature-based image database systems, in which un- compressed and compressed domain image features are employed. Each query or stored image is represented by a set of features extracted from the image. The weighted square sum error distance is employed to evaluate the ranks of retrieved images. Many fast clustering and searching techniques exist for the square sum error distance used in vector quantization (VQ), in which different features have identical weighting coefficients. In practice, different features may have different dynamic ranges and different importances, i.e., different features may have different weighting coefficients. We de- rive a set of inequalities based on the weighted square sum error distance and employ it to speed up the indexing (clustering) and searching procedures for feature-based image database systems. Good simulation results show the feasibility of the proposed ap- proaches. © 2005 SPIE and IS&T. (DOI: 10.1117/1.1866148)

[1]  Hans-Peter Kriegel,et al.  The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.

[2]  Jian-Kang Wu.  Content-Based Indexing of Multimedia Databases , 1997, IEEE Trans. Knowl. Data Eng..

[3]  Georgy L. Gimel'farb,et al.  On retrieving textured images from an image database , 1996, Pattern Recognit..

[4]  David B. Lomet,et al.  The hB-tree: a multiattribute indexing method with good guaranteed performance , 1990, TODS.

[5]  Ming-Kuei Hu,et al.  Visual pattern recognition by moment invariants , 1962, IRE Trans. Inf. Theory.

[6]  Shen-Chuan Tai,et al.  A fast Linde-Buzo-Gray algorithm in image vector quantization , 1998 .

[7]  Hans-Peter Kriegel,et al.  The pyramid-technique: towards breaking the curse of dimensionality , 1998, SIGMOD '98.

[8]  B. S. Manjunath,et al.  Texture Features for Browsing and Retrieval of Image Data , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Chang-Hsing Lee,et al.  High-speed closest codeword search algorithms for vector quantization , 1995, Signal Process..

[10]  K. Sung,et al.  A fast encoding algorithm for vector quantization , 1997, IEEE Signal Process. Lett..

[11]  Anil K. Jain,et al.  Shape-Based Retrieval: A Case Study With Trademark Image Databases , 1998, Pattern Recognit..

[12]  Sung-Hwan Jung,et al.  Image retrieval using texture based on DCT , 1997, Proceedings of ICICS, 1997 International Conference on Information, Communications and Signal Processing. Theme: Trends in Information Systems Engineering and Wireless Multimedia Communications (Cat..

[13]  A. Murat Tekalp,et al.  Shape similarity matching for query-by-example , 1998, Pattern Recognit..

[14]  Morton Nadler,et al.  Pattern recognition engineering , 1993 .

[15]  Mohan S. Kankanhalli,et al.  Shape Measures for Content Based Image Retrieval: A Comparison , 1997, Inf. Process. Manag..

[16]  Myron Flickner,et al.  Query by Image and Video Content , 1995 .

[17]  Dragutin Petkovic,et al.  Query by Image and Video Content: The QBIC System , 1995, Computer.

[18]  Christos Faloutsos,et al.  Access methods for text , 1985, CSUR.

[19]  Chin-Chen Chang,et al.  A fast LBG codebook training algorithm for vector quantization , 1998 .

[20]  C.-H. Lee,et al.  Fast closest codeword search algorithm for vector quantization , 1994 .

[21]  Timos K. Sellis,et al.  Spatio-temporal composition and indexing for large multimedia applications , 1998, Multimedia Systems.

[22]  Chou-Chen Wang,et al.  A fast encoding algorithm for vector quantization , 2005, IEICE Electron. Express.

[23]  Yihong Gong,et al.  Image indexing and retrieval based on color histograms , 1996, Multimedia Tools and Applications.

[24]  Anil K. Jain,et al.  Image retrieval using color and shape , 1996, Pattern Recognit..

[25]  Sethuraman Panchanathan,et al.  Review of Image and Video Indexing Techniques , 1997, J. Vis. Commun. Image Represent..

[26]  Ramin Zabih,et al.  Comparing images using color coherence vectors , 1997, MULTIMEDIA '96.

[27]  Sharad Mehrotra,et al.  The hybrid tree: an index structure for high dimensional feature spaces , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[28]  Rajiv Mehrotra,et al.  Similar-Shape Retrieval in Shape Data Management , 1995, Computer.

[29]  Caroline M. Eastman,et al.  Partially Specified Nearest Neighbor Searches Using k-d Trees , 1982, Inf. Process. Lett..

[30]  Michael J. Swain,et al.  Color indexing , 1991, International Journal of Computer Vision.

[31]  W. Bruce Croft,et al.  Implementing ranking strategies using text signatures , 1988, TOIS.

[32]  Shin'ichi Satoh,et al.  The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.

[33]  Michael Shneier,et al.  Exploiting the JPEG Compression Scheme for Image Retrieval , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[34]  Robert M. Haralick,et al.  Textural Features for Image Classification , 1973, IEEE Trans. Syst. Man Cybern..

[35]  Jeng-Shyang Pan,et al.  A new vector quantization image coding algorithm based on the extension of the bound for Minkowski metric , 1998, Pattern Recognit..

[36]  Jaeho Lee,et al.  A filtering method for k-nearest neighbor query processing in multimedia data retrieval applications , 1999, Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030).