Ten lectures on wavelets
Arithmetic coding for data compression
Communications of the ACM
A simple and efficient hierarchical image coder
ICIP '97 Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 3 - Volume 3
SBHP-a low complexity wavelet coder
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04
Embedded image coding using zerotrees of wavelet coefficients
IEEE Transactions on Signal Processing
Optimal pruning with applications to tree-structured source coding and modeling
IEEE Transactions on Information Theory
An embedded still image coder with rate-distortion optimization
IEEE Transactions on Image Processing
High performance scalable image compression with EBCOT
IEEE Transactions on Image Processing
Image coding using wavelet transform
IEEE Transactions on Image Processing
Multirate 3-D subband coding of video
IEEE Transactions on Image Processing
A new, fast, and efficient image codec based on set partitioning in hierarchical trees
IEEE Transactions on Circuits and Systems for Video Technology
A two-layered wavelet-based algorithm for efficient lossless and lossy image compression
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
This paper describes a highly scalable hybrid image coding scheme (HS-HIC). The proposed hybrid coding scheme combines simply modification of the data in the wavelet domain and the high performance of the set partitioning in hierarchical trees (SPIHT) coding. The modification of the subband image data is done based on the transformation of the high-frequency subband (details) in the wavelet domain. It is based on linear modification of 9-subband image data within three-layer in the wavelet domain. Except the image data in LL3, all other image data will be linearly modified based on the discrete Fourier transform (DFT) components. The modification process provides a new subband image data containing almost the same information as the original one but having a smaller frequency spectrum. The modified data is then located in the corresponding position and the simple SPIHT coder followed by adaptive arithmetic coder is applied on the resulting hierarchical representation to generate the symbol stream. Simulation results demonstrate that, with small addition in the computational complexity of the coding process, the PSNR performance of the proposed algorithm is much higher than that of the SPIHT test coder and some of famous image coding techniques.