Abstract
This paper proposes a novel computational structure for Sum of Absolute Difference (SAD) in Fast Full Search (FFS) algorithm to ellipsis part of the SAD value dependency. This structure adopts an SAD Accumulating Termination Algorithm (SAD-ATA) and an Early Loop Termination Decision (ELTD). SAD-ATA is used to analyze and determine whether to skip the following operation of successive SAD accumulation or not, and ELTD is for the control and reduction of SAD comparison loopspsila degree in FFS ME. The Ratio Distortion (RD) based simulation results show that the proposed algorithm achieves an acceleration in ME processing speed by averagely more than 92% and 20% reduction compared with Full Search (FS) and Fast Full Search (FFS) in H.264 JM12.4, respectively. Meanwhile, the impact on video quality is negligible.
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.
