Abstract
The correspondence presents a fast exhaustive search algorithm for motion estimation. The basic idea is to obtain the best estimate of the motion vectors by successively eliminating the search positions in the search window and thus decreasing the number of matching evaluations that require very intensive computations. Simulation results demonstrate that although the performance of the proposed algorithm is the same as that using the exhaustive search, the computation time has been reduced significantly.
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.
