Reversible watermarking utilising weighted median-based prediction

Naskar, Ruchira; Chakraborty, Rajat Subhra

doi:10.1049/iet-ipr.2011.0244

Cited by 27 publications

(18 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The basic operating principle of this class of reversible watermarking algorithms [13,14,16] is relatively simple. Selected cover image pixel values are predicted based on the neighboring pixel values.…”

Section: Pixel-prediction Based Watermarkingmentioning

confidence: 99%

“…al. [14], a pixel is predicted as a weighted-median of its four neighbors. Therefore, here also k = 4.…”

Section: Weighted-median Based Predictionmentioning

confidence: 99%

“…30 and 37, for a particular value of T as well as a particular value of N , mn being constant for an m × n image. In state-of-the-art pixel-prediction based reversible watermarking algorithms [13,14,16], usually one pixel in each 2 × 2 prediction block represents the base pixel, hence about 3 4 th of the total number of pixel locations are selected for embedding. So, in the proposed framework, we take N mn = 0.75.…”

Section: Optimizing Distortion Vs Capacity Characteristicsmentioning

confidence: 99%

“…Researchers have proposed a number of reversible watermarking algorithms for digital images, based on varied principles of operation such as (A) Integer Transform [7,8], (B) Histogram-Bin-Shifting [9][10][11], (C) Integer Discrete-Cosine-Transform (IDCT) [12], (D) Pixel Prediction [13][14][15][16]. The performance characteristics of the state-of-the-art reversible watermarking algorithms have been determined by various researchers through extensive experimentation and simulations.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Technique to Evaluate Upper Bounds on Performance of Pixel–prediction Based Reversible Watermarking Algorithms

Naskar

Chakraborty

2015

J Sign Process Syst

View full text Add to dashboard Cite

Reversible watermarking algorithms allow distortion-free recovery of the cover image after watermark extraction. Current state-of-the-art does not allow the prediction of the upper bounds of the embedding capacity and distortion characteristics of reversible watermarking algorithms for a given image. In this work, we develop a statistical modelling technique to derive closed form expressions for upper bounds on these performance metrics of pixel-prediction based reversible watermarking algorithms, independent of the actual algorithm used. Comparison of the derived metrics and performance trends with those obtained from two recently reported reversible watermarking algorithms show that the developed model is accurate and consistent.

show abstract

Section: Pixel-prediction Based Watermarkingmentioning

confidence: 99%

“…al. [14], a pixel is predicted as a weighted-median of its four neighbors. Therefore, here also k = 4.…”

Section: Weighted-median Based Predictionmentioning

confidence: 99%

Section: Optimizing Distortion Vs Capacity Characteristicsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Technique to Evaluate Upper Bounds on Performance of Pixel–prediction Based Reversible Watermarking Algorithms

Naskar

Chakraborty

2015

J Sign Process Syst

View full text Add to dashboard Cite

show abstract

“…However, the complexity involved in performing two levels of watermarking remained the major drawback of the algorithm. Naskar et al [11] proposed a dual watermarking scheme by incorporating the DWT, wavelet packet transform (WPT) with best tree, and SVD. The algorithm is computationally complex due to the dual levels of watermark embedding.…”

Section: Introductionmentioning

confidence: 99%

An improved digital image watermarking scheme using the discrete Fourier transform and singular value decomposition

Varghese¹,

Saudia²,

Hussain³

et al. 2016

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

Abstract:The paper presents an improved digital image watermarking algorithm by incorporating the discrete Fourier transform (DFT) and singular value decomposition (SVD). The Fourier transformed carrier image is decomposed into four different frequency subbands by the proposed onion peel decomposition (OPD) algorithm and the SVD-based watermarking scheme is applied to attach the transformed watermark in all four carrier subbands. The proposed inverse OPD algorithm together with inverse DFT is utilized to reconstruct the watermarked image from the frequency blocks.The watermark extraction algorithm is simple and it performs the inverse of watermarking process. The experimental analysis on different images shows that the proposed algorithm produces good quality watermarked images. The watermarks extracted from watermarked images inflicted with potential attacks are also of better perception quality than those produced by other prominent algorithms in terms of subjective and objective metrics.

show abstract