Open Access iconOpen Access

ARTICLE

crossmark

Improving Video Watermarking through Galois Field GF(24) Multiplication Tables with Diverse Irreducible Polynomials and Adaptive Techniques

Yasmin Alaa Hassan1,*, Abdul Monem S. Rahma2

1 Department of Computer Science, College of Science, University of Baghdad, Baghdad, Iraq
2 Department of Computer Science, College of Science, Al-Maarif University College, Al-Anbar, Iraq

* Corresponding Author: Yasmin Alaa Hassan. Email: email

Computers, Materials & Continua 2024, 78(1), 1423-1442. https://doi.org/10.32604/cmc.2023.046149

Abstract

Video watermarking plays a crucial role in protecting intellectual property rights and ensuring content authenticity. This study delves into the integration of Galois Field (GF) multiplication tables, especially GF(24), and their interaction with distinct irreducible polynomials. The primary aim is to enhance watermarking techniques for achieving imperceptibility, robustness, and efficient execution time. The research employs scene selection and adaptive thresholding techniques to streamline the watermarking process. Scene selection is used strategically to embed watermarks in the most vital frames of the video, while adaptive thresholding methods ensure that the watermarking process adheres to imperceptibility criteria, maintaining the video’s visual quality. Concurrently, careful consideration is given to execution time, crucial in real-world scenarios, to balance efficiency and efficacy. The Peak Signal-to-Noise Ratio (PSNR) serves as a pivotal metric to gauge the watermark’s imperceptibility and video quality. The study explores various irreducible polynomials, navigating the trade-offs between computational efficiency and watermark imperceptibility. In parallel, the study pays careful attention to the execution time, a paramount consideration in real-world scenarios, to strike a balance between efficiency and efficacy. This comprehensive analysis provides valuable insights into the interplay of GF multiplication tables, diverse irreducible polynomials, scene selection, adaptive thresholding, imperceptibility, and execution time. The evaluation of the proposed algorithm’s robustness was conducted using PSNR and NC metrics, and it was subjected to assessment under the impact of five distinct attack scenarios. These findings contribute to the development of watermarking strategies that balance imperceptibility, robustness, and processing efficiency, enhancing the field’s practicality and effectiveness.

Keywords


Cite This Article

Y. A. Hassan and A. M. S. Rahma, "Improving video watermarking through galois field gf(24) multiplication tables with diverse irreducible polynomials and adaptive techniques," Computers, Materials & Continua, vol. 78, no.1, pp. 1423–1442, 2024.



cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 129

    View

  • 64

    Download

  • 0

    Like

Share Link