fin avant choix revue

[canny.git] / ourapproach.tex

diff --git a/ourapproach.tex b/ourapproach.tex
index 1b2ee1a619182b8899607356d17db4c7e2d74370..eeabc982608e33b4ffb88a7e8681713257f72d1c 100644 (file)
--- 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
 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 
 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