Details

Autor(en) / Beteiligte

• Xiaolong Li, Xiaolong Li
• Bin Yang, Bin Yang
• Daofang Cheng, Daofang Cheng
• Tieyong Zeng, Tieyong Zeng

Titel

A Generalization of LSB Matching

Ist Teil von

• IEEE signal processing letters, 2009-02, Vol.16 (2), p.69-72

Ort / Verlag

New York: IEEE

Erscheinungsjahr

2009

Link zum Volltext

• Volltext

Quelle

IEEE Electronic Library (IEL)

Beschreibungen/Notizen

• Recently, a significant improvement of the well-known least significant bit (LSB) matching steganography has been proposed, reducing the changes to the cover image for the same amount of embedded secret data. When the embedding rate is 1, this method decreases the expected number of modification per pixel (ENMPP) from 0.5 to 0.375. In this letter, we propose the so-called generalized LSB matching (G-LSB-M) scheme, which generalizes this method and LSB matching. The lower bound of ENMPP for G-LSB-M is investigated, and a construction of G-LSB-M is presented by using the sum and difference covering set of finite cyclic group. Compared with the previous works, we show that the suitable G-LSB-M can further reduce the ENMPP and lead to more secure steganographic schemes. Experimental results illustrate clearly the better resistance to steganalysis of G-LSB-M.