Blind Image Watermarking Scheme for Image Authentication and Restoration with Improved Restoration Features

2020 ◽  
Author(s):  
Rishi Sinhal ◽  
Irshad Ahmad Ansari ◽  
Chang Wook Ahn
2011 ◽  
Vol 3 (4) ◽  
pp. 42-53 ◽  
Author(s):  
Chun-Ning Yang ◽  
Zhe-Ming Lu

This paper presents a novel image watermarking scheme utilizing Block Truncation Coding (BTC). This scheme uses BTC to guide the watermark embedding and extraction processes. During the embedding process, the original cover image is first partitioned into non-overlapping 4×4 blocks. Then, BTC is performed on each block to obtain its BTC bitplane, and the number of ‘1’s in the bitplane is counted. If the watermark bit to be embedded is ‘1’ and the number of ‘1’s is odd, or the watermark bit to be embedded is ‘0’ and the number of ‘1’s is even, then no change is made. Otherwise, by changing at most three pixels in the original image block, the number of ‘1’s (or ‘0’s) in the renewed bitplane are forced to be odd for the watermark bit ‘1’ or to be even for the watermark bit ‘0’. During the extraction process, BTC is first performed on each block to obtain its bitplane. If the number of ‘1’s in the bitplane is odd, then the embedded watermark bit is ‘1’. Otherwise, the embedded watermark bit is ‘0’. The experimental results show that the proposed watermarking method is semi-fragile except for the changes in brightness and contrast; therefore, the proposed method can be used for image authentication.


2010 ◽  
Vol 9 (7) ◽  
pp. 1369-1375 ◽  
Author(s):  
Yong Zhang ◽  
Zhe-Ming Lu ◽  
Dong-Ning Zhao

Optik ◽  
2017 ◽  
Vol 142 ◽  
pp. 191-204 ◽  
Author(s):  
Geeta Kasana ◽  
Singara Singh Kasana

2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Yong-Seok Lee ◽  
Young-Ho Seo ◽  
Dong-Wook Kim

This paper proposes a new adaptive watermarking scheme for digital images, which has the properties of blind extraction, invisibility, and robustness against attacks. The typical scheme for invisibility and robustness consisted of two main techniques: finding local positions to be watermarked and mixing or embedding the watermark into the pixels of the locations. In finding the location, however, our scheme uses a global space such that the multiple watermarking data is spread out over all four lowest-frequency subbands, resulting from n-level Mallat-tree 2D (dimensional) DWT, where n depends on the amount of watermarking data and the resolution of the host image, without any further process to find the watermarking locations. To embed the watermark data into the subband coefficients, weighting factors are used according to the type and energy of each subband to adjust the strength of the watermark, so we call this an adaptive scheme. To examine the ability of the proposed scheme, images with various resolutions are tested for various attacks, both pixel-value changing attacks and geometric attacks. With experimental results and comparison to the existing works we show that the proposed scheme has better performance than the previous works, except those which specialize in certain types of attacks.


Sign in / Sign up

Export Citation Format

Share Document