Abstract
Many suboptimal motion vector search algorithms have been proposed because the full search algorithm, which is an optimal method, requires huge computational requirements. These block matching algorithms find motion vectors simply from the center of the search window. But the motion vector of the current block is highly related to those of its neighboring blocks. In this paper we propose an efficient hybrid search algorithm (HBS) that exploits the motion vectors of the neighboring blocks to predict the initial search point. HBS searches for a motion vector from the initial search point using the diamond search algorithm(DS). DS is chosen because it is one of the fastest motion vector search algorithms. Experimental results show that HBS is a faster and more accurate motion vector search method than other suboptimal methods for most test sequences.
| Original language | English |
|---|---|
| Title of host publication | IEEE Region 10 Annual International Conference, Proceedings/TENCON |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 112-115 |
| Number of pages | 4 |
| ISBN (Electronic) | 0780357396, 9780780357396 |
| DOIs | |
| Publication status | Published - 1999 |
| Event | 1999 IEEE Region 10 Conference, TENCON 1999 - Cheju Island, Korea, Republic of Duration: 1999 Sept 15 → 1999 Sept 17 |
Publication series
| Name | IEEE Region 10 Annual International Conference, Proceedings/TENCON |
|---|---|
| Volume | 1 |
| ISSN (Print) | 2159-3442 |
| ISSN (Electronic) | 2159-3450 |
Other
| Other | 1999 IEEE Region 10 Conference, TENCON 1999 |
|---|---|
| Country/Territory | Korea, Republic of |
| City | Cheju Island |
| Period | 99/9/15 → 99/9/17 |
Bibliographical note
Publisher Copyright:© 1999 IEEE.
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Electrical and Electronic Engineering