Lossless Image Compression Using Integer to Integer Wavelet Transforms
ICIP '97 Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 1 - Volume 1
CREW: Compression with Reversible Embedded Wavelets
DCC '95 Proceedings of the Conference on Data Compression
Embedded image coding using zerotrees of wavelet coefficients
IEEE Transactions on Signal Processing
Optimal prefix codes for sources with two-sided geometric distributions
IEEE Transactions on Information Theory
Optimal source codes for geometrically distributed integer alphabets (Corresp.)
IEEE Transactions on Information Theory
A low complexity and lossless frame memory compression for display devices
IEEE Transactions on Consumer Electronics
An image multiresolution representation for lossless and lossy compression
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
High performance scalable image compression with EBCOT
IEEE Transactions on Image Processing
The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS
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 new frame-recompression algorithm and its hardware design for MPEG-2 video decoders
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.01 |
Video frame memory compression has gained increased popularity in video processing ICs to save external memory storage size and reduce memory access bandwidth. This technique is especially important in portable devices where efficient use of energy is critical for the deployment of video applications. In this paper, we propose a low-complexity lossless image compression method that uses only a fraction of one line-buffer. The proposed method first employs integer wavelet transform (IWT), and then low-frequency coefficients prediction of each segment based on those from the segment in the line above, and last Golomb-Rice (GR) encoding to achieve low-cost and highly efficient compression. Simulation results demonstrate that the proposed method gives a compression ratio comparable with the existing state-of-the-art low-complexity methods while significantly lowering the internal memory cost and keeping the complexity low.