Differential compression and optimal caching methods for content-based image search systems

Compression and caching are two important issues for a large on-line image server. In this paper, we propose a new approach to compression by exploring similarity in large image archives. An adaptive vector quantization approach using content categorizations, including both the semantic level and the feature level, is developed to provide a differential compression scheme. We show that this scheme is able to support flexible and optimal caching strategies. The experimental results demonstrate that the proposed technique can improve the compression rate by about 20 percent compared to JPEG compression, and can improve the retrieval response by 5 percent to 20 percent under different typical access scenarios.

[1]  Teuvo Kohonen,et al.  Things you haven't heard about the self-organizing map , 1993, IEEE International Conference on Neural Networks.

[2]  M. Lew,et al.  Webcrawling Using Sketches , 1997 .

[3]  Bhaskar Ramamurthi,et al.  Classified Vector Quantization of Images , 1986, IEEE Trans. Commun..

[4]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[5]  Shih-Fu Chang,et al.  Visually Searching the Web for Content , 1997, IEEE Multim..