期刊文献+

H.264中CAVLC算法改进

The improvement of CAVLC algorithm in H.264
下载PDF
导出
摘要 简要分析了H.264中的上下文自适应变长编码(CAVLC),并研究其采用的Golomb编码,提出了一种基于最优Golomb编码参数选择的改进算法.利用前一个需编码的数值的Golomb编码最优参数,对当前编码参数进行预测,使当前编码参数更逼进它的最优编码参数.试验结果表明:该算法较原有算法能更好的压缩残差数据,在量化参数QP较小时,能带来一定的压缩增益. After a simple analysis of context-based adaptive variable length coding (CAVLC) in H. 264, and a deeper study of Golomb coding in CAVLC, we proposed an advanced algorithm based on an optimal rule of choosing parameters in this paper. The optimal coding parameter of previous value is utilized to predict the coding parameter of current value thus will make it approaching better of the optimal coding parameter of current value. Results of experiment show that the advanced algorithm compresses the residual data better than original algorithm, especially in low quantization parameter (QP), it could bring compression gain.
出处 《四川大学学报(自然科学版)》 CAS CSCD 北大核心 2007年第5期1029-1032,共4页 Journal of Sichuan University(Natural Science Edition)
关键词 CAVLC H.264 Golomb编码 熵编码 CAVLC, H. 264, Golomb encoding, entropy encoding
  • 相关文献

参考文献5

二级参考文献28

  • 1[1]ITU-T Rec. H.264 ISO/IEC 14496-10 AVC. Joint Final Committee Draft (JFCD) of Joint Video Specification.JVT Doc. JVT-D157,2002.
  • 2[2]Vancouver. Emerging H.26L Standard. http://www.ubvideo.com. Feb 2002.
  • 3[3]Bjφntegaard Gisle, Lillevold Karl. Context-adaptive VLC (CVLC) coding of coefficients. document JVT-C028, JVT of ISO/IEC MPEG & ITU-T VCEG, 3rd Meeting, Fairfax,Virginia, USA, 6-10 May, 2002.
  • 4Golomb S W. Run-length encodings [J]. IEEE Trans. on Info.Theory, 1966, 12(3): 399 - 401.
  • 5Weinberger M J, Seroussi G, Sapiro G. The LOCO-I lossless image compression algorithm: Principles and standardization into JPEG-LS [J]. IEEE Trans. on Image Processing, 2000, 9(8):1309- 1324.
  • 6Rice R F. Some practical universal noiseless coding techniques--Part Ⅲ[R]. Technical Report JPL-91-3, Jet Propulsion Laboratory,Pasadena, CA, 1991.
  • 7Gallager R G, Voorhis D C V. Optimal source codes for geometrically distributed integer alphabets [J]. IEEE Trans. onInfo. Theory, 1975, 21(2): 228- 230.
  • 8Szpankowski W. Asymptotic average redundancy of Huffman(and other) block codes [J]. IEEE Trans. on Info. Theory, 2000,46(7): 2434 - 2443.
  • 9Merhav N, Seroussi G, Weinberger M J. Optimal prefix codes for sources with two-sided geometric distributions [J]. IEEE Trans.on Info. Theory, 2000, 46(1): 121 - 135.
  • 10Howard P G. The design and analysis of efficient Iossless data compression systems [D]. Rhode Island: Brown University, 1993.

共引文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部