Fragile Watermarking for Image Authentication Using the Characteristic of SVD

Zhang, Heng; Wang, Chengyou; Zhou, Xiao

doi:10.3390/a10010027

Cited by 45 publications

(30 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [32], Zhang et al further found that the probability distribution of the values in u 1 v T 1 of all the blocks satisfies normal distribution approximately. Specifically, for smooth blocks, the values in sub-image u 1 v T 1 are approximately equal to the reciprocal of the block size, while for texture blocks, the values in u 1 v T 1 are scattering distributed.…”

Section: Svd Transform and Its Characteristicsmentioning

confidence: 99%

See 1 more Smart Citation

A Self-Recovery Fragile Image Watermarking with Variable Watermark Capacity

2018

Self Cite

View full text Add to dashboard Cite

Currently, the watermark capacity of most self-recovery fragile image watermarking schemes is fixed. That means for smooth regions and texture regions, the length of watermark information is always the same. However, it is impractical since more recovery information is needed for the recovery of texture regions. In this paper, a self-recovery fragile image watermarking with variable watermark capacity is proposed. Based on the characteristic of singular value decomposition (SVD), a new block classification method is introduced. The image blocks are classified into smooth blocks and texture blocks. For smooth blocks, the average pixel values are adopted as the recovery information to recover the tampered blocks, while for texture blocks, the quantized and coded DCT coefficients are adopted as the recovery information. After encrypted by binary pseudo-random sequence, the recovery watermark of each block is embedded into its mapping block. In the detection side, the three-level detection mechanism is applied to detect and locate the tampered regions. The experimental results prove that the proposed method achieves good tamper detection results, and the recovered image has better image quality than other self-recovery fragile watermarking methods.

show abstract

Section: Svd Transform and Its Characteristicsmentioning

confidence: 99%

“…For example, when the image block size is 2 × 2, the values in u 1 v T 1 of smooth blocks are approximately equal to 1/2 (0.5). Based on the above analysis and reference [32], a new block classification method based on SVD transform is designed. The detailed steps of this process are described as follows:…”

Section: Svd Transform and Its Characteristicsmentioning

confidence: 99%

A Self-Recovery Fragile Image Watermarking with Variable Watermark Capacity

2018

Self Cite

View full text Add to dashboard Cite

show abstract

“…A fragile technique is typically easier to implement than a robust one [19]. In [20], binary authentication information was inserted into the host image where, for identifying tampering and localization, a pixel-based fragile watermarking technique was used. It resulted in an acceptable visual effect (in terms of the human eye).…”

Section: Robustnessmentioning

confidence: 99%

Digital Image Watermarking Techniques: A Review

2020

View full text Add to dashboard Cite

Digital image authentication is an extremely significant concern for the digital revolution, as it is easy to tamper with any image. In the last few decades, it has been an urgent concern for researchers to ensure the authenticity of digital images. Based on the desired applications, several suitable watermarking techniques have been developed to mitigate this concern. However, it is tough to achieve a watermarking system that is simultaneously robust and secure. This paper gives details of standard watermarking system frameworks and lists some standard requirements that are used in designing watermarking techniques for several distinct applications. The current trends of digital image watermarking techniques are also reviewed in order to find the state-of-the-art methods and their limitations. Some conventional attacks are discussed, and future research directions are given.

show abstract

“…From Figure 1a,b, it is manifested that the matrix elements in u 1 v T 1 are in the normal distribution approximately. Furthermore, most of the elements are gathered in 0.5 (1/2) [24]. To prove the universality of this conclusion, Figure 2 illustrates the frequency distribution histogram of u 1 v T 1 for block sizes 4 × 4 and 8 × 8, respectively.…”

Section: The Impact Of Svd-based Watermarking On the Pixel Values In mentioning

confidence: 99%

“…It can be seen from Equation (8) that the calculation of ∆A is equivalent to the solving process of u 1 v T 1 . In [24], Zhang et al found that the values in u 1 v T 1 are closely associated with its matrix size, especially when a matrix has similar matrix elements. In this paper, we use this property to develop our proposed scheme.…”

Section: The Impact Of Svd-based Watermarking On the Pixel Values In mentioning

confidence: 99%

A Robust Image Watermarking Scheme Based on SVD in the Spatial Domain

2017

Self Cite

View full text Add to dashboard Cite

Abstract:With the development of image processing technology, the copyright protection of digital images has become an urgent problem to be solved. As an effective method, the robust digital watermarking technique emerges at a historic moment. Currently, most robust watermarking schemes are performed in the transform domains, such as the discrete cosine transform (DCT) and singular value decomposition (SVD). Compared with spatial domain watermarking schemes, these methods have achieved good performance, such as better robustness and higher security. However, the computational complexity increases with the use of forward and reverse transforms. In this paper, we analyze the SVD-based watermarking scheme and its impact on the spatial domain. Based on this analysis and the mathematical characteristics of SVD, we present a robust image watermarking scheme where a binary watermark is embedded into the largest singular value of each image block in the spatial domain. Several experiments are conducted to verify the performance of the proposed watermarking scheme. The experimental results show that compared with the existing SVD domain watermarking schemes, our proposed method has maintained good robustness against various attacks. Moreover, it avoids the false positive problem existing in traditional SVD-based watermarking schemes and has lower computational complexity.

show abstract

Fragile Watermarking for Image Authentication Using the Characteristic of SVD

Cited by 45 publications

References 20 publications

A Self-Recovery Fragile Image Watermarking with Variable Watermark Capacity

A Self-Recovery Fragile Image Watermarking with Variable Watermark Capacity

Digital Image Watermarking Techniques: A Review

A Robust Image Watermarking Scheme Based on SVD in the Spatial Domain

Contact Info

Product

Resources

About