Title: A least-significant-bit substitution data hiding scheme by using modulus function and optimal permutation refining

Authors: Yu-An Ho, Jen-Bang Feng, Iuon-Chang Lin, Yen-Ping Chu

Addresses: Institute of Computer Science, National Chung Hsing University, 250 Kuo Kuang Rd., Taichung, 402, Taiwan. ' Department of Information Engineering and Informatics, Tzu Chi College of Technology, No. 880, Sec. 2, Jianguo Rd., Hualien City, Hualien County 970, Taiwan. ' Department of Management Information Systems, National Chung Hsing University, 250 Kuo Kuang Rd., Taichung, 402, Taiwan. ' Computer Science and Information Engineering, Tunghai University, 181 Taichung Harbor Road, Section 3, Taichung, 40704, Taiwan

Abstract: Least significant bit (LSB) substitution is one of the most straight and simple technique to hide data hiding in an image. It has been widely used in steganography, watermarking, data compression, and so on. So far, there have been many developments to improve the quality of the embedded images such like genetic algorithm, dynamic programming, modulus functions, etc. To further improve LSB data hiding, an adapted LSB data hiding scheme by using modulus function and optimal permutation search is provided in this paper. The paper presents an LSB-based data hiding scheme by using modulus function and optimal permutation refining. The proposed scheme has higher PSNR values of stego-images in the same capacity that can raise the efficiency of current data hiding schemes and can be used in wide applications.

Keywords: data hiding; steganography; least-significant-bit; modulus function; permutation refining.

DOI: 10.1504/IJMIS.2010.036072

International Journal of Multimedia Intelligence and Security, 2010 Vol.1 No.2, pp.139 - 152

Published online: 17 Oct 2010 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article