Adaptive Golomb Code for Joint Geometrically Distributed Data and Its Application in Image Coding

This paper proposes joint-probability-based adaptive Golomb coding (JPBAGC) to improve the performances of the Golomb family of codes, including Golomb coding (GC), Golomb–Rice coding (GRC), exp-Golomb coding (EGC), and hybrid Golomb coding (HGC), for image compression. The Golomb family of codes is ideally suited to the processing of data with geometric distribution. Since it does not require a coding table, it has higher coding efficiency than Huffman coding. In this paper, we find that there are many situations in which the probability distribution of data is not only geometric, but also depends on the probability distribution of the other data. Accordingly, we used the joint probability of generalizing the Golomb family of codes and exploiting the dependence between neighboring image data. The proposed JPBAGC improves the efficiency of many image and video compression standards, such as the joint photographic experts group (JPEG) compression scheme and the H.264-intra JPEG-based image coding system. Simulation results demonstrate the superior coding efficiency of the proposed scheme over those of Huffman coding, GC, GRC, EGC, and HGC.

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

[2]  David C. van Voorhis,et al.  Optimal source codes for geometrically distributed integer alphabets (Corresp.) , 1975, IEEE Trans. Inf. Theory.

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

[4]  Jukka Teuhola,et al.  A Compression Method for Clustered Bit-Vectors , 1978, Inf. Process. Lett..

[5]  Gadiel Seroussi,et al.  On adaptive strategies for an extended family of Golomb-type codes , 1997, Proceedings DCC '97. Data Compression Conference.

[6]  Khalid Sayood,et al.  Introduction to Data Compression , 1996 .

[7]  Henrique S. Malvar Adaptive run-length/Golomb-Rice encoding of quantized generalized Gaussian sources with unknown statistics , 2006, Data Compression Conference (DCC'06).

[8]  Youzhi Xu,et al.  Hybrid Golomb codes for a group of quantised GG sources , 2003 .

[9]  K.R. Rao,et al.  Modified Advanced Image Coding , 2008, 2008 First International Conference on Complexity and Intelligence of the Artificial and Natural Complex Systems. Medical Applications of the Complex Systems. Biomedical Computing.

[10]  Robert F. Rice,et al.  Some practical universal noiseless coding techniques , 1979 .

[11]  M. Klimesh,et al.  Generalized Golomb Codes and Adaptive Coding of Wavelet-Transformed Image Subbands , 2003 .

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

[13]  Padhraic Smyth,et al.  A High-Speed Distortionless Predictive Image-Compression Scheme , 1990 .

[14]  Ajay Luthra,et al.  Overview of the H.264/AVC video coding standard , 2003, IEEE Trans. Circuits Syst. Video Technol..

[15]  Gary J. Sullivan,et al.  Rate-constrained coder control and comparison of video coding standards , 2003, IEEE Trans. Circuits Syst. Video Technol..

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

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

[18]  D. Bardone,et al.  Adaptive Golomb Codes For Level Binarization In The H.264/AVC FRExt Lossless Mode , 2008, 2008 IEEE International Symposium on Signal Processing and Information Technology.

[19]  Neri Merhav,et al.  Optimal prefix codes for sources with two-sided geometric distributions , 2000, IEEE Trans. Inf. Theory.

[20]  Susanto Rahardja,et al.  Bit-plane Golomb coding for sources with Laplacian distributions , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..

[21]  Joan L. Mitchell,et al.  JPEG: Still Image Data Compression Standard , 1992 .

[22]  Detlev Marpe,et al.  H.264/MPEG4-AVC fidelity range extensions: tools, profiles, performance, and application areas , 2005, IEEE International Conference on Image Processing 2005.

[23]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[24]  Roman Starosolski,et al.  Modified Golomb-Rice Codes for Lossless Compression of Medical Images , 2003 .