论文信息 - An Efficient Data Structure for Storing Similar Binary Images

An Efficient Data Structure for Storing Similar Binary Images

Based on the overlapping concept, this paper defines an efficient data structure, called the common-component binary tree (CCBT), to hold the linear quadtrees corresponding to a set of similar binary images. This structure removes the redundant information among the linear quadtrees. The processing time required by the operations on the CCBT structure is only proportional to the number of involved nodes in a specified linear quadtree. Additionally, there is a high storage space reduction for storing the similar images based on the CCBT structure.

Chin-Chen Chang | Yung-Kuan Chan | Chinchen Chang | Y. Chan

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

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

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

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

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

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

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

[8] Wen-Chung Chiang,et al. OPTIC DISK LOCATING OF THE RETINAL FUNDUS IMAGES USING SIMPLE STATISTIC PARAMETERS , .

[9] Ren-Hao Pan,et al. NTMG (N-terminal Truncated Mutants Generator for cDNA): an automatic multiplex PCR assays design for generating various N-terminal truncated cDNA mutants , 1996, Environmental health perspectives.

[10] Chinchen Chang,et al. A Fast Filter for Image Retrieval Based on Color-Spatial Features , 2000 .

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