Abstract

Conventional full search block matching algorithm (BMA) for motion estimation is computationally intensive and the resulting hardware cost is very high. In this paper, we present an efficient BMA using a 16:1 subsampling technique, and describe its hardware design. The algorithm reduces the number of pixels in calculating the mean absolute difference at each search location, instead of reducing the search locations. The algorithm is an extension of the BMA with 4:1 subsampling proposed by Lin and Zaccarin (1993) such that the amount of computation is reduced by a factor of 4 (16 compared to the full search BMA) while producing similar performance. The algorithm can efficiently be designed into a hardware for real-time applications.

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 call

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.