TY - JOUR
T1 - Alternating asymmetric search range assignment for bidirectional motion estimation in H.265/HEVC and H.264/AVC
AU - Zhou, Jinjia
AU - Zhou, Dajiang
AU - Goto, Satoshi
PY - 2014
Y1 - 2014
N2 - Bidirectional motion estimation (ME) significantly enhances video coding efficiency, whereas its huge complexity is also a critical problem for implementation. This paper presents alternating asymmetric search range assignment (AASRA) schemes to reduce the complexity by switching the use of a large and a small search ranges (SR.L and SR.S). A temporal AASRA (T-AASRA) scheme performs search range switching between past and future reference directions. A temporal-spatial AASRA (TS-AASRA) scheme performs more aggressive switching on the two dimensions of reference direction and MB/CTB index. T-AASRA and TS-AASRA achieve 43.5% and 65.2% complexity reduction, respectively, with small coding efficiency drop. Even after removing the factor of coding efficiency drop, the two schemes still show 38.4% and 54.7% equivalent complexity reduction. AASRA can also be combined with existing fast algorithms for further complexity saving, which has been demonstrated on hierarchical ME and dynamic search range selection algorithms.
AB - Bidirectional motion estimation (ME) significantly enhances video coding efficiency, whereas its huge complexity is also a critical problem for implementation. This paper presents alternating asymmetric search range assignment (AASRA) schemes to reduce the complexity by switching the use of a large and a small search ranges (SR.L and SR.S). A temporal AASRA (T-AASRA) scheme performs search range switching between past and future reference directions. A temporal-spatial AASRA (TS-AASRA) scheme performs more aggressive switching on the two dimensions of reference direction and MB/CTB index. T-AASRA and TS-AASRA achieve 43.5% and 65.2% complexity reduction, respectively, with small coding efficiency drop. Even after removing the factor of coding efficiency drop, the two schemes still show 38.4% and 54.7% equivalent complexity reduction. AASRA can also be combined with existing fast algorithms for further complexity saving, which has been demonstrated on hierarchical ME and dynamic search range selection algorithms.
KW - Bidirectional prediction
KW - Coding efficiency
KW - Complexity reduction
KW - H.264/AVC
KW - Hardware implementation
KW - HEVC
KW - Motion estimation
KW - Search range
UR - http://www.scopus.com/inward/record.url?scp=84901978297&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84901978297&partnerID=8YFLogxK
U2 - 10.1016/j.jvcir.2014.01.002
DO - 10.1016/j.jvcir.2014.01.002
M3 - Article
AN - SCOPUS:84901978297
SN - 1047-3203
VL - 25
SP - 1275
EP - 1286
JO - Journal of Visual Communication and Image Representation
JF - Journal of Visual Communication and Image Representation
IS - 5
ER -