Open AccessHEVC fast reference picture selection
Author(s) -
Yang ShihHsuan,
Huang KaiSheng
Publication year - 2015
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2015.3094
Subject(s) - motion vector , expediting , computer science , coding (social sciences) , algorithm , context adaptive binary arithmetic coding , encoder , algorithmic efficiency , data compression , reference software , motion compensation , macroblock , motion estimation , artificial intelligence , decoding methods , mathematics , statistics , systems engineering , engineering , image (mathematics) , operating system
The new high efficiency video coding (HEVC) standard facilitates the realisation of ultrahigh‐definition video applications. Although the compression efficiency of the HEVC standard is double that of the well‐established H.264 standard, HEVC incurs a considerably higher encoding complexity. This Letter presents an algorithm aimed at expediting reference picture selection processes in HEVC encoding. The proposed algorithm is primarily based on a reference picture and block discovered using the advanced motion vector prediction (AMVP) algorithm. Two acceleration conditions are included in the proposed algorithm. The first early‐decision condition entails examining the rate‐distortion (RD) cost associated with AMVP, and if this cost is lower than a predefined threshold, motion estimation is confined to the AMVP‐selected reference picture. Furthermore, for coding units of size 64 × 64 ( N = 32) with a prediction‐unit (PU) partitioning of 2 N × N or N × 2 N , the second PU uses the same reference picture as the first PU if the first PU satisfies the first early‐decision condition. The experimental results revealed that the proposed algorithm considerably reduced the total encoding time with negligible RD degradation.