A simple merge mode/candidate decision for HEVC

Wei Kun Chang, Yinyi Lin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In this paper, we propose an early merge mode decision algorithm for HEVC inter prediction to reduce the computational complexity using early zero-block (ZB) detection. To improve the coding performance degradation introduced in the proposed algorithm, we also propose a new merge candidate decision scheme which suggests using decoder-derived merge candidates for merge mode decision, based upon both sum of absolute bidirectional prediction differences (SABPD) and template matching (TM) criteria. In the proposed scheme, only a 1-bit flag for merge index is required for transmission instead of prefix coded merge index. The experimental results reveal that the proposed algorithm outperforms the inter prediction proposed in HEVC in both coding performance and computational complexity. The results demonstrate that at low bit rates the proposed algorithm achieves average 1.6% BDBR reduction with 38% reduction of total encoding time, compared to the original HEVC inter prediction.

Original languageEnglish
Title of host publication2015 15th International Symposium on Communications and Information Technologies, ISCIT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages65-68
Number of pages4
ISBN (Electronic)9781467368209
DOIs
StatePublished - 22 Apr 2016
Event15th International Symposium on Communications and Information Technologies, ISCIT 2015 - Nara, Japan
Duration: 7 Oct 20159 Oct 2015

Publication series

Name2015 15th International Symposium on Communications and Information Technologies, ISCIT 2015

Conference

Conference15th International Symposium on Communications and Information Technologies, ISCIT 2015
Country/TerritoryJapan
CityNara
Period7/10/159/10/15

Fingerprint

Dive into the research topics of 'A simple merge mode/candidate decision for HEVC'. Together they form a unique fingerprint.

Cite this