Abstract
Block motion estimation using full search is computationally intensive. Previously proposed fast search algorithms limit the size of search window, the size of sequence (usually QCIF format) and search locations. These algorithms do not fit for sequences having large motion or larger picture size. In this paper, we present a new fast and efficient search algorithm for block motion estimation that produce better performance in quality than TSS and 4SS and less computational time. The proposed algorithm is based on the idea of selecting an adaptive search window per macro-block using 3 spatial macro-blocks and one temporal macro-block with the distance criterion without computational burden. The result of simulation shows not only better quality of pictures than that of TSS and 4SS, but also faster execution time. Therefore it can be good solution for the real time multimedia mobile systems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.