2013
DOI: 10.1109/tifs.2012.2224108
|View full text |Cite
|
Sign up to set email alerts
|

Reversible Watermarking Based on Invariant Image Classification and Dynamic Histogram Shifting

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
65
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 199 publications
(65 citation statements)
references
References 17 publications
0
65
0
Order By: Relevance
“…The current paper is an extended version of [7] and includes a new watermarking scheme with smaller distortion compared to [7], [14] and better steganalytic properties that make it practically undetectable by the developed steganalytic attack. The embedding algorithm is based on histogram shape modification, similarly to some existing image watermarking algorithms [31], [32].…”
Section: Related Workmentioning
confidence: 99%
“…The current paper is an extended version of [7] and includes a new watermarking scheme with smaller distortion compared to [7], [14] and better steganalytic properties that make it practically undetectable by the developed steganalytic attack. The embedding algorithm is based on histogram shape modification, similarly to some existing image watermarking algorithms [31], [32].…”
Section: Related Workmentioning
confidence: 99%
“…In addition to facilitating original DNA recovery, reversible DNA data hiding can prevent DNA forgery and mutations from external data, and the mutation process can be analyzed using the iterative process of embedding, detecting, and recovering the information. Reversible image data hiding (or watermarking) has been investigated in many studies using difference expansion [21], prediction error expansion [22][23][24], histogram shifting [25,26], lossless compression 2 Security and Communication Networks [27], and quantization index modulation [28], among other methods. In addition, the performance analysis of relevant methods has been reported [29], and it has been shown that expansion-based methods are more effective than other methods in terms of capacity, imperceptibility, and computation.…”
Section: Introductionmentioning
confidence: 99%
“…They achieved this by using prediction error (PE) instead of the difference of two connected pixels, which produces less error and decreases image degradation significantly. Their technique is to expand the PE whose predicted value is calculated from the predictor; therefore, this technique can be improved by utilizing a high performance predictor such as the median edge detector predictor (MED) [5]- [8], the gradient-adjusted predictor (GAP) [23], the rhombus predictor [9], [10], [19] and improved rhombus predictor [22], partial differential equation (PDE) predictor [11], Gaussian weight predictor [12], [13], or non-uniform weight predictor [24]. Several researchers had tried to increase the prediction function efficiency as in Shaowei et al work's [17].…”
Section: Introductionmentioning
confidence: 99%