Concealing a Secret Image Using the Breadth First Traversal Linear Quad tree Structure
CODAS '01 Proceedings of the Third International Symposium on Cooperative Database Systems for Advanced Applications
Fundamentals of Computational Swarm Intelligence
Fundamentals of Computational Swarm Intelligence
Least significant bit steganography detection with machine learning techniques
Proceedings of the 2007 international workshop on Domain driven data mining
An information hiding scheme by applying the dynamic programming strategy to LSB matching revisited
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Finding Optimal LSB Substitution Using Ant Colony Optimization Algorithm
ICCSN '10 Proceedings of the 2010 Second International Conference on Communication Software and Networks
| Hi-index | 0.00 |
This paper aims to find an effective and efficient information hiding method used for protecting secret information by embedding it in a cover media such as images. Finding the optimal set of the image pixel bits to be substituted by the secret message bits, such that the cover image is of high quality, is a complex process and there is an exponential number of feasible solutions. Two new ant-based algorithms are proposed and compared with other algorithms. The experimental results show that ant colony optimization algorithm can find the solution efficiently and effectively by finding the optimal set of pixel bits in a few number of iterations and with least Mean Square Error MSE comparable with genetic and genetic simulated annealing algorithms.