Lineal Digital Search Tree Encoding for Regional Representation
Zhou Dongru and Jiang HaitaoCAD Laboratory, Institute of Computing Technology, Academia Sinica, Beijing, 100080 Department of Computer and Electronic Engineering, Wuhan Institute of Hydraulic and Electrical Engineering, 430072
In this paper, we put forward a region representation data structure-digital search tree(DST) and its lineal encoding (LDST). According to the digital compress formula in the worst case of square regional image given here, data can be effciently compressed using LDST when the resolution of image is high. The conversion algorithm between LDST and linear quadtree and its time complexity analysis are also studied at the end of the paper.