Memory Efficient Set Partitionning in Hierarchical Tree (MESH) for Wavelet Image Compression
Himanshu Arora, Pushpendra Singh, Ekram Khan, Fay Ghani · 2006
This paper presents a memory efficient version of set partitioning in hierarchical tree (SPIHT). The proposed coder termed as memory efficient SPIHT (MESH), uses a single re-usable list instead of three continuously growing linked lists as in conventional SPIHT. The list is re-initialized at the beginning of each bit-plane (coding pass) and is exhausted within that bit-plane itself. Another feature of the proposed coder is that it uses a single pass for each bit-plane by merging the sorting and refinement passes of conventional SPIHT together. The reinitialization of the list in each bit-plane makes the proposed coder inherently error resilient. The performance of the proposed coder is measured in terms of coding efficiency and the worst case memory requirements for list entries in each bit-plane. The performance comparison with SPIHT shows that the proposed algorithm results in 50-70% memory saving while retaining a coding efficiency comparable to SPIHT.