Abstract

The computational complexity of motion estimation (ME), increases proportionally with the number of search points. As a result, rapid ME techniques reduce complexity by using different search patterns. Of these techniques, hexagonal search (HS) with a small diamond search pattern (SDSP) significantly reduces complexity compared to other fast ME algorithms. The proposed hexagonal intersection search (HIS) algorithm improves the inner search of HS. The new algorithm cares the inner points near to the intersection of a hexagon rather than a SDSP or a full search. The proposed algorithm reduce 7–15% search points compared with HS. Compared with other popular algorithms, the HIS algorithm made the lowest number of average search points with negotiable PSNR loss.

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.