2005
DOI: 10.1117/12.586637
|View full text |Cite
|
Sign up to set email alerts
|

Robust hash-based image watermarking with resistance to geometric distortions and watermark-estimation attack

Abstract: Digital watermarking provides a feasible way for copyright protection of multimedia. The major disadvantage of the existing methods is their limited resistance to both extensive geometric distortions and watermark-estimation attack (WEA). In view of this fact, this paper aims to propose a robust image watermarking scheme that can withstand geometric distortions and WEA simultaneously. Our scheme is mainly composed of two components: (i) mesh generation and embedding for resisting geometric distortions; and (ii… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2005
2005
2020
2020

Publication Types

Select...
5
4

Relationship

3
6

Authors

Journals

citations
Cited by 15 publications
(28 citation statements)
references
References 18 publications
0
28
0
Order By: Relevance
“…In other words, the feature extraction error and other numerical errors such as interpolation errors and rounding errors will affect the watermark detection performance. In order to deal efficiently with these problems, the repeated embedding of a watermark bit is performed [5], [11], [12], [21]. Recall that in [22] the authors proposed to deal with this problem through locally searching (75 times) for the possibly correct feature point in the neighborhood of the detected point.…”
Section: B) Mesh-based Hash Extractionmentioning
confidence: 99%
“…In other words, the feature extraction error and other numerical errors such as interpolation errors and rounding errors will affect the watermark detection performance. In order to deal efficiently with these problems, the repeated embedding of a watermark bit is performed [5], [11], [12], [21]. Recall that in [22] the authors proposed to deal with this problem through locally searching (75 times) for the possibly correct feature point in the neighborhood of the detected point.…”
Section: B) Mesh-based Hash Extractionmentioning
confidence: 99%
“…It is known that attacks were divided into four categories [20]: (1) removal attacks; (2) geometric attacks; (3) cryptographic attacks; and (4) protocol attacks. Therefore, motivated by the needs of sufficient robustness, this study focuses on proposing a non-interactive zero-knowledge watermark detection protocol based on the media hash-dependent watermarking schemes [14,15], which were previously verified to be robust against extensive geometric attacks, and watermark-estimation attacks (including the collusion and copy attacks). It is quite practical to imagine that a watermark must be able to be detected from an attacked data by an owner in advance before the zero-knowledge watermark detection protocol is performed.…”
Section: Introductionmentioning
confidence: 99%
“…To cope with the watermark estimation attack (WEA), an anti-disclosure content-dependent watermark (CDW) with resistance to WEA has been investigated in [5]. In our recent paper [7], the proposed CDW has been combined with geometric-invariant image hash [3], [6] to obtain a mesh-based content-dependent watermarking scheme that can resist both the geometric and estimation attacks.…”
Section: Discussionmentioning
confidence: 99%