Abstract
A fast binary pyramid motion estimation (FBPME) algorithm is presented. The proposed FBPME scheme is based on the representation of set of binary features in terms of multiresolution layers, XOR Boolean block matching and an N-scale tiling search scheme. Each video frame is converted into a pyramid structure of K-1 binary layers with resolution decimation plus one integer layer at the lowest resolution. At the lowest resolution layer, the N-scale tiling search is performed to select the initial motion vector candidates. Motion vector fields are gradually refined with the XOR Boolean block matching criterion and the N-scale tiling search schemes in higher binary layers. FBPME performs several thousands times faster than the conventional full search block matching scheme at the same PSNR performance and visual quality. It also dramatically reduces the bus bandwidth and on-chip memory requirement. Moreover, the hardware complexity is low due to its binary nature.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
