Embedded Zero Tree – Algorithm for Image Coding
In the present digital world, we manage and store different types of data like video,music,images, text files etc digitally in our computers which basically are digital systems. In the case of storing any media type we always look forward to minimum size and maximum quality. When we consider the case of storing an image, we always adopt a “compress and store” algorithm, in which the image is first compressed to reduce the space occupied by the image using compression algorithms and then the data is written into the memory for storage. There are already many algorithms available for image compression and storing and they are being used based on the application and importance of the data. Embedded Zero tree Wavelet (EZW) algorithm is an efficient compression algorithm which is comparatively a newcomer in the field of image coding.
INTRODUCTION
EZW algorithm is a lossy compression
algorithm in which bits are generated in a bit stream, according to
their importance. The EZW encoder calculates a best suited threshold value for compress the still image at a specific decomposition level, followed by multilevel decomposition steps using this threshold. Normally the threshold ranges from 6 to 60, for a decomposition level of 8
Fig: Example for a three level wavelet decomposed image