Paper Info
Title
Color image watermarking in the Karhunen-Loeve transform domain
Abstract
In the field of image watermarking, research has been mainly focused on gray scale image watermarking, the extension to the color case still represents one of the open issues watermarking researchers are faced with. To solve the problem of the correlation among image color bands, a new approach is proposed here which is based on the exploitation of the de-correlation property of the Karhunen-Loeve transform (KLT). The KLT is applied to the red, green, blue components of the host image, then watermarking is performed independently in the discrete Fourier transform (DFT) domain of the KL-transformed bands. In order to preserve watermark invisibility, embedding is achieved by modifying the magnitude of mid-frequency DFT coefficients according to an additive-multiplicative rule. In detection, KL de-correlation is exploited to design an optimum watermark decoder. In particular, based on the Neyman-Pearson criterion, the watermark presence is revealed by comparing a likelihood function against a threshold. Experimental results are presented proving the robustness of the algorithm against the most common image manipulations, and its superior performance with respect to techniques based on luminance watermarking. (C) 2002 SPIE and IST.
Year
DOI
Venue
2002
10.1117/1.1426383
JOURNAL OF ELECTRONIC IMAGING
Keywords
Field
DocType
likelihood function,digital watermarking,karhunen loeve transform,color image,red green blue,discrete fourier transform
Computer vision,Digital watermarking,Embedding,Karhunen–Loève theorem,Pattern recognition,Computer science,Robustness (computer science),Watermark,Artificial intelligence,Discrete Fourier transform,Luminance,Grayscale
Journal
Volume
Issue
ISSN
11
1
1017-9909
Citations 
PageRank 
References 
12
0.69
10
Authors
4
Name
Order
Citations
PageRank
M. Barni13091246.21
franco bartolini253957.39
Alessia De Rosa331220.66
Alessandro Piva42231157.21