Fast block matching algorithm for constrained one-bit transform-based motion estimation using binomial distribution

  • Park, Hanjin
  • Choi, Changryoul
  • Jeong, Jechang
Citations

SCOPUS

1

초록

Many fast block-matching algorithms (BMAs) reduce computational complexity by screening the number of checking points. Although many fast BMAs reduce computations, sometimes they should endure matching errors in comparison with full-search algorithm (FSA). In this paper, a novel fast BMA for constrained one-bit transform (C1BT)-based motion estimation is proposed in order to decrease the calculations of the block distortion measure. Unlike the classical fast BMAs, the proposed algorithm shows a new approach to reduce computations. It utilizes the binomial distribution based on the characteristic of binary plane which is composed of only two elements: 0 and 1. Experimental results show that the proposed algorithm keeps its peak signal-to-noise ratio (PSNR) performance very close to the FSA-C1BT while the computational complexity is reduced considerably.

키워드

binary motion estimationbinomial distributionblcok matching algorithmConsrained one-bit transformBinary motion estimationsBinomial distributionBlock distortion measuresBlock matching algorithmsChecking pointFast block matching algorithmsFull Search algorithmMatching algorithmMatching errorOne bit transformPeak signal-to-noise ratioAlgorithmsComputational complexityMotion estimation
제목
Fast block matching algorithm for constrained one-bit transform-based motion estimation using binomial distribution
저자
Park, HanjinChoi, ChangryoulJeong, Jechang
DOI
10.1109/DICTA.2011.121
발행일
2011-12
유형
Conference Paper
저널명
Proceedings - 2011 International Conference on Digital Image Computing: Techniques and Applications, DICTA 2011
페이지
683 ~ 688