Interlaced asymmetric search range assignment for bidirectional motion estimation

Jinjia Zhou; Dajiang Zhou; Satoshi Goto

doi:10.1109/ICIP.2012.6467170

Interlaced asymmetric search range assignment for bidirectional motion estimation

Jinjia Zhou^*, Dajiang Zhou, Satoshi Goto

^*Corresponding author for this work

Information, Production and Systems Research Center

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

Bidirectional motion estimation significantly enhances video coding efficiency, but its huge complexity is also a critical problem for implementation. This paper presents an interlaced asymmetric search range assignment (IASRA) algorithm. By applying a large and a small search ranges to two reference directions and switching the assignment of these two search ranges once per macroblock, total complexity for bidirectional motion estimation can be reduced by near half with slight coding efficiency drop. IASRA also has the flexibility to be combined with existing fast algorithms and architectures for further complexity saving. We demonstrate this feature by combining IASRA with the state-of-the-art IMNPDR and PMRME architectures, which results in 33% to 42% complexity reduction with less than 1% bit rate increase.

Original language	English
Title of host publication	Proceedings - International Conference on Image Processing, ICIP
Pages	1557-1560
Number of pages	4
DOIs	https://doi.org/10.1109/ICIP.2012.6467170
Publication status	Published - 2012
Event	2012 19th IEEE International Conference on Image Processing, ICIP 2012 - Lake Buena Vista, FL Duration: 2012 Sept 30 → 2012 Oct 3

Other

Other	2012 19th IEEE International Conference on Image Processing, ICIP 2012
City	Lake Buena Vista, FL
Period	12/9/30 → 12/10/3

Keywords

bidirectional prediction
motion estimation
search range

ASJC Scopus subject areas

Computer Networks and Communications
Information Systems

Access to Document

10.1109/ICIP.2012.6467170

Cite this

@inproceedings{6a5b2283f01749c7ba3e14f281435d0a,

title = "Interlaced asymmetric search range assignment for bidirectional motion estimation",

abstract = "Bidirectional motion estimation significantly enhances video coding efficiency, but its huge complexity is also a critical problem for implementation. This paper presents an interlaced asymmetric search range assignment (IASRA) algorithm. By applying a large and a small search ranges to two reference directions and switching the assignment of these two search ranges once per macroblock, total complexity for bidirectional motion estimation can be reduced by near half with slight coding efficiency drop. IASRA also has the flexibility to be combined with existing fast algorithms and architectures for further complexity saving. We demonstrate this feature by combining IASRA with the state-of-the-art IMNPDR and PMRME architectures, which results in 33% to 42% complexity reduction with less than 1% bit rate increase.",

keywords = "bidirectional prediction, motion estimation, search range",

author = "Jinjia Zhou and Dajiang Zhou and Satoshi Goto",

year = "2012",

doi = "10.1109/ICIP.2012.6467170",

language = "English",

isbn = "9781467325332",

pages = "1557--1560",

booktitle = "Proceedings - International Conference on Image Processing, ICIP",

note = "2012 19th IEEE International Conference on Image Processing, ICIP 2012 ; Conference date: 30-09-2012 Through 03-10-2012",

}

TY - GEN

T1 - Interlaced asymmetric search range assignment for bidirectional motion estimation

AU - Zhou, Jinjia

AU - Zhou, Dajiang

AU - Goto, Satoshi

PY - 2012

Y1 - 2012

N2 - Bidirectional motion estimation significantly enhances video coding efficiency, but its huge complexity is also a critical problem for implementation. This paper presents an interlaced asymmetric search range assignment (IASRA) algorithm. By applying a large and a small search ranges to two reference directions and switching the assignment of these two search ranges once per macroblock, total complexity for bidirectional motion estimation can be reduced by near half with slight coding efficiency drop. IASRA also has the flexibility to be combined with existing fast algorithms and architectures for further complexity saving. We demonstrate this feature by combining IASRA with the state-of-the-art IMNPDR and PMRME architectures, which results in 33% to 42% complexity reduction with less than 1% bit rate increase.

AB - Bidirectional motion estimation significantly enhances video coding efficiency, but its huge complexity is also a critical problem for implementation. This paper presents an interlaced asymmetric search range assignment (IASRA) algorithm. By applying a large and a small search ranges to two reference directions and switching the assignment of these two search ranges once per macroblock, total complexity for bidirectional motion estimation can be reduced by near half with slight coding efficiency drop. IASRA also has the flexibility to be combined with existing fast algorithms and architectures for further complexity saving. We demonstrate this feature by combining IASRA with the state-of-the-art IMNPDR and PMRME architectures, which results in 33% to 42% complexity reduction with less than 1% bit rate increase.

KW - bidirectional prediction

KW - motion estimation

KW - search range

UR - http://www.scopus.com/inward/record.url?scp=84875836487&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84875836487&partnerID=8YFLogxK

U2 - 10.1109/ICIP.2012.6467170

DO - 10.1109/ICIP.2012.6467170

M3 - Conference contribution

AN - SCOPUS:84875836487

SN - 9781467325332

SP - 1557

EP - 1560

BT - Proceedings - International Conference on Image Processing, ICIP

T2 - 2012 19th IEEE International Conference on Image Processing, ICIP 2012

Y2 - 30 September 2012 through 3 October 2012

ER -

Interlaced asymmetric search range assignment for bidirectional motion estimation

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this