quelques modifs

[canny.git] / ourapproach.tex

diff --git a/ourapproach.tex b/ourapproach.tex
index 534fb29fc23e96d7d6925ad413bdb8243aae41a8..36fefc31a4cba7ed397041b6eee2884ba28482bb 100644 (file)
--- a/ourapproach.tex
+++ b/ourapproach.tex
@@ -3,7 +3,7 @@ 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 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 then presented  (Sect.~\ref{sub:extract}) while a running example ends this section (Sect.~\ref{sub:xpl}). 
+The message extraction is then presented  (Sect.~\ref{sub:extract}) while a running example ends this section.

 
 
 The flowcharts given in Fig.~\ref{fig:sch}
 
 
 The flowcharts given in Fig.~\ref{fig:sch}


@@ -48,8 +48,8 @@ Let us first focus on the data embedding.
 
 
 \subsection{Security considerations}\label{sub:bbs}
 
 
 \subsection{Security considerations}\label{sub:bbs}

-\JFC{To provide a self-contained article without any bias, we shortly 
-pressent the retained encryption process.}
+To provide a self-contained article without any bias, we shor\-tly 
+present the selected encryption process.

 Among the methods of  message encryption/decryption 
 (see~\cite{DBLP:journals/ejisec/FontaineG07} for a survey)
 we implement the asymmetric 
 Among the methods of  message encryption/decryption 
 (see~\cite{DBLP:journals/ejisec/FontaineG07} for a survey)
 we implement the asymmetric 


@@ -204,20 +204,20 @@ states whether a given pixel is an edge or not.
 In this article, in the Adaptive strategy 
 we consider that all the edge pixels that 
 have been selected by this algorithm have the same
 In this article, in the Adaptive strategy 
 we consider that all the edge pixels that 
 have been selected by this algorithm have the same

-distortion cost \textit{i.e.} $\rho_X$ is always 1 for these bits. 
+distortion cost, \textit{i.e.}, $\rho_X$ is always 1 for these bits. 

 In the Fixed strategy, since pixels that are detected to be edge
 In the Fixed strategy, since pixels that are detected to be edge

-with small values of $T$ (e.g. when $T=3$) 
+with small values of $T$ (e.g., when $T=3$) 

 are more accurate than these with higher values of $T$,
 we give to STC the following distortion map of the corresponding bits
 $$  
 \rho_X= \left\{ 
 \begin{array}{l}
 are more accurate than these with higher values of $T$,
 we give to STC the following distortion map of the corresponding bits
 $$  
 \rho_X= \left\{ 
 \begin{array}{l}

-1 \textrm{ if an edge for $T=3$} \\
-10 \textrm{ if an edge for $T=5$} \\
-100 \textrm{ if an edge for $T=7$}
+1 \textrm{ if an edge for $T=3$,} \\
+10 \textrm{ if an edge for $T=5$,} \\
+100 \textrm{ if an edge for $T=7$.}

 \end{array}
 \right.
 \end{array}
 \right.

-$$.
+$$