exp

[canny.git] / intro.tex

diff --git a/intro.tex b/intro.tex
index f1db772731079d4491770fba5bbe154c687155b4..a8433e58c106b080513cf95e59e7c4f1483c47b1 100644 (file)
--- a/intro.tex
+++ b/intro.tex
@@ -67,9 +67,14 @@ in a cover image, edges already break the  continuity of pixels' intensity map a
 pixels. In other words, minor changes in regular areas are more dramatic than larger modifications in edge ones. 
 Our first proposal is thus to embed message bits into edge shapes while preserving other smooth regions. 
 
 pixels. In other words, minor changes in regular areas are more dramatic than larger modifications in edge ones. 
 Our first proposal is thus to embed message bits into edge shapes while preserving other smooth regions. 
 

-Edge based steganographic schemes have already been  studied, the most interesting 
-approaches being detailed in~\cite{Luo:2010:EAI:1824719.1824720} and \cite{DBLP:journals/eswa/ChenCL10}.
-In the former, the authors show how to select sharper edge regions with respect 
+Edge based steganographic schemes have already been  studied, 
+the most interesting 
+approaches being detailed in~\cite{Luo:2010:EAI:1824719.1824720} and 
+in~\cite{DBLP:journals/eswa/ChenCL10}.
+In the former, the authors presents the Edge Adaptive
+Image Steganography based on lsb matching revisited further denoted as to 
+EAISLSBMR. This approach selects sharper edge
+ regions with respect 

 to a given embedding rate: the larger the number of bits to be embedded, the coarser
 the edge regions are.
 Then the data hiding algorithm is achieved by applying LSBMR on pixels of these regions. 
 to a given embedding rate: the larger the number of bits to be embedded, the coarser
 the edge regions are.
 Then the data hiding algorithm is achieved by applying LSBMR on pixels of these regions. 


@@ -96,14 +101,14 @@ The approach we propose is thus to provide a self adaptive algorithm with a high
 cover signal. 
 
 Additionally, in the steganographic context, the data hiding procedure is often required
 cover signal. 
 
 Additionally, in the steganographic context, the data hiding procedure is often required

-to be a reversible one. We thus need to be able to compute the same edge detection pixels set for the cover and the stego image. For this, we propose to apply the edge detection algorithm not on all the bits of the image, but to exclude the LSBs. 
-Finally, even if the steganalysis discipline
-has done great leaps forward these last years, it is currently impossible to prove rigorously
+to be a reversible one. We thus need to be able to compute the same edge detection pixels set for the cover and the stego image. For this, we propose to apply the edge detection algorithm not on all the bits of the image, but to exclude the LSBs which are modified. 
+% Finally, even if the steganalysis discipline
+% has done great leaps forward these last years, it is currently impossible to prove rigorously

 that a given hidden message cannot be recovered by an attacker.
 This is why we add to our scheme a reasonable
 message encryption stage, to be certain that,
 even in the worst case scenario, the attacker
 that a given hidden message cannot be recovered by an attacker.
 This is why we add to our scheme a reasonable
 message encryption stage, to be certain that,
 even in the worst case scenario, the attacker

-will not be able to obtain the message content.
+will not be able to obtain the original message content.

 Doing so makes our steganographic protocol, to a certain extend, an asymmetric one.
 
 To sum up, in this research work, well studied and experimented
 Doing so makes our steganographic protocol, to a certain extend, an asymmetric one.
 
 To sum up, in this research work, well studied and experimented