The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
An SVD-based watermarking scheme for protecting rightful ownership
Abstract
Digital watermarking has been proposed as a solution to the problem of copyright protection of multimedia documents in networked environments. There are two important issues that watermarking algorithms need to address. First, watermarking schemes are required to provide trustworthy evidence for protecting rightful ownership. Second, good watermarking schemes should satisfy the requirement of robustness and resist distortions due to common image manipulations (such as filtering, compression, etc.). In this paper, we propose a novel watermarking algorithm based on singular value decomposition (SVD). Analysis and experimental results show that the new watermarking method performs well in both security and robustness.
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
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929
Multimedia data-embedding and watermarking technologies
Swanson, M. D., Kobayashi, M., & Tewfik, A. H. (1998) · Proceedings of the IEEE · doi:10.1109/5.687830 · Cited by 924
A DCT-domain system for robust image watermarking
Barni, M., Bartolini, F., Cappellini, V., & Piva, A. (1998) · Signal Processing · doi:10.1016/s0165-1684(98)00015-2 · Cited by 727
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
Singular Value Decomposition (SVD) Image Coding
Andrews, H., & Patterson, C. (1976) · IEEE Transactions on Communications · doi:10.1109/tcom.1976.1093309 · Cited by 304
Multiresolution watermarking for digital images
Hsu, C.-T., & Wu, J.-L. (1998) · IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing · doi:10.1109/82.718818 · Cited by 240
Watermarking Schemes and Protocols for Protecting Rightful Ownership and Customer's Rights
Qiao, L., & Nahrstedt, K. (1998) · Journal of Visual Communication and Image Representation · doi:10.1006/jvci.1998.0391 · Cited by 185
Can invisible watermarks resolve rightful ownerships?:
Craver, S. A., Memon, N. D., Yeo, B.-L., & Yeung, M. M. (1997) · SPIE Proceedings · doi:10.1117/12.263419 · Cited by 167
Document identification for copyright protection using centroid detection
Low, S. H., Maxemchuk, N. F., & Lapone, A. M. (1998) · IEEE Transactions on Communications · doi:10.1109/26.662643 · Cited by 164
In business today and tomorrow
Zhao, J., Koch, E., & Luo, C. (1998) · Communications of the ACM · doi:10.1145/278476.278488 · Cited by 44
Cited by
Robust DWT-SVD domain image watermarking: embedding data in all frequencies
Ganic, E., & Eskicioglu, A. M. (2004) · Proceedings of the 2004 workshop on Multimedia and security · doi:10.1145/1022431.1022461 · Cited by 334
An SVD-based grayscale image quality measure for local and global assessment
Shnayderman, A., Gusev, A., & Eskicioglu, A. M. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.860605 · Cited by 323
SVD Compression for Magnetic Resonance Fingerprinting in the Time Domain
McGivney, D. F., Pierre, E., Ma, D., Jiang, Y., Saybasili, H., Gulani, V., & Griswold, M. A. (2014) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2014.2337321 · Cited by 314
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
Image adaptive watermarking using wavelet domain singular value decomposition
Bao, P., & Ma, X. (2005) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2004.836745 · Cited by 287
Metadata
- Authors
- Liu, R., & Tan, T.
- Venue
- IEEE Transactions on Multimedia
- Published
- 2002-03
- Volume
- 4
- Issue
- 1
- Pages
- 121-128
- ISSN
- 1520-9210 (ISSN-L)
- OpenAlex
- W2131559909
- Cited by
- 995
- References
- 11
- FWCI
- 13.85
- 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
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.