Low complexity weighted two-bit transforms based multiple candidates motion estimation exploiting the redundant computations

  • Choi, Changryoul
  • Jeong, Jechang
Citations

SCOPUS

0

초록

A low complexity weighted two-bit transforms (2BT) based multiple candidates motion estimation algorithm is proposed in this paper. By exploiting almost the identical operations in two different matching error criteria, we can efficiently determine two best motion vectors according to the respective matching criteria and can enhance the overall motion estimation accuracy. Experimental results show that the proposed algorithm achieves peak-to-peak signal-to-noise ratio (PSNR) gains about 0.47dB on average compared with the conventional 2BT-based motion estimation.

키워드

Block matchingFull-searchMotion estimationTwo-bit transformBlock MatchingFull-searchLow complexityMatching errorMotion estimation algorithmMotion VectorsPeak signal-to-noise ratioRedundant computationTwo-bit transformTwo-bit transform(2BT)Color image processingComputer graphicsEstimationMotion compensationSignal to noise ratioVisualizationMotion estimation
제목
Low complexity weighted two-bit transforms based multiple candidates motion estimation exploiting the redundant computations
저자
Choi, ChangryoulJeong, Jechang
DOI
10.1109/CGIV.2010.23
발행일
2010-09
유형
Conference Paper
저널명
Proceedings - 2010 7th International Conference on Computer Graphics, Imaging and Visualization, CGIV 2010
페이지
101 ~ 104