Fast Motion Estimation Algorithm for H.264/AVC
碩士 === 義守大學 === 資訊工程學系碩士班 === 94 === In this paper, an efficient variable-size block-matching motion estimation algorithm is proposed to reduce the computational complexity of H.264/AVC. We first determine the initial candidates of the block modes by merge-split strategy. Measuring the initial block...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/31004703230687460578 |
| Summary: | 碩士 === 義守大學 === 資訊工程學系碩士班 === 94 === In this paper, an efficient variable-size block-matching motion estimation algorithm is proposed to reduce the computational complexity of H.264/AVC. We first determine the initial candidates of the block modes by merge-split strategy. Measuring the initial block-mode with Lagrangian cost function, and then we compute the thresholds using the mean square error and the bit-rate of the 8×8 block. For the remaining block modes, we set the end-point of the modes selection according to R-D cost calculation. If the calculation value is less then the threshold, the remaining block-mode selections terminated early. The proposed methods effectively reduce the number of the block mode candidates with slight degradation of PSNR. Experimental results show that the number of search points per frame is reduced 94% when comparing with full-search motion estimation and with a comparable rate-distortion performance.
|
|---|