From: couchot Date: Mon, 4 May 2015 20:48:02 +0000 (+0200) Subject: ajout des ref ANTE X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/commitdiff_plain/6bc78c180bea99d493483c3cac3f559301d3af09?ds=inline ajout des ref ANTE --- diff --git a/biblioand.bib b/biblioand.bib index 9d1171e..16cad1f 100644 --- a/biblioand.bib +++ b/biblioand.bib @@ -1,6 +1,23 @@ -c% This file was created with JabRef 2.3.1. +% This file was created with JabRef 2.3.1. % Encoding: ANSI_X3.4-1968 +@article{LiFengyongZhang14, +year={2014}, +issn={0003-4347}, +journal={annals of telecommunications - annales des télécommunications}, +volume={69}, +number={7-8}, +doi={10.1007/s12243-013-0415-2}, +title={Adaptive JPEG steganography with new distortion function}, +url={http://dx.doi.org/10.1007/s12243-013-0415-2}, +publisher={Springer Paris}, +keywords={Steganography; Distortion function; Steganalysis}, +author={Li, Fengyong and Zhang, Xinpeng and Yu, Jiang and Shen, Wenfeng}, +pages={431-440}, +language={English} +} + + @INPROCEEDINGS{nusmv02, author = {Alessandro Cimatti and Edmund M. Clarke and Enrico Giunchiglia and Fausto Giunchiglia and Marco Pistore and Marco Roveri and Roberto @@ -1409,3 +1426,15 @@ keywords = "Fuzzy edge detector" ee = {http://dx.doi.org/10.1117/12.838768} } + + +@article{liu2014syndrome, + title={Syndrome trellis codes based on minimal span generator matrix}, + author={Liu, Weiwei and Liu, Guangjie and Dai, Yuewei}, + journal={annals of telecommunications-annales des t{\'e}l{\'e}communications}, + volume={69}, + number={7-8}, + pages={403--416}, + year={2014}, + publisher={Springer} +} \ No newline at end of file diff --git a/experiments.tex b/experiments.tex index 15fb5c1..aa49e84 100644 --- a/experiments.tex +++ b/experiments.tex @@ -150,11 +150,11 @@ The steganalysis quality of our approach has been evaluated through the % two Ensemble Classifier~\cite{DBLP:journals/tifs/KodovskyFH12} based steganalyser. Its particularization to spatial domain is considered as state of the art steganalysers. -\JFC{Features that are embedded into this steganalysis process +Features that are embedded into this steganalysis process are CCPEV and SPAM features as described in~\cite{DBLP:dblp_conf/mediaforensics/KodovskyPF10}. They are extracted from the -set of cover images and the set of training images.} +set of cover images and the set of training images. Next a small set of weak classifiers is randomly built, each one working on a subspace of all the features. @@ -218,7 +218,7 @@ the objective presented in the motivations: providing an efficient steganography approach in a lightweight manner for small payload. -\RC{In Figure~\ref{fig:error}, +In Figure~\ref{fig:error}, Ensemble Classifier has been used with all the previous steganographic schemes with 4 different payloads. It can be observed that face to high values of payload, @@ -230,8 +230,7 @@ than a larger message in only one image. \begin{center} \includegraphics[scale=0.5]{error} \end{center} -\caption{Testing error obtained by Ensemble classifier with +\caption{Testing errors obtained by Ensemble classifier with WOW/UNIWARD, HUGO, and STABYLO w.r.t. payload.} \label{fig:error} \end{figure} -} diff --git a/intro.tex b/intro.tex index a13492f..8e0e6e7 100644 --- a/intro.tex +++ b/intro.tex @@ -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 -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 diff --git a/main.tex b/main.tex index 0528ede..19fdfa1 100755 --- a/main.tex +++ b/main.tex @@ -58,9 +58,9 @@ Adaptive, Bbs, and binarY embedding at LOw cost} -\newcommand{\JFC}[1]{\begin{color}{green}\textit{#1}\end{color}} +\newcommand{\JFC}[1]{\begin{color}{red}\textit{#1}\end{color}} \newcommand{\RC}[1]{\begin{color}{red}\textit{#1}\end{color}} -\newcommand{\CG}[1]{\begin{color}{blue}\textit{#1}\end{color}} +\newcommand{\CG}[1]{\begin{color}{red}\textit{#1}\end{color}} % make the title area @@ -162,7 +162,8 @@ examined for the sake of completeness. Finally, the systematic replacement of all the LSBs of edges by binary digits provided by the BBS generator will be investigated, and the consequences of such a replacement, in terms of security, will be discussed. -Furthermore, we plan to investigate information hiding on other models, such as high frequency for JPEG encoding. +Furthermore, we plan to investigate information hiding on other models, +such as high frequency for JPEG encoding. %\bibliographystyle{spbasic} diff --git a/ourapproach.tex b/ourapproach.tex index e411579..36fefc3 100644 --- a/ourapproach.tex +++ b/ourapproach.tex @@ -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 shor\-tly -present the selected encryption process.} +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 diff --git a/stc.tex b/stc.tex index 5e5b66e..03733f5 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 who is familar with syndrome coding can skip it.} +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$, @@ -66,7 +66,7 @@ The matrix $H$ should be changed to deal with higher payload. Moreover, for any given $H$, finding $y$ that solves $Hy=m$ and that minimizes $D_X(x,y)$, has an exponential complexity with respect to $n$. The Syndrome-Trellis Codes -presented by Filler \emph{et al.} in~\cite{FillerJF11} +presented by Filler \emph{et al.} \JFC{in~\cite{FillerJF11,liu2014syndrome}} is a practical solution to this complexity. Thanks to this contribution, the solving algorithm has a linear complexity with respect to $n$.