z-logo
open-access-imgOpen Access
Improved Capacity Image Steganography Algorithm using 16-Pixel Differencing with n-bit LSB Substitution for RGB Images
Author(s) -
Meenakshi S. Arya,
Meenu Rani,
Charndeep Singh Bedi
Publication year - 2016
Publication title -
international journal of electrical and computer engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.277
H-Index - 22
ISSN - 2088-8708
DOI - 10.11591/ijece.v6i6.pp2735-2741
Subject(s) - least significant bit , steganography , computer science , block (permutation group theory) , pixel , rgb color model , algorithm , image (mathematics) , artificial intelligence , mathematics , geometry , operating system
With the intrusion of internet into the lives of every household and terabytes of data being transmitted over the internet on daily basis, the protection of content being transmitted over the internet has become an extremely serious concern. Various measures and methods are being researched and devised everyday to ensure content protection of digital media. To address this issue of content protection, this paper proposes an RGB image steganography based on sixteen-pixel differencing with n-bit Least Significant Bit (LSB) substitution. The proposed technique provides higher embedding capacity without sacrificing the imperceptibility of the host data. The image is divided into 4×4 non overlapping blocks and in each block the average difference value is calculated. Based on this value the block is classified to fall into one of four levels such as, lower, lower-middle, higher-middle and higher. If block belongs to lower level then 2-bit LSB substitution is used in it. Similarly, for lower-middle, higher-middle and higher level blocks 3, 4, and 5 bit LSB substitution is used. In our proposed method there is no need of pixel value readjustment for minimizing distortion. The experimental results show that stego-images are imperceptible and have huge hiding capacity.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here