From: raphael couturier Date: Tue, 24 Feb 2015 18:17:29 +0000 (+0100) Subject: Merge branch 'master' of ssh://info.iut-bm.univ-fcomte.fr/canny X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/commitdiff_plain/5178f772a789c49b261c48acc466a982d413a9a9?hp=ff62ab9a78e83759f5e40e3b7d422fddeb45115d Merge branch 'master' of ssh://info.iut-bm.univ-fcomte.fr/canny --- diff --git a/experiments.tex b/experiments.tex index 6d65b81..9590b1c 100644 --- a/experiments.tex +++ b/experiments.tex @@ -153,7 +153,7 @@ considered as state of the art steganalysers. \JFC{Features that are embedded into this steganalysis process are CCPEV and SPAM features as described in~\cite{DBLP:dblp_conf/mediaforensics/KodovskyPF10}. -These one are extracted from the +These latter are extracted from the set of cover images and the set of training images.} Next a small set of weak classifiers is randomly built, diff --git a/intro.tex b/intro.tex index db41326..a13492f 100644 --- 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. -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. @@ -124,7 +124,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 -messages of length larger than 15728 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 @@ -144,9 +144,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 -(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 -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. diff --git a/ourapproach.tex b/ourapproach.tex index 534fb29..e411579 100644 --- a/ourapproach.tex +++ b/ourapproach.tex @@ -3,7 +3,7 @@ four main steps: the data encryption (Sect.~\ref{sub:bbs}), the cover pixel selection (Sect.~\ref{sub:edge}), the adaptive payload considerations (Sect.~\ref{sub:adaptive}), and how the distortion has been minimized (Sect.~\ref{sub:stc}). -The message extraction is then presented (Sect.~\ref{sub:extract}) while a running example ends this section (Sect.~\ref{sub:xpl}). +The message extraction is then presented (Sect.~\ref{sub:extract}) while a running example ends this section. The flowcharts given in Fig.~\ref{fig:sch} @@ -48,8 +48,8 @@ Let us first focus on the data embedding. \subsection{Security considerations}\label{sub:bbs} -\JFC{To provide a self-contained article without any bias, we shortly -pressent the retained encryption process.} +\JFC{To provide a self-contained article without any bias, we shor\-tly +present the selected encryption process.} Among the methods of message encryption/decryption (see~\cite{DBLP:journals/ejisec/FontaineG07} for a survey) we implement the asymmetric @@ -204,20 +204,20 @@ states whether a given pixel is an edge or not. In this article, in the Adaptive strategy we consider that all the edge pixels that have been selected by this algorithm have the same -distortion cost \textit{i.e.} $\rho_X$ is always 1 for these bits. +distortion cost, \textit{i.e.}, $\rho_X$ is always 1 for these bits. In the Fixed strategy, since pixels that are detected to be edge -with small values of $T$ (e.g. when $T=3$) +with small values of $T$ (e.g., when $T=3$) are more accurate than these with higher values of $T$, we give to STC the following distortion map of the corresponding bits $$ \rho_X= \left\{ \begin{array}{l} -1 \textrm{ if an edge for $T=3$} \\ -10 \textrm{ if an edge for $T=5$} \\ -100 \textrm{ if an edge for $T=7$} +1 \textrm{ if an edge for $T=3$,} \\ +10 \textrm{ if an edge for $T=5$,} \\ +100 \textrm{ if an edge for $T=7$.} \end{array} \right. -$$. +$$ diff --git a/stc.tex b/stc.tex index c195fca..5e5b66e 100644 --- a/stc.tex +++ b/stc.tex @@ -1,6 +1,6 @@ To make this article self-contained, this section recalls the basis of the Syndrome Treillis Codes (STC). -\JFC{A reader that is familar with syndrome coding can skip it.} +\JFC{A reader who is familar with syndrome coding can skip it.} Let $x=(x_1,\ldots,x_n)$ be the $n$-bits cover vector issued from an image $X$,