 |
      |
DataHiding Publications |
| * This research project has been completed. |
Capacity Analysis
Audio Watermarking
Video Watermarking
Other
|
| BiBTeX file, (Top), (DataHiding Home) |
 "Practical Capacity of Digital Watermark as Constrained by Reliability"Ryo Sugihara, "Practical Capacity of Digital Watermark as Constrained by Reliability", in Proc. of IEEE Intl. Conf. on Information Technology: Coding and Computing, pp.85-89, Las Vegas, USA, April 2001. The paper (PDF) and the presentation slides (PDF). IEEE - Copyright © 2001 by IEEE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee.Abstract: This paper presents a theoretic analysis of watermark capacity. First, a simplified watermark scheme is postulated. In the scheme, detection yields a multidimensional vector, in which each dimension is assumed to be i.i.d. (independent and identically distributed) and follow the Gaussian distribution. The major constraint on the capacity is detection reliability, which is one of the most important measures of the utility of watermarks. The problem is to figure out the maximum amount of information payload with the reliability requirement still satisfied. The reliability is represented by three kinds of error rates: the false positive error rate, the false negative error rate, and the bit error rate. These error rates are formulated under certain assumptions, and the theoretical capacity can be determined by setting the bounds on all of the error rates. Further, experiments were performed to verify the theoretic analysis, and it was shown that this approach yields a good estimate of the capacity of a watermark. |
| BiBTeX file, (Top), (DataHiding Home) |
|
"Practical Capacity of Digital Watermark" Ryo Sugihara, "Practical Capacity of Digital Watermark", in Proc. of 4th Intl. Information Hiding Workshop, pp. 316-329, Pittsburgh, USA, May 2001. The presentation slides (PDF). Abstract: A practical approach for evaluating the capacity of watermarks is presented. In real applications of watermarks, reliability is one of the most important metrics. The problem focused on in this paper is maximizing the number of embedded bits when there are some constraints on detection reliability. Error rates are formulated under some assumptions about the watermarking scheme, and the capacity can be determined by setting the bounds on each error rate. Experiments are performed to verify the theoretical predictions using a prototype watermarking system which conforms to the assumptions, and the resulting capacity agrees with the theory. Further, the theoretical effects of employing error-correcting codes are considered. It is shown that this approach yields the practical capacity of watermarks, as compared with channel capacity in communication theory. |
| BiBTeX file, (Top), (DataHiding Home) |
|
"Performance Analysis of Information Hiding" Shuichi Shimizu, "Performance Analysis of Information Hiding," in Proc. of Security and Watermarking of Multimedia Contents IV, SPIE vol. 4675, pp. 421-432, San Jose, USA, January 2002. The paper (PDF). SPIE Proceedings - Copyright 2002 Society of Photo-Optical Instrumentation Engineers. This paper was published in Proc. of SPIE Int. Conf. on Security and Watermarking of Multimedia Contents IV and is made available as an electronic reprint with permission of SPIE. Single print or electronic copies for personal use only are allowed. Systematic or multiple reproduction, distribution to multiple locations through an electronic listserver or other electronic means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are all prohibited. By choosing to view or print this document, you agree to all the provisions of the copyright law protecting it.Abstract: Information hiding in host data, or transparent digital watermarking, can be treated as an application of digital communications in which the hidden information is conveyed through a channel where the noise includes the host data and stems from other sources. The amount of information to be hidden is called the payload. At the detector, the hidden information (the watermark) should be retrieved with high confidence. We present a theoretical performance analysis of this information hiding problem in terms of payload, detection error rate, SNR, bandwidth of the watermarking channel, and channel coding for error correction. The detector is assumed to be a correlator, which is known to be optimal for Gaussian noise. However, our analysis does not require that the host data has a Gaussian distribution. Since our analysis does not depend on the synchronization between the watermark signal and the detector or on the maximum watermark power as constrained by preserving the fidelity, our result defines the theoretical performance limits. We present two decision rules designed to satisfy the given false alarm and code word error rate, based on energy detection and SNR estimation. We then apply two watermarking schemes, one with constant strength and the other with adaptive strength, in order to determine the watermarking design parameters by examining how the SNR is decreased against random and quantization noises. Keywords: Digital watermarking, information hiding, payload, detection error, estimation, quantization noise |
| BiBTeX file, (Top), (DataHiding Home) |
|
"An Audio Watermarking Method Robust against Time- and Frequency-Fluctuation" Ryuki Tachibana, Shuichi Shimizu, Seiji Kobayashi, and Taiga Nakamura "Au audio watermarking method robust against time- and frequency-fluctuation", in Proc. of Security and Watermarking of Multimedia Contents III, SPIE vol. 4314, pp. 104-115, San Jose, USA, January 2001. The paper (PDF) and the presentation slides (PDF). SPIE Proceedings - Copyright 2001 Society of Photo-Optical Instrumentation Engineers. This paper was published in Proc. of SPIE Int. Conf. on Security and Watermarking of Multimedia Contents III and is made available as an electronic reprint with permission of SPIE. Single print or electronic copies for personal use only are allowed. Systematic or multiple reproduction, distribution to multiple locations through an electronic listserver or other electronic means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are all prohibited. By choosing to view or print this document, you agree to all the provisions of the copyright law protecting it.Abstract : In this paper, we describe an audio watermarking algorithm that can embed a multiple-bit message which is robust against wow-and-flutter, cropping, noise-addition, pitch-shift, and audio compressions such as MP3. The embedding algorithm calculates and manipulates the magnitudes of segmented areas in the time-frequency plane of the content using short-term DFTs. The detection algorithm correlates the magnitudes with a pseudo-random array that corresponds to two-dimensional areas in the time-frequency plane. The two-dimensional array makes the watermark robust because, even when some portions of the content are heavily degraded, other portions of the content can match the pseudo-random array and contribute to watermark detection. Another key idea is manipulation of magnitudes. Because magnitudes are less influenced than phases by fluctuations of the analysis windows caused by random cropping, the watermark resists degradation. When signal transformation causes pitch fluctuations in the content, the frequencies of the pseudo-random array embedded in the content shift, and that causes a decrease in the volume of the watermark signal that still correctly overlaps with the corresponding pseudo-random array. To keep the overlapping area wide enough for successful watermark detection, the widths of the frequency subbands used for the detection segments should be increased as frequency increases. We theoretically and experimentally analyze the robustness of proposed algorithm against a variety of signal degradations. Keywords : Digital watermarking, audio watermarking, synchronization attack, geometric distortion |
| BiBTeX file, (Top) (DataHiding Home Page) |
 "Automatic Music Monitoring and Boundary Detection for Broadcast using
Audio Watermarking"Taiga Nakamura, Ryuki Tachibana, and Seiji Kobayashi, "Automatic Music Monitoring and Boundary Detection for Broadcast using Audio Watermarking," in Proc. of Security and Watermarking of Multimedia Contents IV, SPIE vol. 4675, pp. 170-180, San Jose, USA, January 2002. The paper (PDF) and the presentation slides (PDF). SPIE Proceedings - Copyright 2002 Society of Photo-Optical Instrumentation Engineers. This paper was published in Proc. of SPIE Int. Conf. on Security and Watermarking of Multimedia Contents IV and is made available as an electronic reprint with permission of SPIE. Single print or electronic copies for personal use only are allowed. Systematic or multiple reproduction, distribution to multiple locations through an electronic listserver or other electronic means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are all prohibited. By choosing to view or print this document, you agree to all the provisions of the copyright law protecting it.Abstract : An application of watermarking for automatic music monitoring of radio broadcasts is discussed. By embedding information into the music as a watermark before broadcasting it, it is possible to keep track of what music has been on the air at what time, and for how long. However, to effectively implement this application, the handling of content transitions is important, because the detection reliability deteriorates at the content boundaries. In this paper, a method of detecting content boundaries using overlapping detection windows is described. The most probable pattern of content transition is selected under the condition that detection results from multiple windows are available. The derived rules are represented using a finite state model, which is useful for detection in real time. Experimental results on FM radio broadcasts are also presented. Keywords : Digital watermarking, audio watermarking, broadcast monitoring |
| BiBTeX file, (Top) (DataHiding Home Page) |
 "Improving Audio Watermarking Robustness using Stretched Patterns
against Geometric Distortion"Ryuki Tachibana, "Improving audio watermarking robustness using stretched patterns against geometric distortion," in Advances in Multimedia Information Processing, Y.-C. Chen, L.-W. Chang, and C.-T. Hsu, eds., Lecture Notes in Computer Science (LNCS) 2532, Proc. of the 3rd IEEE Pacific-Rim Conference on Multimedia (PCM2002), pp. 647-654, Springer, Hsinchu, Taiwan, December 2002. The paper (PDF) and the presentation slides (PDF). IEEE - Copyright © 2002 by IEEE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee.Abstract : One of the problems for audio watermarks is robustness against signal processing causing de-synchronization of the pseudo-random sequences. To tackle the problem, we previously introduced an audio watermarking method using a two-dimensional pseudo-random array, which is robust against pitch shifting and random stretching to some extent. In this paper, we explain a modification to the detection algorithm to improve the robustness against excessive distortion. The method uses multiple pseudo-random arrays each of which is stretched assuming a certain amount of distortion. Since most of the detection process for the multiple arrays is shared, the additional computational cost is limited. Keywords : Audio watermarking, synchronization attack, geometric distortion |
| BiBTeX file, (Top) (DataHiding Home Page) |
 "Audio Watermarking for Live Performance" Ryuki Tachibana, "Audio Watermarking for Live Performance," in Proc. of Security and Watermarking of Multimedia Contents V, SPIE vol. 5020, pp. 32-43, Santa Clara, USA, January 2003. The paper (PDF) and the presentation slides (PDF) SPIE Proceedings - Copyright 2003 Society of Photo-Optical Instrumentation Engineers. This paper is published in Proc. of SPIE Int. Conf. on Security and Watermarking of Multimedia Contents V and is made available as an electronic reprint with permission of SPIE. Single print or electronic copies for personal use only are allowed. Systematic or multiple reproduction, distribution to multiple locations through an electronic listserver or other electronic means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are all prohibited. By choosing to view or print this document, you agree to all the provisions of the copyright law protecting it.Abstract : Audio watermarking has been used mainly for digitally stored content. Using real-time watermark embedding, its coverage can be extended to live broadcasts and live performances. In general, a conventional embedding algorithm receives a host signal (HS) and outputs the summation of the HS and a watermark signal (WS). However, when applied to real-time embedding, there are two problems: (1) delay of the HS, and (2) possible interruption of the broadcast. To solve these problems, we propose a watermark generation algorithm that outputs only a WS, and a system composition method in which a mixer outside the computer mixes the WS generated by the algorithm and the HS. In addition, we propose a new composition method hsonic watermarkingh. In this composition method, the sound of the HS and the sound of the WS are played separately by two speakers, and the sounds are mixed in the air. Using this composition method, it would be possible to generate a watermarking sound in a concerto hall so that the watermark could be detected from content recorded by audience members who have recording devices at their seats. We report on the results of experiments and discuss the merits and flaws of various real-time watermarking composition methods. Keywords : Audio watermarking, real-time embedding, sonic watermarking |
| BiBTeX file, (Top) (DataHiding Home Page) |
|
"Two-Dimensional Audio Watermark for MPEG AAC Audio" Ryuki Tachibana, "Two-Dimensional Audio Watermark for MPEG AAC Audio," in Proc. of Security, Steganography, and Watermarking of Multimedia Contents VI, SPIE vol. 5306, pp. 139-150, San Jose, USA, January 2004. The paper (PDF) and the presentation slides (PDF) SPIE Proceedings - Copyright 2004 Society of Photo-Optical Instrumentation Engineers. This paper is published in Proc. of SPIE Int. Conf. on Security, Steganography, and Watermarking of Multimedia Contents VI and is made available as an electronic reprint with permission of SPIE. Single print or electronic copies for personal use only are allowed. Systematic or multiple reproduction, distribution to multiple locations through an electronic listserver or other electronic means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are all prohibited. By choosing to view or print this document, you agree to all the provisions of the copyright law protecting it.Abstract : Since digital music is often stored in a compressed file, it is desirable that an audio watermarking method in a content management system handles compressed files. Using an audio watermarking method that directly manipulates compressed files makes it unnecessary to decompress the files before embedding or detection, so more files can be processed per unit time. However, it is difficult to detect a watermark in a compressed file that has been compressed after the file was watermarked. This paper proposes an MPEG Advanced Audio Coding (AAC) bitstream watermarking method using a two-dimensional pseudo-random array. Detection is done by correlating the absolute values of the recovered MDCT coefficients and the pseudo-random array. Since the embedding algorithm uses the same pseudo-random values for two adjacent overlapping frames and the detection algorithm selects the better frame in the two by comparing detected watermark strengths, it is possible to detect a watermark from a compressed file that was compressed after the watermark was embedded in the original uncompressed file. Though the watermark is not detected as clearly in this case, the watermark can still be detected even when the watermark was embedded in a compressed file and the file was then decompressed, trimmed, and compressed again. Keywords : Audio watermarking, MPEG, AAC, bitstream, compression |
| BiBTeX file, (Top) (DataHiding Home Page) |
|
"Sonic Watermarking" Ryuki Tachibana, "Sonic Watermarking," in EURASIP Journal on Applied Signal Processing, No. 13, pp. 1955-1964, October 2004. Available at Hindawi Publishing Corporation. Abstract : Audio watermarking has been used mainly for digitally stored content. In this paper, we extend the range of its applications to live performances by a new composition method for real-time audio watermarking named " Sonic Watermarking " . Sonic watermarking mixes the sound of the watermark signal and the sound of the host signal in the air to detect illegal music recordings recorded in concert halls, in the Internet. We propose an audio watermarking algorithm for sonic watermarking that increases the magnitudes of the host signal only in segmented areas pseudo-randomly chosen in the time-frequency plane. The results of a MUSHRA subjective listening test assesses the acoustic quality of the method in the range of " Excellent quality" . Robustness of the method is dependent on the type of music samples. For popular and orchestral music, watermark can be stably detected from music samples that have been sonic-watermarked and then compressed by MPEG 1 Layer 3. Keywords : Sonic watermarking, audio watermarking, real-time embedding, live performance, bootleg recording, copyright protection |
| BiBTeX file, (Top) (DataHiding Home Page) |
|
| Last modified 13 Oct 2004 |