Abstract
The three-step search algorithm has been widely used in block matching motion estimation due to its simplicity and effectiveness. The sparsely distributed checking points pattern in the first step is very suitable for searching large motion. However, for stationary or quasistationary blocks it will easily lead the search to be trapped into a local minimum. In this paper we propose a modification on the three-step search algorithm which employs a small diamond pattern in the first step, and the unrestricted search step is used to search the center area. Experimental results show that the new efficient three-step search performs better than new three-step search in terms of MSE and requires less computation by up to 15% on average.
Original language | English |
---|---|
Pages (from-to) | 435-438 |
Number of pages | 4 |
Journal | IEEE Transactions on Multimedia |
Volume | 6 |
Issue number | 3 |
DOIs | |
Publication status | Published - Jun 2004 |
Externally published | Yes |
Keywords
- Block matching
- Motion estimation
- Video coding
ASJC Scopus subject areas
- Signal Processing
- Media Technology
- Computer Science Applications
- Electrical and Electronic Engineering