论文信息 - Block image retrieval based on a compressed linear quadtree

Block image retrieval based on a compressed linear quadtree

Based on a compressed linear quad tree, a data structure is proposed which is more than a structure to compress a gray-level or color image, but a structure, which can be applied to retrieve a block image. This compressed linear quadtree may directly extract a detailed block image without decompressing the compressed data of the original image.

Yung-Kuan Chan

[1] Tsong Wuu Lin,et al. Set operations on constant bit-length linear quadtrees , 1997, Pattern Recognit..

[2] Yannis Manolopoulos,et al. Efficiency Analysis of Overlapped Quadtrees , 1995, Nord. J. Comput..

[3] Hanan Samet,et al. The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[4] I. P. Stewart. Quadtrees: Storage and Scan Conversion , 1986, Comput. J..

[5] Charles R. Dyer,et al. The space efficiency of quadtrees , 1982, Comput. Graph. Image Process..

[6] Yannis Manolopoulos,et al. Overlapping quadtrees for the representation of similar images , 1993, Image Vis. Comput..

[7] Irene Gargantini,et al. An effective way to represent quadtrees , 1982, CACM.

[8] Tsong Wuu Lin. Compressed quadtree representations for storing similar images , 1997, Image Vis. Comput..

[9] Chin-Chen Chang,et al. An Efficient Data Structure for Storing Similar Binary Images , 2001, FODO.