article · 2011
Reduced-complexity entropy coding of transform coefficient levels using truncated golomb-rice codes in video compression
Tung Nguyen, Detlev Marpe, Heiko Schwarz, Thomas Wiegand
Cited by 16Abstract and details only
Abstract
In hybrid video coding, the difference between the intra or inter prediction signal and the original signal is transmitted using block-based transform coding. The state-of-the-art in coding the quantized transform coefficients is the approach specified in H.264/AVC for context-adaptive binary arithmetic coding. It has, however, been shown that the number of binary symbols that have to be arithmetically coded for the transform coefficients can become very large, making the concept less attractive for high rate applications. To overcome this issue, we propose a combination of simple variable-length codes and context-adaptive binary coding, which yields the same coding efficiency as the H.264/AVC transform coefficient coding at a lower complexity level and which has been adopted into the HEVC test model (HM).
Cite this paper
Nguyen, T., Marpe, D., Schwarz, H., & Wiegand, T. (2011). Reduced-complexity entropy coding of transform coefficient levels using truncated golomb-rice codes in video compression. https://doi.org/10.1109/icip.2011.6116664
Nguyen, Tung, et al. “Reduced-complexity entropy coding of transform coefficient levels using truncated golomb-rice codes in video compression.” 2011, pp. 753–56, https://doi.org/10.1109/icip.2011.6116664.
Nguyen, Tung, Detlev Marpe, Heiko Schwarz, and Thomas Wiegand. 2011. “Reduced-complexity entropy coding of transform coefficient levels using truncated golomb-rice codes in video compression.” https://doi.org/10.1109/icip.2011.6116664.
Nguyen, T. et al. (2011) ‘Reduced-complexity entropy coding of transform coefficient levels using truncated golomb-rice codes in video compression’. Available at: https://doi.org/10.1109/icip.2011.6116664.
@article{nguyen2011reduced,
title = {{Reduced-complexity entropy coding of transform coefficient levels using truncated golomb-rice codes in video compression}},
author = {Nguyen, Tung and Marpe, Detlev and Schwarz, Heiko and Wiegand, Thomas},
pages = {753--756},
year = {2011},
doi = {10.1109/icip.2011.6116664}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Research of Data Compression Using Huffman Coding and Arithmetic Coding
Xia Zhu, Jing Zhang, Hongbo Zhu · Lecture notes in electrical engineering · 2022
Cited by 2
Dense coding-a fast alternative to arithmetic coding
Urs Graf · Compression and Complexity of Sequences (SEQUENCES) · 2002
Cited by 3
Bit-Precision Method for Low Complex Lossless Image Coding
Jong Woo Won, Hyun Soo Ahn, Wook Joong Kim et al. · Lecture notes in computer science · 2005
Cited by 3
Binary combinatorial coding
Vito Dai, Avideh Zakhor · DCC · 2003
Cited by 11
Combination coding: a new entropy coding technique
Roger Fawcett · DCC · 1996
Cited by 2
Compaction of color images with arithmetic coding
Masahiro Iwahashi, S. Masuda · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1991
Cited by 0
Arithmetic coding-an alternative VLC strategy for video coding
G.R. Seabrook · 1989
Cited by 0
Metode entropijskog kodiranja
Mario Ožuška · 2016
Cited by 0