X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/blobdiff_plain/b417a74f270da1ad1a8b11552a8508c45cb75085..93faa138ef3fae7589a5dc3ba0d8862f7b54c4cb:/intro.tex?ds=inline

diff --git a/intro.tex b/intro.tex
index 8ff5f41..deecdb7 100644
--- a/intro.tex
+++ b/intro.tex
@@ -73,7 +73,7 @@ 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 
+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
@@ -115,14 +115,14 @@ Doing so makes our steganographic protocol, to a certain extend, an asymmetric o
 
 To sum up, in this research work, well studied and experimented
 techniques of signal processing (adaptive edges detection), 
-coding theory (syndrome-treillis codes), and cryptography 
+coding theory (syndrome-trellis codes), and cryptography 
 (Blum-Goldwasser encryption protocol) are combined 
 to compute an efficient steganographic
 scheme, whose principal characteristic is to take into 
 consideration the cover image and to be compatible with small computation resources.  
 
 The remainder of this document is organized as follows. 
-Section~\ref{sec:ourapproach} presents the details of the proposed steganographic scheme.
+Section~\ref{sec:ourapproach} presents the details of the proposed steganographic scheme and applies it on a running example.
 Section~\ref{sec:experiments} shows experiments on image quality, steganalytic evaluation, complexity of our approach,
 and compares it to the state of the art steganographic schemes.
 Finally, concluding notes and future work are given in Section~\ref{sec:concl}.