Abstract

Future Video Coding (FVC) significantly improves the compression efficiency over the preceding High Efficiency Video Coding (HEVC) standard but at the cost of extremely huge computational complexity. The flexible quad-tree plus binary tree (QTBT) block partitioning structure in FVC is largely responsible for the high computational complexity. In order to address the issue of huge computational complexity of QTBT, we propose a multiple classifier-based fast QTBT partitioning algorithm for FVC intra coding. The proposed multiple classifier-based QTBT algorithm contains three stages including horizon binary-tree decision model (HBTDM), vertical binary-tree decision model (VBTDM), and quad-tree decision model (QTDM). Consequently, the computational complexity of FVC intra coding can be drastically reduced by replacing the brute-force search with HBTDM, VBTDM, and QTDM to decide the optimal QTBT partitioning. To achieve high prediction accuracy, the descriptive features of intra QTBT partitioning decision are extracted to train corresponding classifiers. An efficient optimal parameter selection method of training classifiers is introduced to balance the computational complexity and rate distortion (RD) performance. Experimental results show that in comparison with the original FVC reference software, the proposed overall algorithm can reduce 64.54% intra coding time with negligible degradation of RD performance. Meanwhile, the proposed algorithm outperforms four state-of-the-art algorithms in terms of computational complexity reduction.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.