A novel robust zero-watermarking algorithm for audio based on sparse representation

Behind the prevalence of multimedia technology, digital copyright disputes are becoming increasingly serious. The digital watermarking prevention technique against the copyright infringement needs to be improved urgently. Among the proposed technologies, zero-watermarking has been favored recently. In order to improve the robustness of the zero-watermarking, a novel robust audio zerowatermarking method based on sparse representation is proposed. The proposed scheme is mainly based on the K-singular value decomposition (K-SVD) algorithm to construct an optimal over complete dictionary from the background audio signal. After that, the orthogonal matching pursuit (OMP) algorithm is used to calculate the sparse coefficient of the segmented test audio and generate the corresponding sparse coefficient matrix. Then, the mean value of absolute sparse coefficients in the sparse matrix of segmented speech is calculated and selected, and then comparing the mean absolute coefficient of segmented speech with the average value of the selected coefficients to realize the embedding of zero-watermarking. Experimental results show that the proposed audio zero-watermarking algorithm based on sparse representation performs effectively in resisting various common attacks. Compared with the baseline works, the proposed method has better robustness.
    • Correction
    • Source
    • Cite
    • Save