关键词: 奇异值分解（SVD）, 虚警率, 零水印, 矩阵Schur分解, 感知哈希, 斐波那契变换

Abstract: In order to solve the problems of high false alarm, poor robustness and security in the SVD (singular value decomposition) watermarking algorithms, this paper proposes a fast zero-watermarking algorithm with both the double encryption and strong robustness based on matrix Schur decomposition. Firstly, the matrix Schur decom-position is used on the low-frequency blocks of original images to obtain a stable value. Then, it extracts the abs-olute value of diagonal elements containing the largest energy elements of the upper triangular matrix of Schur decomposition block matrix so that it constructs a transition matrix. Next, to obtain the characteristic matrix, the average value of the matrix is compared with each element value to generate a perceptual Hash binary sequence. In addition, the chaotic map-encrypted feature matrix and the Fibonacci transform-encrypted watermark information are operated to obtain a zero-watermark. Finally, the registration is completed in the third party copyright certification center of IPR (intellectual property rights). Experimental results show that the NC value of watermark extracted from random carriers is less than 0.5, which can effectively solve the problem of high false alarm. Compared with the robust zero watermark based on integer wavelet transform, the performance of noise immunity is improved by 2.43%. In contrast with the time-domain watermarking algorithm, the resistance to JPEG raises up to 4.88% in performance.

Key words: singular value decomposition (SVD), false alarm rate, zero-watermarking, matrix Schur decomposition, perceptual Hash, Fibonacci transform