Reversible watermarking algorithm with distortion compensation

Vasiliy Sachnev, Hyong Joong Kim, Sundaram Suresh, Yun Qing Shi

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

A novel reversible watermarking algorithm with two-stage data hiding strategy is presented in this paper. The core idea is two-stage data hiding (i.e., hiding data twice in a pixel of a cell), where the distortion after the first stage of embedding can be rarely removed, mostly reduced, or hardly increased after the second stage. Note that even the increased distortion is smaller compared to that of other methods under the same conditions. For this purpose, we compute lower and upper bounds from ordered neighboring pixels. In the first stage, the difference value between a pixel and its corresponding lower bound is used to hide one bit. The distortion can be removed, reduced, or increased by hiding another bit of data by using a difference value between the upper bound and the modified pixel. For the purpose of controlling capacity and reducing distortion, we determine appropriate threshold values. Finally, we present an algorithm to handle overflow/underflow problems designed specifically for two-stage embedding. Experimental study is carried out using several images, and the results are compared with well-known methods in the literature. The results clearly highlight that the proposed algorithm can hide more data with less distortion.

Original languageEnglish
Article number316820
JournalEurasip Journal on Advances in Signal Processing
Volume2010
DOIs
Publication statusPublished - 2010 Dec 1

Fingerprint

Watermarking
Pixels
Compensation and Redress

ASJC Scopus subject areas

  • Hardware and Architecture
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Reversible watermarking algorithm with distortion compensation. / Sachnev, Vasiliy; Kim, Hyong Joong; Suresh, Sundaram; Shi, Yun Qing.

In: Eurasip Journal on Advances in Signal Processing, Vol. 2010, 316820, 01.12.2010.

Research output: Contribution to journalArticle

@article{e9d23a41a4654c76b17e1efc16376e4e,
title = "Reversible watermarking algorithm with distortion compensation",
abstract = "A novel reversible watermarking algorithm with two-stage data hiding strategy is presented in this paper. The core idea is two-stage data hiding (i.e., hiding data twice in a pixel of a cell), where the distortion after the first stage of embedding can be rarely removed, mostly reduced, or hardly increased after the second stage. Note that even the increased distortion is smaller compared to that of other methods under the same conditions. For this purpose, we compute lower and upper bounds from ordered neighboring pixels. In the first stage, the difference value between a pixel and its corresponding lower bound is used to hide one bit. The distortion can be removed, reduced, or increased by hiding another bit of data by using a difference value between the upper bound and the modified pixel. For the purpose of controlling capacity and reducing distortion, we determine appropriate threshold values. Finally, we present an algorithm to handle overflow/underflow problems designed specifically for two-stage embedding. Experimental study is carried out using several images, and the results are compared with well-known methods in the literature. The results clearly highlight that the proposed algorithm can hide more data with less distortion.",
author = "Vasiliy Sachnev and Kim, {Hyong Joong} and Sundaram Suresh and Shi, {Yun Qing}",
year = "2010",
month = "12",
day = "1",
doi = "10.1155/2010/316820",
language = "English",
volume = "2010",
journal = "Eurasip Journal on Advances in Signal Processing",
issn = "1687-6172",
publisher = "Springer Publishing Company",

}

TY - JOUR

T1 - Reversible watermarking algorithm with distortion compensation

AU - Sachnev, Vasiliy

AU - Kim, Hyong Joong

AU - Suresh, Sundaram

AU - Shi, Yun Qing

PY - 2010/12/1

Y1 - 2010/12/1

N2 - A novel reversible watermarking algorithm with two-stage data hiding strategy is presented in this paper. The core idea is two-stage data hiding (i.e., hiding data twice in a pixel of a cell), where the distortion after the first stage of embedding can be rarely removed, mostly reduced, or hardly increased after the second stage. Note that even the increased distortion is smaller compared to that of other methods under the same conditions. For this purpose, we compute lower and upper bounds from ordered neighboring pixels. In the first stage, the difference value between a pixel and its corresponding lower bound is used to hide one bit. The distortion can be removed, reduced, or increased by hiding another bit of data by using a difference value between the upper bound and the modified pixel. For the purpose of controlling capacity and reducing distortion, we determine appropriate threshold values. Finally, we present an algorithm to handle overflow/underflow problems designed specifically for two-stage embedding. Experimental study is carried out using several images, and the results are compared with well-known methods in the literature. The results clearly highlight that the proposed algorithm can hide more data with less distortion.

AB - A novel reversible watermarking algorithm with two-stage data hiding strategy is presented in this paper. The core idea is two-stage data hiding (i.e., hiding data twice in a pixel of a cell), where the distortion after the first stage of embedding can be rarely removed, mostly reduced, or hardly increased after the second stage. Note that even the increased distortion is smaller compared to that of other methods under the same conditions. For this purpose, we compute lower and upper bounds from ordered neighboring pixels. In the first stage, the difference value between a pixel and its corresponding lower bound is used to hide one bit. The distortion can be removed, reduced, or increased by hiding another bit of data by using a difference value between the upper bound and the modified pixel. For the purpose of controlling capacity and reducing distortion, we determine appropriate threshold values. Finally, we present an algorithm to handle overflow/underflow problems designed specifically for two-stage embedding. Experimental study is carried out using several images, and the results are compared with well-known methods in the literature. The results clearly highlight that the proposed algorithm can hide more data with less distortion.

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

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

U2 - 10.1155/2010/316820

DO - 10.1155/2010/316820

M3 - Article

VL - 2010

JO - Eurasip Journal on Advances in Signal Processing

JF - Eurasip Journal on Advances in Signal Processing

SN - 1687-6172

M1 - 316820

ER -