A Fast And Robust Image Watermarking Scheme Using Improved Singular Value Decomposition
With the popularity of editing software and the Internet, digital content can easily be manipulated and distributed. Therefore, illegal reproduction of digital products became a real problem. Watermarking has been considered as an effective solution for copyright protection and authentication. However, watermarking schemes usually have encountered some difficulties, such as computational complexity, imperceptibility and robustness. In this paper, based on improved singular value decomposition (SVD), we proposed a new image watermarking scheme in order to reduce the computational complexity. To this end, we designed an algorithm to directly compute the largest eigenvalues and eigenvectors of the analyzed image segmented blocks. Moreover, an adaptive embedding technique was utilized to improve the robustness of the proposed scheme. Experimental results showed that the scheme is fast and good for digital image watermarking and it outperforms several widely used schemes in terms of robustness and imperceptibility.
INTELLIGENT INFORMATION AND DATABASE SYSTEMS, ACIIDS 2016, PT I
Digital watermarking, SVD, Eigenvalue, Eigenvector
Data mining,Singular value decomposition,Digital watermarking,Authentication,Embedding,Computer science,Algorithm,Robustness (computer science),Software,Digital content,Computational complexity theory