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

diff --git a/ourapproach.tex b/ourapproach.tex
index 1b2ee1a..eeabc98 100644
--- a/ourapproach.tex
+++ b/ourapproach.tex
@@ -148,12 +148,13 @@ 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. 
+is sufficient. Even in this situation, our scheme is adapting 
+its algorithm to met all the user requirements. 
 
 
-
-Two methods may further be applied to select bits that 
-will be modified. 
+Once the map of possibly modified pixels is computed, 
+two methods may further be applied to extract bits that 
+are really modified. 
 The first one randomly chooses the subset of pixels to modify by 
 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