IDEAS home Printed from https://ideas.repec.org/a/igg/jwsr00/v19y2022i1p1-19.html
   My bibliography  Save this article

Strong Robustness Watermarking Algorithm Based on Lifting Wavelet Transform and Hessenberg Decomposition

Author

Listed:
  • Fan Li

    (Sichuan University, China)

  • Lin Gao

    (Chengdu University of Information Technology, China)

  • Junfeng Wang

    (Sichuan University, China)

  • Ruixia Yan

    (Southwest University of Science and Technology, China)

Abstract

Watermark imperceptibility and robustness in the present watermarking algorithm based on discrete wavelet transform (DWT) could be weakened due to data truncation. To solve this problem, a strong robustness watermarking algorithm based on the lifting wavelet transform is proposed. First, the color channels of the original image are separated, and the selected channels are processed through lifting wavelet transform to obtain low-frequency information. The information is then split into blocks, with Hesseneberg decomposition performed on each block. Arnold algorithm is used to scramble the watermark image, and the scrambled watermark is transformed into a binary sequence that is then embedded into the maximum element of Hessenberg decomposed matrix by quantization modulation. The experimental results exhibit a good robustness of this new algorithm in defending against a wide variety of conventional attacks.

Suggested Citation

  • Fan Li & Lin Gao & Junfeng Wang & Ruixia Yan, 2022. "Strong Robustness Watermarking Algorithm Based on Lifting Wavelet Transform and Hessenberg Decomposition," International Journal of Web Services Research (IJWSR), IGI Global, vol. 19(1), pages 1-19, January.
    • Handle: RePEc:igg:jwsr00:v:19:y:2022:i:1:p:1-19
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJWSR.314948
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jwsr00:v:19:y:2022:i:1:p:1-19. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.