Suki Arif
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Suki Arif has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Ahmad Abrar
School of Computing, Universiti Utara Malaysia, 06010 Sintok, Kedah, Malaysia
2 shared publications - Ibrahim Abdullahi
Universiti Utara Malaysia
1 shared publication - Khuzairi Mohd Zaini
Universiti Utara Malaysia
1 shared publication - Mahamod Ismail
Universiti Kebangsaan Malaysia
1 shared publication - Mohammed Alsamman
Universiti Utara Malaysia
1 shared publication - Mohd Hasbullah Omar
Universiti Utara Malaysia
1 shared publication
Latest Publications
- 26 January 2024
- Published by Springer Nature
- p. 343-354
Enabling a Sustainable and Inclusive Digital Future with Proactive Producer Mobility Management Mechanism in Named Data Networking
- 26 January 2024
- Published by Springer Nature
- p. 343-354
Enabling a Sustainable and Inclusive Digital Future with Proactive Producer Mobility Management Mechanism in Named Data Networking
- 26 January 2024
- Published by Springer Nature
- p. 330-342
Towards a Sustainable Digital Society: Supporting Producer Mobility in Named Data Networking Through Immobile Anchor-Based Mechanism
- 26 January 2024
- Published by Springer Nature
- p. 330-342
Towards a Sustainable Digital Society: Supporting Producer Mobility in Named Data Networking Through Immobile Anchor-Based Mechanism
- Open Access
- 1 October 2023
- Published by ITMO University in Scientific and Technical Journal of Information Technologies, Mechanics and Optics
- Vol. 23 (5) , 955
A new efficient adaptive rood pattern search motion estimation algorithm
Motion estimation plays a crucial role in video coding; the Adaptive Rood Pattern Search (ARPS) algorithm is a well known fast motion estimation algorithm. However, ARPS has certain limitations, such as the lack of an accurate starting motion vector, a fixed Zero Motion Prejudgment (ZMP) threshold unsuitable for fast motion video sequences, and the repetitive use of a Unit Rood Pattern (URP) resulting in increased computational complexity. To address these issues, this paper proposes a novel algorithm called Efficient Adaptive Rood Pattern Search (EARPS). EARPS overcomes these limitations by employing the Full Search algorithm to obtain optimal motion vectors for the first column in each frame, adopting a dynamic ZMP threshold that adapts to varying motion speeds in video sequences and utilizing URP only once to reduce computational overhead. The performance of the new proposed EARPS algorithm is evaluated and compared with that of ARPS algorithm using various video sequences with different motion speeds. The number of searching points and Peak Signal-to-Noise Ratio (PSNR) are used to quantify computing complexity and accuracy. The experimental findings show that EARPS surpasses ARPS in terms of computing complexity while retaining a decent degree of PSNR accuracy. The proposed EARPS motion estimation algorithm main contribution is to achieve high speed with reasonable accuracy, regardless of the type of motion speed in the video frames. The EARPS algorithm offers a substantial advancement over ARPS, delivering a more efficient motion estimation method with broader applicability in video processing. It represents a significant contribution to the development of effective motion estimation algorithms.
- 1 October 2023
- Published by ITMO University in Scientific and Technical Journal of Information Technologies, Mechanics and Optics
- Vol. 23 (5) , 955
Open AccessA new efficient adaptive rood pattern search motion estimation algorithm
Motion estimation plays a crucial role in video coding; the Adaptive Rood Pattern Search (ARPS) algorithm is a well known fast motion estimation algorithm. However, ARPS has certain limitations, such as the lack of an accurate starting motion vector, a fixed Zero Motion Prejudgment (ZMP) threshold unsuitable for fast motion video sequences, and the repetitive use of a Unit Rood Pattern (URP) resulting in increased computational complexity. To address these issues, this paper proposes a novel algorithm called Efficient Adaptive Rood Pattern Search (EARPS). EARPS overcomes these limitations by employing the Full Search algorithm to obtain optimal motion vectors for the first column in each frame, adopting a dynamic ZMP threshold that adapts to varying motion speeds in video sequences and utilizing URP only once to reduce computational overhead. The performance of the new proposed EARPS algorithm is evaluated and compared with that of ARPS algorithm using various video sequences with different motion speeds. The number of searching points and Peak Signal-to-Noise Ratio (PSNR) are used to quantify computing complexity and accuracy. The experimental findings show that EARPS surpasses ARPS in terms of computing complexity while retaining a decent degree of PSNR accuracy. The proposed EARPS motion estimation algorithm main contribution is to achieve high speed with reasonable accuracy, regardless of the type of motion speed in the video frames. The EARPS algorithm offers a substantial advancement over ARPS, delivering a more efficient motion estimation method with broader applicability in video processing. It represents a significant contribution to the development of effective motion estimation algorithms.
- 2 November 2019
- Published by Springer Nature
- p. 533-544
Compute and Data Grids Simulation Tools: A Comparative Analysis
- 2 November 2019
- Published by Springer Nature
- p. 533-544
Compute and Data Grids Simulation Tools: A Comparative Analysis
- 13 April 2016
- Published by Springer Nature in Wireless Networks
- Vol. 23 (6) , 1917-1952
Power-efficient routing schemes for MANETs: a survey and open issues
- 13 April 2016
- Published by Springer Nature in Wireless Networks
- Vol. 23 (6) , 1917-1952
Power-efficient routing schemes for MANETs: a survey and open issues
- 1 January 2015
- Published by Springer Nature
- p. 327-335
Ubiquitous Shift with Information Centric Network Caching Using Fog Computing
- 1 January 2015
- Published by Springer Nature
- p. 327-335
Ubiquitous Shift with Information Centric Network Caching Using Fog Computing