The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Robust optimum detection of transform domain multiplicative watermarks
Abstract
Digital watermarking is an emerging technique to protect data security and intellectual property right. Identification or verification of watermarking patterns can be achieved by detecting watermarks in received signals. However, one of the biggest challenges in watermarking detection is that the strengths of the watermark signals will change after being distorted by an attacker in a watermarking channel. Meanwhile, the embedding strengths may be adapted to the original signals, which are unknown at the receiver end. Further, the original signals are often highly non-Gaussian. Although some work has been done on optimum detection of watermarks, the uncertainty of watermark signal strengths and real statistical behavior of multimedia contents have not been taken into account simultaneously. Much more study is needed to enhance the performance of watermarking systems. Since multiplicative watermarks are robust and well suited for copyright protection, this paper presents our investigation on robust optimum detection of multiplicative watermarks. For sub-band transformed domains such as the discrete cosine transform (DCT), discrete wavelet transform (DWT), and pyramid transform, a class of generalized correlators is constructed based on the generalized Gaussian distributions. Thresholding methods to achieve a given false alarm rate, and the performance analyses are provided. The square-root detector is designed and demonstrated to have near optimal performance for a large set of natural images and can be employed as a "universally optimal" detector or decoder for images and video. The locally most powerful detection method is then extended to DFT domain multiplicative watermarking, with the magnitudes of coefficients modeled by the Weibull distributions. Another class of detectors is built based on this statistical modeling. The robust optimum detection of multiplicative watermarks can be applied to copyright notification, enforcement, and broadcast monitoring. We have applied the robust optimum watermarking detection to combined audio and video watermarking.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Secure spread spectrum watermarking for multimedia
Cox, I. J., Kilian, J., Leighton, F. T., & Shamoon, T. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.650120 · Cited by 5,299
Cited by
An Overview of Digital Video Watermarking
Asikuzzaman, M., & Pickering, M. R. (2018) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2017.2712162 · Cited by 294
Perceptual image hashing based on virtual watermark detection
Khelifi, F., & Jiang, J. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2038637 · Cited by 107
Metadata
- Authors
- Cheng, Q., & Huang, T. S.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2003-04
- Volume
- 51
- Issue
- 4
- Pages
- 906-924
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2092368531
- Cited by
- 171
- References
- 1
- FWCI
- 11.66
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Robust optimum detection of transform domain multiplicative watermarks. https://app.cochat.ai/papers/10.1109/tsp.2003.809374
- The paper
- Cheng, Q., & Huang, T. S. (2003). Robust optimum detection of transform domain multiplicative watermarks. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2003.809374
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.