Blind and safety-enhanced dual watermarking algorithm with chaotic system encryption based on RHFM and DWT-DCT

Li, Zhenyu; Zhang, Hao; Liu, Xilin; Wang, Chunpeng; Wang, Xingyuan

doi:10.1016/j.dsp.2021.103062

Cited by 32 publications

(23 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Compared with spatial domain-based watermarking, frequency domain-based watermarking is more stealthy and resistant to attacks. Due to the excellent properties of frequency domainbased watermarking algorithms, hybrid watermarking algorithms [1,3,15,25,29] have gained wide attention. Abbas et al [1] combined Lifting Wavelet Transform (LWT) with Bi-dimensional empirical mode decomposition (BEMD)to embed the watermark into the corresponding frequency band of the host image after BEMD.…”

Section: Embedding-based Watermarking Algorithmsmentioning

confidence: 99%

A novel zero-watermarking algorithm based on robust statistical features for natural images

et al. 2022

View full text Add to dashboard Cite

In this paper, we develop a robust image zero-watermarking algorithm based on multiple circular statistical features. First of all, we detect stable feature points from the host image, and construct circular region partitions from the identified feature points, which contain the critical information of the host image. Second, the statistics and differences of circular region partitions are calculated, which contain both the local differences and the global information of the host image. Third, we apply discrete cosine transform (DCT) and singular value decomposition (SVD) in statistics and differences in order to construct the feature image. The stability of DCT and SVD further warrants the robustness of the algorithm. Moreover, Arnold transform is used to scramble the watermark image to enhance the security of the algorithm. Finally, we obtain the zero watermark by performing the exclusive-or (XOR) operation between the feature image and the scrambled watermark image, and the zero watermark is stored in the copyright authentication database for copyright authentication. Moreover, to combat geometric attacks, we develop a blind image correction algorithm without using the original image to accurately correct the attacked image. Numerous experiments and comparisons with the state-of-the-art (SOTA) watermarking algorithms confirm that the proposed algorithm affords good robustness against various attacks, such as filtering attacks, noise attacks, geometric attacks, and even a random combination of the above-stated attacks.

show abstract

Section: Embedding-based Watermarking Algorithmsmentioning

confidence: 99%

A novel zero-watermarking algorithm based on robust statistical features for natural images

et al. 2022

View full text Add to dashboard Cite

show abstract

“…According to different extraction methods of watermarks, it can be divided into nonblind watermarking 24 and blind watermarking. [25][26][27][28][29][30][31][32][33][34][35][36][37] According to different embedding domains of watermarks, it can be divided into spatial-domain watermarking 27,32,34 and frequency-domain watermarking. 25,26,[28][29][30][31]33,[35][36][37] Because carrier information is difficult to be obtained in practical applications, blind watermarking is more extensive and has higher practical value.…”

Section: Related Workmentioning

confidence: 99%

“…[25][26][27][28][29][30][31][32][33][34][35][36][37] According to different embedding domains of watermarks, it can be divided into spatial-domain watermarking 27,32,34 and frequency-domain watermarking. 25,26,[28][29][30][31]33,[35][36][37] Because carrier information is difficult to be obtained in practical applications, blind watermarking is more extensive and has higher practical value. In addition, frequency-domain watermarking is more robust than spatial-domain watermarking, although its operation is relatively complex, the relative running time is also shortening with the upgrade of hardware.…”

Section: Related Workmentioning

confidence: 99%

“…There are many algorithms used in digital watermarking schemes, such as discrete cosine transform (DCT), 25,26 discrete wavelet transform, 27,28 Schur decomposition, 29,30 eigenvalue decomposition (EVD), 31 singular value decomposition (SVD), 32,33 and other transforms. [34][35][36][37] Yuan et al 25 proposed a DCT-based color image watermarking scheme.…”

Section: Related Workmentioning

confidence: 99%

“…At present, digital watermarking schemes can be classified in terms of various methods. According to different extraction methods of watermarks, it can be divided into nonblind watermarking 24 and blind watermarking 25–37 . According to different embedding domains of watermarks, it can be divided into spatial‐domain watermarking 27,32,34 and frequency‐domain watermarking 25,26,28–31,33,35–37 .…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A watermarking scheme for dual‐color images based on URV decomposition and image correction

Sun

Zhang

et al. 2022

Int J of Intelligent Sys

View full text Add to dashboard Cite

In view of the fact that many watermarking schemes cannot well adapt to the occasion of image copyright protection with a large amount of information, and the copyright protection of color image is facing severe challenges, a dual-color image watermarking scheme based on URV decomposition (URVD) and image correction is designed in this paper. The twodimensional Logistic-adjusted-Sine map is first used to generate two chaotic sequences for pixel-level scrambling and bit-level diffusion of the watermark image, and URVD is applied to watermarking scheme.After fully considering the relationship between image channels, the watermark is embedded into the maximum URVD coefficient by using quantization index modulation based on variable quantization steps. The greatest contribution of this paper is to propose a new image correction algorithm as a pretreatment of watermark extraction, which mainly includes fast detection of feature points, image correction, and sawtooth processing, and it solves some problems existing in image correction algorithms based on geometric characteristics. Experimental results show that the proposed scheme has good invisibility, strong robustness, and high security.

show abstract

Dual Image Watermarking Technique Using IWT-SVD and Diffie Hellman Key Exchange Algorithm

Priyadarshini¹,

Naik²

2022

Communications in Computer and Information Science

View full text Add to dashboard Cite

Blind and safety-enhanced dual watermarking algorithm with chaotic system encryption based on RHFM and DWT-DCT

Cited by 32 publications

References 39 publications

A novel zero-watermarking algorithm based on robust statistical features for natural images

A novel zero-watermarking algorithm based on robust statistical features for natural images

A watermarking scheme for dual‐color images based on URV decomposition and image correction

Dual Image Watermarking Technique Using IWT-SVD and Diffie Hellman Key Exchange Algorithm

Contact Info

Product

Resources

About