The Community for Technology Leaders
Frontiers of Information Technology (2011)
Islamabad, Pakistan
Dec. 19, 2011 to Dec. 21, 2011
ISBN: 978-0-7695-4625-4
pp: 281-286
ABSTRACT
Reversible data hiding technique enables the exact recovery of original contents upon extraction of embedding data. Many conventional watermarking algorithms that have been proposed so far, suffer from the problem of low embedding capacity. In many applications huge amount of data is required to embed and exact recovery of host image is also needed. Luo's additive interpolation-error expansion technique [1] is a high capacity reversible method for data embedding without zero loss of host information. In this paper, we focus on improving payload and imperceptibility, and we propose an algorithm which is an extension of interpolation-error scheme using Particle Swarm Optimization (PSO) which better exploits estimation of missing pixel. The experimental results demonstrate that due to slight modification in interpolation-error technique, we achieve large hiding capacity and improved image quality compared with other schemes.
INDEX TERMS
Additive interpolation-error expansion, data embedding, particle swarm optimization, interpolation-error, reversible watermarking
CITATION
Talat Naheed, Amir Dar, Imran Usman, "Lossless Data Hiding Using Optimized Interpolation Error Expansion", Frontiers of Information Technology, vol. 00, no. , pp. 281-286, 2011, doi:10.1109/FIT.2011.59
176 ms
(Ver 3.3 (11022016))