Proceedings of the 29th ACM International Conference on Multimedia 2021
DOI: 10.1145/3474085.3475592
|View full text |Cite
|
Sign up to set email alerts
|

Visible Watermark Removal via Self-calibrated Localization and Background Refinement

Abstract: Superimposing visible watermarks on images provides a powerful weapon to cope with the copyright issue. Watermark removal techniques, which can strengthen the robustness of visible watermarks in an adversarial way, have attracted increasing research interest. Modern watermark removal methods perform watermark localization and background restoration simultaneously, which could be viewed as a multi-task learning problem. However, existing approaches suffer from incomplete detected watermark and degraded texture … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0
2

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(32 citation statements)
references
References 47 publications
0
30
0
2
Order By: Relevance
“…Several works try to apply neural networks to formulate an end-to-end problem, and there are two popular ways applied to solve it. One way is to directly formulate the watermark removal as an image-toimage translation task [4,29]; the other way is adopting a two-stage strategy to formulate the problem: the first step is to locate the by a mask, and the second step is to recover the background in the watermark area and train a network to solve both at the same time [11,20,32,30]. The latter method was found in experiments can be more effective in watermark removal, so we mainly focus on preventing the second type of networks in this paper.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Several works try to apply neural networks to formulate an end-to-end problem, and there are two popular ways applied to solve it. One way is to directly formulate the watermark removal as an image-toimage translation task [4,29]; the other way is adopting a two-stage strategy to formulate the problem: the first step is to locate the by a mask, and the second step is to recover the background in the watermark area and train a network to solve both at the same time [11,20,32,30]. The latter method was found in experiments can be more effective in watermark removal, so we mainly focus on preventing the second type of networks in this paper.…”
Section: Related Workmentioning
confidence: 99%
“…Evaluation Metrics. Following the previous work [32,11,30], Peak Signal-to-Noise Ratio (PSNR), Structural Similarity (SSIM), Root-Mean-Square distance (RMSE), and weighted Root-Mean-Square distance (RMSE w ) are adopted as our evaluation metrics. The difference between RMSE and RMSE w is that RMSE w only focuses on the watermarked area.…”
Section: Experimental Setupsmentioning
confidence: 99%
See 1 more Smart Citation
“…The inspiration mainly comes from some similar tasks, such as watermark removal [6], [33], raindrop removal [34], and fog removal [35]. These tasks do not or are hard to obtain the object mask m, and the source image I is obtained through α blending, i.e.,…”
Section: B Proposed Learning Pipelinementioning
confidence: 99%
“…where G denotes the person removal network, and we use the watermark removal network proposed in [33] as an example. By doing this, we are able to retain the color information to the maximum extent in the process of person removal.…”
Section: B Proposed Learning Pipelinementioning
confidence: 99%