Compressing images of sparse histograms

Most single-frame single-band medical images, like CR, CT, and MR, are of a high nominal bit depth, which usually varies from 12 to 16 bits per pixel. The actual number of pixels' intensity levels found in those images may be smaller, than implied by the nominal bit depth, by an order of magnitude or even more. Furthermore, levels are distributed throughout almost all the entire nominal intensity range, i.e., the images have sparse histograms of intensity levels. Image compression algorithms are based on sophisticated assumptions as to characteristics of the images they process. Sparse histogram is clearly different from what is expected by lossless image compression algorithm, both in case of predictive and of transform coding. To improve the compression ratios of such images, a method of histogram packing was recently introduced. The method is found to be effective, however, the research was done for low bit depth images. In this paper, we investigate effects of packing histograms of high bit depth medical images. We analyze an off-line packing method and find it to be highly effective. The off-line packing requires the information, describing how to expand the histogram after decompressing an image, to be encoded along with the compressed image. We present an efficient method of encoding this information. Experiments are performed for CALIC, JPEG2000, and JPEG-LS. The effects of packing histograms on the compression ratios of tested algorithms are, for all the tested algorithms, very similar. The average compression ratio improvement obtained for the CR, CT, and MR images is about 15%, 42%, and 52% respectively.

[1]  R. F. Rice,et al.  Some practical universal noiseless coding techniques, part 2 , 1983 .

[2]  A.J. Pinho An online preprocessing technique for improving the lossless compression of images with sparse histograms , 2002, IEEE Signal Processing Letters.

[3]  P.J. Ausbeck The piecewise-constant image model , 2000, Proceedings of the IEEE.

[4]  Armando J. Pinho Preprocessing techniques for improving the lossless compression of images with quasi-sparse and locally sparse histograms , 2002, Proceedings. IEEE International Conference on Multimedia and Expo.

[5]  Armando J. Pinho A comparison of methods for improving the lossless compression of images with sparse histograms , 2002, Proceedings. International Conference on Image Processing.

[6]  Xiaolin Wu,et al.  Lossless compression of continuous-tone images via context selection, quantization, and modeling , 1997, IEEE Trans. Image Process..

[7]  Roman Starosolski Performance evaluation of lossless medical and natural continuous tone image compression algorithms , 2005, SPIE Optics + Optoelectronics.

[8]  Iso-Iec Jtc Sc Wg,et al.  FCD14495, lossless and near-lossless coding of continuous tone still images ({JPEG-LS}) , 1997 .

[9]  Antonio Ortega,et al.  Embedded image-domain compression using context models , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

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

[11]  Touradj Ebrahimi,et al.  Christopoulos: Thc Jpeg2000 Still Image Coding System: an Overview the Jpeg2000 Still Image Coding System: an Overview , 2022 .

[12]  Guillermo Sapiro,et al.  LOCO-I: a low complexity, context-based, lossless image compression algorithm , 1996, Proceedings of Data Compression Conference - DCC '96.

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

[14]  Guillermo Sapiro,et al.  The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS , 2000, IEEE Trans. Image Process..

[15]  Armando J. Pinho On the impact of histogram sparseness on some lossless image compression techniques , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[16]  A.J. Pinho,et al.  Why does histogram packing improve lossless compression rates? , 2002, IEEE Signal Processing Letters.