An efficient high payload ±1 data embedding scheme

Omoomi, Masood; Samavi, Shadrokh; Dumitrescu, Sorina

doi:10.1007/s11042-010-0517-z

Cited by 22 publications

(6 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Performance comparison has been made among the proposed LSB Flipping, LSB matching, LSB-MR method [1] , Omoomi's method [2] and EMD method [5] as shown in Fig.1(a). The LSB-MR method incurs less changes in the images compared to a plain LSB matching technique, therefore has improved security against the HCF-COM analysis introduced in [10].…”

Section: Resultsmentioning

confidence: 99%

“…Mielikainen [1] proposed a method, called LSB matching revisited (LSB-MR), which has been shown that embedding efficiency is significantly larger than the early LSB-based algorithms. In [2], another type of steganographic method for improving embedding performance is presented. It allows embedding the same payload as LSB-MR algorithm but with fewer modifications.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Data embedding with multi-ary tree coding

Shi

Zhang

et al. 2011

2011 International Conference on Multimedia Technology

View full text Add to dashboard Cite

This paper proposes a novel steganographic method based on tree structure. This method tries to reduce the amplitude of modifying the cover object to minimize the distortion. In data hiding process, each secret digit is represented by a (2n+1)-ary notational system. We employ complete tree structure to carry the difference between cover pixels and secret digits, and secret digits are embedded into the cover pixels by using tree structure. An optimum node distribution with least distortion is found by performing adjusting procedure, in which the amplitude of modifying is dispersed in all cover pixels evenly. The embedding algorithm obtains the stego object by performing addition between cover object and adjusted tree object. We can prove that our method can produce a stego object with least distortion. Theoretical analysis and experimental results show that our method is very efficient for hiding the secret message due to its simplicity and has higher embedding efficiency than other algorithms when the embedding rate is same.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Data embedding with multi-ary tree coding

Shi

Zhang

et al. 2011

2011 International Conference on Multimedia Technology

View full text Add to dashboard Cite

show abstract

“…The algorithms based on spatial domain may operate directly on the image pixel intensity [4][5][6][7][8][9][10][11]. The algorithms using transform domain operate mainly in DCT, DWT, etc.…”

Section: Introductionmentioning

confidence: 99%

An image information hiding using adaptation and radix

Tang

Song

Chen

et al. 2015

Optik

View full text Add to dashboard Cite

“…Experimental results demonstrate that the proposed method is with fewer revisions to the pixels of the cover image than LSB-M when embedding the same capacity messages. The embedding rate is 0.5 bit per pixel (bpp) in LSB-MR. Omoomi et al proposed a novel efficient high payload ±1 steganographic scheme based on a special two variable binary functions [5]. Embedding capacity is 1.00 bit per pixel (bpp) in the EPES method.…”

Section: Introductionmentioning

confidence: 99%