X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/blobdiff_plain/244797b85f1e232852b9374a76fe7139ed4cccfb..457be557d1bb33d5d169605464822243e0ed6232:/ourapproach.tex?ds=inline

diff --git a/ourapproach.tex b/ourapproach.tex
index e6f3d4a..1b2ee1a 100644
--- a/ourapproach.tex
+++ b/ourapproach.tex
@@ -3,15 +3,16 @@ four main steps: the data encryption (Sect.~\ref{sub:bbs}),
 the cover pixel selection (Sect.~\ref{sub:edge}),
 the adaptive payload considerations (Sect.~\ref{sub:adaptive}),
 and how the distortion has been minimized (Sect.~\ref{sub:stc}).
-The message extraction is finally presented  (Sect.~\ref{sub:extract}) and a running example ends this section (Sect.~\ref{sub:xpl}). 
+The message extraction is then presented  (Sect.~\ref{sub:extract}) and a running example ends this section (Sect.~\ref{sub:xpl}). 
 
 
 The flowcharts given in Fig.~\ref{fig:sch}
 summarize our steganography scheme denoted by
-STABYLO, which stands for STeganography with cAnny, Bbs, binarY embedding at LOw cost.
-What follows are successively details of the inner steps and flows inside 
-both the embedding stage (Fig.~\ref{fig:sch:emb}) 
-and the extraction one (Fig.~\ref{fig:sch:ext}).
+STABYLO, which stands for STeganography with 
+Adaptive, Bbs, binarY embedding at LOw cost.
+What follows are successively some details of the inner steps and the flows both inside 
+ the embedding stage (Fig.~\ref{fig:sch:emb}) 
+and inside the extraction one (Fig.~\ref{fig:sch:ext}).
 Let us first focus on the data embedding. 
 
 \begin{figure*}%[t]
@@ -48,7 +49,7 @@ Let us first focus on the data embedding.
 
 
 \subsection{Security considerations}\label{sub:bbs}
-Among methods of message encryption/decryption 
+Among methods of the message encryption/decryption 
 (see~\cite{DBLP:journals/ejisec/FontaineG07} for a survey)
 we implement the Blum-Goldwasser cryptosystem~\cite{Blum:1985:EPP:19478.19501}
 that is based on the Blum Blum Shub~\cite{DBLP:conf/crypto/ShubBB82} 
@@ -96,7 +97,7 @@ are searched in order to find edges.
 As far as fuzzy edge methods are concerned, they are obviously based on fuzzy logic to highlight edges.
 
 Canny filters, on their parts, are an old family of algorithms still remaining a state of the art edge detector. They can be well-approximated by first-order derivatives of Gaussians.
-As the Canny algorithm is well known and studied, fast, and implementable
+As the Canny algorithm is fast, well known, has been studied in depth, and is implementable
 on many  kinds of architectures like FPGAs, smartphones,  desktop machines, and
 GPUs, we have chosen this edge detector for illustrative purpose.
 
@@ -154,7 +155,7 @@ is sufficient.
 Two methods may further be applied to select bits that 
 will be modified. 
 The first one randomly chooses the subset of pixels to modify by 
-applying the BBS PRNG again. This method is further denoted  as to \emph{sample}.
+applying the BBS PRNG again. This method is further denoted  as a \emph{sample}.
 Once this set is selected, a classical LSB replacement is applied to embed the 
 stego content.
 The second method is a direct application of the 
@@ -238,7 +239,7 @@ message is extracted.
 In this example, the cover image is  Lena, 
 which is a $512\times512$  image with 256 grayscale levels.
 The message is the poem Ulalume (E. A. Poe), which is constituted by 104 lines, 667
-words, and 3754 characters, \textit{i.e.},  30032 bits.
+words, and 3,754 characters, \textit{i.e.},  30,032 bits.
 Lena and the first verses are given in Fig.~\ref{fig:lena}.
 
 \begin{figure}
@@ -267,7 +268,7 @@ $~$ In the ghoul-haunted woodland of Weir.
 \caption{Cover and message examples} \label{fig:lena}
 \end{figure}
 
-The edge detection returns 18641 and 18455 pixels when $b$ is
+The edge detection returns 18,641 and 18,455 pixels when $b$ is
 respectively 7 and 6. These edges are represented in Figure~\ref{fig:edge}.
 
 
@@ -298,7 +299,7 @@ respectively 7 and 6. These edges are represented in Figure~\ref{fig:edge}.
 
 
 
-Only 9320 bits (resp. 9227 bits) are available for embedding 
+Only 9,320 bits (resp. 9,227 bits) are available for embedding 
 in the former configuration where $b$ is 7 (resp. where $b$ is 6).
 In both cases, about the third part of the poem is hidden into the cover.
 Results with \emph{adaptive+STC} strategy are presented in 
@@ -337,9 +338,9 @@ $$
 V_{ij}= \left\{
 \begin{array}{rcl}
 0 & \textrm{if} &  X_{ij} = Y_{ij} \\
-75 & \textrm{if} &  \abs{ X_{ij} - Y_{ij}} = 1 \\
-150 & \textrm{if} &  \abs{ X_{ij} - Y_{ij}} = 2 \\
-225 & \textrm{if} &  \abs{ X_{ij} - Y_{ij}} = 3 
+75 & \textrm{if} &  \vert X_{ij} - Y_{ij} \vert = 1 \\
+150 & \textrm{if} &  \vert X_{ij} - Y_{ij} \vert = 2 \\
+225 & \textrm{if} &  \vert X_{ij} - Y_{ij} \vert = 3 
 \end{array}
 \right..
 $$
@@ -369,3 +370,6 @@ This function allows to emphasize differences between contents.
   \caption{Differences  with Lena's cover  wrt $b$}
   \label{fig:lenadiff}
 \end{figure}
+
+
+