Proposed One Point Pentagon inner search Fast Block Matching Algorithm
Fast block matching algorithms (BMAs) play an important role in motion estimation and object tracking. Search speed and distortion performance are determined by search pattern shape and size. A fast motion estimation algorithm, called one point pentagon inner search (OPPEN) is presented for both mot...
Saved in:
| Published in: | 2009 National Radio Science Conference pp. 1 - 9 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.03.2009
|
| Subjects: | |
| ISBN: | 9781424442140, 1424442141 |
| ISSN: | 1110-6980 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Fast block matching algorithms (BMAs) play an important role in motion estimation and object tracking. Search speed and distortion performance are determined by search pattern shape and size. A fast motion estimation algorithm, called one point pentagon inner search (OPPEN) is presented for both motion estimation and object tracking. The performance of the OPPEN algorithm is analyzed and quantitatively compared with most recent BMAs. Experimental results reveal that our proposed algorithm has superior performance compared with other algorithms in terms of number of search points and computational complexity. Also, the role of region of interest (ROI) in object tracking is discussed for further improving the performance of the proposed algorithm. |
|---|---|
| ISBN: | 9781424442140 1424442141 |
| ISSN: | 1110-6980 |

