Enhancing the Color Set Partitioning in Hierarchical Tree (SPIHT) Algorithm Using Correlation Theory
M. Santhi and R. S.D. Wahida Banu
DOI : 10.3844/jcssp.2011.1204.1211
Journal of Computer Science
Volume 7, Issue 8
Problem statement: Efficient color image compression algorithm is essential for mass storage and the transmission of the image. The compression efficiency of the Set Partitioning in Hierarchical Tree (SPIHT) coding algorithm for color images is improved by using correlation theory. Approach: In this study the correlation between the color channels are used to propose the new algorithm. The correlation between the color channels are analyzed in various color spaces and the color space CIE-UVW in which the color channels are highly correlated is taken. The most correlated U channel is considered as base color and compressed by using the wavelet filter and the SPIHT algorithm. The linear approximation of the two of the color components (V and W) based on the primary color component U is used to code subordinate color components. The image is divided into N*N blocks in each color channels. The linear approximation coefficients are calculated for each block of the subordinate colors V and W as functions of the base color. Only these coefficients of each block are coded and send to the receiver along with the SPIHT coding of the base color. Results: By using this algorithm, a significant (4 dB mean value) Peak Signal to Noise Ratio (PSNR) improvement is obtained compared to the traditional coding scheme for the same compression rate and reduces the coding and decoding time. Also the proposed compression algorithm reduces the complexity in coding and decoding algorithms. Conclusion: This algorithm allows the reduction of complexity for both coding and decoding of color images. It is concluded that a significant PSNR gain and visual quality improvement is obtained. It is found that in color image coding, this algorithm is superior to the traditional de-correlation based methods and reduces the coding and decoding time.
© 2011 M. Santhi and R. S.D. Wahida Banu. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.