Relecture de l'intro

[canny.git] / intro.tex

diff --git a/intro.tex b/intro.tex
index e6a3d97ebd6f8cfb799966f78b1c893d905870e4..f31dbabd1e26197414729e0f7ec834bf56c89dd6 100644 (file)
--- a/intro.tex
+++ b/intro.tex
@@ -1,12 +1,13 @@
 
 This work considers digital images as covers and it is based on
 spatial least significant-bit (LSB) replacement.
 
 This work considers digital images as covers and it is based on
 spatial least significant-bit (LSB) replacement.

-In this data hiding scheme a subset of all the LSBs of the cover image is modified 
+In this data hiding scheme, a subset of all the LSBs of the cover image is modified 

 with a secret bit stream depending on a key, the cover, and the message to embed.
 This well studied steganographic approach  never decreases (resp. increases)
 with a secret bit stream depending on a key, the cover, and the message to embed.
 This well studied steganographic approach  never decreases (resp. increases)

-pixel with even value (resp. odd value) and may break structural symmetry.
-These structural modifications can be detected  by statistical approaches 
-and thus by steganalysis methods~\cite{DBLP:journals/tsp/DumitrescuWW03,DBLP:conf/mmsec/FridrichGD01,Dumitrescu:2005:LSB:1073170.1073176}.
+pixel with even value (resp. odd value), and thus it may break the 
+structural symmetry of the host image.
+Such structural alterations can be detected by 
+well designed statistical investigations, leading to known steganalysis methods~\cite{DBLP:journals/tsp/DumitrescuWW03,DBLP:conf/mmsec/FridrichGD01,Dumitrescu:2005:LSB:1073170.1073176}.

 
 This drawback is avoided in LSB matching (LSBM) where
 the $+1$ or $-1$ is randomly added to the cover pixel LSB value 
 
 This drawback is avoided in LSB matching (LSBM) where
 the $+1$ or $-1$ is randomly added to the cover pixel LSB value 


@@ -28,8 +29,8 @@ another bit of secret message.
 In such a way, the modification
 rate of pixels can decrease from 0.5 to 0.375 bits/pixel
 (bpp) in the case of a maximum embedding rate, meaning fewer
 In such a way, the modification
 rate of pixels can decrease from 0.5 to 0.375 bits/pixel
 (bpp) in the case of a maximum embedding rate, meaning fewer

-changes to the cover image at the same payload compared to
-LSB replacement and LSBM. It is also shown that such a new
+changes in the cover image at the same payload compared to
+LSB replacement and LSBM. It is also shown in~\cite{Mielikainen06} that such a new

 scheme can avoid the LSB replacement style asymmetry, and
 thus it should make the detection slightly more difficult than in the
 LSBM approach. % based on our experiments
 scheme can avoid the LSB replacement style asymmetry, and
 thus it should make the detection slightly more difficult than in the
 LSBM approach. % based on our experiments


@@ -41,7 +42,7 @@ LSBM approach. % based on our experiments
 Instead of (efficiently) modifying LSBs, there is also a need to select pixels whose value 
 modification minimizes a distortion function.
 This distortion may be computed thanks to feature vectors that are embedded for instance in steganalysers
 Instead of (efficiently) modifying LSBs, there is also a need to select pixels whose value 
 modification minimizes a distortion function.
 This distortion may be computed thanks to feature vectors that are embedded for instance in steganalysers

-given above. 
+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 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
 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 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


@@ -60,51 +61,51 @@ in cover image, edge pixels already break its continuity  and thus already conta
 pixels. In other words, minor changes in regular area are more dramatic than larger modifications in edge ones. 
 Our proposal is thus to embed message bits into edge shapes while preserving other smooth regions. 
 
 pixels. In other words, minor changes in regular area are more dramatic than larger modifications in edge ones. 
 Our proposal is thus to embed message bits into edge shapes while preserving other smooth regions. 
 

-Edge based steganographic schemes have been already studied~\cite{Luo:2010:EAI:1824719.1824720,DBLP:journals/eswa/ChenCL10}.
+Edge based steganographic schemes have been already studied in~\cite{Luo:2010:EAI:1824719.1824720} and \cite{DBLP:journals/eswa/ChenCL10}.

 In the former, the authors show how to select sharper edge regions with respect 
 In the former, the authors show how to select sharper edge regions with respect 

-to embedding rate: the larger the number of bits to be embedded, the coarser
+to a given embedding rate: the larger the number of bits to be embedded, the coarser

 the edge regions are.
 the edge regions are.

-Then the data hiding algorithm is achieved by applying LSBMR on pixels of this region. 
-The authors show that this method is more efficient than all the LSB, LSBM, LSBMR approaches 
+Then the data hiding algorithm is achieved by applying LSBMR on pixels of these regions. 
+The authors show that their proposed method is more efficient than all the LSB, LSBM, and LSBMR approaches 

 thanks to extensive experiments.
 thanks to extensive experiments.

-However, it has been shown that the distinguish error with LSB embedding is fewer than 
+However, it has been shown that the distinguish error with LSB embedding is lower than 

 the one with some binary embedding~\cite{DBLP:journals/tifs/FillerJF11}.
 the one with some binary embedding~\cite{DBLP:journals/tifs/FillerJF11}.

-We thus propose to take benefit of these optimized embedding, provided it is not too time consuming.
+We thus propose to take benefit of these optimized embedding, provided they are not too time consuming.

 In the latter, an hybrid edge detector is presented followed by an ad hoc
 embedding approach. 
 The Edge detection is computed by combining fuzzy logic~\cite{Tyan1993} 
 and Canny~\cite{Canny:1986:CAE:11274.11275} approaches. The goal of this combination 
 In the latter, an hybrid edge detector is presented followed by an ad hoc
 embedding approach. 
 The Edge detection is computed by combining fuzzy logic~\cite{Tyan1993} 
 and Canny~\cite{Canny:1986:CAE:11274.11275} approaches. The goal of this combination 

-is to enlarge the set of modified bits to increase the payload. 
+is to enlarge the set of modified bits to increase the payload of the data hiding scheme. 

 
 
 
 

-But, one can notice that all the previous referenced 
+One can notice that all the previously referenced 

 schemes~\cite{Luo:2010:EAI:1824719.1824720,DBLP:journals/eswa/ChenCL10,DBLP:conf/ih/PevnyFB10}
 schemes~\cite{Luo:2010:EAI:1824719.1824720,DBLP:journals/eswa/ChenCL10,DBLP:conf/ih/PevnyFB10}

-produce stego content 
-with only considering the payload, not the type of image signal: the higher the payload is, 
+produce stego contents 
+by only considering the payload, not the type of image signal: the higher the payload is, 

 the better the approach is said to be. 
 Contrarily, we argue that some images should not be taken as a cover because of the nature of their signal.
 Consider for instance a uniformly black image: a very tiny modification of its pixels can be easily detectable.  
 The approach we propose is thus to provide a self adaptive algorithm with a high payload, which depends on the 
 cover signal. 
 
 the better the approach is said to be. 
 Contrarily, we argue that some images should not be taken as a cover because of the nature of their signal.
 Consider for instance a uniformly black image: a very tiny modification of its pixels can be easily detectable.  
 The approach we propose is thus to provide a self adaptive algorithm with a high payload, which depends on the 
 cover signal. 
 

-For some applications it might be interesting to be have a reversible procedure to compute the same edge detection pixel set for the cover and the stego image. For this, we propose to apply the edge detection algorithm not on all the bits of the image but only on all the bits without taking into consideration the LSB. 
+For some applications it might be interesting to have a reversible procedure to compute the same edge detection pixel set for the cover and the stego image. For this, we propose to apply the edge detection algorithm not on all the bits of the image, but to exclude the LSBs. 

  
 
 \JFC{Christophe : énoncer la problématique du besoin de crypto et de ``cryptographiquement sûr'',  les algo déjà cassés....
 l'efficacité d'un encodage/décodage ...} 
 To deal with security issues, message is encrypted... 
 
  
 
 \JFC{Christophe : énoncer la problématique du besoin de crypto et de ``cryptographiquement sûr'',  les algo déjà cassés....
 l'efficacité d'un encodage/décodage ...} 
 To deal with security issues, message is encrypted... 
 

-In this paper, we thus propose to combine tried and 
+In this research work, we thus propose to combine tried and 

 tested techniques of signal theory (the adaptive edge detection), coding (the binary embedding), and cryptography 
 tested techniques of signal theory (the adaptive edge detection), coding (the binary embedding), and cryptography 

-(the encrypt the message) to compute an efficient steganography 
+(encryption of the hidden message) to compute an efficient steganographic

 scheme, which takes into consideration the cover image 
 scheme, which takes into consideration the cover image 

-an which is amenable to be executed on small devices.  
+and that can be executed on small devices.  

 
 

-The rest of the paper is organized as follows. 
+The remainder of this document is organized as follows. 

 Section~\ref{sec:ourapproach} presents the details of our steganographic scheme.
 Section~\ref{sec:experiments} shows experiments on image quality, steganalytic evaluation, complexity of our approach 
 Section~\ref{sec:ourapproach} presents the details of our steganographic scheme.
 Section~\ref{sec:experiments} shows experiments on image quality, steganalytic evaluation, complexity of our approach 

-and compare them to state of the art steganographic schemes.
-Finally, concluding notes and future works are given in section~\ref{sec:concl}
+and compares it to state of the art steganographic schemes.
+Finally, concluding notes and future work are given in Section~\ref{sec:concl}.