LSB matching revisited Source: IEEE Signal Processing Letters, vol. 13, no. 5, May 2006, pp. 285-287. Authors: Jarno Mielikainen Speaker: Wei-Liang Tai
Outline Steganography LSB Replacement LSB Matching The Proposed Method Experimental Results Conclusions
Steganography Escape Alice Bob Warden
LSB Replacement 1 mi mi+1 120 121 01111000 01111001 xi xi+1 121 Cover image Secret Message 1 mi mi+1 120 121 01111000 01111001 xi xi+1 121 01111001 yi yi+1
LSB Matching 1 mi mi+1 120 121 01111000 01111001 xi xi+1 yi yi+1 Cover image Secret Message 1 mi mi+1 120 121 01111000 01111001 xi xi+1 120+1=121 (01111001) Or 120-1=119 (01110111) 121 (01111001) yi yi+1
The Proposed Method (1/5) Binary function Property 1: Property 2:
The Proposed Method (2/5) 120 130 01111000 10000010 xi xi+1 120 130 mi mi+1 yi yi+1
The Proposed Method (3/5) 120 130 01111000 10000010 xi xi+1 1 120 131 or 129 mi mi+1 yi yi+1
The Proposed Method (4/5) 120 130 01111000 10000010 xi xi+1 1 mi mi+1 121 130 yi yi+1
The Proposed Method (5/5) 120 130 01111000 10000010 xi xi+1 1 mi mi+1 119 130 yi yi+1
Experimental Results
Conclusions The number of changed pixel values is smaller It is immune against steganalysis