Abstract
We present an algorithmic enhancement of the full-search block-matching algorithm for motion estimation. The proposed algorithm reduces the computational load by successively eliminating noncandidate blocks from the search window. The elimination process uses low bit-resolution blocks and it is applied in two stages for motion vector computation. This computational reduction leads to enhanced performance in terms of low power consumption and fast motion vector estimation. A low power VLSI implementation of the algorithm is also presented. Simulation results show that the new algorithm, at an average, eliminates more than 88% of the candidate blocks in the search window.
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.
