corrections christophes

[canny.git] / main.tex

diff --git a/main.tex b/main.tex
index 42afe92910905f6d285074f7cd294e90957458fa..c4bb7fc538bf378752d6948cd595c827c5faaaf0 100755 (executable)
--- a/main.tex
+++ b/main.tex
@@ -5,6 +5,8 @@
 \usepackage{subfig}
 \usepackage{color}
 \usepackage{mathtools,etoolbox}
 \usepackage{subfig}
 \usepackage{color}
 \usepackage{mathtools,etoolbox}

+\usepackage{cite}
+

 
 \tolerance=1
 \emergencystretch=\maxdimen
 
 \tolerance=1
 \emergencystretch=\maxdimen


@@ -80,15 +82,15 @@ edge-based steganographic approach}
 
 
 %IEEEtran, journal, \LaTeX, paper, template.
 
 
 %IEEEtran, journal, \LaTeX, paper, template.

-\keywords{Steganography, least-significant-bit (LSB)-based steganography, edge detection, Canny filter, security, syndrome treillis code}
+\keywords{Steganography, least-significant-bit (LSB)-based steganography, edge detection, Canny filter, security, syndrome trellis codes}

 
 
 
 
 \abstracttext{A novel steganographic method called STABYLO is introduced in 
 this research work.
 
 
 
 
 \abstracttext{A novel steganographic method called STABYLO is introduced in 
 this research work.

-Its main avantage for being is to be much lighter than the so-called
-Highly Undetectable steGO (HUGO) scheme, a well known state of the art
+Its main advantage is to be much lighter than the so-called
+Highly Undetectable steGO (HUGO) scheme, a well-known state of the art

 steganographic process in spatial domain.
 Additionally to this effectiveness, 
 quite comparable results through noise measures like PSNR-HVS-M, 
 steganographic process in spatial domain.
 Additionally to this effectiveness, 
 quite comparable results through noise measures like PSNR-HVS-M, 


@@ -123,15 +125,15 @@ a scheme that can reasonably face up-to-date steganalysers.}
 The STABYLO algorithm, whose acronym means STeganography 
 with cAnny, Bbs, binarY embedding at LOw cost, has been introduced 
 in this document as an efficient method having comparable, though
 The STABYLO algorithm, whose acronym means STeganography 
 with cAnny, Bbs, binarY embedding at LOw cost, has been introduced 
 in this document as an efficient method having comparable, though

-somewhat smaller, security than the well known
+somewhat smaller, security than the well-known

 Highly Undetectable steGO (HUGO) steganographic scheme.
 This edge-based steganographic approach embeds a Canny
 detection filter, the Blum-Blum-Shub cryptographically secure
 Highly Undetectable steGO (HUGO) steganographic scheme.
 This edge-based steganographic approach embeds a Canny
 detection filter, the Blum-Blum-Shub cryptographically secure

-pseudorandom number generator, together with Syndrome-Treillis Codes
+pseudorandom number generator, together with Syndrome-Trellis Codes

 for minimizing distortion.
 After having introduced with details the proposed method,
 we have evaluated it through noise measures (namely, the PSNR, PSNR-HVS-M, 
 for minimizing distortion.
 After having introduced with details the proposed method,
 we have evaluated it through noise measures (namely, the PSNR, PSNR-HVS-M, 

-BIQI, and weighted PSNR) and using well established steganalysers.
+BIQI, and weighted PSNR) and using well-established steganalysers.

 
 % Of course, other detectors like the fuzzy edge methods
 % deserve much further attention, which is why we intend 
 
 % Of course, other detectors like the fuzzy edge methods
 % deserve much further attention, which is why we intend 


@@ -147,7 +149,7 @@ be improved by replacing Canny with another edge filter.
 % to take into account the least significant bits too during all the
 % stages of the algorithm, hoping by doing so to be closer to the HUGO scores against 
 % steganalyzers. 
 % to take into account the least significant bits too during all the
 % stages of the algorithm, hoping by doing so to be closer to the HUGO scores against 
 % steganalyzers. 

-Other steganalyzers than the ones used in this document will be
+Other steganalysers than the ones used in this document will be

 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 
 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