Abstract
This paper presents a listless variant of modified wavelet block tree coding (MLBTC) algorithm. Wavelet block-tree coding (WBTC) improves the image compression performance of set partitioning in hierarchical trees (SPIHT) at lower rates by efficiently encoding both inter- and intra-scale correlations. The use of auxiliary lists makes WBTC undesirable for hardware implementation as it needs a lot of memory management due to exponential increase of nodes on each pass. The proposed coder named as hierarchical listless block-tree DTT (HLBT_DTT) that combines discrete Tchebichef transform (DTT) with MLBTC exhibits compression performance significantly higher than most of the DCT-based embedded coders and comparable with JPEG 2000, especially at lower bit rates. Further, HLBT_DTT requires only 10% of memory than that of DCT-based SPIHT/WBTC coders.
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.
