Des typos

diff --git a/experiments.tex b/experiments.tex
index 710164cd1a24aaccf279b5cd4802edb683a21362..8b674e0d78c61e7f11707fd7942df623fb4f4492 100644 (file)
--- a/experiments.tex
+++ b/experiments.tex
@@ -123,7 +123,7 @@ a natural image has stego content or not.
 In the latter, the authors show that the 
 machine learning step, (which is often
 implemented as support vector machine)
 In the latter, the authors show that the 
 machine learning step, (which is often
 implemented as support vector machine)

-can be a favourably executed thanks to an Ensemble Classifiers.
+can be a favorably executed thanks to an Ensemble Classifiers.

 
 
 
 
 
 


@@ -148,7 +148,7 @@ Ensemble Classifier & 0.47 & 0.44 & 0.35     & 0.48     \\
 \end{table}
 
 
 \end{table}
 
 

-Results show that our approach is more easily detectable than HUGO which is
-is the more secure steganography tool, as far we know. However due to its 
+Results show that our approach is more easily detectable than HUGO, which
+is the most secure steganographic tool, as far as we know. However due to its 

 huge number of features integration, it is not lightweight.   
 
 huge number of features integration, it is not lightweight.   
 

diff --git a/intro.tex b/intro.tex
index 871b5fbc2204710140336841d3235ac9ba18e0cf..026e92eee697004aeb614934774472e4755d18b9 100644 (file)
--- a/intro.tex
+++ b/intro.tex
@@ -1,7 +1,7 @@
 
 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 LSB 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)
 pixel with even value (resp. odd value) and may break structural symmetry.
 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.


@@ -56,7 +56,7 @@ There remains a large place between random selection of LSB and feature based mo
 We argue that modifying edge pixels is an acceptable compromise. 
 Edges form the outline of an object: they are the boundary between overlapping objects or between an object
 and the background. A small modification of pixel value in the stego image should not be harmful to the image quality:
 We argue that modifying edge pixels is an acceptable compromise. 
 Edges form the outline of an object: they are the boundary between overlapping objects or between an object
 and the background. A small modification of pixel value in the stego image should not be harmful to the image quality:

-in cover image, edge pixels already break its continuity  and thus already contain large variation with neighbouring 
+in cover image, edge pixels already break its continuity  and thus already contain large variation with neighboring 

 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. 
 


@@ -70,7 +70,7 @@ thanks to extensive experiments.
 However, it has been shown that the distinguish error with LSB embedding is fewer than 
 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.
 However, it has been shown that the distinguish error with LSB embedding is fewer than 
 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.

-In the latter, an hybrid edge detector is presented followed by an ad'hoc
+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 
 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 


@@ -82,7 +82,7 @@ schemes~\cite{Luo:2010:EAI:1824719.1824720,DBLP:journals/eswa/ChenCL10,DBLP:conf
 produce stego content 
 with only considering the payload, not the type of image signal: the higher the payload is, 
 the better the approach is said to be. 
 produce stego content 
 with only considering the payload, not the type of image signal: the higher the payload is, 
 the better the approach is said to be. 

-Contrarely, we argue that some images should not be taken as a cover because of the nature of their signal.
+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. 
 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. 


@@ -100,7 +100,7 @@ tested techniques of signal theory (the adaptive edge detection), coding (the bi
 scheme, which takes into consideration the cover image 
 an which is amenable to be executed on small devices.  
 
 scheme, which takes into consideration the cover image 
 an which is amenable to be executed on small devices.  
 

-The rest of the paper is organised as follows. 
+The rest of the paper 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 
 and compare them to state of the art steganographic schemes.
 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.

diff --git a/main.tex b/main.tex
index cc6454b66752b87071b4671e31dea4ff87cdb055..8a80a940f86e95202cb0e50835522fdd51f9c402 100755 (executable)
--- a/main.tex
+++ b/main.tex
@@ -3,6 +3,7 @@
 \usepackage{color}
 \usepackage{graphicx}
 \usepackage{url}
 \usepackage{color}
 \usepackage{graphicx}
 \usepackage{url}

+\usepackage{cite}

 
 % correct bad hyphenation here
 \hyphenation{op-tical net-works semi-conduc-tor}
 
 % correct bad hyphenation here
 \hyphenation{op-tical net-works semi-conduc-tor}


@@ -10,7 +11,7 @@
 
 \begin{document}
 \title{STABYLO: 
 
 \begin{document}
 \title{STABYLO: 

-a lightweight stego-secure edge-based steganography approach}
+a lightweight stego-secure edge-based steganographic approach}

 
 
 \author{Jean-Fran\c cois Couchot, Raphael Couturier, and  Christophe Guyeux*
 
 
 \author{Jean-Fran\c cois Couchot, Raphael Couturier, and  Christophe Guyeux*


@@ -18,8 +19,8 @@ a lightweight stego-secure edge-based steganography approach}
   Computer Science Laboratory DISC
   University of Franche-Comt\'{e}
   Besan\c con, France.\\
   Computer Science Laboratory DISC
   University of Franche-Comt\'{e}
   Besan\c con, France.\\

-  \{jean-francois.couchot,raphael.couturier, christophe.guyeux\}@femto-st.fr\\
-* Authors in alphabetic order.\\
+  \{jean-francois.couchot, raphael.couturier, christophe.guyeux\}@femto-st.fr\\
+ $*:$ Authors in alphabetic order.\\

 }
 \newcommand{\JFC}[1]{\begin{color}{green}\textit{#1}\end{color}}
 \newcommand{\RC}[1]{\begin{color}{red}\textit{#1}\end{color}}
 }
 \newcommand{\JFC}[1]{\begin{color}{green}\textit{#1}\end{color}}
 \newcommand{\RC}[1]{\begin{color}{red}\textit{#1}\end{color}}


@@ -33,6 +34,9 @@ a lightweight stego-secure edge-based steganography approach}
 Steganography, least-significant-bit (LSB)-based steganography, edge detection, Canny filter, security, syndrome treillis code.
 \end{IEEEkeywords}
 
 Steganography, least-significant-bit (LSB)-based steganography, edge detection, Canny filter, security, syndrome treillis code.
 \end{IEEEkeywords}
 

+\begin{abstract}
+Todo
+\end{abstract}

 
 
 
 
 
 

diff --git a/ourapproach.tex b/ourapproach.tex
index 3e012ea14be1f065c0c9afe484860357fbd85352..fc22e8f2ab2a32ee9a01b30d774b1a0a55f5a9e8 100644 (file)
--- a/ourapproach.tex
+++ b/ourapproach.tex
@@ -85,7 +85,7 @@ In order to be able to compute the same set of edge pixels, we suggest to consid
 Next, following~\cite{Luo:2010:EAI:1824719.1824720}, our scheme automatically
 modifies the Canny algorithm 
 parameters to get a sufficiently large set of edge bits: this 
 Next, following~\cite{Luo:2010:EAI:1824719.1824720}, our scheme automatically
 modifies the Canny algorithm 
 parameters to get a sufficiently large set of edge bits: this 

-one is practically enlarged untill its size is at least twice as many larger 
+one is practically enlarged until its size is at least twice as many larger 

 than the size of embedded message.
 
 % Edge Based Image Steganography schemes 
 than the size of embedded message.
 
 % Edge Based Image Steganography schemes