A blind double color image watermarking algorithm based on QR decomposition

2013 ◽  
Vol 72 (1) ◽  
pp. 987-1009 ◽  
Author(s):  
Qingtang Su ◽  
Yugang Niu ◽  
Hailin Zou ◽  
Yongsheng Zhao ◽  
Tao Yao
Symmetry ◽  
2020 ◽  
Vol 12 (3) ◽  
pp. 486
Author(s):  
Pranab Kumar Dhar ◽  
Pulak Hazra ◽  
Tetsuya Shimamura

Digital watermarking has been utilized effectively for copyright protection of multimedia contents. This paper suggests a blind symmetric watermarking algorithm using fan beam transform (FBT) and QR decomposition (QRD) for color images. At first, the original image is transferred from RGB to L*a*b* color model and FBT is applied to b* component. Then the b*component of the original image is split into m × m non-overlapping blocks and QRD is conducted to each block. Watermark data is placed into the selected coefficient of the upper triangular matrix using a new embedding function. Simulation results suggest that the presented algorithm is extremely robust against numerous attacks, and also yields watermarked images with high quality. Furthermore, it represents more excellent performance compared with the recent state-of-the-art algorithms for robustness and imperceptibility. The normalized correlation (NC) of the proposed algorithm varies from 0.8252 to 1, the peak signal-to-noise ratio (PSNR) varies from 54.1854 to 54.1892, and structural similarity (SSIM) varies from 0.9285 to 0.9696, respectively. In contrast, the NC of the recent state-of-the-art algorithms varies from 0.5193 to 1, PSNR varies from 38.5471 to 52.64, and SSIM varies from 0.9311 to 0.9663, respectively.


2015 ◽  
Vol 76 (1) ◽  
pp. 707-729 ◽  
Author(s):  
Qingtang Su ◽  
Gang Wang ◽  
Xiaofeng Zhang ◽  
Gaohuan Lv ◽  
Beijing Chen

2021 ◽  
Author(s):  
Phuong Thi Nha ◽  
Ta Minh Thanh ◽  
Nguyen Tua Phong

Abstract In order to protect the color image copyright protection of the digital multimedia, it is necessary to design a color image watermarking algorithm. To achieve this purpose, an improved color image watermarking scheme based on QR decomposition for color image matrix is proposed in this paper. The proposed method gives a new algorithm to find elements of Q and R matrices instead of using Gram-Schmidt algorithm for QR factorization. First, R matrix is performed by solving a set of linear equations where diagonal elements of R are checked and modified if they are zero or negative. After that, Q matrix is computed based on R matrix. In addition, a novel formula is proposed to improve extracting time where the first element R(1,1) of R matrix is found instead of computing QR decomposition as the previous proposals. Experimental results show that the proposed method outperforms other methods considered in this paper in term of the quality of the watermarked images and the robustness of embedding method. Furthermore, the execution time is significantly improved and the watermark image is more robust under some tested attacks.


2015 ◽  
Vol 24 (4) ◽  
pp. 1025-1032 ◽  
Author(s):  
L. Laur ◽  
P. Rasti ◽  
M. Agoyi ◽  
G. Anbarjafari

Sign in / Sign up

Export Citation Format

Share Document