.png){kind=icon}
.png){kind=icon}
Return
Complexity reduction methods for fast motion estimation in HEVC
.png){kind=icon}
PRE
AI
DOI：10.1016/j.image.2015.09.015.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Motion estimation is one of the most demanding and complex tools in block based video encoders. Variable block size motion estimation (ME) and multiple reference frames in H.264/AVC make motion estimation even more complex and time consuming. In HEVC, the complexity is even higher since there are more block sizes. This paper presents an analysis of various tools involved in some fast ME algorithms and proposes some improvements to them in order to achieve a novel fast hybrid algorithm. The proposed algorithm has been tested with HEVC reference software. Simulation results show that the algorithm achieves up to 44.7% decrease in ME complexity when compared to the fast ME algorithm (Test Zone Search or TZSearch) and up to 99% reduction in ME complexity compared to full search algorithm with negligible loss in PSNR and bitrate. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Motion estimation
Dynamic search range
Early termination
Hexagon search pattern
Fine refinement
HEVC
Journal
S
IF:
2.7
Papers:
2.8K
Citations:
4.2K