Abstract
Motion in modern video coders is estimated using a block matching algorithm that calculates the distance and direction of motion on a block-by-block basis. In this paper, a novel fast block-based motion estimation algorithm is proposed. This algorithm uses an efficient projection framework that bounds the distance between a template block and candidate blocks. Fast projection is performed using a family of highly efficient filter kernels-the gray-code kernels-requiring only 2 operations per pixel per kernel. The projection framework is combined with a rejection scheme which allows rapid rejection of candidate blocks that are distant from the template block. The tradeoff between computational complexity and quality of results can be easily controlled in the proposed algorithm; thus, it enables adaptivity to image content to further improve the results. Experiments show that the proposed adaptive algorithm outperforms other popular fast motion estimation algorithms.
| Original language | English |
|---|---|
| Pages (from-to) | 2243-2254 |
| Number of pages | 12 |
| Journal | IEEE Transactions on Image Processing |
| Volume | 18 |
| Issue number | 10 |
| DOIs | |
| State | Published - 2009 |
Bibliographical note
Funding Information:Manuscript received October 17, 2008; revised May 18, 2009. First published June 16, 2009; current version published September 10, 2009. This work was supported in part by the Israeli Ministry of Science and by a grant from A.M.N. fund for the promotion of science, culture and arts in Israel. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Srdjan Stankovic.
Keywords
- Block matching
- Gray-code kernels (GCK)
- Motion estimation
- Video coding
- Walsh-Hadamard transform (WHT)
ASJC Scopus subject areas
- Software
- Computer Graphics and Computer-Aided Design