Name
Abstract | ||
|---|---|---|
The emerging H.264 advanced video coding (H.264/AVC) standard achieves significant improvement in coding efficiency compared with previous standards such as MPEG-2 and H.263. One major contribution of its gain profits from variable-block-size motion estimation, which also leads to higher computational complexity. In this paper, we propose a fast predictive variable-blocksize motion estimation algorithm for H.264/AVC. The algorithm takes advantage of three effective predictive schemes - stationary block prediction, predictive search for non-stationary blocks and predictive multi-pattern refinement search in merging process. Experimental results and comparative analysis have shown that our roposed algorithm can reduce the computational complexity up to about 2% of fast full search motion estimation algorithm, with negligible average PSNR loss of 0.065 dB and bit rate increase of 2.43%. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ICME.2005.1521433 | 2005 IEEE International Conference on Multimedia and Expo (ICME), Vols 1 and 2 |
Keywords | Field | DocType |
data compression,profitability,acceleration,comparative analysis,computational complexity,motion estimation,videoconference,prediction algorithms,merging | Quarter-pixel motion,Computer science,Real-time computing,Coding (social sciences),Artificial intelligence,Motion estimation,Block size,Algorithmic efficiency,Pattern recognition,Algorithm,Acceleration,Data compression,Computational complexity theory | Conference |
Citations | PageRank | References |
8 | 0.68 | 8 |
Authors | ||
4 | ||