IEICE TRANSACTIONS on Fundamentals
A Fast Multi-Type Tree Decision Algorithm for VVC Based on Pixel Difference of Sub-Blocks
Summary :
In the upcoming video coding standard VVC (Versatile Video Coding, H.266), a new coding block structure named quadtree nested multi-type trees (MTT) has been proposed. Compared with the quadtree structure defined in HEVC (High Efficiency Video Coding), the partition structure of MTT can achieve better coding performance. Since the splitting scheme of a CU (Coding Unit) need to be calculated recursively, the computational complexity is significantly increased. To reduce computational complexity as well as maintain compression performance, a fast multi-type tree decision algorithm is proposed. The application of binary and ternary tree in horizontal or vertical direction is found to be closely related to the characteristics of CU in this paper, and a metric named pixel difference of sub-blocks (SBPD) is defined to measure the characteristics of CU in different splitting type. By comparing the SBPD in horizontal and vertical sub-blocks, the selection of binary and ternary tree can be decided in advance, so as to skip some redundant splitting modes. Experimental results show that compared with the original reference software VTM 4.0, the average time saving of the proposed algorithm is 27% and the BD-rate is only increased by 0.55%.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E103-A No.6 pp.856-859
- Publication Date
- 2020/06/01
- Publicized
- 2020/03/02
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2020EAL2008
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Zhi LIU
North China University of Technology
Mengjun DONG
North China University of Technology
Mengmeng ZHANG
North China University of Technology,Beijing Polytechnic College
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Zhi LIU, Mengjun DONG, Mengmeng ZHANG, "A Fast Multi-Type Tree Decision Algorithm for VVC Based on Pixel Difference of Sub-Blocks" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 6, pp. 856-859, June 2020, doi: 10.1587/transfun.2020EAL2008.
Abstract: In the upcoming video coding standard VVC (Versatile Video Coding, H.266), a new coding block structure named quadtree nested multi-type trees (MTT) has been proposed. Compared with the quadtree structure defined in HEVC (High Efficiency Video Coding), the partition structure of MTT can achieve better coding performance. Since the splitting scheme of a CU (Coding Unit) need to be calculated recursively, the computational complexity is significantly increased. To reduce computational complexity as well as maintain compression performance, a fast multi-type tree decision algorithm is proposed. The application of binary and ternary tree in horizontal or vertical direction is found to be closely related to the characteristics of CU in this paper, and a metric named pixel difference of sub-blocks (SBPD) is defined to measure the characteristics of CU in different splitting type. By comparing the SBPD in horizontal and vertical sub-blocks, the selection of binary and ternary tree can be decided in advance, so as to skip some redundant splitting modes. Experimental results show that compared with the original reference software VTM 4.0, the average time saving of the proposed algorithm is 27% and the BD-rate is only increased by 0.55%.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020EAL2008/_p
Copy
@ARTICLE{e103-a_6_856,
author={Zhi LIU, Mengjun DONG, Mengmeng ZHANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Fast Multi-Type Tree Decision Algorithm for VVC Based on Pixel Difference of Sub-Blocks},
year={2020},
volume={E103-A},
number={6},
pages={856-859},
abstract={In the upcoming video coding standard VVC (Versatile Video Coding, H.266), a new coding block structure named quadtree nested multi-type trees (MTT) has been proposed. Compared with the quadtree structure defined in HEVC (High Efficiency Video Coding), the partition structure of MTT can achieve better coding performance. Since the splitting scheme of a CU (Coding Unit) need to be calculated recursively, the computational complexity is significantly increased. To reduce computational complexity as well as maintain compression performance, a fast multi-type tree decision algorithm is proposed. The application of binary and ternary tree in horizontal or vertical direction is found to be closely related to the characteristics of CU in this paper, and a metric named pixel difference of sub-blocks (SBPD) is defined to measure the characteristics of CU in different splitting type. By comparing the SBPD in horizontal and vertical sub-blocks, the selection of binary and ternary tree can be decided in advance, so as to skip some redundant splitting modes. Experimental results show that compared with the original reference software VTM 4.0, the average time saving of the proposed algorithm is 27% and the BD-rate is only increased by 0.55%.},
keywords={},
doi={10.1587/transfun.2020EAL2008},
ISSN={1745-1337},
month={June},}
Copy
TY - JOUR
TI - A Fast Multi-Type Tree Decision Algorithm for VVC Based on Pixel Difference of Sub-Blocks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 856
EP - 859
AU - Zhi LIU
AU - Mengjun DONG
AU - Mengmeng ZHANG
PY - 2020
DO - 10.1587/transfun.2020EAL2008
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2020
AB - In the upcoming video coding standard VVC (Versatile Video Coding, H.266), a new coding block structure named quadtree nested multi-type trees (MTT) has been proposed. Compared with the quadtree structure defined in HEVC (High Efficiency Video Coding), the partition structure of MTT can achieve better coding performance. Since the splitting scheme of a CU (Coding Unit) need to be calculated recursively, the computational complexity is significantly increased. To reduce computational complexity as well as maintain compression performance, a fast multi-type tree decision algorithm is proposed. The application of binary and ternary tree in horizontal or vertical direction is found to be closely related to the characteristics of CU in this paper, and a metric named pixel difference of sub-blocks (SBPD) is defined to measure the characteristics of CU in different splitting type. By comparing the SBPD in horizontal and vertical sub-blocks, the selection of binary and ternary tree can be decided in advance, so as to skip some redundant splitting modes. Experimental results show that compared with the original reference software VTM 4.0, the average time saving of the proposed algorithm is 27% and the BD-rate is only increased by 0.55%.
ER -
English
