An efficient data hiding technique in image using binary Hamming code along with particle swarm optimisation
by P. Malathi; T. Gireesh Kumar
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 20, No. 2, 2021

Abstract: An effective spatial domain steganographic scheme is proposed in this paper. Particle swarm optimisation (PSO) can be used to identify the most efficient pixel position in the greyscale cover image, then secret information embedded using linear block code - binary Hamming code which enhances embedding efficiency. The visual quality of the stego image is the primary element taken into consideration in formulating the objective function of the PSO. The efficiency of the proposed method was analysed through measures like peak signal-to-noise ratio (PSNR), and structural similarity index (SSIM) to validate the visual quality of the image. Chi-square, histogram, and regular singular (RS) attacks are the steganalysis techniques used in this paper that confirm the security offered for the secret information. The results are compared with various standard spatial domain embedding techniques for hiding data; binary Hamming code along with PSO provides the best stego image quality and it can sustain various noises during the transmission.

Online publication date: Thu, 18-Nov-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Intelligent Systems Technologies and Applications (IJISTA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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