A compact improved quadtree representation with image manipulations

摘要

In this paper, a new and compact improved quadtree (compact-IQ) representation is presented for representing binary images. Then, efficient set operations on compact-IQs are also presented. Some experimentations are carried out to demonstrate the memory-efficiency and computational advantages of the proposed method. The experimental results reveal that the proposed image representation has 11.04-18.80 compression improvement and 24.39-26.94 computation-time improvement for set operations when compared to the recently published method on the constant bit-length linear quadtrees (CBLQ) (T.W.Lin, Set operation on constant bit-length linear quadtrees, Pattern Recognition 30(7) (1997)1239-1249). In addition, geometric operations (area and centroid) on the compact-IQ and the performance comparison with JBIG are also investigated.