Based on some observations on quadtrees, this paper first presents two improved representations for the linear quadtree and DF-expression. Then, we present three improved representations for the S-tree, bincodes, and logical bincodes. Some experiments are carried out to evaluate the performance of the five proposed improved representations and the existing corresponding representations. Experimental results show that all the proposed improved representations have better compression ratios when compared to the existing ones. Especially, the improved representations for the linear quadtree, bincodes, and logical bincodes have some significant compression performance. Finally, a few image manipulations, such as area calculation, centroid calculation, and set operations, on the proposed improved representations are discussed.
|Number of pages||11|
|Publication status||Published - 1999 May 1|
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science Applications
- Artificial Intelligence