Adaptive storage and retrieval of large compressed images

Enabling the efficient storage, access and retrieval of large volumes of multidimensional data is one of the important emerging problems in databases. We present a framework for adaptively storing, accessing, and retrieving large images. The framework uses a space and frequency graph to generate and select image view elements for storing in the database. By adapting to user access patterns, the system selects and stores those view elements that yield the lowest average cost for accessing the multiresolution subregion image views. The system uses a second adaptation strategy to divide computation between server and client in progressive retrieval of image views using view elements. We show that the system speeds-up retrieval for access and retrieval modes, such as drill-down browsing and remote zooming and panning, and minimizes the amount of data transfer over the network.

[1]  Ambuj K. Singh,et al.  Browsing and placement of multiresolution images on secondary storage , 1997, Proceedings of IEEE International Conference on Multimedia Computing and Systems.

[2]  Ronald R. Coifman,et al.  Entropy-based algorithms for best basis selection , 1992, IEEE Trans. Inf. Theory.

[3]  John R. Smith,et al.  Dynamic assembly of views in data cubes , 1998, PODS '98.

[4]  Shih-Fu Chang,et al.  Joint adaptive space and frequency basis selection , 1997, Proceedings of International Conference on Image Processing.

[5]  Daniel Andresen,et al.  Dynamic processor scheduling with client resources for fast multi-resolution WWW image browsing , 1997, Proceedings 11th International Parallel Processing Symposium.

[6]  Meir Feder,et al.  Image compression via improved quadtree decomposition algorithms , 1994, IEEE Trans. Image Process..