Multimedia watermarking techniques
01 Jul 1999-Vol. 87, Iss: 7, pp 1079-1107
TL;DR: The basic concepts of watermarking systems are outlined and illustrated with proposed water marking methods for images, video, audio, text documents, and other media.
Abstract: Multimedia watermarking technology has evolved very quickly during the last few years. A digital watermark is information that is imperceptibly and robustly embedded in the host data such that it cannot be removed. A watermark typically contains information about the origin, status, or recipient of the host data. In this tutorial paper, the requirements and applications for watermarking are reviewed. Applications include copyright protection, data monitoring, and data tracking. The basic concepts of watermarking systems are outlined and illustrated with proposed watermarking methods for images, video, audio, text documents, and other media. Robustness and security aspects are discussed in detail. Finally, a few remarks are made about the state of the art and possible future developments in watermarking technology.
Citations
More filters
25 Jun 2000
TL;DR: It is shown that QIM is "provably good" against arbitrary bounded and fully informed attacks, and achieves provably better rate distortion-robustness tradeoffs than currently popular spread-spectrum and low-bit(s) modulation methods.
Abstract: We consider the problem of embedding one signal (e.g., a digital watermark), within another "host" signal to form a third, "composite" signal. The embedding is designed to achieve efficient tradeoffs among the three conflicting goals of maximizing the information-embedding rate, minimizing the distortion between the host signal and composite signal, and maximizing the robustness of the embedding. We introduce new classes of embedding methods, termed quantization index modulation (QIM) and distortion-compensated QIM (DC-QIM), and develop convenient realizations in the form of what we refer to as dither modulation. Using deterministic models to evaluate digital watermarking methods, we show that QIM is "provably good" against arbitrary bounded and fully informed attacks, which arise in several copyright applications, and in particular it achieves provably better rate distortion-robustness tradeoffs than currently popular spread-spectrum and low-bit(s) modulation methods. Furthermore, we show that for some important classes of probabilistic models, DC-QIM is optimal (capacity-achieving) and regular QIM is near-optimal. These include both additive white Gaussian noise (AWGN) channels, which may be good models for hybrid transmission applications such as digital audio broadcasting, and mean-square-error-constrained attack channels that model private-key watermarking applications.
2,218 citations
Additional excerpts
...An extremely large number of embedding methods have been proposed in the literature [22], [23], [1]....
[...]
01 Apr 1997
TL;DR: The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity.
Abstract: The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity. Topics covered includes an introduction to the concepts in cryptography, attacks against cryptographic systems, key use and handling, random bit generation, encryption modes, and message authentication codes. Recommendations on algorithms and further reading is given in the end of the paper. This paper should make the reader able to build, understand and evaluate system descriptions and designs based on the cryptographic components described in the paper.
2,188 citations
Book•
23 Nov 2007
TL;DR: This new edition now contains essential information on steganalysis and steganography, and digital watermark embedding is given a complete update with new processes and applications.
Abstract: Digital audio, video, images, and documents are flying through cyberspace to their respective owners. Unfortunately, along the way, individuals may choose to intervene and take this content for themselves. Digital watermarking and steganography technology greatly reduces the instances of this by limiting or eliminating the ability of third parties to decipher the content that he has taken. The many techiniques of digital watermarking (embedding a code) and steganography (hiding information) continue to evolve as applications that necessitate them do the same. The authors of this second edition provide an update on the framework for applying these techniques that they provided researchers and professionals in the first well-received edition. Steganography and steganalysis (the art of detecting hidden information) have been added to a robust treatment of digital watermarking, as many in each field research and deal with the other. New material includes watermarking with side information, QIM, and dirty-paper codes. The revision and inclusion of new material by these influential authors has created a must-own book for anyone in this profession.
*This new edition now contains essential information on steganalysis and steganography
*New concepts and new applications including QIM introduced
*Digital watermark embedding is given a complete update with new processes and applications
1,773 citations
TL;DR: A new and efficient steganographic method for embedding secret messages into a gray-valued cover image that provides an easy way to produce a more imperceptible result than those yielded by simple least-significant-bit replacement methods.
1,078 citations
Cites background from "Multimedia watermarking techniques"
...Another way of data hiding is image watermarking (Swanson et al., 1998; Hartung and Kutter, 1999; Voyatzis and Pitas, 1999; Wolfgang et al., 1999; Cox et al., 2001) which is a novel way for embedding watermark information in host images....
[...]
TL;DR: In this paper, a generalization of the well-known least significant bit (LSB) modification is proposed as the data-embedding method, which introduces additional operating points on the capacity-distortion curve.
Abstract: We present a novel lossless (reversible) data-embedding technique, which enables the exact recovery of the original host signal upon extraction of the embedded information. A generalization of the well-known least significant bit (LSB) modification is proposed as the data-embedding method, which introduces additional operating points on the capacity-distortion curve. Lossless recovery of the original is achieved by compressing portions of the signal that are susceptible to embedding distortion and transmitting these compressed descriptions as a part of the embedded payload. A prediction-based conditional entropy coder which utilizes unaltered portions of the host signal as side-information improves the compression efficiency and, thus, the lossless data-embedding capacity.
1,058 citations
References
More filters
Book•
01 Jan 1965
TL;DR: This chapter discusses the concept of a Random Variable, the meaning of Probability, and the axioms of probability in terms of Markov Chains and Queueing Theory.
Abstract: Part 1 Probability and Random Variables 1 The Meaning of Probability 2 The Axioms of Probability 3 Repeated Trials 4 The Concept of a Random Variable 5 Functions of One Random Variable 6 Two Random Variables 7 Sequences of Random Variables 8 Statistics Part 2 Stochastic Processes 9 General Concepts 10 Random Walk and Other Applications 11 Spectral Representation 12 Spectral Estimation 13 Mean Square Estimation 14 Entropy 15 Markov Chains 16 Markov Processes and Queueing Theory
13,886 citations
6,899 citations
"Multimedia watermarking techniques" refers methods in this paper
..., The watermarked image is then given by the union of and To verify the presence of a watermark, hypothesis testing [97] is applied....
[...]
Book•
01 Jan 1979
TL;DR: An electromagnetic pulse counter having successively operable, contact-operating armatures that are movable to a rest position, an intermediate position and an active position between the main pole and the secondary pole of a magnetic circuit.
Abstract: An electromagnetic pulse counter having successively operable, contact-operating armatures. The armatures are movable to a rest position, an intermediate position and an active position between the main pole and the secondary pole of a magnetic circuit.
4,897 citations
TL;DR: This work explores both traditional and novel techniques for addressing the data-hiding process and evaluates these techniques in light of three applications: copyright protection, tamper-proofing, and augmentation data embedding.
Abstract: Data hiding, a form of steganography, embeds data into digital media for the purpose of identification, annotation, and copyright. Several constraints affect this process: the quantity of data to be hidden, the need for invariance of these data under conditions where a "host" signal is subject to distortions, e.g., lossy compression, and the degree to which the data must be immune to interception, modification, or removal by a third party. We explore both traditional and novel techniques for addressing the data-hiding process and evaluate these techniques in light of three applications: copyright protection, tamper-proofing, and augmentation data embedding.
3,037 citations
"Multimedia watermarking techniques" refers methods in this paper
...[6] propose two methods for data hiding....
[...]
...[6] propose several techniques for watermarking which are applicable to audio....
[...]
Book•
01 Jan 1995TL;DR: Generating Pseudorandom Signals (Pseudonoise) from PseudOrandom Sequences by Modulation and Demodulation of Spread Spectrum Signals in Multipath and Multiple Access Interference.
Abstract: 1. Introduction. Definition and Purpose. Basic Limitations of the Conventional Approach. Spread Spectrum Principles. Organization of the Book. 2. Random and Pseudorandom Signal Generation. Purpose. Pseudorandom Sequences. Maximal Length Linear Shift Register Sequences. Randomness Properties of MLSR Sequences. Conclusion. Generating Pseudorandom Signals (Pseudonoise) from Pseudorandom Sequences. First- and Second-Order Statistics of Demodulator Output in Multiple Access Interference. Statistics for QPSK Modulation by Pseudorandom Sequences. Examples. Bound for Bandlimited Spectrum. Error Probability for BPSK or QPSK with Constant Signals in Additive Gaussian Noise and Interference. Appendix 2A: Optimum Receiver Filter for Bandlimited Spectrum. 3. Synchronization of Pseudorandom Signals. Purpose. Acquisition of Pseudorandom Signal Timing. Hypothesis Testing for BPSK Spreading. Hypothesis Testing for QPSK Spreading. Effect of Frequency Error. Additional Degradation When N is Much Less Than One Period. Detection and False Alarm Probabilities. Fixed Signals in Gaussian Noise (L=1). Fixed Signals in Gaussian Noise with Postdetection Integration (L>1). Rayleigh Fading Signals (L>/=1). The Search Procedure and Acquisition Time. Single-Pass Serial Search (Simplified). Single-Pass Serial Search (Complete). Multiple Dwell Serial Search. Time Tracking of Pseudorandom Signals. Early-Late Gate Measurement Statistics. Time Tracking Loop. Carrier Synchronization. Appendix 3A: Likelihood Functions and Probability Expressions. Bayes and Neyman-Pearson Hypothesis Testing. Coherent Reception in Additive White Gaussian Noise. Noncoherent Reception in AWGN for Unfaded Signals. Noncoherent Reception of Multiple Independent Observations of Unfaded Signals in AWGN. Noncoherent Reception of Rayleigh-Faded Signals in AWGN. 4. Modulation and Demodulation of Spread Spectrum Signals in Multipath and Multiple Access Interference. Purpose. Chernoff and Battacharyya Bounds. Bounds for Gaussian Noise Channel. Chernoff Bound for Time-Synchronous Multiple Access Interference with BPSK Spreading. Chernoff Bound for Time-Synchronous Multiple Access Interference with QPSK Spreading. Improving the Chernoff Bound by a Factor of 2. Multipath Propagation: Signal Structure and Exploitation. Pilot-Aided Coherent Multipath Demodulation. Chernoff Bounds on Error Probability for Coherent Demodulation with Known Path Parameters. Rayleigh and Rician Fading Multipath Components. Noncoherent Reception. Quasi-optimum Noncoherent Multipath Reception for M-ary Orthogonal Modulation. Performance Bounds. Search Performance for Noncoherent Orthogonal M-ary Demodulators. Power Measurement and Control for Noncoherent Orthogonal M-ary Demodulators. Power Control Loop Performance. Power Control Implications. Appendix 4A: Chernoff Bound with Imperfect Parameter Estimates. 5. Coding and Interleaving. Purpose. Interleaving to Achieve Diversity. Forward Error Control Coding - Another Means to Exploit Redundancy. Convolutional Code Structure. Maximum Likelihood Decoder - Viterbi Algorithm. Generalization of the Preceding Example. Convolutional Code Performance Evaluation. Error Probability for Tailed-off Block. Bit Error Probability. Generalizations of Error Probability Computation. Catastrophic Codes. Generalization to Arbitrary Memoryless Channels - Coherent and Noncoherent. Error Bounds for Binary-Input, Output-Symmetric Channels with Integer Metrics. A Near-Optimal Class of Codes for Coherent Spread Spectrum Multiple Access. Implementation. Decoder Implementation. Generating Function and Performance. Performance Comparison and Applicability. Orthogonal Convolutional Codes for Noncoherent Demodulation of Rayleigh Fading Signals. Implementation. Performance for L-Path Rayleigh Fading. Conclusions and Caveats. Appendix 5A: Improved Bounds for Symmetric Memoryless Channels and the AWGN Channel. Appendix 5B: Upper Bound on Free Distance of Rate 1/n Convolutional Codes. 6. Capacity, Coverage, and Control of Spread Spectrum Multiple Access Networks. General. Reverse Link Power Control. Multiple Cell Pilot Tracking and Soft Handoff. Other-Cell Interference. Propagation Model. Single-Cell Reception - Hard Handoff. Soft Handoff Reception by the Better of the Two Nearest Cells. Soft Handoff Reception by the Best of Multiple Cells. Cell Coverage Issues with Hard and Soft Handoff. Hard Handoff. Soft Handoff. Erlang Capacity of Reverse Links. Erlang Capacity for Conventional Assigned-Slot Multiple Access. Spread Spectrum Multiple Access Outage - Single Cell and Perfect Power Control. Outage with Multiple-Cell Interference. Outage with Imperfect Power Control. An Approximate Explicit Formula for Capacity with Imperfect Power Control. Designing for Minimum Transmitted Power. Capacity Requirements for Initial Accesses. Erlang Capacity of Forward Links. Forward Link Power Allocation. Soft Handoff Impact on Forward Link. Orthogonal Signals for Same-Cell Users. Interference Reduction with Multisectored and Distributed Antennas. Interference Cancellation. Epilogue. References and Bibliography. Index.
2,795 citations
"Multimedia watermarking techniques" refers background in this paper
...It was soon recognized that digital watermarking and digital modulation, and especially direct sequence spreadspectrum modulation [40], [102], [119], [140], share similar concepts, and it was proposed to consider digital watermarking as communication in non-Gaussian noise....
[...]