By Topic

A review of motion estimation algorithms for video compression

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

The key to high performance of video compression lies in an efficient reduction of the temporal redundancy. For this purpose, the block-based motion estimation (BBME) technique has been successfully applied in the video compression standards from H.261 to H.264. The most straightforward BBME method must be full search algorithm (FSA) that searches every candidate position within the search range. Since FS consumes extremely high computational cost, development and refinement on ME algorithms have been fueled to archive better tradeoff between the computational cost and the ME speed. In this paper, we study the low complexity ME algorithms and classify them into three categories, namely modeling the matching error surface, fast full search and reduction of searching candidate points. In the following sections, we will have a brief review across all these categories. The aim of this review is to provide the succeeding researchers with some constructive information in design of the fast ME algorithms.

Published in:

Computer Application and System Modeling (ICCASM), 2010 International Conference on  (Volume:2 )

Date of Conference:

22-24 Oct. 2010