The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Circularly symmetric watermark embedding in 2-D DFT domain
Abstract
In this paper, a method for digital image watermarking is described that is resistant to geometric transformations. A private key, which allows a very large number of watermarks, determines the watermark, which is embedded on a ring in the DFT domain. The watermark possesses circular symmetry. Correlation is used for watermark detection. The original image is not required in detection. The proposed method is resistant to JPEG compression, filtering, noise addition, scaling, translation, cropping, rotation, printing and rescanning. Experimental results prove the robustness of this method against the aforementioned attacks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Spread spectrum communications handbook
(1995) · Choice Reviews Online · doi:10.5860/choice.32-3356 · Cited by 1,209
Optimal binary sequences for spread spectrum multiplexing (Corresp.)
Gold, R. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1054048 · Cited by 849
Image-adaptive watermarking using visual models
Podilchuk, C. I., & Zeng, W. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668975 · Cited by 849
Attacks on Copyright Marking Systems
Petitcolas, F. A. P., Anderson, R. J., & Kuhn, M. G. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49380-8_16 · Cited by 835
Robust image watermarking in the spatial domain
Nikolaidis, N., & Pitas, I. (1998) · Signal Processing · doi:10.1016/s0165-1684(98)00017-6 · Cited by 525
Rotation, scale and translation invariant digital image watermarking
O'Ruanaidh, J. J. K., & Pun, T. (2002) · Proceedings of International Conference on Image Processing · doi:10.1109/icip.1997.647968 · Cited by 362
Transparent robust image watermarking
Swanson, M. D., Zhu, B., & Tewfik, A. H. (2002) · Proceedings of 3rd IEEE International Conference on Image Processing · doi:10.1109/icip.1996.560421 · Cited by 326
Multiresolution scene-based video watermarking using perceptual models
Swanson, M. D., Zhu, B., & Tewfik, A. H. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668976 · Cited by 309
A new wavelet-based scheme for watermarking images
Dugad, R., Ratakonda, K., & Ahuja, N. (2002) · Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269) · doi:10.1109/icip.1998.723406 · Cited by 267
Cited by
A survey of digital image watermarking techniques
Potdar, V. M., Han, S., & Chang, E. (2005) · INDIN '05. 2005 3rd IEEE International Conference on Industrial Informatics, 2005. · doi:10.1109/indin.2005.1560462 · Cited by 626
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
Metadata
- Authors
- Solachidis, V., & Pitas, L.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2001
- Volume
- 10
- Issue
- 11
- Pages
- 1741-1753
- ISSN
- 1057-7149 (ISSN-L)
- OpenAlex
- W2133907445
- Cited by
- 272
- References
- 20
- FWCI
- 12.28
- 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: Circularly symmetric watermark embedding in 2-D DFT domain. https://app.cochat.ai/papers/10.1109/83.967401
- The paper
- Solachidis, V., & Pitas, L. (2001). Circularly symmetric watermark embedding in 2-D DFT domain. IEEE Transactions on Image Processing. https://doi.org/10.1109/83.967401
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.