A search pattern based on the repeated motion vectors components for the fast block matching motion estimation in temporal coding
by Awanish Kumar Mishra; Narendra Kohli
International Journal of Computational Science and Engineering (IJCSE), Vol. 27, No. 2, 2024

Abstract: To reduce the amount of unnecessary data in a video's timeline, block-based motion estimate is routinely utilised. However, a significant reduction in the computational complexity of motion estimation remains a significant problem. In this manuscript, a search pattern approach is proposed to efficiently estimate the motion of blocks. Proposed algorithm estimates the motion based on the maximum frequency of magnitude and direction of the available motion vector components. Motion vector components with higher frequency have greater probability to provide early estimation of matching block. In this iterative process, searching for the matching block is terminated on getting matched block. To demonstrate the enhanced performance of the proposed approach, a comprehensive analysis is carried out, and when we compare the results, the novel approach outperforms recent motion estimation approaches. Proposed approach improves the best case complexity till one search per block for dynamic blocks. It improves the average case complexity because of the early termination of the process.

Online publication date: Mon, 11-Mar-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com