Abstract
A new fast block-matching algorithm for video coding is presented. In the algorithm, the partial distance search (PDS) technique is performed in the wavelet domain to eliminate the undesired blocks. Since the energy of blocks is concentrated in a few coefficients in the wavelet domain, by starting the PDS at these coefficients, the algorithm can significantly reduce the computational time for block matching. The PDS can be performed over the subspace in the wavelet domain to further lower the the computational time at the expense of a possible slight degradation in performance. In addition, the simple Haar wavelet can be used to remove the need for multiplication for blocking matching. Simulation results show that our algorithm is very effective for video coding where real-time processing is required.
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.
