Abstract
A lossless image compression algorithm based on adaptive subband decomposition is proposed. The subband decomposition is achieved by a two-channel LMS adaptive filter bank. The resulting coefficients are lossy coded first, and then the residual error between the lossy and error-free coefficients is compressed. The locations and the magnitudes of the nonzero coefficients are encoded separately by an hierarchical enumerative coding method. The locations of the nonzero coefficients in children bands are predicted from those in the parent band. The proposed compression algorithm, on the average, provides higher compression ratios than the state-of-the-art methods.
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.
