A Novel Fast Partition Algorithm Based on EDGE Information in HEVC


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

High efficiency video coding (HEVC) introduces a well-designed quad-tree structure to improve coding efficiency. During quad-tree building, the encoder tries all possible coding unit (CU) partition schemes to determine the optimal one with the minimum rate distortion cost, which introduces high computation complexity. To deal with this problem, a fast algorithm based on edge information is proposed to accelerate CU splitting in this paper. Firstly, the depth and prediction mode of adjacent blocks are obtained and used to facilitate rough partition. Secondly, the edge pixel values of this CU are counted and analyzed to fine-tune the partition. Experimental results show that the proposed algorithm can reduce coding time by 35.7% on average, with an acceptable loss of Bjøntegaard delta rate of 0.6%.

作者简介

Zhi Liu

North China University of Technology

编辑信件的主要联系方式.
Email: lzliu@ncut.edu.cn
中国, Beijing, 100144

Mengmeng Zhang

North China University of Technology

编辑信件的主要联系方式.
Email: zmm@ncut.edu.cn
中国, Beijing, 100144

Delun Lai

North China University of Technology

Email: zmm@ncut.edu.cn
中国, Beijing, 100144

Changzhi An

Beijing China Electronic Intelligent Communication Technology Co., Ltd.

Email: zmm@ncut.edu.cn
中国, Beijing, 100085

补充文件

附件文件
动作
1. JATS XML

版权所有 © Allerton Press, Inc., 2019