Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
---|---|---|---|---|---|
Searching... | 30000010026284 | QA76.575 W85 2003 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
The digital information revolution has brought about profound changes in our society and our life. New devices and powerful software have made it possible for consumers worldwide to create, manipulate, share, and enjoy the multimedia information. Internet and wireless networks offer ubiquitous channels to deliver and to exchange multimedia information for such pur poses as remote collaboration, distant learning, and entertainment. With all these advances in multimedia coding and communication technologies over the past decade, the major hurdle for allowing much broader access of multimedia assets and deployment of multimedia services no longer lies with bandwidth-related issues, but with how to make sure that content is used for its intended purpose by its intended recipients. The core issue then be comes the development of secure management of content usage and delivery across communication networks. Data hiding and digital watermarking are promising new technologies for multimedia information protection and rights management. Secondary data can be embedded imperceptibly in digital multimedia signals for a variety of applications, including ownership protection, authentication, access con trol, and annotation. Data hiding can also be used to send side information in multimedia communication for providing additional functionalities or for enhancing performance. The extraction of the embedded data mayor may not need knowledge of the original host media data. In addition to im perceptibility, robustness against moderate processing such as compression is also an important consideration.
Table of Contents
Preface | p. v |
1 Introduction | p. 1 |
1.1 Overview of Multimedia Data Hiding | p. 2 |
1.2 Book Organization | p. 6 |
1.2.1 Fundamental Issues and Solutions | p. 6 |
1.2.2 Algorithm and System Designs | p. 7 |
1.2.3 Attacks and Countermeasures | p. 10 |
I Fundamental Issues | p. 13 |
2 Preliminaries | p. 15 |
2.1 Data Hiding Framework | p. 15 |
2.2 Key Elements and A Layered View | p. 16 |
3 Basic Embedding Mechanisms | p. 19 |
3.1 Two Basic Embedding Mechanisms | p. 21 |
3.1.1 Probability of Detection Errors | p. 24 |
3.2 Embedding Capacity | p. 27 |
3.2.1 Capacity for Type-I Embedding | p. 28 |
3.2.2 Capacity of Type-II Embedding | p. 28 |
3.2.3 Capacity Comparison for Type-I & Type-II | p. 30 |
3.2.4 Extensions and Discussions | p. 32 |
3.3 Techniques for Embedding Multiple Bits | p. 34 |
3.3.1 Modulation and Multiplexing Techniques | p. 34 |
3.3.2 Comparison | p. 36 |
3.4 Chapter Summary | p. 39 |
3.5 Appendix - Derivations of Type-II Embedding Capacity | p. 40 |
4 Handling Uneven Embedding Capacity | p. 43 |
4.1 Quantitative Model for Uneven Embedding Capacity | p. 45 |
4.2 Constant Embedding Rate (CER) | p. 45 |
4.2.1 Backup Embedding | p. 47 |
4.2.2 Equalizing Embedding Capacity Via Shuffling | p. 48 |
4.2.3 Practical Considerations | p. 52 |
4.2.4 Discussions | p. 53 |
4.3 Variable Embedding Rate (VER) | p. 53 |
4.3.1 Conveying Additional Side Information | p. 54 |
4.4 Outline of Examples | p. 55 |
4.5 Chapter Summary | p. 55 |
4.6 Appendix - Generating Shuffling Table From A Key | p. 56 |
4.7 Appendix - Analysis of Shuffling | p. 57 |
4.7.1 Joint Probability of Histogram | p. 57 |
4.7.2 Mean and Variance of Each Bin | p. 58 |
4.7.3 More About E\left [ \frac{{m_r}}{{N}}\right] | p. 60 |
4.7.4 Approximations for Hypergeometric Distribution | p. 61 |
4.7.5 More About Var\left [ \frac{{m_r}}{{N}} \right] | p. 64 |
II Algorithm and System Designs | p. 65 |
5 Data Hiding in Binary Image | p. 67 |
5.1 Proposed Scheme | p. 69 |
5.1.1 Flippable Pixels | p. 69 |
5.1.2 Embedding Mechanism | p. 71 |
5.1.3 Uneven Embedding Capacity and Shuffling | p. 72 |
5.2 Applications and Experimental Results | p. 76 |
5.2.1 ""Signature in Signature"" | p. 76 |
5.2.2 Invisible Annotation for Line Drawings | p. 76 |
5.2.3 Tamper Detection for Binary Document | p. 77 |
5.3 Robustness and Security Considerations | p. 78 |
5.3.1 Analysis and Enhancement of Robustness | p. 79 |
5.3.2 Security Considerations | p. 82 |
5.4 Chapter Summary | p. 85 |
5.5 Appendix - Details of Determining Flippability Scores | p. 86 |
5.6 Appendix - Recovering Images After Printing & Scanning | p. 90 |
6 Multilevel Data Hiding for Image and Video | p. 95 |
6.1 Multi-level Embedding | p. 96 |
6.2 Multi-level Image Data Hiding | p. 98 |
6.2.1 Spectrum Partition | p. 99 |
6.2.2 System Design | p. 102 |
6.2.3 Refined Human Visual Model | p. 105 |
6.2.4 Experimental Results | p. 111 |
6.3 Multi-level Video Data Hiding | p. 111 |
6.3.1 Embedding Domain | p. 111 |
6.3.2 Variable vs. Constant Embedding Rate | p. 114 |
6.3.3 User Data vs. Control Data | p. 116 |
6.3.4 System Design and Experimental Results | p. 117 |
6.4 Chapter Summary | p. 119 |
7 Data Hiding for Image Authentication | p. 123 |
7.1 Review of Prior Art | p. 125 |
7.2 Framework for Authentication Watermark | p. 126 |
7.3 Transform-domain Table Lookup Embedding | p. 127 |
7.3.1 Considerations for Imperceptibility & Security | p. 129 |
7.3.2 Estimating Embedded Data and Changes | p. 132 |
7.4 Design of Embedded Data | p. 133 |
7.4.1 Visually Meaningful Pattern | p. 133 |
7.4.2 Content-based Features | p. 133 |
7.5 Experimental Results | p. 135 |
7.6 Extensions | p. 138 |
7.7 Chapter Summary | p. 140 |
8 Data Hiding for Video Communications | p. 141 |
8.1 Transcoding by Downsizing Using Data Hiding | p. 142 |
8.1.1 Overview of Proposed Approach | p. 142 |
8.1.2 Embedding Subblock Motion Information | p. 143 |
8.1.3 Advantages of Data Hiding | p. 144 |
8.1.4 Experimental Results | p. 145 |
8.2 Error Concealment and Data Hiding | p. 147 |
8.2.1 Related Works | p. 147 |
8.2.2 Proposed Techniques | p. 149 |
8.3 Chapter Summary | p. 150 |
III Attacks and Countermeasures | p. 151 |
9 Attacks on Known Data Hiding Algorithms | p. 153 |
9.1 Block Replacement Attack on Robust Watermark | p. 154 |
9.1.1 Existing Attacks on Robust Watermarks | p. 155 |
9.1.2 Attack via Block Replacement | p. 155 |
9.1.3 Analysis and Countermeasures | p. 157 |
9.2 Countermeasures Against Geometric Attacks | p. 159 |
9.2.1 Basic Idea of RST Resilient Watermarking | p. 161 |
9.2.2 Embedding and Detection Algorithms | p. 162 |
9.2.3 Implementation Issues | p. 164 |
9.2.4 Experimental Results | p. 168 |
9.2.5 Summary | p. 172 |
9.3 Double Capturing Attack on Authentication Watermark | p. 175 |
9.3.1 Proposed Attack | p. 175 |
9.3.2 Countermeasures Against Proposed Attack | p. 176 |
10 Attacks on Unknown Data Hiding Algorithms | p. 179 |
10.1 Introduction | p. 179 |
10.1.1 SDMI Attack Setup | p. 180 |
10.1.2 Comments on Attack Setup | p. 181 |
10.2 Attacks and Analysis on SDMI Robust Watermarks | p. 183 |
10.2.1 General Approaches to Attacks | p. 183 |
10.2.2 Attacks on Watermark-C | p. 184 |
10.2.3 Attacks on Watermark A, B & F | p. 188 |
10.2.4 Remarks | p. 191 |
10.3 Attacks and Analysis on SDMI Fragile Watermarks | p. 192 |
11 Conclusions and Perspectives | p. 195 |
References | p. 197 |
Index | p. 215 |