Coding complexity is a crucial parameter in rate control scheme. Traditional measures for coding complexity are based on statistic and estimation. This way may cause the imprecise coding complexity and finally bring inaccurate output bit rate more or less. To resolve this problem, we propose a hypothetical virtual coding complexity to imitate the real coding complexity. Based on the proposed coding complexity measure, a novel rate control algorithm is proposed either. Experimental results and analysis show that the proposed mearsure for coding complexity is effective, and our scheme outperforms the JVT-W042 solution by providing more accurate QP prediction, reducing frame skipping, and improving visual quality.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yimin ZHOU, Ling TIAN, "Coding Complexity Prediction for H.264/AVC Rate Control" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 8, pp. 1592-1595, August 2009, doi: 10.1587/transinf.E92.D.1592.
Abstract: Coding complexity is a crucial parameter in rate control scheme. Traditional measures for coding complexity are based on statistic and estimation. This way may cause the imprecise coding complexity and finally bring inaccurate output bit rate more or less. To resolve this problem, we propose a hypothetical virtual coding complexity to imitate the real coding complexity. Based on the proposed coding complexity measure, a novel rate control algorithm is proposed either. Experimental results and analysis show that the proposed mearsure for coding complexity is effective, and our scheme outperforms the JVT-W042 solution by providing more accurate QP prediction, reducing frame skipping, and improving visual quality.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.1592/_p
Copy
@ARTICLE{e92-d_8_1592,
author={Yimin ZHOU, Ling TIAN, },
journal={IEICE TRANSACTIONS on Information},
title={Coding Complexity Prediction for H.264/AVC Rate Control},
year={2009},
volume={E92-D},
number={8},
pages={1592-1595},
abstract={Coding complexity is a crucial parameter in rate control scheme. Traditional measures for coding complexity are based on statistic and estimation. This way may cause the imprecise coding complexity and finally bring inaccurate output bit rate more or less. To resolve this problem, we propose a hypothetical virtual coding complexity to imitate the real coding complexity. Based on the proposed coding complexity measure, a novel rate control algorithm is proposed either. Experimental results and analysis show that the proposed mearsure for coding complexity is effective, and our scheme outperforms the JVT-W042 solution by providing more accurate QP prediction, reducing frame skipping, and improving visual quality.},
keywords={},
doi={10.1587/transinf.E92.D.1592},
ISSN={1745-1361},
month={August},}
Copy
TY - JOUR
TI - Coding Complexity Prediction for H.264/AVC Rate Control
T2 - IEICE TRANSACTIONS on Information
SP - 1592
EP - 1595
AU - Yimin ZHOU
AU - Ling TIAN
PY - 2009
DO - 10.1587/transinf.E92.D.1592
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 2009
AB - Coding complexity is a crucial parameter in rate control scheme. Traditional measures for coding complexity are based on statistic and estimation. This way may cause the imprecise coding complexity and finally bring inaccurate output bit rate more or less. To resolve this problem, we propose a hypothetical virtual coding complexity to imitate the real coding complexity. Based on the proposed coding complexity measure, a novel rate control algorithm is proposed either. Experimental results and analysis show that the proposed mearsure for coding complexity is effective, and our scheme outperforms the JVT-W042 solution by providing more accurate QP prediction, reducing frame skipping, and improving visual quality.
ER -