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

diff --git a/experiments.tex b/experiments.tex
index 0c08d69..9da4704 100644
--- a/experiments.tex
+++ b/experiments.tex
@@ -7,50 +7,25 @@ this set of cover images since this paper is more focused on
 the methodology than benchmarking.    
 Our approach is always compared to Hugo~\cite{DBLP:conf/ih/PevnyFB10}
 and to EAISLSBMR~\cite{Luo:2010:EAI:1824719.1824720}.
+The former is the less detectable information hidding tool in spatial domain 
+and the later is the work which is close to ours, as far as we know. 
 
 
 
-
-
-\subsection{Adaptive Embedding Rate} 
-Two strategies have been developed in our scheme, 
-depending on the embedding rate that is either \emph{adaptive} or \emph{fixed}.
-
-In the former the embedding rate depends on the number of edge pixels.
-The higher it is, the larger the message length that can be inserted is.
-Practically, a set of edge pixels is computed according to the 
-Canny algorithm with an high threshold.
-The message length is thus defined to be half of this set cardinality.
-In this strategy, two methods are thus applied to extract bits that 
-are modified. The first one is a direct application of the STC algorithm.
-This method is further referred to as \emph{adaptive+STC}.
-The second one randomly chooses the subset of pixels to modify by 
-applying the BBS PRNG again. This method is denoted \emph{adaptive+sample}.
-Notice that the rate between 
-available bits  and bit message length is always equal to 2.
-This constraint is indeed induced by the fact that the efficiency 
-of the STC algorithm is unsatisfactory under that threshold.
-In our experiments and with the adaptive scheme, 
+First of all,  in our experiments and with the adaptive scheme, 
 the average size of the message that can be embedded is 16,445 bits.
 Its corresponds to an  average payload of 6.35\%. 
+The two other tools will then be compared with this payload. 
+The Sections~\ref{sub:quality} and~\ref{sub:steg} respectively present 
+the quality analysis and the security of our scheme. 
 
 
 
-
-In the latter, the embedding rate is defined as a percentage between the 
-number of modified pixels and the length of the bit message.
-This is the classical approach adopted in steganography.
-Practically, the Canny algorithm generates  
-a set of edge pixels related to a threshold that is decreasing until its cardinality
-is sufficient. If the set cardinality is more than twice larger than the 
-bit message length, a STC step is again applied.
-Otherwise, pixels are again randomly chosen with BBS.
-
  
 
-\subsection{Image Quality}
+\subsection{Image Quality}\label{sub:quality}
 The visual quality of the STABYLO scheme is evaluated in this section.
-For the sake of completeness, four metrics are computed in these experiments: 
+For the sake of completeness, three metrics are computed in these experiments: 
 the Peak Signal to Noise Ratio (PSNR), 
 the PSNR-HVS-M family~\cite{psnrhvsm11}, 
 %the BIQI~\cite{MB10}, 
@@ -96,7 +71,7 @@ HUGO and STABYLO with  STC+adaptive parameters.
 
 
 Results are summarized into the Table~\ref{table:quality}.
-Let us give an interpretation of these first experiments.
+Let us give an interpretation of these experiments.
 First of all, the adaptive strategy produces images with lower distortion 
 than the one of images resulting from the 10\% fixed strategy.
 Numerical results are indeed always greater for the former strategy than 
@@ -128,7 +103,7 @@ give quality metrics for fixed embedding rates from a large base of images.
 
 
 
-\subsection{Steganalysis}
+\subsection{Steganalysis}\label{sub:steg}