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 journalArticle

  • 1 Citations

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.

LanguageEnglish
Pages83-92
Number of pages10
JournalDigital Signal Processing: A Review Journal
Volume73
DOIs
StatePublished - 01 Feb 2018

Fingerprint

Restoration
Authentication
Pixels
Watermarking
Recovery
Costs

Cite this

@article{c7422e4beb5b4c41988a317ce15cc27c,
title = "Fast fragile watermark embedding and iterative mechanism with high self-restoration performance",
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.",
keywords = "Erasure channel, Fragile watermarking, Image authentication, Self-restoration, Tornado codes",
author = "Sergio Bravo-Solorio and Felix Calderon and Li, {Chang Tsun} and Nandi, {Asoke K.}",
year = "2018",
month = "2",
day = "1",
doi = "10.1016/j.dsp.2017.11.005",
language = "English",
volume = "73",
pages = "83--92",
journal = "Digital Signal Processing: A Review Journal",
issn = "1051-2004",
publisher = "Elsevier",

}

Fast fragile watermark embedding and iterative mechanism with high self-restoration performance. / Bravo-Solorio, Sergio; Calderon, Felix; Li, Chang Tsun; Nandi, Asoke K.

In: Digital Signal Processing: A Review Journal, Vol. 73, 01.02.2018, p. 83-92.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Bravo-Solorio,Sergio

AU - Calderon,Felix

AU - Li,Chang Tsun

AU - Nandi,Asoke K.

PY - 2018/2/1

Y1 - 2018/2/1

N2 - 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.

AB - 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.

KW - Erasure channel

KW - Fragile watermarking

KW - Image authentication

KW - Self-restoration

KW - Tornado codes

UR - http://www.scopus.com/inward/record.url?scp=85034654082&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85034654082&partnerID=8YFLogxK

U2 - 10.1016/j.dsp.2017.11.005

DO - 10.1016/j.dsp.2017.11.005

M3 - Article

VL - 73

SP - 83

EP - 92

JO - Digital Signal Processing: A Review Journal

T2 - Digital Signal Processing: A Review Journal

JF - Digital Signal Processing: A Review Journal

SN - 1051-2004

ER -