Fast block matching algorithm for constrained one-bit transform-based motion estimation using binomial distribution
- Authors
- Park, Hanjin; Choi, Changryoul; Jeong, Jechang
- Issue Date
- Dec-2011
- Publisher
- IEEE
- Keywords
- binary motion estimation; binomial distribution; blcok matching algorithm; Consrained one-bit transform
- Citation
- Proceedings - 2011 International Conference on Digital Image Computing: Techniques and Applications, DICTA 2011, pp.683 - 688
- Indexed
- SCOPUS
- Journal Title
- Proceedings - 2011 International Conference on Digital Image Computing: Techniques and Applications, DICTA 2011
- Start Page
- 683
- End Page
- 688
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/167016
- DOI
- 10.1109/DICTA.2011.121
- ISSN
- 0000-0000
- Abstract
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 융합전자공학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/167016)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.