quelques modifs

[canny.git] / intro.tex

diff --git a/intro.tex b/intro.tex
index 5fa4b70725b3bd8a1c4d3998ec469c8ba5f32cb1..8e0e6e71348884ea586c6d0b867aa83b085ac069 100644 (file)
--- a/intro.tex
+++ b/intro.tex
@@ -96,7 +96,7 @@ the one with some binary embedding~\cite{DBLP:journals/tifs/FillerJF11}.
 We thus propose to take advantage of this optimized embedding, provided they are not too time consuming.
 In the latter, an hybrid edge detector is presented followed by an ad hoc
 embedding. 
 We thus propose to take advantage of this optimized embedding, provided they are not too time consuming.
 In the latter, an hybrid edge detector is presented followed by an ad hoc
 embedding. 

-The Edge detection is computed by combining fuzzy logic~\cite{Tyan1993} 
+The Edge detection is computed by combining fuz\-zy 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 of the data hiding scheme. 
 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 of the data hiding scheme. 


@@ -114,7 +114,10 @@ Consider for instance a uniformly black image: a very tiny modification of its
 pixels can be easily detected.
 Practically speaking, if Alice would send
 a hidden message to Bob, she would never consider
 pixels can be easily detected.
 Practically speaking, if Alice would send
 a hidden message to Bob, she would never consider

-such kind of image and a high embedding rate.   
+such kind of image and a high embedding rate.
+\JFC{This desire to be adaptive has been 
+studied too in~\cite{LiFengyongZhang14}, 
+but in JPEG frequency domain}. 

 The approach we propose here is thus to provide a small complexity 
 self adaptive algorithm
 with an acceptable payload, which 
 The approach we propose here is thus to provide a small complexity 
 self adaptive algorithm
 with an acceptable payload, which 


@@ -124,7 +127,7 @@ The payload is further said to
 long message in the cover signal. 
 Practically speaking, our approach is efficient enough for
 payloads close to 0.06 bit per pixel which allows to embed 
 long message in the cover signal. 
 Practically speaking, our approach is efficient enough for
 payloads close to 0.06 bit per pixel which allows to embed 

-messages of length larger than 16000 bits in an 
+messages of length larger than 15,728 bits in an 

 image of size $512\times 512$ pixels. 
 
 % Message extraction is achieved by computing the same
 image of size $512\times 512$ pixels. 
 
 % Message extraction is achieved by computing the same


@@ -144,9 +147,9 @@ Doing so makes our steganographic protocol, to a certain extend, an asymmetric o
 To sum up, well-studied and experimented
 techniques of signal processing (adaptive edges detection), 
 coding theory (syndrome-trellis codes), and cryptography 
 To sum up, well-studied and experimented
 techniques of signal processing (adaptive edges detection), 
 coding theory (syndrome-trellis codes), and cryptography 

-(Blum-Goldwasser encryption protocol) are combined in this research work.
+(Blum-Goldwas\-ser encryption protocol) are combined in this research work.

 The objective is to  compute an efficient steganographic
 The objective is to  compute an efficient steganographic

-scheme, whose principal characteristic is to take into 
+sche\-me, whose principal characteristic is to take into 

 consideration the cover image and to be compatible with small computation resources.  
 
 The remainder of this document is organized as follows. 
 consideration the cover image and to be compatible with small computation resources.  
 
 The remainder of this document is organized as follows.