A New Double Color Image Watermarking Algorithm Based on the SVD and Arnold ScramblingReportar como inadecuado

A New Double Color Image Watermarking Algorithm Based on the SVD and Arnold Scrambling - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Journal of Applied Mathematics - Volume 2016 2016, Article ID 2497379, 9 pages -

Research Article

College of Mathematical Sciences, Liaocheng University, Shandong 252000, China

College of Mathematics and Science, Shanghai Normal University, Shanghai 200234, China

Received 12 July 2016; Revised 6 October 2016; Accepted 26 October 2016

Academic Editor: M. Montaz Ali

Copyright © 2016 Ying Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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 with size of is scrambled by Arnold transformation to obtain a meaningless image . Then, the color host image with size of is divided into nonoverlapping pixel blocks. In each pixel block , we form a real matrix with the red, green, and blue components of and perform the SVD of . We then replace the three smallest singular values of by the red, green, and blue values of with scaling factor, to form a new watermarked host image . 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.

Autor: Ying Li, Musheng Wei, Fengxia Zhang, and Jianli Zhao

Fuente: https://www.hindawi.com/


Documentos relacionados