Abstract
We propose a new approach to image compression based on the principle of Shapiro's embedded zero-tree wavelet (EZW) algorithm. Our approach, the efficient EZW (E-EZW), uses six symbols instead of the four used in the original Shapiro's algorithm to minimize the redundant symbols, and optimizes the coding by binary regrouping of the information. This approach can produce results that have a significant improvement over the peak signal-to-noise ratio and compression ratio obtained by Shapiro without affecting the computing time. These results are also comparable to those obtained using the set partitioning in hierarchical trees (SPIHT), set partitioning embedded block (SPECK), and JPEG2000 algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
