An Efficient Block Matching Algorithm Utilizing Motion Correlation
碩士 === 華梵大學 === 電子工程學系碩士班 === 95 === Block matching algorithms (BMA) play a very important role in the field of motion estimation for video coding. They are efficient to preserve the quality for reconstructed video frames with a minimum cost of computation complexity. Fast BMAs can find an optimal m...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/42712167327784391419 |
| Summary: | 碩士 === 華梵大學 === 電子工程學系碩士班 === 95 === Block matching algorithms (BMA) play a very important role in the field of motion estimation for video coding. They are efficient to preserve the quality for reconstructed video frames with a minimum cost of computation complexity. Fast BMAs can find an optimal match close to the best match under a full search.
In this paper, we propose a method to further improve the efficiency of the block matching algorithms. This method varies the sizes and the origins of the search areas by utilizing strong spatial correlation of motion vectors. Blocks are classified into two groups: those are fixed-length spaced and those are surrounded by fixed-length spaced blocks. The motion vectors of the former group are produced in larger search areas. For blocks in the latter group, the method seeks their matches in smaller areas and hence increases its efficiency.
|
|---|