Block-based adaptive lossless image coder

With an exponential growth in the use of digital documents and photographic and medical images, the interest in lossless image compression has increased. Coders, such as CALIC and JPEG-LS, using context modeling have raised the bar on achievable compression performance. However, the computation required for these coders is significant and naturally serial. Parallelizable and compute efficient compression and decompression algorithms have attractive features such as cost effective hardware and scalable software implementations. Hence, we propose a compute friendly, parallel algorithm for image compression with compression performance comparable to that of the state-of-the-art schemes. Furthermore, we also show that the proposed method is applicable to interframe lossless coding for image sequences such as medical, graphical, and video contents.

[1]  Parthasarathy Sriram,et al.  Computationally efficient lossless image coder , 1999, Electronic Imaging.

[2]  Michael W. Marcellin,et al.  Lossy and lossless image compression using reversible integer wavelet transforms , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[3]  Nasir D. Memon,et al.  Context-based, adaptive, lossless image coding , 1997, IEEE Trans. Commun..

[4]  J. Rissanen,et al.  Applications of universal context modeling to lossless compression of gray-scale images , 1995 .

[5]  Solomon W. Golomb,et al.  Run-length encodings (Corresp.) , 1966, IEEE Trans. Inf. Theory.

[6]  Ahmad Zandi,et al.  CREW: Compression with Reversible Embedded Wavelets , 1995, Proceedings DCC '95 Data Compression Conference.

[7]  Khalid Sayood,et al.  Lossless image compression: a comparative study , 1995, Electronic Imaging.

[8]  R. F. Rice,et al.  Algorithms for a very high speed universal noiseless coding module , 1991 .

[9]  S. Golomb Run-length encodings. , 1966 .