2006
DOI: 10.1016/j.csi.2005.03.006
|View full text |Cite
|
Sign up to set email alerts
|

A semi-blind digital watermarking scheme based on singular value decomposition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
84
0

Year Published

2006
2006
2022
2022

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 136 publications
(84 citation statements)
references
References 14 publications
0
84
0
Order By: Relevance
“…Depending on whether it requires access to the original signal and/or the actual watermark, the scheme may be described as 'informed' or 'blind'. 'Semi-blind' schemes do not need the original signal or the actual watermark at the decode stage but instead require some other information related to the process [1].…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Depending on whether it requires access to the original signal and/or the actual watermark, the scheme may be described as 'informed' or 'blind'. 'Semi-blind' schemes do not need the original signal or the actual watermark at the decode stage but instead require some other information related to the process [1].…”
Section: Introductionmentioning
confidence: 99%
“…As mentioned in Section II, the watermarking algorithms proposed in [4][5] cannot be applied directly to the RSVD of this input matrix because, as seen in (1) s 1,1 is the largest value in S and, when expanding the product it is only multiplied with the column elements u 1..p, 1 .This results in the most significant peaks within the reconstructed spectrum being determined by u 1..p,1 * s 1,1 * v 1,1..q . Even a minor alteration of any element in u 1..p,1 may therefore result in significant distortion when the time signal is resynthesized.…”
Section: Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The watermark is usually a pseudo random number sequence, copyright messages and ownership logo. The two common methods used in watermarking are spatial and spectral domain.Algorithms in first category embed a watermark by modifying the pixel values of image and algorithms in the second category embed watermark in spectrum coefficients after the image has been transformed to spectrum domain such as Discrete Cosine Transform (DCT) [17,7,16,24] , Singular Value Decomposition(SVD) [18,31,4,5] Discrete Fourier Transform (DFT) [27,34,19,8], and Discrete Wavelet Domain(DWT) [12],Complex Hadamard transform [9], Walsh-Hadamard transform [10,11]. The watermark is embedded in spectral coefficients and later inverse transform is used to get watermarked image.…”
Section: Introductionmentioning
confidence: 99%
“…It is one of the most useful numerical analysis techniques having property that the singular values (SVs) of an image do not change significantly when a small perturbation is added to an image. [1][2][3][4] With the rapid development of internet technology, transmission of multimedia information over the Internet becomes convenient. While transmitting these data security of multimedia data is a prime concern.…”
Section: Introductionmentioning
confidence: 99%