A New Robust Watermarking Scheme for Color Image in Spatial Domain

Author(s):  
Ibrahim Nasir ◽  
Ying Weng ◽  
Jianmin Jiang
2016 ◽  
Vol 48 ◽  
pp. 12-21 ◽  
Author(s):  
Zhuhong Shao ◽  
Yuanyuan Shang ◽  
Rui Zeng ◽  
Huazhong Shu ◽  
Gouenou Coatrieux ◽  
...  

2008 ◽  
Vol 5 (1) ◽  
pp. 155-159
Author(s):  
Baghdad Science Journal

In this work a fragile watermarking scheme is presented. This scheme is applied to digital color images in spatial domain. The image is divided into blocks, and each block has its authentication mark embedded in it, we would be able to insure which parts of the image are authentic and which parts have been modified. This authentication carries out without need to exist the original image. The results show the quality of the watermarked image is remaining very good and the watermark survived some type of unintended modification such as familiar compression software like WINRAR and ZIP


2017 ◽  
Vol 25 (4) ◽  
pp. 61-79 ◽  
Author(s):  
B.V.D. S. Sekhar ◽  
P.V.G.D. Prasad Reddy ◽  
G.P.S. Varma

Watermarking emerged as versatile technique of hiding confidential or copy right protect information. The image embedded with watermark is often prone to several security vulnerabilities due to several attacks. It is desired to secure the information in the form of watermark by making it immune to these attacks. Several techniques are prevailing which use image transform techniques for efficient watermark de-noising and extraction. However, in the recent past the evolutionary computing techniques evolved as promising methods. In this paper, one such attempt of integrating the popular image transform techniques with PSO for developing efficient watermarking scheme. Embedding and extraction of the watermark are demonstrated and finally the efficiency of the technique is evaluated in terms of calculated PNSR. Gray scale image is used as WM image and a color image is considered for hosting the WM image. The technique utilises only one frame of the color image for hiding securely the WM image instead of conventional method of using all the three frames.


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 10 (11) ◽  
pp. 1127
Author(s):  
Nidaa Hasan Abbas ◽  
Sharifah Mumtazah Syed Ahmad ◽  
Wan Azizun Wan Adnan ◽  
Abed Rahman Bin Ramli ◽  
Sajida Parveen

2018 ◽  
Vol 31 (1) ◽  
pp. 277 ◽  
Author(s):  
Methaq Talib Gaata

  With the fast progress of information technology and the computer networks, it becomes very easy to reproduce and share the geospatial data due to its digital styles. Therefore, the usage of geospatial data suffers from various problems such as data authentication, ownership proffering, and illegal copying ,etc. These problems can represent the big challenge to future uses of the geospatial data. This paper introduces a new watermarking scheme to ensure the copyright protection of the digital vector map. The main idea of proposed scheme is based on transforming  the digital map to frequently domain using the Singular Value Decomposition (SVD) in order to determine suitable areas to insert the watermark data. The digital map is separated into the isolated parts.Watermark data are embedded within the nominated magnitudes in each part when satisfied the definite criteria. The efficiency of proposed watermarking scheme is assessed within statistical measures based on two factors which are fidelity and robustness. Experimental results demonstrate the proposed watermarking scheme representing ideal trade off for disagreement issue between distortion amount and robustness. Also, the proposed scheme shows  robust resistance for many kinds of attacks.


Author(s):  
Wenbing Wang ◽  
Shengli Liu ◽  
Liu Feng

Generic polar complex exponential transform (GPCET), as continuous orthogonal moment, has the advantages of computational simplicity, numerical stability, and resistance to geometric transforms, which make it suitable for watermarking. However, errors in kernel function discretization can degrade these advantages. To maximize the GPCET utilization in robust watermarking, this paper proposes a secondary grid-division (SGD)-based moment calculation method that divides each grid corresponding to one pixel into nonoverlapping subgrids and increases the number of sampling points. Using the accurate moment calculation method, a nonsubsampled contourlet transform (NSCT)–GPCET-based watermarking scheme with resistance to image processing and geometrical attacks is proposed. In this scheme, the accurate moment calculation can reduce the numerical error and geometrical error of the traditional methods, which is verified by an image reconstruction comparison. Additionally, NSCT and accurate GPCET are utilized to achieve watermark stability. Subsequent experiments test the proposed watermarking scheme for its invisibility and robustness, and verify that the robustness of the proposed scheme outperforms that of other schemes when its level of invisibility is significantly higher.


Sign in / Sign up

Export Citation Format

Share Document