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

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

Fan Li, Lin Gao, Junfeng Wang, Ruixia Yan
Copyright: © 2022 |Pages: 19
DOI: 10.4018/IJWSR.314948
Article PDF Download
Open access articles are freely available for download

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.
Article Preview
Top

1. Introduction

As a new means of digital image copyright protection, image digital watermarking technology is increasingly connected with various facets of society and plays a decisive role in medical images, commercial publicity, industrial production, information security, etc. The embedding domain of watermarks is generally divided into three kinds: spatial domain, frequency domain, and compression domain. The watermark embedding algorithm based on the spatial domain (Wu et al., 2021) features a low time complexity and a large watermark capacity due to its simplicity and capability to avoid changing the original image. However, as a conventional semi-fragile watermarking algorithm, it only provides adequate resistance against image compression attacks but is less robust against noise disturbances. Frequency-domain-based watermark embedding algorithms (Wu et al., 2021), such as discrete cosine transform, wavelet transform, contourlet transform, shear wave transform, vector transform, and Hadamard transform, require specific alteration of the original image before embedding the watermark, and the watermark can be embedded by modifying, replacing, or exchanging the frequency band coefficients of quality images. In general, the low-frequency section contains important contour information of the image, while the high-frequency section contains redundant details of the image. If robustness is emphasized, it would be suitable to embed the watermark into low-frequency information, while if invisibility and embedding capacity are regarded as more important, it would be suitable to embed the watermark information into the high-frequency section.

Complete Article List

Search this Journal:
Reset
Volume 21: 1 Issue (2024)
Volume 20: 1 Issue (2023)
Volume 19: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 18: 4 Issues (2021)
Volume 17: 4 Issues (2020)
Volume 16: 4 Issues (2019)
Volume 15: 4 Issues (2018)
Volume 14: 4 Issues (2017)
Volume 13: 4 Issues (2016)
Volume 12: 4 Issues (2015)
Volume 11: 4 Issues (2014)
Volume 10: 4 Issues (2013)
Volume 9: 4 Issues (2012)
Volume 8: 4 Issues (2011)
Volume 7: 4 Issues (2010)
Volume 6: 4 Issues (2009)
Volume 5: 4 Issues (2008)
Volume 4: 4 Issues (2007)
Volume 3: 4 Issues (2006)
Volume 2: 4 Issues (2005)
Volume 1: 4 Issues (2004)
View Complete Journal Contents Listing