Reduction of Computational Complexity for an Advanced HEVC Inter Prediction

碩士 === 國立中央大學 === 通訊工程學系 === 105 === With the advancement of technology and high requirement, multimedia devices that have high resolution started to rapidly increase in numbers. In order to compress the significant increasing of data storage effectively, HEVC utilize multiple techniques to efficien...

Full description

Bibliographic Details
Main Authors: Li Lin, 林立
Other Authors: Yin-yi Lin
Format: Others
Language:zh-TW
Published: 2017
Online Access:http://ndltd.ncl.edu.tw/handle/9c858u
Description
Summary:碩士 === 國立中央大學 === 通訊工程學系 === 105 === With the advancement of technology and high requirement, multimedia devices that have high resolution started to rapidly increase in numbers. In order to compress the significant increasing of data storage effectively, HEVC utilize multiple techniques to efficiently decrease bitrate。Review the previous work which using Sum of Absolute Bi-Prediction Differences(SABPD) and Template Matching(TM) algorithm in extended merge mode decision and inter prediction mode and utilizing encoded information to predict. With such comparison against merge mode decision and inter mode decision of HEVC, the decoder can predict the same predicted block with the same information, so we can reduce transmitting header information to decrease bitrate. However, the coding time might be longer due to the increase of computational complexity. In order to decrease the computational complexity, we proposed the change of TM range, 〖Early Inter〗_MV and 〖Early Inter〗_RDO to early terminate inter prediction. At last we combine the methods together. According to experimental results, our proposed algorithm receives a result in decreasing the coding time by 19.19% by only increase BDBR by 0.09%