| 1/2024 - 4 |
A New Motion Estimation Method using Modified Hexagonal Search Algorithm and Lucas-Kanade Optical Flow TechniqueGHOUL, K.   , ZAIDI, S. , LABOUDI, Z. |
Extra paper information in    |
| Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF  (1,610 KB) | Citation | Downloads: 594 | Views: 733 |
Author keywords
block matching methods, computational vision, hexagonal search algorithm, Lucas and Kanade method, motion estimation
References keywords
motion(20), estimation(19), video(10), search(10), algorithm(9), flow(8), block(8), optical(7), image(7), fast(6)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2024-02-29
Volume 24, Issue 1, Year 2024, On page(s): 33 - 40
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2024.01004
Web of Science Accession Number: 001178765900003
SCOPUS ID: 85189487561
Abstract
Block matching methods are one of the most widely used methods in motion estimation and compensation. In this work, we propose a new hybrid block matching motion estimation algorithm based on the Lucas and Kanade method as a distortion criterion to improve the accuracy of estimated motion. The proposed algorithm proceeds in three steps. In the first step, a small hexagonal pattern is used, in order to find the smaller motion vectors and thus fewer searching points. In the second step, the modified large hexagonal pattern is used to identify the direction of motion vectors. In the third step, the small hexagonal search pattern is used to refine the solution search. The proposed algorithm is tested on several both synthetic and real images sequences. The experimental results show that our proposal could achieve good performances in terms of amplitude and angular errors, prediction quality, and computational complexity, compared to some related works. |
| References | | | Cited By «-- Click to see who has cited this paper |
| [1] T. Nithyoosha, P. R. Christopher, "A survey on motion estimation and de-hazing algorithms and architectures," Digital Signal Processing, pp. 104130, 2023. [CrossRef] [Web of Science Times Cited 1] [SCOPUS Times Cited 2] [2] D. K. B. Saini, S. D. Kamble, R. Shankar, M. R. Kumar, D. Kapila, and D. P Tripathi, "Fractal video compression for IOT-based smart cities applications using motion vector estimation," Measurement: Sensors, vol. 26, pp. 100698. 2023. [CrossRef] [SCOPUS Times Cited 12] [3] L. Wu, Z. Yang, M. Jian, J. Shen, Y. Yang, X. Lang, "Global motion estimation with iterative optimization-based independent univariate model for action recognition," Pattern Recognition, vol. 116, pp. 107925, 2021. [CrossRef] [Web of Science Times Cited 19] [SCOPUS Times Cited 24] [4] J. Huang, H. Wang, T. Birdal, M. Sung, F. Arrigoni, S. M. Hu, L. J. Guibas, "Multi body sync: Multi-body segmentation and motion estimation via 3D scan synchronization," In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 7108-7118, 2021. [CrossRef] [5] J. Ding, Z. Zhang, X. Yu, X. Zhao, Z. Yan, "A novel moving object detection algorithm based on robust image feature threshold segmentation with improved optical flow estimation," Applied Sciences, vol. 13, no 8, pp 4854, 2023. [CrossRef] [Web of Science Times Cited 4] [SCOPUS Times Cited 5] [6] S. Xuan, S. Li, M. Han, X. Wan, G. S. Xia, "Object tracking in satellite videos by improved correlation filters with motion estimations," IEEE Transactions on Geoscience and Remote Sensing, vol. 58, no 2, pp. 1074-1086, 2019. [CrossRef] [Web of Science Times Cited 105] [SCOPUS Times Cited 129] [7] B. K. P. Horn, and B. G. Schunck, "Determining optical flow," Artificial intelligence, vol. 17, no 1-3, pp. 185-203, 1981. [CrossRef] [Web of Science Times Cited 7174] [SCOPUS Times Cited 6340] [8] K. S. Rao, A. V. Paramkusam, N. K. Darimireddy, A. Chehri, "Block matching algorithms for the estimation of motion in image sequences: Analysis," Procedia Computer Science, vol. 192, pp. 2980-2989, 2021. [CrossRef] [Web of Science Times Cited 3] [SCOPUS Times Cited 4] [9] S. Rao, H. Wang, R. Kashif, F. Rao, "Robust optical flow estimation to enhance behavioral research on ants," Digital Signal Processing, vol. 120, pp. 103284, 2022. [CrossRef] [Web of Science Times Cited 5] [SCOPUS Times Cited 6] [10] T. Koga, "Motion-compensated inter-frame coding for video conferencing," In: Proc. National Telecommunications Conference, pp. G5. 3.1-G5. 3.5, 1981 [11] S. Zhu and C. Zhang, "A fast algorithm of intra prediction modes pruning for HEVC based on decision trees and a new three-step search," Multimedia Tools and Applications, vol. 76, pp. 21707-21728, 2017. [CrossRef] [Web of Science Times Cited 20] [SCOPUS Times Cited 21] [12] L. M. Po and W. C. Ma, "A novel four-step search algorithm for fast block motion estimation," EEE transactions on circuits and systems for video technology, vol. 6, no 3, pp. 313-317, 1996. [CrossRef] [Web of Science Times Cited 994] [SCOPUS Times Cited 1328] [13] S. Banchhor, and D. Shukla, "An improved diamond search pattern for motion estimation," i-manager's Journal on Pattern Recognition, vol. 3, no 3, pp. 19, 2016. [CrossRef] [14] R. P. Ravuri, "Diamond search optimization-based technique for motion estimation in video compression, "International Journal of e-Collaboration, vol. 19, no 3, 2023. [CrossRef] [Web of Science Times Cited 1] [SCOPUS Times Cited 2] [15] J. N. Jivarani and S. K. Parmar, "Motion estimation for video compression using modified hexagonal search," In: International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014). IEEE. pp. 1-7, 2014. [CrossRef] [SCOPUS Times Cited 2] [16] S. Baker, D. Scharstein, J. P. Lewis, S. Roth, M. J. Black, R. Szeliski, "A database and evaluation methodology for optical flow," International journal of computer vision, vol. 92, pp. 1-31, 2011. [CrossRef] [SCOPUS Times Cited 518] [17] J. L. Barron, D. J Fleet, S. S. Beauchemin, "Performance of optical flow techniques," International journal of computer vision, vol. 12, pp. 43-77, 1994. [CrossRef] [Web of Science Times Cited 2740] [SCOPUS Times Cited 3588] [18] B. Galvin, B. McCane, K. Novins, D. Mason, S. Mills, "Recovering motion fields: An evaluation of eight optical flow algorithms," In: BMVC. pp. 195-204, 1998 [19] J. Weickert, A. Bruhn, T. Brox, N. Papenberg, "A survey on variational optic flow methods for small displacements," Springer Berlin Heidelberg, pp. 103-136, 2006. [CrossRef] [20] L. P. Gokul, P. Adarsh, G. Vinayan, G. Gokuldath, M. Ponmalar, S. H. Aswini, "Lucas Kanade based optical flow for vehicle motion tracking and velocity estimation," In: 2023 International Conference on Control, Communication and Computing (ICCC), pp. 1-6, IEEE, 2023. [CrossRef] [SCOPUS Times Cited 3] [21] B. D. Lucas and T. Kanade, "An iterative image registration technique with an application to stereo vision," In IJCAI'81: 7th international joint conference on Artificial intelligence, 1981, vol. 2, pp. 674-679 [22] L. C. Manikandan, S. A. H. Nair, K. P. Sanal Kumar, R. K. Selvakumar, "A study and analysis on block matching algorithms for motion estimation in video coding," Cluster Computing, vol. 22, pp. 11773-11780, 2019. [CrossRef] [Web of Science Times Cited 2] [SCOPUS Times Cited 4] [23] N. Al-Najdawi, M. N. Al-Najdawi, S .Tedmori, "Employing a novel cross-diamond search in a modified hierarchical search motion estimation algorithm for video compression," Information Sciences, vol. 268, pp. 425-435, 2014. [CrossRef] [Web of Science Times Cited 26] [SCOPUS Times Cited 31] [24] K. Belloulata, S. Zhu, Z. Wang, "A fast fractal video coding algorithm using cross-hexagon search for block motion estimation," International Scholarly Research Notices, vol. 2011. [CrossRef] [SCOPUS Times Cited 13] [25] T. Z. Hamood, M. E. Abdulmunem, "A novel kite cross hexagonal search algorithm for fast block motion estimation," In: Journal of Physics: Conference Series. IOP Publishing, pp. 012026, 2021. [CrossRef] [SCOPUS Times Cited 2] [26] Y. Douini, J. Riffi, A. M. Mahraz, H. Tairi, "An image registration algorithm based on phase correlation and the classical Lucas-Kanade technique," Signal, Image and Video Processing, vol. 11, pp. 1321-1328, 2017. [CrossRef] [Web of Science Times Cited 17] [SCOPUS Times Cited 19] [27] Y. Ahmine, G. Caron, E. M. Mouaddib, F. Chouireb, "Adaptive Lucas-Kanade tracking," Image and Vision Computing, vol. 88, pp. 1-8, 2019. [CrossRef] [Web of Science Times Cited 13] [SCOPUS Times Cited 17] [28] D. Kerfa, M. F. Belbachir, "Star diamond: An efficient algorithm for fast block matching motion estimation in H264/AVC video codec," Multimedia tools and applications, vol. 75, pp. 3161-3175, 2016. [CrossRef] [Web of Science Times Cited 15] [SCOPUS Times Cited 19] [29] S. Zhu, K. K. Ma, "A new diamond search algorithm for fast block-matching motion estimation," IEEE transactions on Image Processing, vol. 9, no 2, pp. 287-290, 2000. [CrossRef] [Web of Science Times Cited 1163] [SCOPUS Times Cited 1570] [30] R. Yaakob, A. Aryanfar, A. A. Halin, N. Sulaiman, "A comparison of different block matching algorithms for motion estimation," Procedia Technology, vol. 11, pp. 199-205, 2013. [CrossRef] [Web of Science Times Cited 22] Web of Science® Citations for all references: 12,324 TCR SCOPUS® Citations for all references: 13,659 TCR Web of Science® Average Citations per reference: 398 ACR SCOPUS® Average Citations per reference: 441 ACR TCR = Total Citations for References / ACR = Average Citations per Reference We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more Citations for references updated on 2024-11-17 11:15 in 185 seconds. Note1: Web of Science® is a registered trademark of Clarivate Analytics. Note2: SCOPUS® is a registered trademark of Elsevier B.V. Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site. |
Copyright ©2001-2024
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
