A finite mixture model of geometric distributions for lossless image compression

In this paper, we proposed a new geometric finite mixture model-based adaptive arithmetic coding (AAC) for lossless image compression. Applying AAC for image compression, large compression gains can be achieved only through the use of sophisticated models that provide more accurate probabilistic descriptions of the image. In this work, we proposed to divide the residual image into non-overlapping blocks, and then we model the statistics of each block by a mixture of geometric distributions of parameters estimated through the maximum likelihood estimation using the expectation–maximization algorithm. Moreover, a histogram tail truncation method within each predicted error block is used in order to reduce the number of symbols in the arithmetic coding and therefore to reduce the effect of the zero-occurrence symbols. Experimentally, we showed that using convenient block size and number of mixture components in conjunction with the prediction technique median edge detector, the proposed method outperforms the well known lossless image compressors.

[1]  Nasir D. Memon,et al.  CALIC-a context based adaptive lossless image codec , 1996, 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings.

[2]  Sartaj Sahni,et al.  Efficient Algorithms for Lossless Compression of 2D/3D Images , 1999, VISUAL.

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

[4]  Geoffrey J. McLachlan,et al.  Finite Mixture Models , 2019, Annual Review of Statistics and Its Application.

[5]  William Puech,et al.  An improved lossless image compression based arithmetic coding using mixture of non-parametric distributions , 2014, Multimedia Tools and Applications.

[6]  Mohamed Salim Bouhlel,et al.  Efficient adaptive arithmetic coding based on updated probability distribution for lossless image compression , 2010, J. Electronic Imaging.

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

[8]  Ichiro Matsuda,et al.  A lossless coding scheme using adaptive predictors and arithmetic code optimized for each image , 2007 .

[9]  G. Schwarz Estimating the Dimension of a Model , 1978 .

[10]  Nobutaka Kuroki,et al.  Adaptive arithmetic coding for image prediction errors , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[11]  Jian-Jiun Ding,et al.  Modified Golomb coding algorithm for asymmetric two-sided geometric distribution data , 2012, 2012 Proceedings of the 20th European Signal Processing Conference (EUSIPCO).

[12]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[13]  Ian H. Witten,et al.  Arithmetic coding for data compression , 1987, CACM.

[14]  Shigeru Yoshida,et al.  Development of an XML-document compaction method to improve data-processing performance , 2007 .

[15]  Michael W. Marcellin,et al.  JPEG2000 - image compression fundamentals, standards and practice , 2013, The Kluwer international series in engineering and computer science.

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

[17]  Louis Vuurpijl,et al.  Using Pen-Based Outlines for Object-Based Annotation and Image-Based Queries , 1999, VISUAL.

[18]  Atef Masmoudi,et al.  A new arithmetic coding model for a block-based lossless image compression based on exploiting inter-block correlation , 2015, Signal Image Video Process..