for the “Laarhoven score funct...7 Chapter 7Figure 7.1 Classification of data hiding methods, based on the work of Petitcola...Figure 7.2 Data hiding trade-offFigure 7.3 The Stanford Bunny in low-resolution, 1,889 vertices and 3,851 faces,...Figure 7.4 a) 3006 3D point cloud, and b) MST built on the point cloudFigure 7.5 The problem of sensitivity of EMSTsFigure 7.6 Structure at the i stage. The vertices and edges in red are already c...Figure 7.7 State of the sets at step i: vi the current vertexFigure 7.8 a) vi+1 is moved too close to the sub-path, and b) vi+1 is placed too...Figure 7.9 Embedding method of the algorithm of Cayre and Macq (2003), the bit “...Figure 7.10 Overview of a data hiding method in a point cloud in the spatial dom...Figure 7.11 Representation of a K-d-B-TreeFigure 7.12 Example of data hiding in a 3D Bunny object with ∆= 10−4: a) origina...
8 Chapter 8Figure 8.1 Illustration of the impact of steganography by LSBR and its detection...Figure 8.2 Illustration of probability distributions (empirical and theoretical)...Figure 8.3 Results of the application of the LRG test, equation [8.14]Figure 8.4. Illustration of the supervised learning principal, which aims to det...Figure 8.5 Illustration of the principle of extraction of RM characteristics (Sp...Figure 8.6 The Yedroudj-Net (Yedroudj et al. 2018b) network
Guide
1 Cover
7 Preface
10 Index
Pages
1 v
2 iii
3 iv
4 xi
5 xii
6 xiii
7 xiv
8 xv
9 xvi
10 xvii
11 1
12 2
13 3
14 4
15 5
16 6
17 7
18 8
19 9
20 10
21 11
22 12
23 13
24 14
25 15
26 16
27 17
28 18
29 19
30 20
31 21
32 22
33 23
34
