2015 7th Conference on Information and Knowledge Technology (IKT) 2015
DOI: 10.1109/ikt.2015.7288669
|View full text |Cite
|
Sign up to set email alerts
|

Targeted watermark removal of a SVD-based image watermarking scheme

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 12 publications
0
4
0
Order By: Relevance
“…DWT Sub-images [10] In Figure 1, the sub-image in HL, LH, and HH positions will look like a rough version of the host image because it contains high-frequency components of the host image, while for the LL sub-image looks like the host image and looks smoother as it contains low-frequency components of the host image [14]. Since it is similar to the host image, the LL sub-image can embed the watermark image to the host image [6]. While the pixel values of LH, HL, and HH sub-images tend to be low-value and sometimes zero, so they are easy to compress.…”
Section: D-discrete Wavelet Transformmentioning
confidence: 99%
See 1 more Smart Citation
“…DWT Sub-images [10] In Figure 1, the sub-image in HL, LH, and HH positions will look like a rough version of the host image because it contains high-frequency components of the host image, while for the LL sub-image looks like the host image and looks smoother as it contains low-frequency components of the host image [14]. Since it is similar to the host image, the LL sub-image can embed the watermark image to the host image [6]. While the pixel values of LH, HL, and HH sub-images tend to be low-value and sometimes zero, so they are easy to compress.…”
Section: D-discrete Wavelet Transformmentioning
confidence: 99%
“…The visible watermark [6] is good to know directly who the owner of the artworks but in that way, it will degrade the quality of work because it will be covered by the watermark and make irresponsible people to easily remove the watermark in various ways, whereas if watermarking is done invisibly [4] the work will not be covered and confuse irresponsible people who want to remove the watermark from the artwork.…”
Section: Introductionmentioning
confidence: 99%
“…In other words, if the algorithm is known, the watermark can be irreversibly damaged through targeted attacks. Examples of such attacks are presented in [2,3,4,5,6]. In the following, the algorithms are briefly presented and the extracted features of each i.e.…”
Section: Detecting Watermarking Algorithm Usingmentioning
confidence: 99%
“…A number of targeted attacks on watermarking algorithms are presented in [2,3,4,5,6], all of which require prior knowledge of the watermarking algorithm. This prerequisite may appear to prevent some targeted attacks.…”
Section: Introductionmentioning
confidence: 99%