X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/blobdiff_plain/af81455342fce2b4d7f96ecb4f1194635a5a13a4..01ec38902455e4ee4dba09ead751639638481fd2:/ourapproach.tex?ds=sidebyside

diff --git a/ourapproach.tex b/ourapproach.tex
index 12b3a32..3537640 100644
--- a/ourapproach.tex
+++ b/ourapproach.tex
@@ -196,14 +196,26 @@ It  is further referred to as \emph{STC} and is detailed in the next section.
 % but the whole approach can be updated to consider 
 % the fuzzy logic edge detector.   
 
-% Next, following~\cite{Luo:2010:EAI:1824719.1824720}, our scheme automatically
-% modifies Canny parameters to get a sufficiently large set of edge bits: this 
-% one is practically enlarged untill its size is at least twice as many larger 
-% than the size of embedded message.
-
-
-
-%%RAPH: paragraphe en double :-)
+For a given set of parameters, 
+the canny algorithm returns a numerical value and
+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
+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
+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}
+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.
+$$.
 
 
 
