z-logo
open-access-imgOpen Access
Steganographic Data Hiding using Modified APSO
Author(s) -
E. Divya,
Prateek Kumar
Publication year - 2016
Publication title -
international journal of intelligent systems and applications
Language(s) - English
Resource type - Journals
eISSN - 2074-9058
pISSN - 2074-904X
DOI - 10.5815/ijisa.2016.07.04
Subject(s) - particle swarm optimization , computer science , steganography , swarm behaviour , computation , domain (mathematical analysis) , algorithm , information hiding , mathematical optimization , multi swarm optimization , image (mathematics) , artificial intelligence , mathematics , mathematical analysis
In this paper we are analy zing the steganographic data hiding using the least significant bit technique. This paper describes the particle swarm optimisation. The particle swarm optimisation algorith m is applied to the spatial domain technique. The improved algorith m called the accelerated particle swarm optimisation converges faster than the usual particle swarm optimisation and imp roves the performance. This paper also analyses the modified part icle swarm optimisation on the spatial domain technique which improved the PSNR and also reduced the computation time.

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
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom