Abstract
A fast N-step search algorithm for rate-constrained motion estimation is presented. The motion vectors are selected from a search window based on a rate-distortion criterion by successively eliminating the search positions at each step. The performance of the proposed algorithm is identical to the performance of the conventional rate-constrained N-step search algorithm, with considerable reduction in computation. Computational savings increase in parallel with the increase in the rate constraint and the number of steps.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.