Mehmet YAKUT

Fast image search on a VQ compressed image database

A fast and efficient image search method is developed for a compressed image database using vector quantization (VQ). An image search on an image database requires an exhaustive sequential scan of all the images, given the similarity measure. If compressed images are dealt with, images are decompressed as an initial operation and then the previously mentioned exhaustive search is performed using the predetermined similarity measure. If the images in the database are compressed using VQ, the image search process is reduced to codebook index match tests. A pixel by pixel similarity test of two images computationally costs too much. This bottleneck is overcome by using VQ, where the similarity test of the two image block is performed by a precalculated distortion lookup table. The same is valid for the object search in the image database. The object image is vector quantized first; then the index map of the object image is scanned over the entire index area of the compressed image database. Significant image search speed gains on the VQ image database are obtained. Results show that the VQ compressed image search is faster than a sequential search, and compressed and decompressed JPEG search. Actual speed gain obtained here depends on the application area and required image quality for the database.

PDF

___

[1] Brent SW, Yuana CJ, Wei HI, Matthew DC. Object recognition in compressed imagery. Image Vision Comput 1998; 16: 337-352.
[2] Regentova E, Latifi S, Deng S. Image similarity estimation by processing compressed data. Image Vision Comput 2001; 19: 485-500.
[3] Bischof H, Wildenauer H, Leonardis A. Illumination insensitive recognition using eigenspaces. Comput Vis Image Und 2004; 95: 86-104.
[4] Cerra D, Datcu M. A fast compression-based similarity measure with applications to content-based image retrieval. J Vis Com Image Rep 2012; 23: 293-302.
[5] Drew M, Au J. Video key frame production by efficient clustering of compressed chromaticity signatures. ACM Multimedia00, 30 Oct3 Nov 2000; Los Angeles, CA, USA: pp. 365-368.
[6] Osadchy M, Keren D. Efficient detection under varying illumination conditions and image plane rotations. Comput Vis Image Und 2004; 93: 245-259.
[7] Park SB, Lee JW, Kim SK. Content-based image classification using a neural network. Pattern Recogn Lett 2004; 25: 287-300.
[8] Jain AK. Image data compression; a review. IEEE 1981; 349-389. [9] Gersho A, Gray RM. Vector quantization and signal compression. Boston, MA, USA: Kluwer, 1992.
[10] Gray RM. Vector quantization. IEEE ASSP Mag 1984; 1: 4-29.
[11] Kunt M, Ikonomopoulos A, Kocher M. Second generation image coding techniques. IEEE 1985; 73: 549-574.
[12] Barnes CF, Rizvi SA, Nasrabadi NM. Advances in residual vector quantization. IEEE T Image Proces 1996; 5: 226-262.
[13] Wang L, Goldberg M. Progressive image transmission using vector quantization in pyramid form. IEEE T Com 1989; 37: 1339-1349.
[14] Yakut M. Vector quantization using nonrectangular blocks. ISCIS XVI International Symposium of Computer and Information Sciences; 57 Nov 2001; Antalya, Turkey: pp. 229-234.
[15] Enireddy V, Reddi KK. A data mining approach for compressed medical image retrieval. Int J Comput App 2012; 52: 975-987.
[16] Sayood K. Introduction to Data Compression. San Francisco, CA, USA: Morgan Kaufman Publishing, 1996.
[17] Lim JS. 2-D Signal and Image Processing. Englewood Cliffs, NJ, USA: Prentice Hall, 1990.
[18] Porter R, Canagarajah N. A robust automatic clustering scheme for image segmentation using wavelets. IEEE T Image Proces 1996; 5: 662-665.
[19] Smith B, Rowe L. Algorithms for manipulating compressed images. IEEE Comput Graph 1993; 13: 34-42.
[20] Amani C, Mounir K, Amel BB. An improved image retrieval algorithm for JPEG2000 compressed images. ISSPIT2012; 1215 Dec, Vietnam, pp. 453-458.
[21] Pradyumna A, Sara G, Farine A. Retrieval of occluded images using DCT phase and region merging. ICIP 2012; 30 Sep3 Oct, Orlando, Florida, USA. pp. 2441-2444.
[22] Ephraim F, Shmuel W. Fast algorithms for the discrete cosine transform. IEEE T Sig Proces 1992; 40: 274-2193.