Selective bit embedding scheme for robust blind color image watermarking

Huynh-The, Thien; Hua, Cam-Hao; Tu, Nguyen Anh; Hur, Tae Ho; Bang, Jae Hun; Kim, Dohyeong; Amin, Muhammad Bilal; Kang, Byeong Ho; Seung, Hyonwoo; Lee, Sungyoung

doi:10.1016/j.ins.2017.10.016

Cited by 63 publications

(27 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Comparing the two signatures helps us to detect whether the image has been tampered with or not [5,6,7,8]. The watermarking method can be categorized into robust watermarking [9,10,11,12,13,14,15], semi-fragile watermarking [16,17,18,19] and fragile watermarking [20,21,22,23,24,25,26,27,28,29,30,31,32,33,34]. In the robust watermarking method, hidden watermarks can be retrieved from the watermarked images after they have undergone image processing, such as noise processing or image compression.…”

Section: Introductionmentioning

confidence: 99%

Self-Embedding Authentication Watermarking with Effective Tampered Location Detection and High-Quality Image Recovery

Lee

Shen

Chen

et al. 2019

Sensors

View full text Add to dashboard Cite

Recently, sensor networks have emerged as a high-impact research area, and a number of high profile applications have been proposed. Although significant progress has already been made on securing basic network protocols, additional research is needed to produce techniques and methods for protecting canonical tasks in wireless sensor networks. In this paper, we propose an effective self-embedding authentication watermarking method for tampered location detection and image recovery. The proposed detection method is classified into block-wise and pixel-wise. In block-wise detection, if the size of the block is small, the false positive rate (FPR) will be low. In pixel-wise detection, when the tampered pixels are detected, only the corresponding pixel area is marked. Therefore, the FPR will be lower than that of the block-wise detection. The experimental results demonstrate that the proposed method was effective, and accurate tamper detection and high-quality recovery can be realized even in highly tampered images.

show abstract

Section: Introductionmentioning

confidence: 99%

Self-Embedding Authentication Watermarking with Effective Tampered Location Detection and High-Quality Image Recovery

Lee

Shen

Chen

et al. 2019

Sensors

View full text Add to dashboard Cite

show abstract

“…Thus, our image cryptosystems have strong robustness to resist against noise attack and occlusion attack. Furthermore, PSNR (Peak Signal to Noise Ratio) is often used to evaluate the restoring ability of an image and expressed using the following equation [ 43 , 44 ]:

where

, M and N are the size of the image, O is the original image and D is the decrypted image of the cipher image contaminated by noise or occlusion-attack. The larger the value of PSNR, the less distortion of the image.…”

Section: Experimental Results and Security Analysismentioning

confidence: 99%

A Simple Chaotic Map-Based Image Encryption System Using Both Plaintext Related Permutation and Diffusion

Huang

Cai

Xiao

et al. 2018

Entropy

View full text Add to dashboard Cite

Abstract:Recently, to conquer most non-plain related chaos-based image cryptosystems' security flaws that cannot resist the powerful chosen/knownn plain-text attacks or differential attacks efficiently for less plaintext sensitivity, many plain related chaos-based image cryptosystems have been developed. Most cryptosystems that have adopted the traditional permutation-diffusion structure still have some drawbacks and security flaws: (1) most plaintext related image encryption schemes using only plaintext related confusion operation or only plaintext related diffusion operation relate to plaintext inadequately that cannot achieve high plaintext sensitivity; (2) in some algorithms, the generation of security key that needs to be sent to the receiver is determined by the original image, so these algorithms may not applicable to real-time image encryption; (3) most plaintext related image encryption schemes have less efficiency because more than one round permutation-diffusion operation is required to achieve high security. To obtain high security and efficiency, a simple chaotic based color image encryption system by using both plaintext related permutation and diffusion is presented in this paper. In our cryptosystem, the values of the parameters of cat map used in permutation stage are related to plain image and the parameters of cat map are also influenced by the diffusion operation. Thus, both the permutation stage and diffusion stage are related to plain images, which can obtain high key sensitivity and plaintext sensitivity to resist chosen/known plaintext attacks or differential attacks efficiently. Furthermore, only one round of plaintext related permutation and diffusion operation is performed to process the original image to obtain cipher image. Thus, the proposed scheme has high efficiency. Complete simulations are given and the simulation results prove the excellent security and efficiency of the proposed scheme.

show abstract

“…Spatial domain algorithms usually have lower computational complexity than the transform domain watermarking algorithms. However, due to the limitations of watermarking in the spatial domain involving visualization and robustness [17], most image watermarking algorithms use the transforms such as Cosine transform [18][19][20][21][22], Fourier transform [23,24], Wavelet transform [25,26], Contourlet transform [27,28], and Shearlet transform [29][30][31].…”

Section: Introductionmentioning

confidence: 99%

A Novel Zero-Watermarking Scheme Based on Variable Parameter Chaotic Mapping in NSPD-DCT Domain

et al. 2020

View full text Add to dashboard Cite

In this paper, a novel image zero-watermarking scheme against rotation attacks is proposed based on nonsubsampled pyramid decomposition (NSPD) and discrete cosine transform (DCT). It utilizes the intrinsic characteristics of NSPD and DCT to extract the robust feature of an image as the original zero-watermark. To increase the security of the proposed scheme, a variable parameter chaotic mapping (VPCM) is designed for the processes of watermark encryption and robust feature extraction. Firstly, the host gray-scale image is decomposed by NSPD, and the low-frequency sub-band image is divided into nonoverlapping blocks. After the blocks are transformed by DCT, the signs of the first AC coefficients from all the blocks are used to construct a binary feature image. Then an exclusive-or operation is performed between the binary feature image and the encrypted watermark image to obtain the verification zero-watermark image. Furthermore, a method against arbitrary rotation attacks is employed to improve the robustness of the scheme against geometric attacks. The experimental results demonstrate that the proposed scheme is highly robust against various image processing attacks such as filtering, JPEG compression, scaling, translation, rotation and Checkmark attacks. INDEX TERMS Discrete cosine transform, Nonsubsampled pyramid decomposition, Rotation attacks, Variable parameter chaotic mapping, Zero-watermarking.

show abstract

Selective bit embedding scheme for robust blind color image watermarking

Cited by 63 publications

References 35 publications

Self-Embedding Authentication Watermarking with Effective Tampered Location Detection and High-Quality Image Recovery

Self-Embedding Authentication Watermarking with Effective Tampered Location Detection and High-Quality Image Recovery

A Simple Chaotic Map-Based Image Encryption System Using Both Plaintext Related Permutation and Diffusion

A Novel Zero-Watermarking Scheme Based on Variable Parameter Chaotic Mapping in NSPD-DCT Domain

Contact Info

Product

Resources

About