A compact improved quadtree representation with image manipulations

被引：9

作者：

Yang, YH

Chung, KL

Tsai, YH

机构：

[1] Natl Taiwan Univ Sci & Technol, Dept Informat Management, Taipei 10672, Taiwan

[2] Natl Taiwan Univ Sci & Technol, Inst Informat Engn, Taipei 10672, Taiwan

来源：

IMAGE AND VISION COMPUTING | 2000年 / 18卷 / 03期

关键词：

constant bit-length linear quadtree; entropy coding; geometric operations; JBIG; quadtree; set operations; spatial data structures;

D O I：

10.1016/S0262-8856(99)00014-1

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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-36.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 operations 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. (C) 2000 Elsevier Science Publishers B.V. All rights reserved.

引用

页码：223 / 231

页数：9

共 13 条

[1]

[Anonymous], 1976, COMPUT VISION GRAPH, DOI DOI 10.1016/S0146-664X(76)80006-8

[2]

BELL TC, 1990, ADV REFERENCE SERIES

[3] AN EFFECTIVE WAY TO REPRESENT QUADTREES [J].