Skip Navigation

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 2008 E91-A(4):1015-1022; doi:10.1093/ietfec/e91-a.4.1015
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by CHEN, Z.
Right arrow Articles by GOTO, S.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2008 The Institute of Electronics, Information and Communication Engineers

Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers

Adaptive Search Range Algorithms for Variable Block Size Motion Estimation in H.264/AVC

Zhenxing CHEN1, Yang SONG1, Takeshi IKENAGA1 and Satoshi GOTO1

1 The authors are with the Graduate School of Information, Production and Systems, Waseda University, Kitakyusyu-shi, 808-0135 Japan. E-mail: chenzhenxing{at}akane.waseda.jp


  Abstract

Comparing with search pattern motion estimation (ME) algorithms, adaptive search range (ASR) algorithms are more fundamental, regular and flexible. In variable block size motion estimation (VBSME), ASR algorithms can be applied whether on a whole frame (frame level), or on an entire macroblock which includes up to forty-one blocks (macroblock level), or just on a single block (block level). In the other hand, in H.264/AVC, not the motion vectors (MVs) but the motion vector differences (MVDs) are coded and the median motion vector predictors (median-MVPs) are used to place the search centers. In this sense, it can be thought that the search windows (SWs) are centered at the positions pointed by median-MVPs, the search ranges (SRs) play the role of limiting MVDs. Thus it is reasonable for considering using MVDs to predict SRs. In this paper, one of the MB level and two of the block level, at all three MVD based SR prediction algorithms are proposed. VBSME based experiments are carried out to assess the proposed algorithms. Comparisons between the proposed three algorithms and the previously proposed one given in [8] are done in terms of encoding quality and computational complexity.

Key Words: H.264/AVC, VBSME, ASR, MVD

Manuscript received July 1, 2007. Manuscript revised October 12, 2007.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.