Abstract
The new fast full search motion estimation algorithm for optimal motion estimation is proposed in this paper. The computational process of boundaries and possibility of early rejection of non best candidate blocks in Successive Elimination Algorithm (SEA), Multilevel Successive Elimination Algorithm (MSEA) and Fine Granularity Successive Elimination (FGSE) are theoretically and practically analyzed. Based on these analyzes, we present two methods. The first method is Fast Computing Method (FCM) which takes advantage of mathematical indications of redundancy to reduce the number of operations required to compute the boundaries. The second method is Best Initial Matching Error Predictive Method (BIMEPM) which predicts the best initial matching error. With these methods, the operation number for proposed motion estimation is reduced down to 1/52 of Full Search (FS). But MSEA and FGSE algorithms can reduce computations by 1/40 and 1/42 of FS.
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.
