2 This work considers digital images as covers and foundation is
3 spatial least significant-bit (LSB) replacement.
4 I this data hiding scheme a subset of all the LSB of the cover image is modified
5 with a secret bit stream depending on to a key, the cover, and the message to embed.
6 This well studied steganographic approach never decreases (resp. increases)
7 pixel with even value (resp. odd value) and may break structural symmetry.
8 These structural modification can be detected by statistical approaches
9 and thus by steganalysis methods~\cite{DBLP:journals/tsp/DumitrescuWW03,DBLP:conf/mmsec/FridrichGD01,Dumitrescu:2005:LSB:1073170.1073176}
11 This drawback is avoided in LSB matching (LSBM) where
12 the $+1$ or $-1$ is randomly added to the cover pixel LSB value
13 only if this one does not match the secret bit.
14 Since probabilities of increasing or decreasing pixel value are the same, statistical approaches
15 cannot be applied there to discover stego-images in LSBM.
16 The most accurate detectors for this matching are universal steganalysers such as~\cite{LHS08,DBLP:conf/ih/2005,FK12}
17 which classify images thanks to extracted features from neighboring elements of noise residual.
19 LSB matching revisited (LSBMR)~\cite{Mielikainen06} have been recently introduced.
20 This scheme deals with pairs of pixels instead of individual ones.
21 It thus allows to decrease the number of modified bits per cover pixel
22 for the same payload compared to LSB replacement and LSBM and
23 and avoids the LSB replacement style asymmetry. Unfortunately,
24 detectors referenced above are able to distinguish between
25 stego content images and cover images.
27 Instead of (efficiently) modifying LSBs, there is also a need to select pixels whose value
28 modification minimizes a distortion function.
29 This distortion may be computed thanks to feature vectors that are embedded for instance in steganalysers
31 Highly Undetectable steGO (HUGO) method~\cite{DBLP:conf/ih/PevnyFB10} is one of the most efficient instance of such a scheme.
32 It takes into account SPAM features (whose size is larger than $10^7$) to avoid overfitting a particular
33 steganalyser. Thus a distortion measure for each pixel is individually determined as the sum of differences between
34 features of SPAM computed from the cover and from the stego images.
35 Thanks to this feature set, HUGO allows to embed $7\times$ longer messages with the same level of
36 indetectability than LSB matching.
37 However, this improvement is time consuming, mainly due to the distortion function
40 There remains a large place between random selection of LSB and feature based modification of pixel values.
41 We argue that modifying edge pixels is an acceptable compromise.
42 Edges form the outline of an object: they are the boundary between overlapping objects or between an object
43 and the background. A small modification of pixel value in the stego image should not be harmful to the image quality:
44 in cover image, edge pixels already break its continuity and thus already contains large variation with neighbouring
45 pixels. In other words, minor changes in regular area is more dramatic than larger modifications in edge ones.
46 Our proposal is thus to embed message bits into edge shapes while preserving other smooth regions.
48 Edge based steganographic schemes have bee already studied~\cite{Luo:2010:EAI:1824719.1824720,DBLP:journals/eswa/ChenCL10}.
49 In the former, the authors show how to select sharper edge regions with respect
50 to embedding rate: the larger the number of bits to be embedded, the coarse the edge regions are.
51 Then the data hiding algorithm is achieved by applying LSBMR on pixels of this region.
52 The authors show that this method is more efficient than all the LSB, LSBM, LSBMR approaches
53 thanks to extensive experiments.
54 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}.
55 We thus propose to take benefit of these optimized embedding, provided it is not too time consuming.
56 Experiments have confirmed such a fact\JFC{Raphael....}.
59 \JFC{Christophe : énoncer la problématique du besoin de crypto et de ``cryptographiquement sûr'', les algo déjà cassés....
60 l'efficacité d'un encodage/décodage ...}
61 To deal with security issues, message is encrypted
63 In this paper, we thus propose to combine tried and tested techniques of signal theory (the adaptive edge detection), coding (the binary embedding), and cryptography
64 (the encrypt the message) to compute an efficient steganography scheme that is amenable to be executed on small devices.
66 The rest of the paper is organised as follows.
67 Section~\ref{sec:ourapproach} presents the details of our steganographic scheme.
68 Section~\ref{sec:experiments} shows experiments on image quality, steganalytic evaluation, complexity of our approach
69 and compare them to state of the art steganographic schemes.
70 Finally, concluding notes and future works are given in section~\ref{sec:concl}
