A New Double Color Image Watermarking Algorithm Based on the SVD and Arnold Scrambling

15Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We propose a new image watermarking scheme based on the real SVD and Arnold scrambling to embed a color watermarking image into a color host image. Before embedding watermark, the color watermark image W with size of M×M is scrambled by Arnold transformation to obtain a meaningless image W. Then, the color host image A with size of N×N is divided into nonoverlapping N/M×N/M pixel blocks. In each (i,j) pixel block Ai,j, we form a real matrix Ci,j with the red, green, and blue components of Ai,j and perform the SVD of Ci,j. We then replace the three smallest singular values of Ci,j by the red, green, and blue values of Wij with scaling factor, to form a new watermarked host image Aij. With the reserve procedure, we can extract the watermark from the watermarked host image. In the process of the algorithm, we only need to perform real number algebra operations, which have very low computational complexity and are more effective than the one using the quaternion SVD of color image.

Cite

CITATION STYLE

APA

Li, Y., Wei, M., Zhang, F., & Zhao, J. (2016). A New Double Color Image Watermarking Algorithm Based on the SVD and Arnold Scrambling. Journal of Applied Mathematics, 2016. https://doi.org/10.1155/2016/2497379

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free