2016
DOI: 10.1007/s11042-016-3750-2
|View full text |Cite
|
Sign up to set email alerts
|

An image zero-watermarking algorithm based on the encryption of visual map feature with watermark information

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
27
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 42 publications
(27 citation statements)
references
References 15 publications
0
27
0
Order By: Relevance
“…However, Wu's scheme is vulnerable to geometric attacks such as cropping, scaling, rotation, and histogram equalization, whereas our scheme is able to withstand such attacks. Moreover, it is obvious that the performance of our scheme is much better than the algorithms in [24,25,26,30]. A feature of our scheme is that it can extract the watermark perfectly in the case of some image processing attacks such as median filtering, scaling, histogram equalization, and compression attacks.…”
Section: Bchmentioning
confidence: 94%
See 3 more Smart Citations
“…However, Wu's scheme is vulnerable to geometric attacks such as cropping, scaling, rotation, and histogram equalization, whereas our scheme is able to withstand such attacks. Moreover, it is obvious that the performance of our scheme is much better than the algorithms in [24,25,26,30]. A feature of our scheme is that it can extract the watermark perfectly in the case of some image processing attacks such as median filtering, scaling, histogram equalization, and compression attacks.…”
Section: Bchmentioning
confidence: 94%
“…For performance comparisons, four copyright protection methods, proposed by [24], [25], [26], and [30] were implemented in this study. We use the gray-scale images CT and MR in Fig.…”
Section: Bchmentioning
confidence: 99%
See 2 more Smart Citations
“…However, dividing the host image into overlapping blocks generates a large number of image blocks, which increased the computational complexity of the algorithm. Ta Minhn Thanh et al [40] extracted the robust feature as the master share from the host image by combining the QR decomposition and one-dimensional (1D) DCT. In their scheme, the host images are RGB images, and two zero-watermarking construction schemes were proposed utilizing the luminance Y-components of the host images.…”
Section: Introductionmentioning
confidence: 99%