Contemporary Approaches to the Histogram Modification Based Data Hiding Techniques

Yalman, Yildiray; Akar, Feyzi; Ertürk, İsmail

doi:10.5772/38298

Search citation statements

Order By: Relevance

Paper Sections

Select...

Fundamentals Of the Proposed Scheme1

Definition For the Data Embedding Capacity1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

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

Secret data embedding scheme modifying the frequency of occurrence of image brightness values

Yalman

Ertürk

2014

Sadhana

Self Cite

View full text Add to dashboard Cite

The main purpose of this presented work is to develop a data embedding method based on a new digital image histogram modification approach. The proposed scheme fundamentally is concerned about the frequency of occurrence of the image brightness values of the cover image for the data embedding procedures. The proposed scheme effectively realizes both perceptual invisibility and statistical invisibility so that obtained covered images are highly robust against common perceptual and statistical steganalysis techniques. The scheme provides reasonably higher payload values than its counterparts, as well as providing comparatively improved PSNR results.

show abstract

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%