상세 보기
초록
In this paper, a fast full-search (FS) block matching algorithm (BMA) for two-bit transform (2BT) motion estimation is developed. The algorithm evaluates lower bounds for 2BT matching criterion based on the reverse triangle inequality to eliminate the impossible candidates faster and save computations substantially. Experimental results show that while the motion estimation accuracy of the proposed algorithm is the same as that of the FS-2BT algorithm, the proposed algorithm reduces computational complexity dramatically.
키워드
Block matching; Full-search; Motion estimation; Two-bit transform; Video coding; Block Matching; Block matching algorithms; Full-search; Lower bounds; Matching criterion; Optimal algorithm; Triangle inequality; Two-bit transform; Two-bit transform(2BT); Video coding; Algorithms; Color image processing; Computational complexity; Computer vision; Estimation; Image matching; Imaging systems; Motion compensation; Three dimensional; Virtual reality; Visualization; Motion estimation
- 제목
- Fast optimal algorithm for two-bit transform motion estimation based on the reverse triangle inequality
- 저자
- Close Choi, Changryoul; Jeong, Jechang
- 발행일
- 2010-07
- 유형
- Conference Paper
- 저널명
- Proc. of the IADIS Int. Conf. - Computer Graphics, Visualization, Computer Vision and Image Processing, CGVCVIP 2010, Visual Commun., VC 2010, Web3DW 2010, Part of the MCCSIS 2010
- 페이지
- 418 ~ 422