Abstract

Although subband and wavelet coding have been proved to be very efficient for lossy image compression, it is generally not possible to represent the output of most subband/wavelet filters by a limited number of bits and yet guarantee perfect reconstruction. This is a fundamental problem when applying subband and wavelet coding to lossless image compression. This paper presents a solution to this problem by an investigation of interpolative subband coding. Based on an evaluation of the decorrelation performance of some typical image interpolation techniques, a new interpolative coding algorithm has been proposed. The new algorithm has been shown to be superior to two related algorithms, the hierarchical interpolation algorithm and the recently published minimum entropy pyramid algorithm.

Full Text
Paper version not known

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 call

Disclaimer: 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.