A recent survey of self-embedding fragile watermarking scheme for image authentication with recovery capability

Rakhmawati, Lusia; Wirawan, Wirawan; Suwadi, Suwadi

doi:10.1186/s13640-019-0462-3

Cited by 50 publications

(23 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Authentication data can be generated using the parity check approach [11,12]. Parity bit checking is a straightforward watermarking approach [13].…”

Section: Parity Bitmentioning

confidence: 99%

Image Watermarking Based on IWT and Parity Bit Checking

Awad

Majeed²

2021

eijs

View full text Add to dashboard Cite

Various document types play an influential role in a lot of our lives activities today; hence preserving their integrity is an important matter. Such documents have various forms, including texts, videos, sounds, and images. The latter types' authentication will be our concern here in this paper. Images can be handled spatially by doing the proper modification directly on their pixel values or spectrally through conducting some adjustments to some of the addressed coefficients. Due to spectral (frequency) domain flexibility in handling data, the domain coefficients are utilized for the watermark embedding purpose. The integer wavelet transform (IWT), which is a wavelet transform based on the lifting scheme, is adopted in this paper in order to provide a direct way for converting image pixels' integer values to integer coefficient values rather than floating point coefficients that could be produced by the traditional wavelet transform. This direct relation can enhance the processed image quality due to avoiding the rounding operations on the floating point coefficients. The well-known parity bit approach is also utilized in this paper as an authentication mechanism, where 3 secret parity bits are used for each block in an image which is divided into non-overlapped blocks in order to enforce a form of fragile watermark approach. Thus, any alteration in the block pixels could cause the adopted (even) parity to be violated. The fragile watermarking is achieved through the modification of least significant bits ((LSBs) of certain frequency coefficients' according to the even parity condition. In spite of this image watermarking operation, the proposed method is efficient. In order to prove the efficiency of our proposed method, it was tested against standard images using measurements like peak signal to noise ratio (PSNR) and structural similarity index (SSIM). Experiments showed promising results; the method preserves high image quality (PSNR≈ 44.4367dB, SSIM≈ 0.9956) and good tamper detection capability.

show abstract

“…Authentication data can be generated using the parity check approach [11,12]. Parity bit checking is a straightforward watermarking approach [13].…”

Section: Parity Bitmentioning

confidence: 99%

Image Watermarking Based on IWT and Parity Bit Checking

Awad

Majeed²

2021

eijs

View full text Add to dashboard Cite

show abstract

“…This has the advantage of low complexity and easy implementation, but not too strong to withstand affine transformations and some image processing attacks. However, the frequency domain scheme [5] usually makes it more difficult to see and provides resistance to too many common attacks. In the frequency domain watermarking scheme, the robustness and imperceptibility of the host picture are in the balance.…”

Section: Related Workmentioning

confidence: 99%

“…There are a number of self-embedding watermarking techniques that have been proposed [5]. Either uses fragile watermarking or robust watermarking techniques.…”

Section: Introductionmentioning

confidence: 99%

Blind Robust and Self-Embedding Fragile Image Watermarking for Image Authentication and Copyright Protection with Recovery Capability

Rakhmawati¹,

Suwadi²,

Wirawan³

2020

IJIES

Self Cite

View full text Add to dashboard Cite

This paper proposes a dual watermarking scheme that can integrate the functions of authentication, copyright protection, and image recovery in the same cover image. The robust watermarking utilizes a single watermark using the discrete cosine transform (DCT) domain for copyright protection, while the fragile scheme utilizes two self-embedding watermarks in a spatial domain for authenticating and restoring digital image content. The mechanism of the two schemes is carried out sequentially and uses a block-based approach. A new blind robust watermarking is proposed using a quantitative property of intermediate frequency coefficient for embedding and adaptive embedding strength selection to balance transparency and robustness. Fragile watermarks are inserted into a robust watermarked image based on the improved replacement approach of the least significant bits. Experimental results show that the proposed method can withstand various processing attacks; enhance the accuracy of deceptive localization with good visual quality of image recovery.

show abstract

“…Furthermore, digital signatures are often unable to locate or recover the manipulations of the critical images [5]- [7]. A common method to deal with these two issues is watermarking [2] which has been developed to provide ownership authentication and integrity verification for digital media [8]- [11]. In this method, some information is inserted inside the original media signal in order to verify the credibility of the content or identify the ownership [12]- [17].…”

Section: Introductionmentioning

confidence: 99%

“…Therefore, a good fragile watermarking should be easily affected by any feasible attack. The various types of tampering or common attacks which may be imposed on a watermarked image are as follows [2] [26]- [29]:…”

Section: A Introducing Tampering Attacksmentioning

confidence: 99%

Detection and Recovery of Higher Tampered Images Using Novel Feature and Compression Strategy

2021

View full text Add to dashboard Cite

Due to the availability of powerful image-editing software and the growing amount of multimedia data that is transmitted via the Internet, integrity verifications and confidentiality of the data are becoming critical issues. However, currently, the accuracy of detecting and the recovery capability of the tampered images by the existing methods through watermarking strategy is still not at the required level, especially at a higher tampered rate. This paper proposes a new blind and fragile watermarking method to detect tampering and better recovery of tampered images. To improve the quality of both the watermarked and the recovered images, a new feature extraction scheme is introduced which will produce a short but comprehensive recovery code using a new compression strategy. If a block in the image tampers, the proposed embedded feature allows the original data to be extracted for recovery. To overcome tamper coincidence, every block's watermarked data contains not only the recovery code belonging to the block itself but also its neighbor's data as a second layer of recovery. Various size blocks were investigated to see the performance and compare their efficiency for recovering an image after different tampering rates. The test showed the smaller block sizes may be more suitable for locating tampering, where the bigger ones are more suitable when the tampering rate is higher. The bigger block sizes in the proposed method can recover an image even after a 60% tampering rate with high quality (more than 31 dB). The experimental results prove that the proposed method can have better efficiency for detecting tampering, and recovery of the original image, compared to the relevant existing methods.

show abstract

A recent survey of self-embedding fragile watermarking scheme for image authentication with recovery capability

Cited by 50 publications

References 53 publications

Image Watermarking Based on IWT and Parity Bit Checking

Image Watermarking Based on IWT and Parity Bit Checking

Blind Robust and Self-Embedding Fragile Image Watermarking for Image Authentication and Copyright Protection with Recovery Capability

Detection and Recovery of Higher Tampered Images Using Novel Feature and Compression Strategy

Contact Info

Product

Resources

About