X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/blobdiff_plain/c1c8ac417383292fd1103aca552f689ff362426c..3cb99fa4936f62fef8a0f24880e7d9bca9c31a9e:/intro.tex

diff --git a/intro.tex b/intro.tex
index b17515c..3ccf316 100644
--- a/intro.tex
+++ b/intro.tex
@@ -1,7 +1,8 @@
 
 This research work takes place into the field of information hiding, considerably developed
 these last two decades. The proposed method for 
-steganography considers digital images as covers, it belongs in the well investigated large category
+steganography considers digital images as covers.
+It belongs in the well investigated large category
 of spatial least significant bits (LSBs) replacement schemes.
 Let us recall that, in this LSBR category, a subset of all the LSBs of the cover image is modified 
 with a secret bit stream depending on: a secret key, the cover, and the message to embed.
@@ -45,7 +46,9 @@ modification minimizes a distortion function.
 This distortion may be computed thanks to feature vectors that are embedded for instance in steganalysers
 referenced above. 
 Highly Undetectable steGO (HUGO) method~\cite{DBLP:conf/ih/PevnyFB10} is one of the most efficient instance of such a scheme.
-It takes into account so-called SPAM features (whose size is larger than $10^7$) to avoid overfitting a particular 
+It takes into account so-called SPAM features 
+%(whose size is larger than $10^7$) 
+to avoid overfitting a particular 
 steganalyser. Thus a distortion measure for each pixel is individually determined as the sum of differences between
 features of SPAM computed from the cover and from the stego images.
 Thanks to this features set, HUGO allows to embed $7\times$ longer messages with the same level of 
