Color in Image Watermarking

This chapter summarizes the state-of-the-art color techniques used in the emerging field of image watermarking. It is now well understood that a color approach is required when it comes to deal with security, steganography and watermarking applications of multimedia contents. Indeed, consumers and business expectations are focused on the protection of their contents, which are here color images and videos. In the past few years, several gray-level image watermarking schemes have been proposed but their application to color image is often inadequate since they usually work with the luminance or with individual color channel. Unfortunately, color cannot be considered as a simple RGB decomposition and all of its intrinsic information must be integrated in the watermarking process. Therefore, it is the chapter objective to present, first, the major difficulties associated with the treatment of color images, and second, the state-of-the-art methods used in the field of color image watermarking.

Download Full-text

Blind Color Image Watermarking Using Fan Beam Transform and QR Decomposition

Symmetry ◽

10.3390/sym12030486 ◽

2020 ◽

Vol 12 (3) ◽

pp. 486

Author(s):

Pranab Kumar Dhar ◽

Pulak Hazra ◽

Tetsuya Shimamura

Keyword(s):

Color Image ◽

State Of The Art ◽

Signal To Noise Ratio ◽

Image Watermarking ◽

Triangular Matrix ◽

Structural Similarity ◽

Qr Decomposition ◽

Original Image ◽

Color Image Watermarking ◽

Multimedia Contents

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.

Download Full-text

A survey of color image watermarking: State-of-the-art and research directions

Computers & Electrical Engineering ◽

10.1016/j.compeleceng.2021.107255 ◽

2021 ◽

Vol 93 ◽

pp. 107255

Author(s):

Dhiran Kumar Mahto ◽

A.K. Singh

Keyword(s):

Color Image ◽

State Of The Art ◽

Image Watermarking ◽

Color Image Watermarking ◽

Research Directions

Download Full-text

A Robust Fractal Color Image Watermarking Algorithm

Mathematical Problems in Engineering ◽

10.1155/2014/638174 ◽

2014 ◽

Vol 2014 ◽

pp. 1-12 ◽

Cited By ~ 8

Author(s):

Jian Lu ◽

Yuru Zou ◽

Chaoying Yang ◽

Lijing Wang

Keyword(s):

Image Quality ◽

Color Image ◽

Image Watermarking ◽

Just Noticeable Difference ◽

Color Image Watermarking ◽

Coding Method ◽

Gray Level Image ◽

Color Pixel ◽

Mean Vector

One of the main objectives of watermarking is to achieve a better tradeoff between robustness and high visual quality of a host image. In recent years, there has been a significant development in gray-level image watermarking using fractal-based method. This paper presents a human visual system (HVS) based fractal watermarking method for color images. In the proposed method, a color pixel is considered as a 3-D vector inRGBspace. And a general form of 3 × 3 matrix is utilized as the scaling operator. Meanwhile, the luminance offset vector is substituted by the range block mean vector. Then an orthogonalization fractal color coding method is achieved to obtain very high image quality. We also show that the orthogonalization fractal color decoding is a mean vector-invariant iteration. So, the range block mean vector is a good place for hiding watermark. Furthermore, for consistency with the characteristics of the HVS, we carry out the embedding process in theCIE La*b*space and incorporate a just noticeable difference (JND) profile to ensure the watermark invisibility. Experimental results show that the proposed method has good robustness against various typical attacks, at the same time, with an imperceptible change in image quality.

Download Full-text

A Robust Color Image Watermarking Algorithm Based on APDCBT and SSVD

Symmetry ◽

10.3390/sym11101227 ◽

2019 ◽

Vol 11 (10) ◽

pp. 1227 ◽

Cited By ~ 3

Author(s):

Xiaoyan Yu ◽

Chengyou Wang ◽

Xiao Zhou

Keyword(s):

Singular Value Decomposition ◽

Color Image ◽

Image Watermarking ◽

Median Filter ◽

Coefficient Matrix ◽

Singular Value ◽

Color Images ◽

Color Image Watermarking ◽

Value Decomposition ◽

Dc Coefficient

With the wide application of color images, watermarking for the copyright protection of color images has become a research hotspot. In this paper, a robust color image watermarking algorithm based on all phase discrete cosine biorthogonal transform (APDCBT) and shuffled singular value decomposition (SSVD) is proposed. The host image is transformed by the 8 × 8 APDCBT to obtain the direct current (DC) coefficient matrix, and then, the singular value decomposition (SVD) is performed on the DC matrix to embed the watermark. The SSVD and Fibonacci transform are mainly used at the watermark preprocessing stage to improve the security and robustness of the algorithm. The watermarks are color images, and a color quick response (QR) code with error correction mechanism is introduced to be a watermark to further improve the robustness. The watermark embedding and extraction processes are symmetrical. The experimental results show that the algorithm can effectively resist common image processing attacks, such as JPEG compression, Gaussian noise, salt and pepper noise, average filter, median filter, Gaussian filter, sharpening, scaling attacks, and a certain degree of rotation attacks. Compared with the color image watermarking algorithms considered in this paper, the proposed algorithm has better performance in robustness and imperceptibility.

Download Full-text

ROBUST COLOR IMAGE WATERMARKING BASED ON FAN BEAM PROJECTIONS

International Journal of Information Acquisition ◽

10.1142/s0219878909001990 ◽

2009 ◽

Vol 06 (04) ◽

pp. 269-280 ◽

Cited By ~ 1

Author(s):

DEJEY ◽

R. S. RAJESH

Keyword(s):

Digital Media ◽

Bit Error Rate ◽

Color Image ◽

Image Watermarking ◽

Subjective Evaluation ◽

Color Images ◽

Color Image Watermarking ◽

Huge Amount ◽

Digital Watermarks ◽

Almost All

Digital watermarks have been embedded invisibly in digital media to protect copyrights of legal owners. In this paper two new robust digital color image watermarking schemes using fan beam projections are proposed and their imperceptibility, capacity and robustness are analyzed. The approach FBWLC adds a binary watermark to both the luminance and chrominance content of a color image whereas FBWC adds the watermark to the chrominance content of the color image and is based on Fan Beam Transform that takes multiple projections of the image from different angles. It is observed that FBWC scheme is robust to almost all the attacks and FBWLC scheme is more robust and guarantees zero bit error rate (BER) to most of the attacks on color images namely compression, filtering, blurring and sharpening and is compared with an existing approach based on Spatio Chromatic Discrete Fourier Transform (SCDFT). Also, when compared with other works in color image watermarking, these approaches embed a huge amount of data thereby increasing the watermarking capacity while preserving image quality by subjective evaluation.

Download Full-text