| Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] | [ 19] | [ 20] | [ 21] | [ 22] | [ 23] | [ 24] |
¡@
CHENG-HSING YANG AND SHIUH-JENG WANG+
Department of Computer Science
National Pingtung University of Education
Pingtung, 900 Taiwan
+Department of Information Management
Central Police University
Taoyuan, 333 Taiwan
Simple least-significant-bit (LSB) substitution is a method used to embed secret
data in least significant bits of pixels in a host image. The LSB approaches typically
achieve high capacity. A simple LSB substitution, which hides secret data directly into
LSBs, is easily implemented but will result in bad quality of the stego-image. In order to
reduce the degradation of the host image after embedding, an LSB substitution scheme
was proposed by Wang et al. They proposed a genetic algorithm to search for approximate
solutions. Also, Chang et al. proposed a dynamic programming strategy to efficiently
obtain a solution. In this paper, we propose a more general model of Wang et
al.¡¦s LSB substitution scheme, called as transforming LSB substitution. In order to
overcome the problem associated with the two previous approaches of a long running
time, a more efficient approach, referred to as the matching approach, is proposed to find
a better solution. Some experiments, demonstrations and analyses are shown in this paper
to demonstrate our new scheme and approach.
Received July 29, 2008; revised November 3, 2008; accepted January 22, 2009.
Communicated by H. Y. Mark Liao.
* This paper was supported in part by the National Science Council of Taiwan, R.O.C. under the Grant NSC
95-2221-E-015-002-MY2, NSC 97-2221-E-153-001, and NSC 97-2221-E-015-001.
+ Corresponding author.