Memory efficient set partitionning in hierarchical tree for color image coding

In this paper, a memeory, efficient version Color SPIHT with enhanced features is presented The proposed coder termed as Color Memory Efficient SPIHT (CMESH) extends the use of set partitioning in hierarchical tree to color images. The exciting feature of the algorithm is that it uses a single re-usable list instead of three continuously growing linked lists as in conventional CSPIHT The list is re-initialized according in the beginning of each coding passes and is exhausted within that pass itself Besides, these passes being independent of each other anti simple linking between chrominance and luminance allow offsets for chrominance & hence comes later in the initialization of list. The performance of the proposed coder is measured in terms of coding efficiency and maximum memory requirement due to list entries in each bit-plane. The performance is compared with that of CSPIHT It Is observed that the proposed algorithm results in saving of 50-70% memory, while having comparable coding efficiency.