Abstract
The recursive search motion estimation algorithm offers smooth and accurate motion vector fields. Computationally, the most expensive part of the motion estimator is the evaluation of the various motion vector candidates. Evaluation is performed by comparing blocks in two consecutive frames indicated by motion vector candidates. The paper addresses the issue of reducing the already extremely low number of motion vector evaluations. We apply preprocessing techniques to reduce the number of motion vector candidates from 7 to 5, i.e. 30%, without sacrificing quality. We exemplify the above findings through experimental results obtained using the 3D recursive search motion estimation algorithm. The required preprocessing overhead is negligible.
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.
