Fast fragile watermark embedding and iterative mechanism with high self-restoration performance

Sergio Bravo-Solorio, Felix Calderon, Chang Tsun Li, Asoke K. Nandi

Research output: Contribution to journalArticlepeer-review

22 Citations (Scopus)
23 Downloads (Pure)

Abstract

This paper presents a new algorithm to reduce significantly the computational cost of one of the best methods with self-recovery capabilities in the fragile watermarking literature. This is achieved by generating two sequences of reference bits associated to the 5 most significant bit-planes (MSBPs) of the image. The reference bits and some authentication bits are then allocated to the 3 least significant bit-planes (LSBPs) of the image. The receiver uses the authentication bits to localise altered pixel-blocks and then executes an iterative restoration mechanism to calculate the original value of the watermarked pixels. Experimental results demonstrate that the embedding method executes significantly faster compared to the state-of-the-art method while achieving a high restoration performance.

Original languageEnglish
Pages (from-to)83-92
Number of pages10
JournalDigital Signal Processing: A Review Journal
Volume73
Early online date2017
DOIs
Publication statusPublished - Feb 2018

Fingerprint Dive into the research topics of 'Fast fragile watermark embedding and iterative mechanism with high self-restoration performance'. Together they form a unique fingerprint.

Cite this