Improvement in Coding Time of Embedded Zero Wavelet Tree


As the coming era of digitized information. The Compression is one of the indispensable techniques to solve this problem. Quality and time are two important aspects. Achieving high quality necessarily requires higher degree of skill, sophisticated design tools, advancement. The EMBDDED ZEROTREE WAVELET (EZW) algorithm, as presented by J. Shapiro, is a simple yet powerful algorithm, in which bit-streams are generated in the order of their significance in containing the image information. The original EZW algorithm scans the entire wavelet decomposed image, at a stroke, during each pass. Improvement of quality results reduction in productivity and vice versa. Thus, optimality must be maintained between quality as well as productivity. This work presents a modified method for coding images using EZW method, which works on the principal of fragmentation of the colored image. The proposed method takes the smallest unit cell, generated from the wavelet decomposed image, to encode at a time .This makes the encoding times independent of the level of wavelet decomposition. This work shows advancement in the original work of unit embedded zero tree coding .This paper is based on encoding time for color image processing while the UEZW was totally based on grayscale image. Results show that the proposed algorithm is more efficient in performance, in terms of encoding times, as compared to the original algorithm.


    9 Figures and Tables

    Download Full PDF Version (Non-Commercial Use)