From: Jean-François Couchot Date: Fri, 21 Dec 2012 13:49:43 +0000 (+0100) Subject: té X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/commitdiff_plain/24da70a2907152b45f175222de4962951669ac12?ds=inline té --- 24da70a2907152b45f175222de4962951669ac12 diff --cc biblio.bib index 8e5c9de,5680580..22bcda2 --- a/biblio.bib +++ b/biblio.bib @@@ -228,18 -255,18 +255,6 @@@ author = {Jessica J. Fridrich an year = 2001 } --@proceedings{DBLP:conf/ih/2001, -- editor = {Ira S. Moskowitz}, -- title = {Information Hiding, 4th International Workshop, IHW 2001, -- Pittsburgh, PA, USA, April 25-27, 2001, Proceedings}, -- booktitle = {Information Hiding}, -- publisher = {Springer}, -- series = {Lecture Notes in Computer Science}, -- volume = {2137}, -- year = {2001}, -- isbn = {3-540-42733-3}, -- bibsource = {DBLP, http://dblp.uni-trier.de} --} @inproceedings{DBLP:conf/ih/KimDR06, added-at = {2007-09-20T00:00:00.000+0200}, @@@ -260,7 -287,7 +275,7 @@@ series = {Lecture Notes in Computer Science}, timestamp = {2007-09-20T00:00:00.000+0200}, title = {Modified Matrix Encoding Technique for Minimal Distortion Steganography.}, -- url = {http://dblp.uni-trier.de/db/conf/ih/ih2006.html#KimDR06}, ++ url = {http://dblp.uni-trier.de/db/conf/ih/ih206.html#KimDR06}, volume = 4437, year = 2006 } diff --cc experiments.tex index 11af844,40cd93b..b952fae --- a/experiments.tex +++ b/experiments.tex @@@ -1,15 -1,41 +1,42 @@@ \subsection{Image Quality} The visual quality of the STABYLO scheme is evaluated in this section. - Three metrics are computed in these experiments : + Four metrics are computed in these experiments : the Peak Signal to Noise Ratio (PSNR), - the PSNR-HVS-M~\cite{PSECAL07,psnrhvsm11} and the BIQI~\cite{MB10,biqi11}. + the PSNR-HVS-M familly~\cite{PSECAL07,psnrhvsm11} , + the BIQI~\cite{MB10,biqi11} and + the weigthed PSNR (wPSNR)~\cite{DBLP:conf/ih/PereiraVMMP01}. The first one is widely used but does not take into account Human Visual System (HVS). - The two last ones have been designed to tackle this problem. + The other last ones have been designed to tackle this problem. + + \begin{table} + \begin{center} + \begin{tabular}{|c|c|c|} + \hline + Embedding rate & Adaptive + 10 \% & \\ + \hline + PSNR & & \\ + \hline + PSNR-HVS-M & 78.6 & 72.9 \\ + \hline + BIQI & 28.3 & 28.4 \\ + \hline + wPSNR & 86.43& 77.47 \\ + \hline + \end{tabular} + \end{center} + \caption{Quality measeures of our steganography approach\label{table:quality}} + \end{table} + + + Compare to the Edge Adpative scheme detailed in~\cite{Luo:2010:EAI:1824719.1824720}, our both wPSNR and PSNR values are always higher than their ones. + + \JFC{comparer aux autres approaches} + \subsection{Steganalysis} @@@ -30,4 -56,22 +57,21 @@@ can be a favourably executed thanks to - \JFC{Raphael, il faut donner des résultats ici} + \begin{table} + \begin{center} + \begin{tabular}{|c|c|c|c|} + Shemes & \multicolumn{2}{|c|}{STABYLO} & HUGO\\ + \hline + Embedding rate & Adaptive & 10 \% & 10 \%\\ + \hline + AUMP & 0.39 & 0.22 & 0.50 \\ + \hline + Ensemble Classifier & & & \\ + + \hline + \end{tabular} + \end{center} + \caption{Steganalysing STABYLO\label{table:steganalyse}} + \end{table} + + -\JFC{Raphael, il faut donner des résultats ici} diff --cc ourapproach.tex index 4dce984,4539cf1..f832695 --- a/ourapproach.tex +++ b/ourapproach.tex @@@ -63,6 -85,6 +85,27 @@@ modifies canny parameters to get a suff one is practically enlarged untill its size is at least twice as many larger than the size of embedded message. ++Edge Based Image Steganography schemes ++already studied~\cite{Luo:2010:EAI:1824719.1824720,DBLP:journals/eswa/ChenCL10,DBLP:conf/ih/PevnyFB10} differ ++how they select edge pixels, and ++how they modify these ones. ++ ++First of all, let us discuss about compexity of edge detetction methods. ++Let then $M$ and $N$ be the dimension of the original image. ++According to~\cite{Hu:2007:HPE:1282866.1282944}, ++even if the fuzzy logic based edge detection methods~\cite{Tyan1993} ++have promising results, its complexity is in $C_3 \times O(M \times N)$ ++whereas the complexity on the Canny method~\cite{Canny:1986:CAE:11274.11275} ++is in $C_1 \times O(M \times N)$ where $C_1 < C_3$. ++\JFC{Verifier ceci...} ++In experiments detailled in this article, the canny method has been retained ++but the whole approach can be updated to consider ++the fuzzy logic edge detector. ++ ++Next, following~\cite{Luo:2010:EAI:1824719.1824720}, our scheme automatically ++modifies canny 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 ++than the size of embedded message. \subsubsection{Security Considerations} @@@ -82,6 -104,6 +125,21 @@@ it would thus be not possible to retrie polynomial time. ++\subsubsection{Security Considerations} ++Among methods of message encryption/decryption ++(see~\cite{DBLP:journals/ejisec/FontaineG07} for a survey) ++we implement the Blum-Goldwasser cryptosystem~\cite{Blum:1985:EPP:19478.19501} ++which is based on the Blum Blum Shub~\cite{DBLP:conf/crypto/ShubBB82} Pseudo Random Number Generator (PRNG) ++for security reasons. ++It has been indeed proven~\cite{DBLP:conf/crypto/ShubBB82} that this PRNG ++has the cryptographically security property, \textit{i.e.}, ++for any sequence $L$ of output bits $x_i$, $x_{i+1}$, \ldots, $x_{i+L-1}$, ++there is no algorithm, whose time complexity is polynomial in $L$, and ++which allows to find $x_{i-1}$ and $x_{i+L}$ with a probability greater ++than $1/2$. ++Thus, even if the encrypted message would be extracted, ++it would thus be not possible to retrieve the original one in a ++polynomial time.