scholarly journals Cryptanalysis and Improvement of the Robust and Blind Watermarking Scheme for Dual Color Image

2015 ◽  
Vol 2015 ◽  
pp. 1-10
Author(s):  
Hai Nan ◽  
Bin Fang ◽  
Weibin Yang ◽  
Jiye Qian ◽  
Ming Li ◽  
...  
Keyword(s):  
Theoretical Analysis ◽  
Color Image ◽  
Color Images ◽  
The Internet ◽  
Blind Watermarking ◽  
Watermark Image ◽  
Dual Color ◽  
Improvement Measure ◽  
Original Scheme ◽  
Watermarking Scheme

With more color images being widely used on the Internet, the research on embedding color watermark image into color host image has been receiving more attention. Recently, Su et al. have proposed a robust and blind watermarking scheme for dual color image, in which the main innovation is the using of two-level DCT. However, it has been demonstrated in this paper that the original scheme in Su’s study is not secure and can be attacked by our proposed method. In addition, some errors in the original scheme have been pointed out. Also, an improvement measure is presented to enhance the security of the original watermarking scheme. The proposed method has been confirmed by both theoretical analysis and experimental results.

Quantum color image watermarking based on fast bit-plane scramble and dual embedded

2018 ◽  
Vol 16 (07) ◽  
pp. 1850060 ◽  
Author(s):  
Ri-Gui Zhou ◽  
Peng Liu Yang ◽  
Xing Ao Liu ◽  
Hou Ian
Keyword(s):  
Nearest Neighbor ◽  
Color Image ◽  
Interpolation Method ◽  
Image Watermarking ◽  
Extraction Process ◽  
Watermark Image ◽  
Color Image Watermarking ◽  
Encryption Algorithms ◽  
Bit Plane ◽  
Watermarking Scheme

Most of the studied quantum encryption algorithms are based on square images. In this paper, based on the improved novel quantum representation of color digital images model (INCQI), a quantum color image watermarking scheme is proposed. First, INCQI improved from NCQI is used to represent the carrier and watermark images with the size [Formula: see text] and [Formula: see text], respectively. Secondly, before embedding, the watermarking needs to be preprocessed. That is, the watermark image with the size of [Formula: see text] with 24-qubits color information is disordered by the fast bit-plane scramble algorithm, and then further expanded to an image with the size [Formula: see text] with 6-qubits pixel information by the nearest-neighbor interpolation method. Finally, the dual embedded algorithm is executed and a key image with 3-qubits information is generated for retrieving the original watermark image. The extraction process of the watermark image is the inverse process of its embedding, including inverse embedding, inverse expand and inverse scrambling operations. To show that our method has a better performance in visual quality and histogram graph, a simulation of different carrier and watermark images are conducted on the classical computer’s MATLAB.

scholarly journals AN EFFICIENT AND SECURED NON BLIND WATERMARKING SCHEME FOR COLOR IMAGES USING DWT AND ARNOLD TRANSFORM

2010 ◽  
pp. 183-191
Author(s):  
Nagaraj V. Dharwadkar ◽  
B. B. Amberker
Keyword(s):  
Color Image ◽  
Blind Watermarking ◽  
Arnold Transform ◽  
Control Techniques ◽  
Extraction Algorithm ◽  
Different Types ◽  
Image Blurring ◽  
Frequency Components ◽  
Watermarking Scheme ◽  
Image Transformations

In the early days, encryption and access control techniques are used to protect the ownership of image. Recently, the watermarking schemes are utilized to define the copyright of image. Digital watermarking is a concept of embedding a special security pattern into cover image. It has recently become important in various application areas of image processing. In this paper we present a new invisible, robust, non blind frequency domain watermarking scheme. This scheme embeds the monochrome (logo) watermark into the high and middle {HL, LH, HH} frequency bands of Arnold transformed luminance channel of the color image. The security of scheme is improved by scrambling the luminance channel of the color image using Arnold transform. In order to increase the detection speed and efficiency of algorithm, the location of modified high and middle frequency components are stored into key array. Use of this key array improves the speed of the extraction algorithm. The experimental results show that the watermark is robust against different types of attacks like image cropping, image filtering, image Compression, image blurring, and Image transformations. Further, the results of the proposed scheme are analyzed on the set of images.

A New Robust Reversible Blind Watermarking in Wavelet-Domain for Color Images

2016 ◽  
Vol 16 (02) ◽  
pp. 1650006 ◽  
Author(s):  
P. Manimehalai ◽  
P. Arockia Jansi Rani
Keyword(s):  
Clustering Algorithm ◽  
Color Image ◽  
Reversible Watermarking ◽  
Color Images ◽  
Blind Watermarking ◽  
Wavelet Domain ◽  
Wavelet Coefficients ◽  
Recovered Image ◽  
Host Image

Reversible watermarking methods are used for copyright protection and are able to recover the host image without distortion. Robust reversible watermarking technique should resist against intentional and unintentional image processing attacks. Robust reversible watermarking techniques should have three features namely imperceptibility, reversibility and robustness. In this paper, it is proposed to develop a new robust reversible blind watermarking for color images based on histogram construction of the wavelet coefficients constructed from the cover image. In the proposed approach, the red component of a host color image is decomposed into wavelet coefficients. Motivated by the excellent spatio-frequency localization properties of wavelets, this technique is proposed in the wavelet domain. The pixels are adjusted before watermark embedding such that both overflow and underflow of pixels during embedding is avoided and image is recovered without distortion. Based on histogram construction and the local sensitivity of Human Visual System (HVS) in wavelet domain, the watermark is embedded. For watermark extraction without host image, k-means clustering algorithm is proposed. The experimental results show that the proposed technique has good performance in terms of reversibility and robustness with the high quality of the watermarked image. The PSNR value of the recovered image is around 48[Formula: see text]dB which proves that the quality of the recovered image is not degraded.

scholarly journals An Efficient and Highly Secure Technique to Encrypt and Decrypt Color Images

2019 ◽  
Vol 9 (3) ◽  
pp. 4165-4168 ◽  
Author(s):  
M. O. Al-Dwairi ◽  
A. Y. Hendi ◽  
Z. A. AlQadi
Keyword(s):  
Image Encryption ◽  
Color Image ◽  
Color Images ◽  
The Internet ◽  
Security Level ◽  
Color Image Encryption ◽  
Encryption And Decryption ◽  
Encryption Decryption ◽  
Low Efficiency ◽  
Digital Color Images

Digital color images are considered as the most widely used data. They are exchanged frequently on the internet and via email, so an efficient and highly secure method of color image encryption and decryption is needed. Different methods of encryption-decryption are used, but most of them suffer from low efficiency or low-security level or both. In this paper, an efficient and highly secure method of encryption-decryption will be proposed, tested, and implemented. The efficiency parameters will be calculated and compared with other methods’ parameters to prove the efficiency of the proposed method.

Color image blind watermarking scheme based on QR decomposition

2014 ◽  
Vol 94 ◽  
pp. 219-235 ◽  
Author(s):  
Qingtang Su ◽  
Yugang Niu ◽  
Gang Wang ◽  
Shaoli Jia ◽  
Jun Yue
Keyword(s):  
Color Image ◽  
Qr Decomposition ◽  
Blind Watermarking ◽  
Watermarking Scheme

scholarly journals RGB Color Image Encryption-Decryption Using Image Segmentation and Matrix Multiplication

2018 ◽  
Vol 7 (3.13) ◽  
pp. 104 ◽  
Author(s):  
Musbah J. Aqel ◽  
Ziad ALQadi ◽  
Ammar Ahmed Abdullah
Keyword(s):  
Image Segmentation ◽  
Image Encryption ◽  
Color Image ◽  
Matrix Multiplication ◽  
Image Transmission ◽  
Color Images ◽  
The Internet ◽  
Color Image Encryption ◽  
Novel Technique ◽  
Encryption Decryption

Digital RGB color images are considered as the most widely used data type through the internet, so there is a need for efficient and secure techniques to transmit and protect these digital images and this is a matter of high priority process. Many researchers had developed different techniques to increase the security of image transmission, and most of these techniques suffer from the low speed of the encryption-decryption process. In this paper, a novel technique is proposed that could be used for digital color image encryption-decryption. The performance of this technique is compared with the performance of other techniques and it has shown the advantages of using this technique over other techniques in enhancing the throughput and speed of encryption-decryption process. 

Sign in / Sign up

Export Citation Format

Share Document