.png){kind=icon}
.png){kind=icon}
Return
An efficient and robust zero watermarking algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s11042-022-12115-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To improve the resistance to geometric rotation attacks and to solve the problem of high computational complexity of existing watermarking algorithms, a novel efficient and robust zero watermarking algorithm in spatial domain is proposed. First, the central pixels of different channels of colorful host image are taken as the center of the circle, and the features of the image are constructed by the pixels covered by rings with different radius and width. The binary feature image is obtained by binary operation on the constructed image features. Then, the zero watermark image is constructed by XOR operation for the scrambled binary feature image and copyright watermark image encrypted Logistic chaotic algorithm. Finally, the zero watermark image is stored in the intellectual property database for copyright certification in possible copyright disputes. Experimental results show that the proposed algorithm is robust to geometric rotation attacks and common image processing attacks. Compared with similar zero watermarking schemes, the proposed algorithm has lower computational complexity and better robustness.
Keywords:
Spatial domain
Zero watermarking
Geometric attack
Logistic chaotic encryption
Journal
IF:
3
Papers:
1.9W
Citations:
3.2W