Optimal transform domain watermark embedding via linear programming
Invisible digital watermarks have been proposed as a method for discouraging illicit copying and distribution of copyright material. In recent years, it has been recognized that embedding information in a transform domain leads to more robust watermarks. A major difficulty in watermarking in a trans...
Saved in:
Published in | Signal processing Vol. 81; no. 6; pp. 1251 - 1260 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
01.06.2001
|
Subjects | |
Online Access | Get full text |
ISSN | 0165-1684 1872-7557 |
DOI | 10.1016/S0165-1684(01)00042-1 |
Cover
Summary: | Invisible digital watermarks have been proposed as a method for discouraging illicit copying and distribution of copyright material. In recent years, it has been recognized that embedding information in a transform domain leads to more robust watermarks. A major difficulty in watermarking in a transform domain lies in the fact that constraints on the allowable distortion at any pixel may be specified in the spatial domain. The central contribution of the paper is the proposal of an approach which takes into account spatial domain constraints in an optimal fashion. The main idea is to structure the watermark embedding as a linear programming problem in which we wish to maximize the strength of the watermark subject to a set of linear constraints on the pixel distortions as determined by a masking function. We consider the special cases of embedding in the DCT domain and wavelet domain using the Haar wavelet and Daubechies 4-tap filter in conjunction with a masking function based on a non-stationary Gaussian model, but the algorithm is applicable to any combination of transform and masking functions. Our results indicate that the proposed approach performs well against lossy compression such as JPEG and other types of filtering which do not change the geometry of the image. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0165-1684 1872-7557 |
DOI: | 10.1016/S0165-1684(01)00042-1 |