Region-adaptive probability model selection for the arithmetic coding of video texture

In video coding systems using adaptive arithmetic coding to compress texture information, the employed symbol probability models need to be retrained every time the coding process moves into an area with different texture. To avoid this inefficiency, we propose to replace the probability models used in the original coder with multiple switchable sets of probability models. We determine the model set to use in each spatial region in an optimal manner, taking into account the additional signaling overhead. Experimental results show that this approach, when applied to H.264/AVC's context-based adaptive binary arithmetic coder (CABAC), yields significant bit-rate savings, which are comparable to or higher than those obtained using alternative improvements to CABAC previously proposed in the literature.

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

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

[3]  Marek Domanski,et al.  Improved context-adaptive arithmetic coding in H.264/AVC , 2009, 2009 17th European Signal Processing Conference.

[4]  E. Belyaev,et al.  Binary Arithmetic Coding System with Adaptive Probability Estimation by "Virtual Sliding Window" , 2006, 2006 IEEE International Symposium on Consumer Electronics.

[5]  Mihaela van der Schaar,et al.  Arithmetic coding with adaptive context-tree weighting for the H.264 video coders , 2004, IS&T/SPIE Electronic Imaging.

[6]  Heiko Schwarz,et al.  Context-based adaptive binary arithmetic coding in the H.264/AVC video compression standard , 2003, IEEE Trans. Circuits Syst. Video Technol..