Claim Missing Document
Check
Articles

Found 2 Documents
Search

A Method of Steganography – P Message With Q Coefficient (SPMQC) Zeinab Famili; Karim Faez; Abbas Fadavi
International Journal of Electrical and Computer Engineering (IJECE) Vol 3, No 2: April 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (318.246 KB)

Abstract

In this paper, we are going to propose a method for Steganography- which is based on deceiving χ2 algorithm. Since the cover image coefficients and stego image coefficients histograms have significant differences for purposes of statistical properties, statistical analysis of χ2-test reveals the existence of hidden messages inside stego image. We are introducing an idea for hiding messages in the cover image. It causes that DCT (Discrete Cosine Transforms) coefficient histogram not to have remarkable modification before and after embedding message. As a result, identifying the hidden message inside an image is impossible for an eavesdropper through χ2 -test. In this paper, we are proposing a better method with developing this algorithm. In fact, the capacity and the security of embedding messages increase extremely.DOI:http://dx.doi.org/10.11591/ijece.v3i2.2011
The Effect of Rearrangement of the Most Incompatible Particle on Increase of Convergence Speed of PSO Abbas Fadavi; Karim Faez
International Journal of Electrical and Computer Engineering (IJECE) Vol 3, No 2: April 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (385.055 KB)

Abstract

This article presents a new method for increasing the speed of Particle Swarm Optimization (PSO) method. The particle swarm is an optimization method that was inspired by collective movement of birds and fish looking for food. This method is composed of a group of particles: each particle tries to move in one direction that the best individual and best group of particles occur in that direction. Different articles tried to expand PSO so that global optimization is gained in less time. One of the problems of this model that occurs in most cases is falling of particles in local optimum. By finding the most incompatible particle and its rearrangement in the searching space, we increase convergence speed in some considered methods. Different tests of this method in standard searching space demonstrated that this method takes account of suitable function of increasing the convergece speed of particles.DOI:http://dx.doi.org/10.11591/ijece.v3i2.2026