Data hiding using adaptive LSB and PVD technique resisting PDH and RS analysis Online publication date: Mon, 30-Sep-2019
by Aditya Kumar Sahu; Gandharba Swain
International Journal of Electronic Security and Digital Forensics (IJESDF), Vol. 11, No. 4, 2019
Abstract: This paper proposes an improved data hiding technique using the principle of least significant bit (LSB) substitution and pixel value differencing (PVD). It addresses two issues: 1) the error block problem (EBP); 2) the fall of boundary problem (FOBP). The image is divided into non-overlapping blocks of two consecutive pixels. The blocks are divided into three levels depending upon the pixel value difference. The level of the block and the pixel difference range decides the hiding capacity of a block. The proposed technique has been compared with related existing techniques in terms of parameters like peak signal to noise ratio (PSNR), quality index (Q), hiding capacity, bits per pixel (BPP), and the count of the blocks suffering from FOBP. The experimental results prove that the proposed technique offers better PSNR and hiding capacity as compared to the related existing techniques. Furthermore, the proposed technique is resistant to pixel difference histogram (PDH) analysis and RS analysis.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Electronic Security and Digital Forensics (IJESDF):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook