Image compression using fixed length quadtree coding

Abstract

Image compression is a process of efficiently coding digital images to reduce the number of bits required in representing an image. We propose an effective lossless image compression by eliminating the spatial redundancy and temporal redundancy. The spatial redundancy is grouped with the quadtree structure, and the temporal redundancy is eliminated by our tree coding. The quadtree of the image is constructed while an image is given. Then the breadth first search is applied to encode the quadtree. In our coding scheme, it is only necessary to store the internal nodes. The code of an internal node depends on the type of node of its children. Seven bits are used to represent an internal node. Therefore the number of bits needed to store an image is proportional to the number of internal nodes in the corresponding quadtree.