상세 보기
초록
A low complexity weighted two-bit transforms (2BT) based multiple candidate 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 with negligible complexity increase. And with additional local square search, the proposed algorithm can enhance the overall motion estimation accuracy substantially. Experimental results show that the proposed algorithm achieves peak-to-peak signal-to-noise ratio (PSNR) gains about 0.55dB on average compared with the conventional 2BT-based motion estimation.
키워드
Motion estimation; block matching; full-search; two-bit transform; SUCCESSIVE ELIMINATION ALGORITHM; ONE-BIT TRANSFORM
- 제목
- Low Complexity Weighted Two-Bit Transforms Based Multiple Candidate Motion Estimation
- 저자
- Choi, Changryoul; Jeong, Jechang
- 발행일
- 2011-11
- 유형
- Article
- 권
- 57
- 호
- 4
- 페이지
- 1837 ~ 1842