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 quasi-stationary 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 proposed algorithm 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) | 421-424 |
| Number of pages | 4 |
| Journal | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
| Volume | 3 |
| Publication status | Published - Apr 2003 |
| Externally published | Yes |
| Event | 2003 IEEE International Conference on Accoustics, Speech, and Signal Processing - Hong Kong, Hong Kong Duration: 6 Apr 2003 → 10 Apr 2003 |
ASJC Scopus subject areas
- Software
- Signal Processing
- Electrical and Electronic Engineering