Name
Abstract | ||
|---|---|---|
H.264 video coding standard gains significant improvement in compression efficiency. However, the computational complexity also considerably increases. Many fast algorithms are introduced to speed up the encoding. Distinguishing from pervious multi-frame based fast motion estimation algorithms which only exploit temporal correlation, a novel algorithm both employing temporal and spatial correlations is proposed in this paper, which has much better prediction accuracy. To further speed up the encoding process, an adaptive mode reduction scheme which will discard small probability modes is also proposed. Combining the novel fast multi-frame based motion estimation algorithm and the adaptive mode reduction scheme, experimental results show that the proposed algorithms improve the encoding speed by an average of 9 times faster than fast full search and about 2.5 times faster than reference method which only employs temporal correlation, PSNR dropping and bitrate increasing are negligible. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-69423-6_54 | MMM |
Keywords | Field | DocType |
complexity reduction,adaptive mode reduction scheme,encoding process,multi-frame motion estimation,motion estimation algorithm,fast full search,encoding speed,fast algorithm,novel algorithm,temporal correlation,proposed algorithm,fast motion estimation algorithm,spatial correlation,computational complexity,motion estimation | Spatial correlation,Pattern recognition,Computer science,Algorithm,Coding (social sciences),Reduction (complexity),Artificial intelligence,Motion estimation,Adaptive algorithm,Speedup,Encoding (memory),Computational complexity theory | Conference |
Volume | ISSN | ISBN |
4351 | 0302-9743 | 3-540-69421-8 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
5 | ||