Hypergraph lossless image compression

Hypergraphs are a very powerful tool and can represent many problems. In this paper we define a new image representation based on hypergraphs. This representation conducts to a new lossless compression algorithm for images called HLC. We present the algorithm and give some experimental results proving its efficiency. Finally we show that this algorithm can be generalized to three-dimensional images and to parametric lossy compression.

[1]  Alain Bretto,et al.  Noise detection and cleaning by hypergraph model , 2000, Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540).

[2]  Alain Bretto,et al.  Introduction to Hypergraph Theory and Its Use in Engineering and Image Processing , 2004 .

[3]  Alain Bretto,et al.  Combinatorics and Image Processing , 1997, CVGIP Graph. Model. Image Process..

[4]  John G. Cleary,et al.  Unbounded Length Contexts for PPM , 1997 .

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

[6]  Dmitry A. Shkarin,et al.  PPM: one step to practicality , 2002, Proceedings DCC 2002. Data Compression Conference.