Fast Partitioning Decision Strategies for The Upcoming Versatile Video Coding (VVC) Standard

Wieckowski, Adam; Ma, Jackie; Schwarz, Heiko; Marpe, Detlev; Wiegand, Thomas

doi:10.1109/icip.2019.8803533

Cited by 55 publications

(33 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [25], it was estimated that 97% of the VTM encoding runtime could be saved in the AI configuration, if the selected partitioning could be directly inferred rather than determined through search. The VTM encoder already contains search strategies based on dynamic programming and heuristics to improve run times [26]. These enable VTM, in its default configuration, to run over 7× faster than if a full partitioning search was performed.…”

Section: A Partitioning Complexitymentioning

confidence: 99%

See 1 more Smart Citation

VVC Complexity and Software Implementation Analysis

Bossen¹,

Sühring

Wieckowski

et al. 2021

IEEE Trans. Circuits Syst. Video Technol.

Self Cite

View full text Add to dashboard Cite

A steady increase in available processing power continues to drive advances in video compression technology. The recently completed Versatile Video Coding (VVC) standard aims to double the compression efficiency of HEVC and deliver a same quality of video at half the bitrate. To achieve this goal, VVC includes several new methods that improve coding efficiency at the cost of increased complexity. This paper provides a complexity analysis of VVC and its VTM reference software. Whereas VVC is more complex than HEVC, it remains readily implementable in software on current generation processors. Performance of practical decoders are reported, showing that real-time decoding of 8K content is feasible. An encoder is also presented, showing that most of the compression gains of VVC over HEVC can be obtained at a small fraction of the resources needed by the VTM encoder under common test conditions.

show abstract

Section: A Partitioning Complexitymentioning

confidence: 99%

“…In VTM, without such recursion, over 70% runtime reduction is possible for a BD-rate loss of around 4.5%. No state-of-the-art fast partitioning algorithm can achieve such a trade-off when applied on top of already available fast methods [26].…”

Section: A Partitioning Complexitymentioning

confidence: 99%

VVC Complexity and Software Implementation Analysis

Bossen¹,

Sühring

Wieckowski

et al. 2021

IEEE Trans. Circuits Syst. Video Technol.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Tang et al [15] used edge features extracted by canny edge detector to skip vertical or horizontal split mode to carry out early termination. [16] presented an early termination strategy that skipped the evaluation of QT split mode if both binary splits had been evaluated but did not reduce the coding cost. A fast partition method based on Bayesian decision rules was designed by Fu et al [17], which jointly utilized split types and intra modes of sub-CUs to skip certain partitions in advance.…”

Section: Related Workmentioning

confidence: 99%

“…Content may change prior to final publication. Reference [16] presented an early termination strategy that QT split mode will be skipped if both binary splits were evaluated but performed worse than non-split. Since the traversal of block partition follows the order of non-split, QT, BT and EQT split mode, the QTBT Rate-Distortion (RD) cost could be a useful clue to avoid inefficient EQT partition attempts.…”

Section: ) Proposed Algorithm Based On Iterate Constraintmentioning

confidence: 99%

Fast CU Partition Decision Algorithm for AVS3 Intra Coding

Liu

Wang

et al. 2021

IEEE Access

View full text Add to dashboard Cite

“…In tests 2 and 3, even the decoding complexities were increased. In order to improve the high computational complexity of QTBT partitioning, several rapid methods were also proposed in refs [21][22][23][24][25][26][27].…”

Section: Related Studiesmentioning

confidence: 99%

Adaptive block tree structure for video coding

et al. 2020

View full text Add to dashboard Cite

The Joint Video Exploration Team (JVET) has studied future video coding (FVC) technologies with a potential compression capacity that significantly exceeds that of the high-efficiency video coding (HEVC) standard. The joint exploration test model (JEM), a common platform for the exploration of FVC technologies in the JVET, employs quadtree plus binary tree block partitioning, which enhances the flexibility of coding unit partitioning. Despite significant improvement in coding efficiency for chrominance achieved by separating luminance and chrominance tree structures in I slices, this approach has intrinsic drawbacks that result in the redundancy of block partitioning data. In this paper, an adaptive tree structure correlating luminance and chrominance of single and dual trees is presented. Our proposed method resulted in an average reduction of −0.24% in the Y Bjontegaard Delta rate relative to the intracoding of JEM 6.0 common test conditions.

show abstract

Fast Partitioning Decision Strategies for The Upcoming Versatile Video Coding (VVC) Standard

Cited by 55 publications

References 11 publications

VVC Complexity and Software Implementation Analysis

VVC Complexity and Software Implementation Analysis

Fast CU Partition Decision Algorithm for AVS3 Intra Coding

Adaptive block tree structure for video coding

Contact Info

Product

Resources

About