Image compression based on p-tree

Many mature approaches to lossy compression of digital image have been proposed. In this paper, we present a novel lossless compression approach to digital image based on p-tree^[1]. We apply our algorithm to encode and decode 2 randomly selected images using VC. The experimental results demonstrate that the approach based on p-tree is efficient in compressing the binary images corresponding to the significant bits in the bytes. What´s more, the principle of the encoding and decoding is very simple and the operation is timesaving.