An Efficient Adaptive Binary Arithmetic Coder With Low Memory Requirement

Belyaev, Evgeny; Turlikov, Andrey; Егиазарян, Карен; Gabbouj, Moncef

doi:10.1109/jstsp.2013.2269272

Cited by 16 publications

(15 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The context modeling in CABAC divides the syntax elements into several non-stationary binary sources with different statistical properties [21]. The probability of each non-stationary binary source is estimated by M-coder [22] through one state machine.…”

Section: Probability Estimator In Binary Arithmetic Coding Enginementioning

confidence: 99%

An enhanced entropy coding scheme for HEVC

Gao

Fan

Zhao

et al. 2016

Signal Processing: Image Communication

View full text Add to dashboard Cite

This paper presents a modification to Context-based Adaptive Binary Arithmetic Coding (CABAC) in High Efficiency Video Coding (HEVC), which includes an improved context modeling for transform coefficient levels and a binary arithmetic coding (BAC) engine with low memory requirement. In the improved context modeling for transform coefficient levels, the context model index for significance map is dependent on the number of the significant neighbors covered by a local template and its position within transform block (TB). To limit the total number of context models for significance map, TBs are split into different regions based on the coefficient position. The same region in different TBs shares the same context model set. For the first and second bins of the truncated unary scheme of absolute level minus one, their context model indices depend on the neighbors covered by a local template of the current transform coefficient level. Specifically, the context model index for the first bin is determined by the number of neighbors covered by the local template with absolute magnitude equal to 1 and larger than 1; for the second bin, its context model index is determined by the number of neighbors covered by the local template with absolute magnitude larger than 1 and larger than 2. Moreover, TB is also split into different regions to incorporate the coefficient position in the context modeling of the first bin in luma component. In the BAC engine with low memory requirement, the probability is estimated based on a multi-parameter probability update mechanism, in which the probability is updated with two different adaption speeds and use the average as the estimated probability for the next symbol.

show abstract

Section: Probability Estimator In Binary Arithmetic Coding Enginementioning

confidence: 99%

An enhanced entropy coding scheme for HEVC

Gao

Fan

Zhao

et al. 2016

Signal Processing: Image Communication

View full text Add to dashboard Cite

show abstract

“…The estimation of is commonly carried out by context-adaptive mechanisms and probability models. Our coder uses a variablesize sliding window [4] that utilizes between and symbols except at the beginning of coding. This technique has been devised to minimize computational costs without affecting coding efficiency.…”

Section: A Low-complexity Codingmentioning

confidence: 99%

“…As depicted in Fig. 1, when the window is reduced to symbols and the number of zeroes within the window is updated according to (4) with being the number of zeroes coded during the first symbols of the window.…”

Section: A Low-complexity Codingmentioning

confidence: 99%

“…We note that other mechanisms of probability estimation such as [4], that avoids the use of an integer division, might also be employed. Empirical evidence indicates that (3) increases only slightly the complexity of the coder.…”

Section: A Low-complexity Codingmentioning

confidence: 99%

“…Standards of video coding such as H.264/AVC and HEVC employ variants of the M coder [3], which was introduced in the 2000s employing a reduced range of possible subinterval sizes together with LUTs. Among others, enhancements to the M coder have been proposed in [4].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Context-Adaptive Binary Arithmetic Coding With Fixed-Length Codewords

Aulí-Llinàs

2015

IEEE Trans. Multimedia

View full text Add to dashboard Cite

Context-adaptive binary arithmetic coding is a widespread technique in the field of image and video coding. Most state-of-the-art arithmetic coders produce a (long) codeword of a priori unknown length. Its generation requires a renormalization procedure to permit progressive processing. This paper introduces two arithmetic coders that produce multiple codewords of fixed length. Contrary to the traditional approach, the generation of fixed-length codewords does not require renormalization since the whole interval arithmetic is stored in the coder's internal registers. The proposed coders employ a new context-adaptive mechanism based on variable-size sliding window that estimates with high precision the probability of the symbols coded. Their integration in coding systems is straightforward as demonstrated within the framework of JPEG2000. Experimental tests indicate that the proposed coders are computationally simpler than the MQ coder of JPEG2000 and the M coder of HEVC while achieving superior coding efficiency.Index Terms-Context-adaptive binary arithmetic coding, fixedlength arithmetic codes.

show abstract

Adaptive Window Size Selection for Efficient Probability Estimation in Binary Range Coder of the 3-D DWT Video Codec

Belyaev

2014

Multiple Access Communications

View full text Add to dashboard Cite

An Efficient Adaptive Binary Arithmetic Coder With Low Memory Requirement

Cited by 16 publications

References 24 publications

An enhanced entropy coding scheme for HEVC

An enhanced entropy coding scheme for HEVC

Context-Adaptive Binary Arithmetic Coding With Fixed-Length Codewords

Adaptive Window Size Selection for Efficient Probability Estimation in Binary Range Coder of the 3-D DWT Video Codec

Contact Info

Product

Resources

About