Recent Advances in Steganography 2012
DOI: 10.5772/38298
|View full text |Cite
|
Sign up to set email alerts
|

Contemporary Approaches to the Histogram Modification Based Data Hiding Techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…The proposed secret data embedding scheme. FoO of the V LL (i.e., '23' in the given example) to FoO of the V UL in the histogram (Yalman et al 2012). Bearing in mind the secret data embedding case above, relatively simple procedure, which are detailed below, revealing the secret data bits (i.e., '(101) 2 ') obtained from the covered image histogram in table 2.…”
Section: Fundamentals Of the Proposed Schemementioning
confidence: 99%
See 1 more Smart Citation
“…The proposed secret data embedding scheme. FoO of the V LL (i.e., '23' in the given example) to FoO of the V UL in the histogram (Yalman et al 2012). Bearing in mind the secret data embedding case above, relatively simple procedure, which are detailed below, revealing the secret data bits (i.e., '(101) 2 ') obtained from the covered image histogram in table 2.…”
Section: Fundamentals Of the Proposed Schemementioning
confidence: 99%
“…Assume that the number of parts of the two-dimensional image (only R, G, B separately or gray) is p, the number of V B s (for FoO = 0) j, and the number of hidden data bits to be placed in each FoO is n,. The data embedding capacity of the presented scheme is defined as follows (Yalman et al 2012):…”
Section: Definition For the Data Embedding Capacitymentioning
confidence: 99%