Name: | Description: | Size: | Format: | |
---|---|---|---|---|
3.37 MB | Adobe PDF |
Advisor(s)
Abstract(s)
Several different methods have been investigated in recent years, aiming at computational complexity reduction and scaling of High Efficiency Video Coding (HEVC) software
implementations. However, maintaining the encoding time per frame or group of pictures (GOPs) below an adjustable upper bound is still an open research issue. A solution for this problem is devised in this paper based on a set of Pareto-efficient encoding configurations, identified through rate-distortion-complexity analysis. The proposed method combines a medium-granularity encoding time control with a fine-granularity encoding time control to accurately limit the HEVC encoding time below a predefined target for each GOP. It is shown that the encoding time can be kept below a desired target for a wide range of encoding time reductions, e.g., up to 90% in comparison with the original encoder. The results also show that compression efficiency loss (Bjøntegaard delta-rate) varies from negligible (0.16%) to moderate (9.83%) in the extreme case of 90% computational complexity reduction.
Description
Keywords
Encoding time limitation High Efficiency Video Coding (HEVC) Pareto efficiency rate-distortion complexity (R-D-C)
Citation
G. Corrêa, P. A. Assunção, L. V. Agostini and L. A. da Silva Cruz, "Pareto-Based Method for High Efficiency Video Coding With Limited Encoding Time," in IEEE Transactions on Circuits and Systems for Video Technology, vol. 26, no. 9, pp. 1734-1745, Sept. 2016, doi: 10.1109/TCSVT.2015.2469533.
Publisher
Institute of Electrical and Electronics Engineers (IEEE)