| Preface | p. xiii |
| Introduction | |
| What Is Data Hiding? | p. 1 |
| Forms of Data Hiding | p. 2 |
| Relative Importance of Cover Signals | p. 3 |
| Nature of Content | p. 4 |
| Oblivious and Nonoblivious | p. 4 |
| Synchronous and Asynchronous | p. 4 |
| Active and Passive Wardens | p. 5 |
| Properties of Steganographic Communications | p. 5 |
| Multimedia Data Hiding | p. 6 |
| The Steganographic Channel | p. 8 |
| Frameworks for Data Hiding | |
| Signal Processing Framework | p. 14 |
| Data Hiding from a Communications Perspective | p. 15 |
| Relationship Between Communications and Signal Processing Frameworks | p. 17 |
| A Review of Data Hiding Methods | p. 20 |
| Communication with Side Information and Data Hiding | |
| Costa's Framework | p. 27 |
| A Framework Based on Channel Adaptive Encoding and Channel Independent Decoding | p. 30 |
| Highlights of the CAE-CID Framework | p. 34 |
| On the Duality of Communications and Data Hiding Frameworks | p. 35 |
| Codebook Generation for Data Hiding Methods | p. 40 |
| Type I (Linear) Data Hiding | |
| Linear Data Hiding in Transform Domain | p. 50 |
| Problem Statement | p. 51 |
| Capacity of Additive Noise Channels | p. 52 |
| Modeling Channel Noise | p. 58 |
| Modeling Image Noise | p. 59 |
| Modeling Processing Noise | p. 59 |
| Visual Threshold | p. 61 |
| Channel Capacity vs. Choice of Transform | p. 63 |
| Some Capacity Results and Discussions | p. 66 |
| The Ideal Decomposition | p. 74 |
| Factors Influencing Choice of Transform | p. 76 |
| Type II and Type III (Nonlinear) Data Hiding Methods | |
| Type II Embedding and Detection | p. 79 |
| Type III Embedding and Detection Methods | p. 83 |
| Postprocessing Types | p. 85 |
| Vectoral Embedding and Detection | p. 86 |
| Scalar Embedding and Detection | p. 87 |
| Forms of Demodulation | p. 87 |
| Minimum Distance Decoding | p. 88 |
| Maximum Correlation Rule | p. 90 |
| Optimization Criteria for Embedding and Detection Parameters | p. 91 |
| Optimization of Parameters for Vectoral Embedding and Detection | p. 91 |
| Optimization of Parameters for Scalar Embedding and Detection | p. 92 |
| Maximizing Correlation | p. 95 |
| Minimizing Probability of Error | p. 96 |
| Maximizing Mutual Information | p. 98 |
| Performance Comparisons | p. 98 |
| Advanced Implementations | |
| Spread Transforming | p. 108 |
| Multiple Codebook Data Hiding | p. 113 |
| A Channel Model for Multiple Codebook Data Hiding | p. 119 |
| Single Codebook Data Hiding Based on the Maximum Correlation Criterion | p. 125 |
| Distribution of [rho subscript ind] | p. 127 |
| Distribution of [rho subscript dep] | p. 128 |
| Multiple Codebook Data Hiding Using the Maximum Correlation Criterion | p. 130 |
| Distribution of [rho superscript i subscript m,j] | p. 132 |
| Distribution of [rho subscript max] | p. 133 |
| Single Codebook Hiding Using the Minimum Distance Criterion | p. 134 |
| Distribution of d[subscript ind] | p. 135 |
| Distribution of d[subscript dep] | p. 136 |
| Multiple Codebook Hiding Using the Minimum Distance Criterion | p. 137 |
| Distribution of d[superscript i subscript m,j] | p. 139 |
| Distribution of d[subscript min] | p. 139 |
| Comparisons | p. 139 |
| Implementation and Simulation Results | p. 147 |
| Major Design Issues | |
| DFT-Based Signaling | p. 154 |
| Conventional Signaling | p. 154 |
| FFT-Based Signaling | p. 155 |
| Cyclic All-Pass Sequences | p. 155 |
| Signal Constellation | p. 157 |
| Redundant Signaling | p. 158 |
| Synchronization | p. 160 |
| Autocorrelation for Restoring the Cropped Signal | p. 162 |
| Practical Concerns | p. 165 |
| Watermark Signal Design | p. 165 |
| Cyclic Autocorrelation | p. 165 |
| Synchronization | p. 167 |
| Results | p. 167 |
| Perceptual Constraints | p. 170 |
| Attacks on Data Hiding Systems | p. 172 |
| Removal Attacks | p. 173 |
| Blind Attacks | p. 173 |
| Estimation Attacks | p. 174 |
| Desynchronization Attacks | p. 175 |
| Geometric Attacks | p. 175 |
| Mosaic Attack | p. 175 |
| Template and Periodicity Removal | p. 175 |
| Security/Cryptographic Attacks | p. 176 |
| Protocol Attacks | p. 176 |
| Invertible Watermarks | p. 176 |
| Copy Attack | p. 176 |
| Future Direction in Attack Design | p. 176 |
| Data Hiding Applications | |
| Design of Data Hiding Methods Robust to Lossy Compression | p. 179 |
| Data Hiding for Secure Multimedia Delivery | p. 180 |
| Compression and Data Hiding | p. 182 |
| Data Hiding with Known Compression | p. 183 |
| Simultaneous Robustness to Multiple Compression Techniques | p. 185 |
| Robustness to Unknown Compression Methods | p. 187 |
| Utilizing the "Hole" in Compression Techniques | p. 187 |
| The Data Hiding Scheme | p. 191 |
| Type III Hiding for Lossy Compression | p. 194 |
| Joint Embedding and Compression | p. 195 |
| Results for JPEG Compression | p. 197 |
| Watermarking for Ownership | p. 199 |
| Counterfeit Attacks on Watermarks | p. 201 |
| Freedom in Choosing | p. 202 |
| Detection Statistic | p. 203 |
| Fake Originals | p. 205 |
| Multiple Watermarks | p. 205 |
| Watermarking Algorithms | p. 206 |
| Overcoming Attacks on Watermarks | p. 207 |
| Restrictions on Choice of Signature | p. 209 |
| Attacking Scheme III (Craver's Protocol) | p. 210 |
| Quasi-Oblivious Watermarking | p. 211 |
| Detection Statistic for Quasi-Oblivious Watermarking | p. 213 |
| Suggested Protocol | p. 214 |
| An Example of a Watermarking Scheme | p. 216 |
| CAE-CID Framework under Varying Channel Noise | p. 221 |
| Statistics of [rho subscript dep vertical bar]P and d[subscript dep vertical bar]P | p. 223 |
| Mathematical Proofs | |
| Proof of Eq. (7.7) | p. 229 |
| Proof of Eq. (7.10) | p. 230 |
| Bibliography | p. 231 |
| Index | p. 239 |
| Table of Contents provided by Ingram. All Rights Reserved. |