scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Robust watermarking scheme and tamper detection based on threshold versus intensity

01 Dec 2015-Journal of Innovation in Digital Ecosystems (No longer published by Elsevier)-Vol. 2, Iss: 1, pp 1-12
TL;DR: The imperceptibility and robustness of the watermarking approach are proven and showing perfectly the detection of the tamper zones are proven.
About: This article is published in Journal of Innovation in Digital Ecosystems.The article was published on 2015-12-01 and is currently open access. It has received 24 citations till now. The article focuses on the topics: Watermark & Digital watermarking.
Citations
More filters
Journal ArticleDOI
TL;DR: This method generates two image digests from the host image, based on the lifting wavelet and the halftoning technique, which shows the efficiency of TRLH compared to the state of the art methods.

45 citations

Journal ArticleDOI
01 Jan 2020
TL;DR: The simulation results show that the proposed watermarking algorithm is robust against most image processing attacks like salt & pepper, cropping, low-pass filter, wiener filter, blurring, etc.
Abstract: This paper proposes a blind and robust color image watermarking method based on a new three-dimensional Henon chaotic map and uses integer wavelet transform, discrete wavelet transform and contourlet transform in embedding and extracting processes. In the presented approach, color images are divided into $$4\times 4$$ main nonoverlapping parts, and one of the transforms is applied to these parts. Then the low–low sub-band of transform is selected. The suggested map is used to find $$2\times 2$$ blocks in the embedding process. The bits of watermark are embedded in the parts of images to increase the robustness of the proposed watermarking scheme. To improve the quality of the final watermark, the suggested technique uses a correction process in the extracting process. In this paper, the bifurcation diagram, Lyapunov exponent, cobweb plot and trajectory diagram are used to show the chaotic behavior of the proposed map. Based on DIEHARD, ENT and NIST test suites, the suggested map can be used as a pseudo-random number generator. The simulation results show that the proposed watermarking algorithm is robust against most image processing attacks like salt & pepper, cropping, low-pass filter, wiener filter, blurring, etc. The comparison results between the suggested watermarking scheme, and some similar methods show that the presented technique has good performance, imperceptibility, acceptable robustness and outperforms most related methods.

40 citations

Journal ArticleDOI
01 Jun 2019-Optik
TL;DR: The simulation results of the proposed algorithm reflects the efficiency of this technique in terms of embedding visual quality, maintain the structure of the cover image, low running time and detection accuracy which have been evaluated by PSNR, SSIM, NCC, TDR, FPR and FNR metrics.

32 citations

Journal ArticleDOI
TL;DR: The experimental results have proven that the proposed encryption scheme provides an acceptable percentage of encrypted image data, and the security analysis demonstrates that the scheme has a robust resistance against various security attacks.
Abstract: Securing digital medical images is increasingly becoming a major concern due to the rapid growth of the amount of medical images transferred over a network and stored on the web servers. However, the enormous size of multimedia and the huge volume of exchanging medical images have motivated the development of low computational complexity methods. This paper presents a lightweight selective encryption scheme to encrypt the edge maps of medical images. The edge map is firstly extracted by an edge detection method. Then, a chaotic map is used to generate a large key space. We propose a one-time pad algorithm to respectively encrypt the significant detected image blocks. The experimental results have proven that the proposed encryption scheme provides an acceptable percentage of encrypted image data. It can also effectively perform image encryption and decryption in a lightweight manner, which makes the scheme a good candidate for real time applications. Moreover, the security analysis demonstrates that our scheme has a robust resistance against various security attacks.

30 citations

Journal ArticleDOI
TL;DR: A logistic map based fragile watermarking technique to efficiently detect and localize the tampered regions from the watermarked image (WI) and exhibits an excellent ability to resist various intentional and unintentional attacks which makes it suitable for real-time applications.
Abstract: In real-time data transmission, the protection of multimedia content from unauthorized access is pivotal. In this context, digital watermarking techniques have drawn significant attention from the past few decades. However, most of the reported techniques fail to achieve a good balance among the perceptual transparency, embedding capacity (EC), and robustness. Besides, tamper detection and localization are the two crucial aspects of any authentication based watermarking technique. This paper proposes a logistic map based fragile watermarking technique to efficiently detect and localize the tampered regions from the watermarked image (WI). The proposed technique takes advantage of the sensitivity property of the logistic map to generate the watermark bits. Next, these watermark bits are embedded in the rightmost least significant bits (LSBs) by performing the logical XOR operation between the first intermediate significant bits (ISBs) and the watermark bits. Simulation results show that the proposed technique can produce high quality WI with an average peak signal-to-noise ratio (PSNR) of 51.14 dB. Further, the proposed technique can efficiently detect and locate the tampering regions from the image with a high true positive rate, low false positive and negative rate. Additionally, the proposed technique exhibits an excellent ability to resist various intentional and unintentional attacks which makes it suitable for real-time applications.

18 citations

References
More filters
Journal ArticleDOI
TL;DR: Experimental results on the Brodatz and KTH-TIPS2-a texture databases show that WLD impressively outperforms the other widely used descriptors (e.g., Gabor and SIFT), and experimental results on human face detection also show a promising performance comparable to the best known results onThe MIT+CMU frontal face test set, the AR face data set, and the CMU profile test set.
Abstract: Inspired by Weber's Law, this paper proposes a simple, yet very powerful and robust local descriptor, called the Weber Local Descriptor (WLD). It is based on the fact that human perception of a pattern depends not only on the change of a stimulus (such as sound, lighting) but also on the original intensity of the stimulus. Specifically, WLD consists of two components: differential excitation and orientation. The differential excitation component is a function of the ratio between two terms: One is the relative intensity differences of a current pixel against its neighbors, the other is the intensity of the current pixel. The orientation component is the gradient orientation of the current pixel. For a given image, we use the two components to construct a concatenated WLD histogram. Experimental results on the Brodatz and KTH-TIPS2-a texture databases show that WLD impressively outperforms the other widely used descriptors (e.g., Gabor and SIFT). In addition, experimental results on human face detection also show a promising performance comparable to the best known results on the MIT+CMU frontal face test set, the AR face data set, and the CMU profile test set.

1,007 citations

Journal ArticleDOI
TL;DR: This paper presents a reversible or lossless watermarking algorithm for images without using a location map in most cases that employs prediction errors to embed data into an image.
Abstract: This paper presents a reversible or lossless watermarking algorithm for images without using a location map in most cases. This algorithm employs prediction errors to embed data into an image. A sorting technique is used to record the prediction errors based on magnitude of its local variance. Using sorted prediction errors and, if needed, though rarely, a reduced size location map allows us to embed more data into the image with less distortion. The performance of the proposed reversible watermarking scheme is evaluated using different images and compared with four methods: those of Kamstra and Heijmans, Thodi and Rodriguez, and Lee et al. The results clearly indicate that the proposed scheme can embed more data with less distortion.

773 citations


"Robust watermarking scheme and tamp..." refers background in this paper

  • ...However, semi-fragile watermarking techniques aim to prove the integrity and authenticity of the data content, It can accept the non-malicious modification and the watermark will be destroyed against malicious attacks, it called soft authenticate [7]....

    [...]

Journal ArticleDOI
TL;DR: Two new semi-fragile authentication techniques robust against lossy compression are proposed, using random bias and nonuniform quantization, to improve the performance of the methods proposed by Lin and Chang.
Abstract: Semi-fragile watermarking techniques aim at detecting malicious manipulations on an image, while allowing acceptable manipulations such as lossy compression. Although both of these manipulations are considered to be pixel value changes, semi-fragile watermarks should be sensitive to malicious manipulations but robust to the degradation introduced by lossy compression and other defined acceptable manipulations. In this paper, after studying the characteristics of both natural images and malicious manipulations, we propose two new semi-fragile authentication techniques robust against lossy compression, using random bias and nonuniform quantization, to improve the performance of the methods proposed by Lin and Chang.

133 citations

Journal ArticleDOI
TL;DR: Experimental results show that the proposed method is quite robust under either non-geometry or geometry attacks and can extract the watermark without using the original image or watermark.
Abstract: This paper proposes a blind watermarking algorithm based on maximum wavelet coefficient quantization for copyright protection. The wavelet coefficients are grouped into different block size and blocks are randomly selected from different subbands. We add different energies to the maximum wavelet coefficient under the constraint that the maximum wavelet coefficient is always maximum in a block. The watermark is embedded the local maximum coefficient which can effectively resist attacks. Also, using the block-based watermarking, we can extract the watermark without using the original image or watermark. Experimental results show that the proposed method is quite robust under either non-geometry or geometry attacks.

128 citations


"Robust watermarking scheme and tamp..." refers methods in this paper

  • ...The security of computer field is provided with possibility techniques to cover these threats, like digital signature and watermarking techniques [1]....

    [...]

Proceedings ArticleDOI
TL;DR: Two new semi-fragile authentication techniques robust against lossy compression are proposed, using random bias and nonuniform quantization, to improve the performance of the methods proposed by Lin and Chang.
Abstract: Semi-fragile watermarking methods aim at detecting unacceptable image manipulations, while allowing acceptable manipulations such as lossy compression. In this paper, we propose new semi-fragile authentication watermarking techniques using random bias and non-uniform quantization, to improve the performance of the methods proposed by Lin and Chang. Specifically, the objective is to improve the performance tradeoff between the alteration detection sensitivity and the false detection rate.© (2002) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

89 citations


"Robust watermarking scheme and tamp..." refers methods in this paper

  • ...Dual watermarking technique in the frequency domain is also proposed in [23]....

    [...]