Bitwise Structured Prediction Model for Lossless Image Coding

In this paper, we propose the bitwise structured prediction model for the loss less image coding. The prediction problem is handled by decomposing into a series of bitwise prediction problems, where max margin estimation is made for each bit. Furthermore, the structured prediction is proposed for combining such bitwise problems with constraints on their interrelationship and loss function for loss-augmented inference. The proposed methods tend to utilize the inherent dependencies existing in the bitplanes among the neighboring pixels and suppress the fluctuation led by the bitwise decomposition. When building the max margin Markov network for training, the upper bound for the prediction errors is shown to be asymptotically equivalent to the results obtained over the training set. Experimental results also show that the proposed method is superior in coding performance for regular oscillatory patterns.

[1]  Michael T. Orchard,et al.  Edge directed prediction for lossless compression of natural images , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[2]  M. Louargand,et al.  Managing risk in apartment development , 2002 .

[3]  Ben Taskar,et al.  Max-Margin Markov Networks , 2003, NIPS.

[4]  Ichiro Matsuda,et al.  Lossless coding using variable block-size adaptive prediction optimized for each image , 2005, 2005 13th European Signal Processing Conference.