IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i18p2938-d1482573.html
   My bibliography  Save this article

A Video Dual-Domain Blind Watermarking Algorithm Based on Hadamard Transform

Author

Listed:
  • Yucheng Liang

    (Key Laboratory of Information Security of the Chinese People’s Armed Police Force, Chinese People’s Armed Police Force Engineering University, Xi’an 710086, China)

  • Ke Niu

    (Key Laboratory of Information Security of the Chinese People’s Armed Police Force, Chinese People’s Armed Police Force Engineering University, Xi’an 710086, China)

  • Yingnan Zhang

    (Key Laboratory of Information Security of the Chinese People’s Armed Police Force, Chinese People’s Armed Police Force Engineering University, Xi’an 710086, China)

  • Yifei Meng

    (College of Cryptographic Engineering, Chinese People’s Armed Police Force Engineering University, Xi’an 710086, China)

  • Fangmeng Hu

    (College of Cryptographic Engineering, Chinese People’s Armed Police Force Engineering University, Xi’an 710086, China)

Abstract

Addressing the compatibility challenges surrounding the robustness and reversibility of existing video watermarking techniques, this study introduces a novel video dual-domain blind watermarking algorithm leveraging the Hadamard transform. Specifically tailored for H.264 video copyright protection, the algorithm initially organizes video frames and identifies key frames for watermark embedding. Prior to embedding, the robust watermark undergoes coding preprocessing to optimize its integration. Subsequently, a 4 × 4 block is expanded based on the selected embedding position within the frame, followed by the application of the Hadamard transform to the enlarged block. The 1-bit robust watermark information is then embedded via the coefficient pair located in the first row of the Hadamard coefficient matrix corresponding to the expanded block. Additionally, a reversible watermark, designed to mitigate the distortions introduced during robust embedding, is generated and embedded into the remaining coefficients of the coefficient matrix using reversible embedding techniques. During watermark extraction, the dual-domain watermark can be retrieved exclusively through reversible extraction methodologies by analyzing the size relationship of coefficient pairs, eliminating the need for access to the original video data. To bolster the algorithm’s robustness, a majority-subordinate voting system is devised and implemented, effectively enhancing its resilience. Experimental findings demonstrate that, compared to similar approaches, this algorithm not only enhances the reversibility of video restoration but also exhibits superior robustness and meets the requirements for imperceptibility.

Suggested Citation

  • Yucheng Liang & Ke Niu & Yingnan Zhang & Yifei Meng & Fangmeng Hu, 2024. "A Video Dual-Domain Blind Watermarking Algorithm Based on Hadamard Transform," Mathematics, MDPI, vol. 12(18), pages 1-28, September.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:18:p:2938-:d:1482573
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/18/2938/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/18/2938/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Wichmann, B.A. & Hill, I.D., 2006. "Generating good pseudo-random numbers," Computational Statistics & Data Analysis, Elsevier, vol. 51(3), pages 1614-1622, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. repec:jss:jstsof:34:i04 is not listed on IDEAS
    2. McCullough, B.D., 2008. "Microsoft Excel's 'Not The Wichmann-Hill' random number generators," Computational Statistics & Data Analysis, Elsevier, vol. 52(10), pages 4587-4593, June.
    3. Massimo Gangi & Giulio E. Cantarella & Antonino Vitetta, 2019. "Solving stochastic frequency-based assignment to transit networks with pre-trip/en-route path choice," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 661-681, December.
    4. Cheng, Ching-Wei & Hung, Ying-Chao & Balakrishnan, Narayanaswamy, 2014. "Generating beta random numbers and Dirichlet random vectors in R: The package rBeta2009," Computational Statistics & Data Analysis, Elsevier, vol. 71(C), pages 1011-1020.
    5. P. Luizi & F. Cruz & J. Graaf, 2010. "Assessing the Quality of Pseudo-Random Number Generators," Computational Economics, Springer;Society for Computational Economics, vol. 36(1), pages 57-67, June.
    6. Krzysztof Tomczyk, 2020. "Monte Carlo-Based Procedure for Determining the Maximum Energy at the Output of Accelerometers," Energies, MDPI, vol. 13(7), pages 1-13, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:18:p:2938-:d:1482573. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.