Abstract
This paper presents a new computationally adaptive formulation of the full-search block-matching (FSBM) motion estimation. A key feature of our approach is to progressively adjust the number of computations required per block to the picture variation by applying a data-driven thresholding. Unlike the related methods, the proposed algorithm utilizes a simple threshold updating mechanism which neither requires a large hardware overhead to eliminate redundant search candidates, nor affects the performance of the motion estimation. Compared to the FSBM, it executes four times fewer operations whilst preserving the same quality of results. The algorithm implicitly features array implementation and can be easily realized in VLSI. A supportive hardware design is outlined.
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 callMore From: IEEE Transactions on Circuits and Systems for Video Technology
Disclaimer: 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.
