• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

Computer Engineering & Science ›› 2021, Vol. 43 ›› Issue (07): 1243-1249.

Previous Articles     Next Articles

A color image robust watermarking algorithm based on Schur decomposition and chaotic scrambling

LI Wei-an,XIONG Xiang-guang,XIA Dao-xun   

  1. (School of Big Data and Computer Science,Guizhou Normal University,Guiyang 550001,China)
  • Received:2020-01-30 Revised:2020-07-30 Accepted:2021-07-25 Online:2021-07-25 Published:2021-08-17

Abstract: Aiming at the problem that the traditional color image watermarking algorithm usually only embeds a random signal or binary image into the color carrier image, by combining the advantages of chaotic system and Schur decomposition, a robust watermarking algorithm is proposed, which embeds a color watermarking image into a color cover image. Firstly, the Arnold scrambling and chaotic encryption are performed on the color watermarking image to improve the security performance of the color watermarking image. Secondly, the color cover image is separated into three channels, each channel is divided into 4×4 non-overlapping blocks, and Schur decomposition is done on the selected block. Finally, the pre-processed watermarking signal is embedded into the maximum energy element after Schur decomposition. The experimental results show that the proposed algorithm has better imperceptibility, and has better robustness to filter attacks, noise attacks, JPEG compression attacks, and multiple combined attacks. Compared with similar watermarking algorithms based on Schur decomposition, this algorithm has better anti-attack performance for most attacks.


Key words: digital watermarking, color image, Schur decomposition, chaotic scrambling, robustness