2012 IEEE International Workshop on Information Forensics and Security (WIFS) 2012
DOI: 10.1109/wifs.2012.6412652
|View full text |Cite
|
Sign up to set email alerts
|

Watermarking method with exact self-propagating restoration capabilities

Abstract: This paper proposes a new fragile watermarking capable of perfectly restoring the original watermarked pixels of a tampered image. First, a secure block-wise mechanism, resilient to cropping, is used to localise tampered blocks of pixels. The authentic pixels and some reference bits are then used to estimate the original 5 most significant bits (MSBs) of the tampered pixels by means of an exhaustive and iterative restoration mechanism.Results are presented to demonstrate the restoration capabilities of the pro… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(9 citation statements)
references
References 14 publications
0
9
0
Order By: Relevance
“…Five algorithms were implemented in their sequential form following their description reported in the literature. The algorithm proposed by Bravo-Solorio et al [27] was optimized using the MatLab parallel computing toolbox due to its very high time complexity. For each experiment, 2000 gray-level images from the BOWS 2 [34] data set were used; each image is 512 × 512 pixels in size.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Five algorithms were implemented in their sequential form following their description reported in the literature. The algorithm proposed by Bravo-Solorio et al [27] was optimized using the MatLab parallel computing toolbox due to its very high time complexity. For each experiment, 2000 gray-level images from the BOWS 2 [34] data set were used; each image is 512 × 512 pixels in size.…”
Section: Resultsmentioning
confidence: 99%
“…Finally, the original grayscale values from all the pixels in the blocks identified as tampered are restored. The scheme by [27] proposes a secure block mechanism, resilient to content replacement attacks. To locate the tampered blocks, it uses the unaltered pixels and the reference bits to estimate the original five MSB of the altered pixels, using an iterative and exhaustive restoration mechanism.…”
Section: Self-recovery Schemesmentioning
confidence: 99%
“…In [96] the scheme from [95] is improved, it can also reconstruct the image after content replacement attack as long as the tampered area is smaller than 24% of the image. In [97] a scheme that can perfectly reconstruct an image after cropping attack is presented, as long as the tampered area is smaller than 25% of the image. In [98] their previous approach from [97] is improved in terms of computational cost for tamper restoration.…”
Section: ) Approximate Reconstructionmentioning
confidence: 99%
“…In [97] a scheme that can perfectly reconstruct an image after cropping attack is presented, as long as the tampered area is smaller than 25% of the image. In [98] their previous approach from [97] is improved in terms of computational cost for tamper restoration. This method, as well as the previous one performs the restoration of tampered areas in an iterative manner, where the first iterations yield approximate restoration, but as the iterations increase so does the restoration quality.…”
Section: ) Approximate Reconstructionmentioning
confidence: 99%
“…A method of image watermarking of the image is presented in Solorio et al [12]. The stepwise implementation of the method is mentioned as:…”
Section: Literature Reviewmentioning
confidence: 99%