Abstract
The authors present a new fast block-matching algorithm for video coding. In the algorithm, the partial distance search technique is performed in the wavelet domain to eliminate the undesired blocks. The algorithm can reduce computation time without sacrificing the average distortion for encoding. In addition, the algorithm has a lower arithmetic complexity than other existing fast block-matching algorithms.
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.
