CA2184949C - Secure spread spectrum watermarking for multimedia data - Google Patents
Secure spread spectrum watermarking for multimedia data Download PDFInfo
- Publication number
- CA2184949C CA2184949C CA002184949A CA2184949A CA2184949C CA 2184949 C CA2184949 C CA 2184949C CA 002184949 A CA002184949 A CA 002184949A CA 2184949 A CA2184949 A CA 2184949A CA 2184949 C CA2184949 C CA 2184949C
- Authority
- CA
- Canada
- Prior art keywords
- data
- watermark
- set forth
- values
- watermarked
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04H—BROADCAST COMMUNICATION
- H04H20/00—Arrangements for broadcast or for distribution combined with broadcast
- H04H20/28—Arrangements for simultaneous broadcast of plural pieces of information
- H04H20/30—Arrangements for simultaneous broadcast of plural pieces of information by a single channel
- H04H20/31—Arrangements for simultaneous broadcast of plural pieces of information by a single channel using in-band signals, e.g. subsonic or cue signal
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T1/00—General purpose image data processing
- G06T1/0021—Image watermarking
- G06T1/0028—Adaptive watermarking, e.g. Human Visual System [HVS]-based watermarking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T1/00—General purpose image data processing
- G06T1/0021—Image watermarking
- G06T1/005—Robust watermarking, e.g. average attack or collusion attack resistant
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
- H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
- H04N1/32154—Transform domain methods
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
- H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
- H04N1/32154—Transform domain methods
- H04N1/3216—Transform domain methods using Fourier transforms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
- H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
- H04N1/32154—Transform domain methods
- H04N1/32165—Transform domain methods using cosine transforms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
- H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
- H04N1/32154—Transform domain methods
- H04N1/3217—Transform domain methods using wavelet transforms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
- H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
- H04N1/32154—Transform domain methods
- H04N1/32187—Transform domain methods with selective or adaptive application of the additional information, e.g. in selected frequency coefficients
- H04N1/32197—Transform domain methods with selective or adaptive application of the additional information, e.g. in selected frequency coefficients according to the spatial domain characteristics of the transform domain components
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
- H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
- H04N1/3232—Robust embedding or watermarking
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/238—Interfacing the downstream path of the transmission network, e.g. adapting the transmission rate of a video stream to network bandwidth; Processing of multiplex streams
- H04N21/2389—Multiplex stream processing, e.g. multiplex stream encrypting
- H04N21/23892—Multiplex stream processing, e.g. multiplex stream encrypting involving embedding information at multiplex stream level, e.g. embedding a watermark at packet level
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/80—Generation or processing of content or additional data by content creator independently of the distribution process; Content per se
- H04N21/83—Generation or processing of protective or descriptive data associated with content; Content structuring
- H04N21/835—Generation of protective data, e.g. certificates
- H04N21/8358—Generation of protective data, e.g. certificates involving watermark
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N7/00—Television systems
- H04N7/08—Systems for the simultaneous or sequential transmission of more than one television signal, e.g. additional information signals, the signals occupying wholly or partially the same frequency band, e.g. by time division
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N7/00—Television systems
- H04N7/24—Systems for the transmission of television signals using pulse code modulation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N7/00—Television systems
- H04N7/24—Systems for the transmission of television signals using pulse code modulation
- H04N7/52—Systems for transmission of a pulse code modulated video signal with one or more other pulse code modulated signals, e.g. an audio signal or a synchronizing signal
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2201/00—General purpose image data processing
- G06T2201/005—Image watermarking
- G06T2201/0052—Embedding of the watermark in the frequency domain
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2201/00—General purpose image data processing
- G06T2201/005—Image watermarking
- G06T2201/0063—Image watermarking in relation to collusion attacks, e.g. collusion attack resistant
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2201/00—General purpose image data processing
- G06T2201/005—Image watermarking
- G06T2201/0065—Extraction of an embedded watermark; Reliable detection
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2201/00—General purpose image data processing
- G06T2201/005—Image watermarking
- G06T2201/0202—Image watermarking whereby the quality of watermarked images is measured; Measuring quality or performance of watermarking methods; Balancing between quality and robustness
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/00086—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy
- G11B20/00884—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy involving a watermark, i.e. a barely perceptible transformation of the original data which can nevertheless be recognised by an algorithm
- G11B20/00891—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy involving a watermark, i.e. a barely perceptible transformation of the original data which can nevertheless be recognised by an algorithm embedded in audio data
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/00086—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy
- G11B20/00884—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy involving a watermark, i.e. a barely perceptible transformation of the original data which can nevertheless be recognised by an algorithm
- G11B20/00913—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy involving a watermark, i.e. a barely perceptible transformation of the original data which can nevertheless be recognised by an algorithm based on a spread spectrum technique
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
- H04N19/39—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability involving multiple description coding [MDC], i.e. with separate layers being structured as independently decodable descriptions of input picture data
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
- H04N2201/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N2201/3201—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N2201/3225—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of data relating to an image, a page or a document
- H04N2201/3233—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of data relating to an image, a page or a document of authentication information, e.g. digital signature, watermark
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
- H04N2201/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N2201/3201—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N2201/3269—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of machine readable codes or marks, e.g. bar codes or glyphs
- H04N2201/327—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of machine readable codes or marks, e.g. bar codes or glyphs which are undetectable to the naked eye, e.g. embedded codes
Abstract
Digital watermarking of audio, image, video or multimedia data is achieved by inserting the watermark into the perceptually significant components of a decomposition of the data in a manner so as to be visually imperceptible. In a preferred method, a frequency spectral image of the data, preferably a Fourier transform of the data, is obtained. A watermark is inserted into perceptually significant components of the frequency spectral image. The resultant watermarked spectral image is subjected to an inverse transform to produce watermarked data. The watermark is extracted from watermarked data by first comparing the watermarked data with the original data to obtain an extracted watermark. Then, the original watermark, original data and the extracted watermark are compared to generate a watermark which is analyzed for authenticity of the watermark.
Description
,~
Secure Spread Spectrum Watermarking for Multimedia Data Field of the Invention The present invention concerns a method of digital watermarking for use in audio, image, video and multimedia data for the purpose of authenticating copyright ownership, identifying copyright infringers or transmitting a hidden message.
Specifically, a watermark is inserted into the perceptually most significant components of a decomposition of the data in a manner so as to be virtually imperceptible.
More specifically, a narrow band signal representing the watermark is placed in a wideband channel that is the data.
Background of the Invention The proliferation of digitized media such as audio, image and video is creating a need for a security system which facilitates the identification of the source of the material. The need manifests itself in terms of copyright enforcement and identification of the source of the material.
Using conventional cryptographic systems permits only valid keyholder access to encrypted data, but once the data is encrypted, it is not possible to maintain records of its subsequent representation or transmission. Conventional cryptography therefore provides minimal protection against data piracy of the type a publisher or owner of data or material is confronted with by unauthorized reproduction or distribution of such data.
or material.
A digital watermark is intended to complement cryptographic processes. The watermark is a visible or preferably an invisible identification code that is permanently embedded in the data. That is, the watermark remains with the data after any decryption process. As used herein the terms data and material will be understood to refer to audio (speech and music), images (photographs and graphics), video (movies or sequences of images) and ,,...
multimedia data (combinations of the above categories of materials) or processed or compressed versions thereof. These terms are not intended to refer to ASCII
representations of text, but do refer to text represented as an image. A
simple example of a watermark is a visible "seal" placed over an image to identify the copyright owner.
However, the watermark might also contain additional information, including the identity of the purchaser of the particular copy of the image. An effective watermark should possess the following properties:
1. The watermark should be perceptually invisible or its presence should not interfere with the material being protected.
Secure Spread Spectrum Watermarking for Multimedia Data Field of the Invention The present invention concerns a method of digital watermarking for use in audio, image, video and multimedia data for the purpose of authenticating copyright ownership, identifying copyright infringers or transmitting a hidden message.
Specifically, a watermark is inserted into the perceptually most significant components of a decomposition of the data in a manner so as to be virtually imperceptible.
More specifically, a narrow band signal representing the watermark is placed in a wideband channel that is the data.
Background of the Invention The proliferation of digitized media such as audio, image and video is creating a need for a security system which facilitates the identification of the source of the material. The need manifests itself in terms of copyright enforcement and identification of the source of the material.
Using conventional cryptographic systems permits only valid keyholder access to encrypted data, but once the data is encrypted, it is not possible to maintain records of its subsequent representation or transmission. Conventional cryptography therefore provides minimal protection against data piracy of the type a publisher or owner of data or material is confronted with by unauthorized reproduction or distribution of such data.
or material.
A digital watermark is intended to complement cryptographic processes. The watermark is a visible or preferably an invisible identification code that is permanently embedded in the data. That is, the watermark remains with the data after any decryption process. As used herein the terms data and material will be understood to refer to audio (speech and music), images (photographs and graphics), video (movies or sequences of images) and ,,...
multimedia data (combinations of the above categories of materials) or processed or compressed versions thereof. These terms are not intended to refer to ASCII
representations of text, but do refer to text represented as an image. A
simple example of a watermark is a visible "seal" placed over an image to identify the copyright owner.
However, the watermark might also contain additional information, including the identity of the purchaser of the particular copy of the image. An effective watermark should possess the following properties:
1. The watermark should be perceptually invisible or its presence should not interfere with the material being protected.
2. The watermark must be difficult (preferably virtually impossible) to remove from the material without rendering the material useless for its intended purpose.
However, if only partial knowledge is known, e.g. the exact location of the watermark within an image is unknown, then attempts to remove or destroy the watermark, for instance by adding noise, should result in severe degradation in data fidelity, rendering the data useless, before the watermark is removed or lost.
However, if only partial knowledge is known, e.g. the exact location of the watermark within an image is unknown, then attempts to remove or destroy the watermark, for instance by adding noise, should result in severe degradation in data fidelity, rendering the data useless, before the watermark is removed or lost.
3. The watermark should be robust against collusion by multiple individuals who each possess a watermarked copy of the data. That is, the watermark should be robust to the combining of copies of the same data set to destroy the watermarks. Also, it must not be possible for colluders to combine each of their images to generate a different valid watermark.
4. The watermark should still be retrievable if common signal processing operations are applied to the data. These operations include, but are not limited to digital-to-analog and analog-to-digital conversion, resampling, requantization (including dithering and recompression) and common signal enhancements to image contrast and color, or audio bass and treble for example. The watermarks in image and video data should be immune from geometric image operations such as rotation, translation, cropping and scaling.
5. The same digital watermark method or algorithm should be applicable to each of the different media under consideration. This is particularly useful in watermarking of multimedia material. Moreover, this feature is conducive to the implementation of video and image/video watermarking using common hardware.
6. Retrieval of the watermark should unambiguously identify the owner.
Moreover, the accuracy of the owner identification should degrade gracefully during attack.
Several previous digital watermarking methods have been proposed. L. F. Tumer in V1IIP0 Publication No. W089108915 entitled "Digital Data Security System", published on September 21, 1989, proposed a method for inserting an identification string into a digital audio signal by substituting the "insignificant" bits of randomly selected audio samples with the bits of an identification code. Bits are deemed "insignificant" if their alteration is inaudible. Such a system is also appropriate for two-dimensional data such as images, as discussed in an article by R.G. Van Schyndel et al.
entitled "A
digital watermark" in Intl. Conf. on Image Processing, vol. 2, Pages 86-90, 1994. The Tumer method may easily be circumvented. For example, if it is known that the algorithm only affects the least significant two bits of a word, then it is possible to randomly flip all such bits, thereby destroying any existing identification code.
An article entitled "Assuring Ownership Rights for Digital Images" by G.
Caronni, in Proc. Reliable IT Systems, VIS '95, 1995 suggests adding tags - small geometric patterns-to-digitized images at brightness levels that are imperceptible. While the idea of hiding a spatial watermark in an image is fundamentally sound, this scheme is susceptible to attack-by filtering and redigitization. The fainter such watermarks are, the more susceptible they are to such attacks and geometric shapes provide only a limited alphabet with which to encode information. Moreover, the scheme is not applicable to audio data and may not be robust to common geometric distortions, especially cropping.
~ ' _.. .r .. , f s J. Brassil et al in an article entitled "Electronic Marking and Identification Techniques to Discourage Document Copying" in Proc. of Infocom 94, pp 1278-1287, 1994 propose three methods appropriate for document images in which text is common. Digital watermarks are coded by: (1)vertically shifting text lines, (2) horizontally shifting words, or (3) altering text features such as the vertical endlines of individual characters.
Unfortunately, all three proposals are easily defeated, as discussed by the authors.
Moreover, these techniques are restricted exclusively to images containing text.
An article by K. Tanaka et al entitled "Embedding Secret Information into a Dithered Mufti-level Image" in IEEE Military Comm. Conf., pp216-220, 1990 and K. Mitsui et al in an article entitled "Video-Steganography" in IMA Intellectual Property Proc., vI, pp 187-206, 1994, describe several watermarking schemes that rely on embedding watermarks that resemble quantization noise. Their ideas hinge on the notion that quantization noise is typically imperceptible to viewers. Their first scheme injects a watermark into an image by using a predetermined data stream to guide level selection in a predictive quantizer. The data stream is chosen so that the resulting watermark looks like quantization noise. A
variation of this scheme is also presented, where a watermark in the form of a dithering matrix is used to dither an image in a certain way. There are several drawbacks to these schemes. The most important is that they are susceptible to signal processing, especially requantization, and geometric attacks such as cropping. Furthermore, they degrade an image in the same way that predictive coding and dithering can.
In Tanaka et al, the authors also propose a scheme for watermarking facsimile data. This scheme shortens or lengthens certain runs of data in the run length code used to generate -the coded fax image. This proposal is susceptible to digital-to-analog and analog-to digital conversions. In particular, randomizing the least significant bit (LSB) of each pixel's intensity will completely alter the resulting run length encoding.
Tanaka et al also propose a watermarking method for "color-scaled picture and video sequences".
This method applies the same signal transform as JPEG (DCT of 8 x 8 sub-blocks of an image) and embeds a watermark in the coe~cient quantization module. While being compatible with existing transform coders, this scheme is quite susceptible to requantization and filtering and is equivalent to coding the watermark in the least significant bits of the transform coefficients.
In a recent paper, by Macq and ~Quisquater entitled "Cryptology for Digital TV
Broadcasting" in Proc. of the IEEE, 83(6), pp944-957, 1995 there is briefly discussed the issue of watermarking digital images as part of a general survey on cryptography and digital television. The authors provide a description of a procedure to insert a watermark into the least significant bits of pixels located in the vicinity of image contours. Since it relies on modifications of the least significant bits, the watermark is easily destroyed.
Further, the method is only applicable to images in that it seeks to insert the watermark into image regions that lie on the edge of contours.
W. Bender et al in article entitled "Techniques for Data Hiding" in Proc. of SPIE, v2420, page 40, July 1995, describe two watermarking schemes. The first is a statistical method called "Patchwork". Patchwork randomly chooses n pairs of image points (a;, b;) and increases the brightness at a; by one unit while correspondingly decreasing the brightness of b;. The expected value of the sum of the differences of the n pairs of points is claimed to be 2n, provided certain statistical properties of the image are true. In particular, it is assumed that all brightness levels are equally likely, that is, intensities are uniformly distributed. However, in practice, this is very uncommon. Moreover, the scheme may not be robust to randomly jittering the intensity levels by a single unit, and be extremely sensitive to geometric affine transformations.
The second method is called "texture block coding", where a region of random texture pattern found in the image is copied to an area of the image with similar texture.
Autocorrelation is then used to recover each texture region. The most significant problem with this technique is that it is only appropriate for images that possess large areas of random texture. The technique could not be used on images of text, for example. Nor is there a direct analog for audio.
w ~ 218499 In addition to direct work on watermarking images, there are several works of interest in related areas. E.H. Adelson in U.S. Patent No. 4, 939,515 entitled "Digital Signal Encoding and Decoding Apparatus" describes a technique for embedding digital information in an analog signal for the purpose of inserting digital data into an analog TV
signal. The analog signal is quantized into one of two disjoint ranges ({0,2,4... }, { 1,3,5}, for example) which are selected based on the binary digit to be transmitted.
Thus Adelson's method is equivalent to watermark schemes that encode information into the least significant bits of the data or its transform coefficients. Adelson recognizes that the method is susceptible to noise and therefore proposes an alternative scheme wherein a 2x1 Hadamard transform of the digitized analog signal is taken. The differential coefficient of the Hadamard transform is offset by 0 or 1 unit prior to computing the inverse transform.
This corresponds to encoding the watermark into the least significant bit of the differential coefficient of the Hadamard transform. It is not clear that this approach would demonstrate enhanced resilience to noise. Furthermore, like all such least significant bit schemes, an attacker can eliminate the watermark by randomization.
U.S. Patent No. 5,010,405 describes a method of interleaving a standard NTSC
signal within an enhanced definition television (EDTV) signal. This is accomplished by analyzing the frequency spectrum of the EDTV signal (larger than that of the NTSC
signal) and decomposing it into three sub-bands (L,M,H for low, medium and high frequency respectively). In contrast, the NTSC signal is decomposed into two subbands, L
and M.
The coefficients, Mk, within the M band are quantized into M levels and the high frequency coe~cients, Hk, of the EDTV signal are scaled such that the addition of the H,; signal plus-any noise present in the system is less than the minimum separation between quantization levels. Once more, the method relies on modifying least significant bits.
Presumably, the mid-range rather than low frequencies were chosen because they are less perceptually significant. In contrast, the method proposed in the present invention modifies the most perceptually significant components of the signal.
Finally, it should be noted that many, if noC all, of the prior art protocols are not collusion resistant.
Recently, Digimarc Corporation of Portland, Oregon, has described work referred to as signature technology for use in identifying digital intellectual property.
Their method adds or subtracts small random quantities from each pixels. Addition or subtraction is based on comparing a binary mask of N bits with the least significant bit (LSB) of each pixel. If the LSB is equal to the corresponding mask bit, then the random quantity is added, otherwise it is subtracted. The watermark is extracted by first computing the difference between the original and watermarked images and then by examining the sign of the difference, pixel by pixel, to determine if it corresponds to the original sequence of additions/subtractions.
The Digimarc technique is not based on direct modifications of the image spectrum and does not make use of perceptual relevance. While the technique appears to be robust, it may be susceptible to constant brightness offsets and to attacks based on exploiting the high degree of local correlation present in an image. For example, randomly switching the position of similar pixels within a local neighborhood may significantly degrade the watermark without damaging the image.
In a paper by Koch, Rindfrey and Zhao entitled "Copyright Protection for Multimedia Data", two general methods for watermarking images are described. The first method partitions an image into 8x8 blocks of pixels and computes the Discrete Cosine Transform (DCT) of each of these blocks. A pseudorandom subset of the blocks is chosen and in each such block a triple of frequencies selected from one of 18 predetermined triples is modified so that their relative strengths encode a 1 or 0 value. The 18 possible triples are-composed by selection of three out of eight predetermined frequencies within the 8x 8 DCT block. The choice of the eight frequencies to be altered within the DCT
block appears to be based on the belief that middle frequencies have a moderate variance level, i.e., they have similar magnitude. This property is needed in order to allow the relative strength of the frequency triples to be altered without requiring a modification that would.
be perceptually noticeable. Unlike in the present invention, the set of frequencies is not ,... ~ 2184949 chosen based on any perceptual significance or relative energy considerations.
In addition, because the variance between the eight frequency coefficients is small, one would expect that the technique may be sensitive to noise or distortions. This is supported by the experimental results reported in the Koch et al paper, supra, where it is reported that the "embedded labels are robust against JPEG compression for a quality factor as low as about 50%". In contrast, the method described in accordance with the teachings of the present invention has been demonstrated with compression quality factors as low as 5 percent.
An earlier proposal by Koch and Zhao in a paper entitled "Toward Robust and Hidden Image Copyright Labeling" proposed not triples of frequencies but pairs of frequencies and was again designed specifically for robustness to JPEG compression.
Nevertheless, the report states that "a lower quality factor will increase the likelihood that the changes necessary to superimpose the embedded code on the signal will be noticeably visible".
In a second method, proposed by Koch and Zhao, designed for black and white images, no frequency transform is employed. Instead, the selected blocks are modified so that the relative frequency of white and black pixels encodes the final value. Both watermarking procedures are particularly vulnerable to multiple document attacks. To protect against this, Zhao and Koch proposed a distributed 8 x 8 block of pixels created by randomly sampling 64 pixels from the image. However, the resulting DCT has no relationship to that of the true image. Consequently, one would expect such distributed blocks to be both sensitive to noise and likely to cause noticeable artifacts in the image.
In summary, prior art digital watermarking techniques are not robust and the watermark is easy to remove. In addition, many prior techniques would not survive common signal and geometric distortions Summary of the Invention The present invention overcomes the limitations of the prior art methods by providing a watern~arking system that embeds an unique identifier into the perceptually significant components of a decomposition of an image, an audio signal or a video sequence.
Preferably, the decomposition is a spectral frequency decomposition. The watermark is embedded in the data's perceptually significant frequency components. This is because an effective watermark cannot be located in perceptually insignificant regions of image data or in its frequency spectrum, since many common signal or geometric processes affect these components. For example, a watermark located in the high frequency spectral components of an image is easily removed, with minor degradation to the image, by a process that performs low pass filtering. The issue then becomes one of how to insert the watermark into the most significant regions of the data frequency spectrum without the alteration being noticeable to an observer, i.e., a human or a machine feature recognition system. Any spectral component may be altered, provided the alteration is small.
However, very small alterations are susceptible to any noise present or intentional distortion.
In order to overcome this problem, the frequency domain of the image data or sound data may be considered as a communication channel, and correspondingly the watermark may be considered as a signal transmitted through the channel. Attacks and intentional signal distortions are thus treated as noise from which the transmitted signal must be immune.
Attacks are intentional efforts to remove, delete or otherwise overcome the beneficial aspects of the data watermarking. While the present invention is intended to embed watermarks in data, the same methodology can be applied to sending any type of message-through media data.
Instead of encoding the watermark into the least significant components of the data, the present invention considers applying concepts of spread spectrum communication. In spread spectrum communications, a narrowband signal is transmitted over a much larger bandwidth such that the signal energy present in any single frequency is imperceptible. In 2 ~ ~~~9~9 a similar manner, the watermark is spread over many frequency bins so that the energy in any single bin is small and imperceptible. Since the watermark verification process includes a priori knowledge of the locations and content of the watermarks, it is possible to concentrate these many weak signals into a single signal with a high signal to-noise ratio.
Destruction of such a watermark would require noise of high amplitude to be added to every frequency bin.
In accordance with the teachings of the present invention, a watermark is inserted into the perceptually most significant regions of the data decomposition. The watermark itself is designed to appear to be additive random noise and is spread throughout the image. By placing the watermark into the perceptually significant components, it is much more difficult for an attacker to add more noise to the components without adversely affecting the image or other data. It is the fact that the watermark looks like noise and is spread throughout the image or data which makes the present scheme appear to be similar to spread spectrum methods used in communications system.
Spreading the watermark throughout the spectrum of an image ensures a large measure of security against unintentional or intentional attack. First, the location of the watermark is not obvious. Second, frequency regions are selected in a fashion that ensures severe degradation of the original data following any attack on the watermark.
A watermark that is well placed in the frequency domain of an image or a sound track will be practically impossible to see or hear. This will always be the case if the energy in the watermark is sufficiently small in any single frequency coefficient. Moreover, it is possible-to increase the energy present in particular frequencies by exploiting knowledge of masking phenomena in the human auditory and visual systems. Perceptual masking refers to any situation where information in certain regions of an image or a sound is occluded by perceptually more prominent information in another part of the image or sound.
In digital waveform coding, this frequency domain (and in some cases, time/pixel domain) masking is exploited extensively to achieve low bit rate encoding of data. It is clear that both ~~~~949 ...
auditory and visual systems attach more resolution to the high energy, low frequency, spectral regions of an auditory or visual scene. Further, spectrum analysis of images and sounds reveals that most of the information in such data is often located in the low frequency regions.
In addition, particularly for processed or compressed data, perceptually significant need not refer to human perceptual significance, but may refer instead to machine perceptual significance, for instance, machine feature recognition.
To meet these requirements, a watermark is proposed whose structure comprises a large quantity, for instance 1000, of randomly generated numbers with a normal distribution having zero mean and unity variance. A binary watermark is not chosen because it is much less robust to attacks based on collusion of several independently watermarked copies of an image. However, generally, the watermark might have arbitrary structure, both deterministic and/or random, and including uniform distributions. The length of the proposed watermark is variable and can be adjusted to suit the characteristics of the data.
For example, longer watermarks might be used for images that are especially sensitive to large modifications of its spectral coefficients, thus requiring weaker scaling factors for individual components.
The watermark is then placed in components of the image spectrum. These components may be chosen based on an analysis of those components which are most vulnerable to attack and/or which are most perceptually significant. This ensures that the watermark remains with the image even after common signal and geometric distortions.
Modification-of these spectral components results in severe image degradation long before the watermark itself is destroyed. Of course, to insert the watermark, it is necessary to alter these very same coefficients. However, each modification can be extremely small and, in a manner similar to spread spectrum communication, a strong narrowband watermark may be distributed over a much broader image {channel) spectrum. Conceptually, detection of the watermark then proceeds by adding all of these very small signals, whose locations are 2i ~~9~9 only known to the copyright owner, and concentrating the watermark into a signal with high signal-to-noise ratio. Because the location of the watermark is only known to the copyright holder, an attacker would have to add very much more noise energy to each spectral coefficient in order to be confident of removing the watermark.
However, this process would destroy the image.
Preferably, a predetermined number of the largest coefficients of the DCT
(discrete cosine transform) (excluding the DC term) are used. However, the choice of the DCT is not critical to the algorithm and other spectral transforms, including wavelet type decompositions are also possible. In fact, use of the FFT rather than DCT is preferable from a computational perspective.
The invention will be more clearly understood when the following description is read in conjunction with the accompanying drawing.
Brief Description of the Drawing Figure 1 is a schematic representation of typical common processing operations to which data could be subjected;
Figure 2 is a schematic representation of a preferred system for immersing a watermark into an image;
Figures 3a and 3b are flow charts of the encoding and decoding of watermarks;
Figure 4 is a graph of the responses of the watermark detector to random watermarks;
Figure 5 is a graph of the response of the watermark detector to random watermarks for an image which is successively watermarked five times;
2~~4~49 Figure 6 is a graph of the response of the watermark detector to random watermarks where five images, each having a different watermark, and averaged together;
and Figure 7 is a schematic diagram of an optical embodiment of the present invention Detailed Description In order to better understand the advantages of the invention, the preferred embodiment of a frequency spectrum based watermarking system will be described. It is instructive to examine the processing stages that image (or sound) data may undergo in the copying process and to consider the effect that such processing stages can have on the data.
Referring to Figure 1, a watermarked image or sound data 10 is transmitted 12 to undergo typical distortion or intentional tampering 14. Such distortions or tampering includes lossy compression 16, geometric distortion 18, signal processing 20 and D/A
and AID
conversion 22. After undergoing distortion or tampering, corrupted watermarked image or sound data 24 is transmitted 26. The process of "transmission" refers to the application of any source or channel code and/or of encryption techniques to the data.
While most transmission steps are information lossless, many compression schemes (e.g., JPEG, MPEG, etc.) may potentially degrade the quality of the data through irretrievable loss of data. In general, a watermarking method should be resilient to any distortions introduced by transmission or compression algorithms. -L.ossy compression 16 is an operation that usually eliminates perceptually ,irrelevant components of image or sound data. In order to preserve a watermark when undergoing lossy compression, the watermark is located in a perceptually significant region of the data. Most processing of this type occurs in the frequency domain. Data loss usually occurs in the high frequency components. Thus, the waternnark must be placed in the z ~ sa9a~
,...
significant frequency component of the image (or sound) data spectrum to minimize the adverse affects of lossy compression.
After receipt, an image may encounter many common transformations that are broadly categorized as geometric distortions or signal distortions. Geometric distortions 18 are specific to image and video data, and include such operations as rotation, translation, scaling and cropping. By manually determining a minimum of four or nine corresponding points between the original and the distorted watermark, it is possible to remove any two or three dimensional affine transformation. However, an affine scaling (shrinking) of the image results in a loss of data in the high frequency spectral regions of the image.
Cropping, or the cutting out and removal of portions of an image, also results in irretrievable loss of data. Cropping may be a serious threat to any spatially based watermark but is less likely to affect a frequency-based scheme.
Common signal distortions include digital-to-analog and analog-to-digital conversion 22, resampling, requantization, including dithering and recompression, and common signal enhancements to image contrast and/or color, and audio frequency equalization.
Many of these distorrtions are non-linear, and it is difficult to analyze their effect in either a spatial or frequency based method. However, the fact that the original image is known allows many signal transformations to be undone, at least approximately. For example, histogram equalization, a common non-linear contrast enhancement method, may be substantially removed by histogram specification or dynamic histogram warping techniques.
Finally, the copied image may not remain in digital form. Instead, it is likely to be printed -or an analog recording made (analog audio or video tape). These reproductions introduce additional degradation into the image data that a watermarking scheme must be robust to.
Tampering ( or attack) refers to any intentional attempt to remove the watermark, or corrupt it beyond recognition. The watermark must not only be resistant to the inadvertent application of distortions. It must also be immune to intentional manipulation by malicious parties. These manipulations can include combinations of distortions, and can also include collusion and forgery attacks.
Figure 2 shows a preferred system for inserting a watermark into an image in the frequency domain. Image data X(i,j) assumed to be in digital form, or alternatively data in other formats such as photographs, paintings or the like, that have been previously digitized by well-known methods, is subject to a frequency transformation 30, such as the Fourier transform. A watermark signal W (k) is inserted into the frequency spectrum components of the transformed image data 32 applying the techniques described below.
The frequency spectrum image data including the watermark signal is subjected to an inverse frequency transform 34, resulting in watermarked image data X(i, j) , which may remain in digital form or be printed as an analog representation by well-known methods.
After applying a frequency transformation to the image data 30, a perceptual mask is computed that highlights prominent regions in the frequency spectrum capable of supporting the watermark without overly affecting perceptual fidelity. This may be performed by using knowledge of the perceptual significance of each frequency in the spectrum, as discussed earlier, or simply by ranking the frequencies based on their energy.
The latter method was used in experiments described below.
In general, it is desired to place the watermark in regions of the spectrum that are least affected by common signal distortions and are most significant to image quality as perceived by a viewer, such that significant mod~cation would destroy the image fidelity.
In practice, these regions could be experimentally identified by applying common signal distortions to images and examining which frequencies are most affected, and by psychophysical studies to identify how much each component may be modified before significant changes in the image are perceivable.
The watermark signal is then inserted into these prominent regions in a way that makes any tampering create visible (or audible) defects in the data. The requirements of the 21~~~49 watermark mentioned above and the distortions common to copying provide constraints on the design of an electronic watermark 1n order to better understand the watermarking method, reference is made to Figures 3(a) and 3(b) where from each document D a sequence of values X=x,,...,xn is extracted 40 with which a watermark W=w,,...,wo is combined 42 to create an adjusted sequence Of values X'=x',,...,x'o which is then inserted back 44 into the document in place of values X
in order to obtain a watermark document D'. An attack of the document D', or other distortion, will produce a document D*. Having the original document D and the document D*, a possibly corrupted watermark W* is extracted 46 and compared to watermark W 48 for statistical analysis 50. The values W* are extracted by first extracting a set of values X*=xl*,...,xo* from D* (using information about D) and then generating W* from the values X* and the values X.
When combining the values X with the watermark values W in step 42, scaling parameter a is specified. The scaling parameter a determines the extent to which values W alter values X. Three preferred formulas for computing X' are:
x; = x; + aw; (1) x; = x; (1 + aw; ) (2) x; = x; (e°°"' ) (3) Equation 1 is invertible. Equations 2 and 3 are invertible when x;$0.
Therefore, given X*
it is possible to compute the inverse function necessary to derive W* from X
and X*.
Equation 1 is not the preferred formula when the values x; vary over a wide range. For example, if x;=106 then adding 100 may be insufficient to establish a watermark, but if x;=10, then adding 100 will unacceptably distort the value. Insertion methods using equations 2 and 3 are more robust when encountering such a wide range of values x;. It 2 ~ ~49~ 9 will also be observed that equation 2 and 3 yield similar results when aw; is small.
Moreover, when x; is positive, equation 3 is equivalent to ln(x;) = ln(x;) +ax; and may be considered as an application of equation 1 when natural logarithms of the original values are used. For example, if Iw;l 51 and a=0.01, then using Equation (2) guarantees that the spectral coe~cient will change by no more than 1 %
For certain applications, a single scaling parameter a may not be best for combining all values of x;. Therefore, multiple scaling parameters oc;,...,oco can be used with revised equations 1 to 3 such as x;=x; ( 1+a;w;). The values of a; serve as a relative measure of how much x; must be altered to change the perceptual quality of the document.
A large value for a; means that it is possible to alter x; by a large amount without perceptually degrading the document.
A method for selecting the multiple scaling values is based upon certain general assumptions. For example, equation 2 is a special case of the generalized equation 1, (x;'=x;+ oc;x;), for a;=ax;. That is , equation 2 makes the reasonable assumption that a large value of x; is less sensitive to additive alteration that a small value of x;.
Generally,.the sensitivity of the image to different values of a; is unknown.
A method of empirically estimating the sensitivities is to determine the distortion caused by a number of attacks on the original image. For example, it is possible to compute a degraded image D* from D, extract the corresponding values xl*,...,xn* and select a; to be proportional to the deviation Ix;*-x;i. For greater robustness, it is possible to try other forms of distortion and make a; proportional to the average value of (x;*-x;l. Instead of using the average duration, it is possible to use the median or maximum deviation.
Alternatively, it is possible to combine the empirical approach with general global assumptions regarding the sensitivity of the values. For example, it might be required that 2~~49~9 a; _> a; whenever x; >x;. This can be combined with the empirical approach by setting a;
according to max Iv'. -v.l {jlv~5v;}
A more sophisticated approach is to weaken the monotonicity constraint to be robust against occasional outliers.
The length of the watermark, n, determines the degree to which the watermark is spread among the relevant components of the image data. As the size of the watermark increases, so does the number of altered spectral components, and the extent to which each component need be altered decreases for the same resilience to noise.
Consider watermarks of the form x;'=x;+ocw; and a white noise attack by x;'=x;' +r;, where r; are chosen according to independent normal distributions with standard deviation 6. It is possible to recover the watermark when a is proportional to ~~-. That is, quadrupling n the number of components can halve the magnitude of the watermark placed into each component. The sum of the squares of the deviations remains essentially unchanged.
In general, a watermark comprises an arbitrary sequence of real numbers W=w;,...,wn. In practice, each value w; may be chosen independently'from a normal distribution N(0,1 ), where N(p,, c~) with mean p, and variance oz or of a uniform distribution from { 1,-1 }. or {~ 1}.
It is highly unlikely that the extracted mark W* will be identical to the original watermark W. Even the act of requantizing the watermarked document for transmission will cause W* to deviate from W. A preferred measure of the similarity of W and W* is sim(W, W*) _ ~ * . ~ * (4) Large values of sim (W,W*) are significant in view of the following analysis.
Assume that the authors of document D* had no access to W (either through the seller or through a watermarked document). Then for whatever value of W* is obtained, the conditional distribution on w; will be independently distributed according to N(0,1). In this case, n N(0,~,x;2)=N(O,W~~Wi).
Thus, sim(W, W*) is distributed according to N(0,1). Then, one may apply the standard significance tests for the normal distribution. For example, if D* is chosen independently from W, then it is very unlikely that sim(W,W*) > 5. Note that somewhat higher values of sim (W,W*) may be needed when a large number of watermarks are on file. The above analysis required only the independence of W from W*, and did not rely on any specific properties of W* itself. This fact provides further flexibility when preprocessing W*.
The extracted watermark W* may be extracted in several ways to potentially enhance the ability to extract a watermark. For example, experiments on images encountered instances where the average value of W*, denoted E; (W*), differed substantially from 0, due to the effects of a dithering procedure. While this artifact could be easily eliminated as part of the extraction process, it provides a motivation for postprocessing extracted watermarks.
As a result, it was discovered that the simple transformation w;* ~w;*-E;(W*) yielded superior values of sim (W,W*). The improved performance resulted from the decreased value of W*~ W*; the value of W*~ W was only slightly affected.
In experiments it was frequently observed that w;* could be greatly distorted for some values of i. One postprocessing option is to simply ignore such values, setting them to 0.
That is, *
w* ~ wl if Iw; ( > tolerance 0 otherwise The goal of such a transformation is to lower W* ~ W*. A less abrupt version of this approach is to normalize the W* values to be either -1,0 or 1, by ,,~.~.
wl E-sign(wl -E1 (W*)).
This transformation can have a dramatic effect on the statistical significance of the result.
Other robust statistical techniques could also be used to suppress outlier effects.
In principle, any frequency domain transform can be used. In the scheme described below, a Fourier domain method is used, but the use of wavelet based schemes are also useable as a variation. In terms of selecting frequency regions of the transform, it is possible to use models for the perceptual system under consideration.
Frequency analysis may be performed by a wavelet or sub-band transform where the signal is divided into sub-bands by means of a wavelet or multi-resolution transform.
The sub-bands need not be uniformly spaced. Each sub-band may be thought of as representing a frequency region in the domain corresponding to a sub-region of the frequency range of the signal. The watermark is then inserted into the sub-regions.
For audio data, a sliding "window" moves along the signal data and the frequency transform (DCT, FFT, etc.) is taken of. the sample in the window. This process enables the capture of meaningful information of a signal that is time varying in nature.
Each coefficient in the frequency domain is assumed to have a perceptual capacity. That is, it can support the insertion of additional information without any (or with minimal) impact to the perceptual fidelity of the data.
In order to place a length L watermark into an N x N image, the N x N FFT (or DCT) of the image is computed and the watermark is placed into the L highest magnitude coefficients of the transform matrix, excluding the DC component. More generally, L
randomly chosen coefficients could be chosen from the M, M> L most perceptually significant coefficients of the transform. For most images, these coefficients will be the ones corresponding to the low frequencies. The purpose of placing the watermark in these locations is because significant tampering with these frequencies will destroy the image fidelity or perceived quality well before the watermark is destroyed The FFT provides perceptually similar results to the DCT. This is different than the case of transform coding, where the DCT is preferred to the FFT due to its spectral properties.
The DCT tends to have less high frequency information than that the FFT, and places most of the image information in the low frequency regions, making it preferable in situations where data need to be eliminated. In the case of watermarking, image data is preserved, and nothing is eliminated. Thus the FFT is as good as the DCT, and is preferred since it is easier to compute.
In an experiment, a visually imperceptible watermark was intentionally placed in an image.
Subsequently, 100 randomly generated watermarks, only one of which corresponded to the correct watermark, were applied to the watermark detector described above.
The result, as shown in Figure 4, was a very strong positive response corresponding to the correct watermark, suggesting that the method results in a very low number of false positive responses and a very low false negative response rate.
In another test, the watermarked image was scaled to half of its original size. In order to recover the watermark, the image was re-scaled to its original size, albeit with loss of detail due to subsampling of the image using low pass spatial filter operations. The response of the watermark detector was well above random chance levels, suggesting that the watermark is robust to geometric distortions. This result was achieved even though 75 percent of the original data was missing from the scaled down image. -In a further experiment, a JPEG encoded version of the image with parameters of 10 percent quality and 0 percent smoothing, resulting in visible distortions, was used. The results of the watermark detector suggest that the method is robust to common encoding distortions. Even using a version of the image with parameters of the 5 percent quality and 0 percent smoothing, the results were well above that achievable due to random chance.
In experiments using a dithered version of the image, the response of the watermark detector suggested that the method is robust to common encoding distortion.
Moreover, more reliable detection is achieved by removing any non-zero mean from the extracted watermark.
In another experiment, the image was clipped, leaving only the central quarter of the image. In order to extract the watermark from the clipped image, the missing portion of the image was replaced with portions from the original unwatermarked image.
The watermark detector was able to recover the watermark with a response greater than random. When the non-zero mean was removed, and the elements of the watermark were binarized prior to the comparison with the correct watermark, the detector response was improved. This result is achieved even though 75 percent of the data was removed from the image.
In yet another experiment, the image was printed, photocopied, scanned using a 300 dpi Umax PS-2400x scanner and rescaled to a size of 256 x 256 pixels. Clearly, the final image suffered from different levels of distortion introduced at each process.
High frequency pattern noise was particularly noticeable. When the non-zero mean was removed and only the sign of the elements of the watermark was used, the watermark detector response improved to well above random chance levels.
In still another experiment, the image was subject to five successive watermarking operations. That is, the original image was watermarked, the watermarked image was watermarked, and so forth. The process may be considered another form of attack in which it is clear that significant image degradation occurs if the process is repeated.
Figure S shows the response of the watermark detector to 1000 randomly generated watermarks, including the five watermarks present in the image. The five dominant spikes -~ ~ 21 ~~949 in the graph, indicative of the presence of the five watermarks, show that successive watermarking does not interfere with the process.
The fact that successive watermarking is possible means that the history or pedigree of a document is determinable if successive watermarking is added with each copy.
1n a variation of the multiple watermark image, five separately watermarked images were averaged together to simulate simple conclusion attack. Figure 6 shows the response of the watermark detector to 1000 randomly generated watermarks, including the five watermarks present in the original images. The result is that simple collusion based on averaging is ineffective in defeating the present watermarking system.
The result of the above experiments is that the described system can extract a reliable copy of the watermark from images that have been significantly degraded through several common geometric and signal processing procedures. These procedures include zooming (low pass filtering), cropping, lossy JPEG encoding, dithering, printing, photocopying and subsequent rescanning.
While these experiments were, in fact, conducted using an image, similar results are attainable with text images, audio data and video data, although attention must be paid to the time varying nature of these data.
The above implementation of the watermarking system is an electronic system.
Since the basic principle of the invention is the inclusion of a watermark into spectral frequency -components of the data, watermarking can be accomplished by other means using, for example, an optical system as shown in Figure 7. .
In Figure 7, data to be watermarked such as an image 40 is passed through a spatial transform lens 42, such as a Fourier transform lens, the output of which lens is the spatial transform of the image. Concurrently, a watermark image 44 is passed through a second ~~~~~~9 spatial transform lens 46, the output of which lens is the spatial transfer of the watermark image 44. The spatial transform from lens 42 and the spatial transform from lens 46 are combined at an optical combiner 48. The output of the optical combiner 48 is passed through an inverse spatial transform lens 50 from which the watermark image 52 is present. The result is a unique, virtually imperceptible, watermarked image.
Similar results are achievable by transmitting video or multimedia signals through the lenses in the manner described above.
While there have been described and illustrated spread spectrum watermarking of data and variations and modifications thereof, it will be apparent to those skilled in the art that further variations and modifications are possible without deviating from the broad principles and spirit of the present invention which shall be limited solely by the scope of the claims appended hereto.
What is claimed is:
Moreover, the accuracy of the owner identification should degrade gracefully during attack.
Several previous digital watermarking methods have been proposed. L. F. Tumer in V1IIP0 Publication No. W089108915 entitled "Digital Data Security System", published on September 21, 1989, proposed a method for inserting an identification string into a digital audio signal by substituting the "insignificant" bits of randomly selected audio samples with the bits of an identification code. Bits are deemed "insignificant" if their alteration is inaudible. Such a system is also appropriate for two-dimensional data such as images, as discussed in an article by R.G. Van Schyndel et al.
entitled "A
digital watermark" in Intl. Conf. on Image Processing, vol. 2, Pages 86-90, 1994. The Tumer method may easily be circumvented. For example, if it is known that the algorithm only affects the least significant two bits of a word, then it is possible to randomly flip all such bits, thereby destroying any existing identification code.
An article entitled "Assuring Ownership Rights for Digital Images" by G.
Caronni, in Proc. Reliable IT Systems, VIS '95, 1995 suggests adding tags - small geometric patterns-to-digitized images at brightness levels that are imperceptible. While the idea of hiding a spatial watermark in an image is fundamentally sound, this scheme is susceptible to attack-by filtering and redigitization. The fainter such watermarks are, the more susceptible they are to such attacks and geometric shapes provide only a limited alphabet with which to encode information. Moreover, the scheme is not applicable to audio data and may not be robust to common geometric distortions, especially cropping.
~ ' _.. .r .. , f s J. Brassil et al in an article entitled "Electronic Marking and Identification Techniques to Discourage Document Copying" in Proc. of Infocom 94, pp 1278-1287, 1994 propose three methods appropriate for document images in which text is common. Digital watermarks are coded by: (1)vertically shifting text lines, (2) horizontally shifting words, or (3) altering text features such as the vertical endlines of individual characters.
Unfortunately, all three proposals are easily defeated, as discussed by the authors.
Moreover, these techniques are restricted exclusively to images containing text.
An article by K. Tanaka et al entitled "Embedding Secret Information into a Dithered Mufti-level Image" in IEEE Military Comm. Conf., pp216-220, 1990 and K. Mitsui et al in an article entitled "Video-Steganography" in IMA Intellectual Property Proc., vI, pp 187-206, 1994, describe several watermarking schemes that rely on embedding watermarks that resemble quantization noise. Their ideas hinge on the notion that quantization noise is typically imperceptible to viewers. Their first scheme injects a watermark into an image by using a predetermined data stream to guide level selection in a predictive quantizer. The data stream is chosen so that the resulting watermark looks like quantization noise. A
variation of this scheme is also presented, where a watermark in the form of a dithering matrix is used to dither an image in a certain way. There are several drawbacks to these schemes. The most important is that they are susceptible to signal processing, especially requantization, and geometric attacks such as cropping. Furthermore, they degrade an image in the same way that predictive coding and dithering can.
In Tanaka et al, the authors also propose a scheme for watermarking facsimile data. This scheme shortens or lengthens certain runs of data in the run length code used to generate -the coded fax image. This proposal is susceptible to digital-to-analog and analog-to digital conversions. In particular, randomizing the least significant bit (LSB) of each pixel's intensity will completely alter the resulting run length encoding.
Tanaka et al also propose a watermarking method for "color-scaled picture and video sequences".
This method applies the same signal transform as JPEG (DCT of 8 x 8 sub-blocks of an image) and embeds a watermark in the coe~cient quantization module. While being compatible with existing transform coders, this scheme is quite susceptible to requantization and filtering and is equivalent to coding the watermark in the least significant bits of the transform coefficients.
In a recent paper, by Macq and ~Quisquater entitled "Cryptology for Digital TV
Broadcasting" in Proc. of the IEEE, 83(6), pp944-957, 1995 there is briefly discussed the issue of watermarking digital images as part of a general survey on cryptography and digital television. The authors provide a description of a procedure to insert a watermark into the least significant bits of pixels located in the vicinity of image contours. Since it relies on modifications of the least significant bits, the watermark is easily destroyed.
Further, the method is only applicable to images in that it seeks to insert the watermark into image regions that lie on the edge of contours.
W. Bender et al in article entitled "Techniques for Data Hiding" in Proc. of SPIE, v2420, page 40, July 1995, describe two watermarking schemes. The first is a statistical method called "Patchwork". Patchwork randomly chooses n pairs of image points (a;, b;) and increases the brightness at a; by one unit while correspondingly decreasing the brightness of b;. The expected value of the sum of the differences of the n pairs of points is claimed to be 2n, provided certain statistical properties of the image are true. In particular, it is assumed that all brightness levels are equally likely, that is, intensities are uniformly distributed. However, in practice, this is very uncommon. Moreover, the scheme may not be robust to randomly jittering the intensity levels by a single unit, and be extremely sensitive to geometric affine transformations.
The second method is called "texture block coding", where a region of random texture pattern found in the image is copied to an area of the image with similar texture.
Autocorrelation is then used to recover each texture region. The most significant problem with this technique is that it is only appropriate for images that possess large areas of random texture. The technique could not be used on images of text, for example. Nor is there a direct analog for audio.
w ~ 218499 In addition to direct work on watermarking images, there are several works of interest in related areas. E.H. Adelson in U.S. Patent No. 4, 939,515 entitled "Digital Signal Encoding and Decoding Apparatus" describes a technique for embedding digital information in an analog signal for the purpose of inserting digital data into an analog TV
signal. The analog signal is quantized into one of two disjoint ranges ({0,2,4... }, { 1,3,5}, for example) which are selected based on the binary digit to be transmitted.
Thus Adelson's method is equivalent to watermark schemes that encode information into the least significant bits of the data or its transform coefficients. Adelson recognizes that the method is susceptible to noise and therefore proposes an alternative scheme wherein a 2x1 Hadamard transform of the digitized analog signal is taken. The differential coefficient of the Hadamard transform is offset by 0 or 1 unit prior to computing the inverse transform.
This corresponds to encoding the watermark into the least significant bit of the differential coefficient of the Hadamard transform. It is not clear that this approach would demonstrate enhanced resilience to noise. Furthermore, like all such least significant bit schemes, an attacker can eliminate the watermark by randomization.
U.S. Patent No. 5,010,405 describes a method of interleaving a standard NTSC
signal within an enhanced definition television (EDTV) signal. This is accomplished by analyzing the frequency spectrum of the EDTV signal (larger than that of the NTSC
signal) and decomposing it into three sub-bands (L,M,H for low, medium and high frequency respectively). In contrast, the NTSC signal is decomposed into two subbands, L
and M.
The coefficients, Mk, within the M band are quantized into M levels and the high frequency coe~cients, Hk, of the EDTV signal are scaled such that the addition of the H,; signal plus-any noise present in the system is less than the minimum separation between quantization levels. Once more, the method relies on modifying least significant bits.
Presumably, the mid-range rather than low frequencies were chosen because they are less perceptually significant. In contrast, the method proposed in the present invention modifies the most perceptually significant components of the signal.
Finally, it should be noted that many, if noC all, of the prior art protocols are not collusion resistant.
Recently, Digimarc Corporation of Portland, Oregon, has described work referred to as signature technology for use in identifying digital intellectual property.
Their method adds or subtracts small random quantities from each pixels. Addition or subtraction is based on comparing a binary mask of N bits with the least significant bit (LSB) of each pixel. If the LSB is equal to the corresponding mask bit, then the random quantity is added, otherwise it is subtracted. The watermark is extracted by first computing the difference between the original and watermarked images and then by examining the sign of the difference, pixel by pixel, to determine if it corresponds to the original sequence of additions/subtractions.
The Digimarc technique is not based on direct modifications of the image spectrum and does not make use of perceptual relevance. While the technique appears to be robust, it may be susceptible to constant brightness offsets and to attacks based on exploiting the high degree of local correlation present in an image. For example, randomly switching the position of similar pixels within a local neighborhood may significantly degrade the watermark without damaging the image.
In a paper by Koch, Rindfrey and Zhao entitled "Copyright Protection for Multimedia Data", two general methods for watermarking images are described. The first method partitions an image into 8x8 blocks of pixels and computes the Discrete Cosine Transform (DCT) of each of these blocks. A pseudorandom subset of the blocks is chosen and in each such block a triple of frequencies selected from one of 18 predetermined triples is modified so that their relative strengths encode a 1 or 0 value. The 18 possible triples are-composed by selection of three out of eight predetermined frequencies within the 8x 8 DCT block. The choice of the eight frequencies to be altered within the DCT
block appears to be based on the belief that middle frequencies have a moderate variance level, i.e., they have similar magnitude. This property is needed in order to allow the relative strength of the frequency triples to be altered without requiring a modification that would.
be perceptually noticeable. Unlike in the present invention, the set of frequencies is not ,... ~ 2184949 chosen based on any perceptual significance or relative energy considerations.
In addition, because the variance between the eight frequency coefficients is small, one would expect that the technique may be sensitive to noise or distortions. This is supported by the experimental results reported in the Koch et al paper, supra, where it is reported that the "embedded labels are robust against JPEG compression for a quality factor as low as about 50%". In contrast, the method described in accordance with the teachings of the present invention has been demonstrated with compression quality factors as low as 5 percent.
An earlier proposal by Koch and Zhao in a paper entitled "Toward Robust and Hidden Image Copyright Labeling" proposed not triples of frequencies but pairs of frequencies and was again designed specifically for robustness to JPEG compression.
Nevertheless, the report states that "a lower quality factor will increase the likelihood that the changes necessary to superimpose the embedded code on the signal will be noticeably visible".
In a second method, proposed by Koch and Zhao, designed for black and white images, no frequency transform is employed. Instead, the selected blocks are modified so that the relative frequency of white and black pixels encodes the final value. Both watermarking procedures are particularly vulnerable to multiple document attacks. To protect against this, Zhao and Koch proposed a distributed 8 x 8 block of pixels created by randomly sampling 64 pixels from the image. However, the resulting DCT has no relationship to that of the true image. Consequently, one would expect such distributed blocks to be both sensitive to noise and likely to cause noticeable artifacts in the image.
In summary, prior art digital watermarking techniques are not robust and the watermark is easy to remove. In addition, many prior techniques would not survive common signal and geometric distortions Summary of the Invention The present invention overcomes the limitations of the prior art methods by providing a watern~arking system that embeds an unique identifier into the perceptually significant components of a decomposition of an image, an audio signal or a video sequence.
Preferably, the decomposition is a spectral frequency decomposition. The watermark is embedded in the data's perceptually significant frequency components. This is because an effective watermark cannot be located in perceptually insignificant regions of image data or in its frequency spectrum, since many common signal or geometric processes affect these components. For example, a watermark located in the high frequency spectral components of an image is easily removed, with minor degradation to the image, by a process that performs low pass filtering. The issue then becomes one of how to insert the watermark into the most significant regions of the data frequency spectrum without the alteration being noticeable to an observer, i.e., a human or a machine feature recognition system. Any spectral component may be altered, provided the alteration is small.
However, very small alterations are susceptible to any noise present or intentional distortion.
In order to overcome this problem, the frequency domain of the image data or sound data may be considered as a communication channel, and correspondingly the watermark may be considered as a signal transmitted through the channel. Attacks and intentional signal distortions are thus treated as noise from which the transmitted signal must be immune.
Attacks are intentional efforts to remove, delete or otherwise overcome the beneficial aspects of the data watermarking. While the present invention is intended to embed watermarks in data, the same methodology can be applied to sending any type of message-through media data.
Instead of encoding the watermark into the least significant components of the data, the present invention considers applying concepts of spread spectrum communication. In spread spectrum communications, a narrowband signal is transmitted over a much larger bandwidth such that the signal energy present in any single frequency is imperceptible. In 2 ~ ~~~9~9 a similar manner, the watermark is spread over many frequency bins so that the energy in any single bin is small and imperceptible. Since the watermark verification process includes a priori knowledge of the locations and content of the watermarks, it is possible to concentrate these many weak signals into a single signal with a high signal to-noise ratio.
Destruction of such a watermark would require noise of high amplitude to be added to every frequency bin.
In accordance with the teachings of the present invention, a watermark is inserted into the perceptually most significant regions of the data decomposition. The watermark itself is designed to appear to be additive random noise and is spread throughout the image. By placing the watermark into the perceptually significant components, it is much more difficult for an attacker to add more noise to the components without adversely affecting the image or other data. It is the fact that the watermark looks like noise and is spread throughout the image or data which makes the present scheme appear to be similar to spread spectrum methods used in communications system.
Spreading the watermark throughout the spectrum of an image ensures a large measure of security against unintentional or intentional attack. First, the location of the watermark is not obvious. Second, frequency regions are selected in a fashion that ensures severe degradation of the original data following any attack on the watermark.
A watermark that is well placed in the frequency domain of an image or a sound track will be practically impossible to see or hear. This will always be the case if the energy in the watermark is sufficiently small in any single frequency coefficient. Moreover, it is possible-to increase the energy present in particular frequencies by exploiting knowledge of masking phenomena in the human auditory and visual systems. Perceptual masking refers to any situation where information in certain regions of an image or a sound is occluded by perceptually more prominent information in another part of the image or sound.
In digital waveform coding, this frequency domain (and in some cases, time/pixel domain) masking is exploited extensively to achieve low bit rate encoding of data. It is clear that both ~~~~949 ...
auditory and visual systems attach more resolution to the high energy, low frequency, spectral regions of an auditory or visual scene. Further, spectrum analysis of images and sounds reveals that most of the information in such data is often located in the low frequency regions.
In addition, particularly for processed or compressed data, perceptually significant need not refer to human perceptual significance, but may refer instead to machine perceptual significance, for instance, machine feature recognition.
To meet these requirements, a watermark is proposed whose structure comprises a large quantity, for instance 1000, of randomly generated numbers with a normal distribution having zero mean and unity variance. A binary watermark is not chosen because it is much less robust to attacks based on collusion of several independently watermarked copies of an image. However, generally, the watermark might have arbitrary structure, both deterministic and/or random, and including uniform distributions. The length of the proposed watermark is variable and can be adjusted to suit the characteristics of the data.
For example, longer watermarks might be used for images that are especially sensitive to large modifications of its spectral coefficients, thus requiring weaker scaling factors for individual components.
The watermark is then placed in components of the image spectrum. These components may be chosen based on an analysis of those components which are most vulnerable to attack and/or which are most perceptually significant. This ensures that the watermark remains with the image even after common signal and geometric distortions.
Modification-of these spectral components results in severe image degradation long before the watermark itself is destroyed. Of course, to insert the watermark, it is necessary to alter these very same coefficients. However, each modification can be extremely small and, in a manner similar to spread spectrum communication, a strong narrowband watermark may be distributed over a much broader image {channel) spectrum. Conceptually, detection of the watermark then proceeds by adding all of these very small signals, whose locations are 2i ~~9~9 only known to the copyright owner, and concentrating the watermark into a signal with high signal-to-noise ratio. Because the location of the watermark is only known to the copyright holder, an attacker would have to add very much more noise energy to each spectral coefficient in order to be confident of removing the watermark.
However, this process would destroy the image.
Preferably, a predetermined number of the largest coefficients of the DCT
(discrete cosine transform) (excluding the DC term) are used. However, the choice of the DCT is not critical to the algorithm and other spectral transforms, including wavelet type decompositions are also possible. In fact, use of the FFT rather than DCT is preferable from a computational perspective.
The invention will be more clearly understood when the following description is read in conjunction with the accompanying drawing.
Brief Description of the Drawing Figure 1 is a schematic representation of typical common processing operations to which data could be subjected;
Figure 2 is a schematic representation of a preferred system for immersing a watermark into an image;
Figures 3a and 3b are flow charts of the encoding and decoding of watermarks;
Figure 4 is a graph of the responses of the watermark detector to random watermarks;
Figure 5 is a graph of the response of the watermark detector to random watermarks for an image which is successively watermarked five times;
2~~4~49 Figure 6 is a graph of the response of the watermark detector to random watermarks where five images, each having a different watermark, and averaged together;
and Figure 7 is a schematic diagram of an optical embodiment of the present invention Detailed Description In order to better understand the advantages of the invention, the preferred embodiment of a frequency spectrum based watermarking system will be described. It is instructive to examine the processing stages that image (or sound) data may undergo in the copying process and to consider the effect that such processing stages can have on the data.
Referring to Figure 1, a watermarked image or sound data 10 is transmitted 12 to undergo typical distortion or intentional tampering 14. Such distortions or tampering includes lossy compression 16, geometric distortion 18, signal processing 20 and D/A
and AID
conversion 22. After undergoing distortion or tampering, corrupted watermarked image or sound data 24 is transmitted 26. The process of "transmission" refers to the application of any source or channel code and/or of encryption techniques to the data.
While most transmission steps are information lossless, many compression schemes (e.g., JPEG, MPEG, etc.) may potentially degrade the quality of the data through irretrievable loss of data. In general, a watermarking method should be resilient to any distortions introduced by transmission or compression algorithms. -L.ossy compression 16 is an operation that usually eliminates perceptually ,irrelevant components of image or sound data. In order to preserve a watermark when undergoing lossy compression, the watermark is located in a perceptually significant region of the data. Most processing of this type occurs in the frequency domain. Data loss usually occurs in the high frequency components. Thus, the waternnark must be placed in the z ~ sa9a~
,...
significant frequency component of the image (or sound) data spectrum to minimize the adverse affects of lossy compression.
After receipt, an image may encounter many common transformations that are broadly categorized as geometric distortions or signal distortions. Geometric distortions 18 are specific to image and video data, and include such operations as rotation, translation, scaling and cropping. By manually determining a minimum of four or nine corresponding points between the original and the distorted watermark, it is possible to remove any two or three dimensional affine transformation. However, an affine scaling (shrinking) of the image results in a loss of data in the high frequency spectral regions of the image.
Cropping, or the cutting out and removal of portions of an image, also results in irretrievable loss of data. Cropping may be a serious threat to any spatially based watermark but is less likely to affect a frequency-based scheme.
Common signal distortions include digital-to-analog and analog-to-digital conversion 22, resampling, requantization, including dithering and recompression, and common signal enhancements to image contrast and/or color, and audio frequency equalization.
Many of these distorrtions are non-linear, and it is difficult to analyze their effect in either a spatial or frequency based method. However, the fact that the original image is known allows many signal transformations to be undone, at least approximately. For example, histogram equalization, a common non-linear contrast enhancement method, may be substantially removed by histogram specification or dynamic histogram warping techniques.
Finally, the copied image may not remain in digital form. Instead, it is likely to be printed -or an analog recording made (analog audio or video tape). These reproductions introduce additional degradation into the image data that a watermarking scheme must be robust to.
Tampering ( or attack) refers to any intentional attempt to remove the watermark, or corrupt it beyond recognition. The watermark must not only be resistant to the inadvertent application of distortions. It must also be immune to intentional manipulation by malicious parties. These manipulations can include combinations of distortions, and can also include collusion and forgery attacks.
Figure 2 shows a preferred system for inserting a watermark into an image in the frequency domain. Image data X(i,j) assumed to be in digital form, or alternatively data in other formats such as photographs, paintings or the like, that have been previously digitized by well-known methods, is subject to a frequency transformation 30, such as the Fourier transform. A watermark signal W (k) is inserted into the frequency spectrum components of the transformed image data 32 applying the techniques described below.
The frequency spectrum image data including the watermark signal is subjected to an inverse frequency transform 34, resulting in watermarked image data X(i, j) , which may remain in digital form or be printed as an analog representation by well-known methods.
After applying a frequency transformation to the image data 30, a perceptual mask is computed that highlights prominent regions in the frequency spectrum capable of supporting the watermark without overly affecting perceptual fidelity. This may be performed by using knowledge of the perceptual significance of each frequency in the spectrum, as discussed earlier, or simply by ranking the frequencies based on their energy.
The latter method was used in experiments described below.
In general, it is desired to place the watermark in regions of the spectrum that are least affected by common signal distortions and are most significant to image quality as perceived by a viewer, such that significant mod~cation would destroy the image fidelity.
In practice, these regions could be experimentally identified by applying common signal distortions to images and examining which frequencies are most affected, and by psychophysical studies to identify how much each component may be modified before significant changes in the image are perceivable.
The watermark signal is then inserted into these prominent regions in a way that makes any tampering create visible (or audible) defects in the data. The requirements of the 21~~~49 watermark mentioned above and the distortions common to copying provide constraints on the design of an electronic watermark 1n order to better understand the watermarking method, reference is made to Figures 3(a) and 3(b) where from each document D a sequence of values X=x,,...,xn is extracted 40 with which a watermark W=w,,...,wo is combined 42 to create an adjusted sequence Of values X'=x',,...,x'o which is then inserted back 44 into the document in place of values X
in order to obtain a watermark document D'. An attack of the document D', or other distortion, will produce a document D*. Having the original document D and the document D*, a possibly corrupted watermark W* is extracted 46 and compared to watermark W 48 for statistical analysis 50. The values W* are extracted by first extracting a set of values X*=xl*,...,xo* from D* (using information about D) and then generating W* from the values X* and the values X.
When combining the values X with the watermark values W in step 42, scaling parameter a is specified. The scaling parameter a determines the extent to which values W alter values X. Three preferred formulas for computing X' are:
x; = x; + aw; (1) x; = x; (1 + aw; ) (2) x; = x; (e°°"' ) (3) Equation 1 is invertible. Equations 2 and 3 are invertible when x;$0.
Therefore, given X*
it is possible to compute the inverse function necessary to derive W* from X
and X*.
Equation 1 is not the preferred formula when the values x; vary over a wide range. For example, if x;=106 then adding 100 may be insufficient to establish a watermark, but if x;=10, then adding 100 will unacceptably distort the value. Insertion methods using equations 2 and 3 are more robust when encountering such a wide range of values x;. It 2 ~ ~49~ 9 will also be observed that equation 2 and 3 yield similar results when aw; is small.
Moreover, when x; is positive, equation 3 is equivalent to ln(x;) = ln(x;) +ax; and may be considered as an application of equation 1 when natural logarithms of the original values are used. For example, if Iw;l 51 and a=0.01, then using Equation (2) guarantees that the spectral coe~cient will change by no more than 1 %
For certain applications, a single scaling parameter a may not be best for combining all values of x;. Therefore, multiple scaling parameters oc;,...,oco can be used with revised equations 1 to 3 such as x;=x; ( 1+a;w;). The values of a; serve as a relative measure of how much x; must be altered to change the perceptual quality of the document.
A large value for a; means that it is possible to alter x; by a large amount without perceptually degrading the document.
A method for selecting the multiple scaling values is based upon certain general assumptions. For example, equation 2 is a special case of the generalized equation 1, (x;'=x;+ oc;x;), for a;=ax;. That is , equation 2 makes the reasonable assumption that a large value of x; is less sensitive to additive alteration that a small value of x;.
Generally,.the sensitivity of the image to different values of a; is unknown.
A method of empirically estimating the sensitivities is to determine the distortion caused by a number of attacks on the original image. For example, it is possible to compute a degraded image D* from D, extract the corresponding values xl*,...,xn* and select a; to be proportional to the deviation Ix;*-x;i. For greater robustness, it is possible to try other forms of distortion and make a; proportional to the average value of (x;*-x;l. Instead of using the average duration, it is possible to use the median or maximum deviation.
Alternatively, it is possible to combine the empirical approach with general global assumptions regarding the sensitivity of the values. For example, it might be required that 2~~49~9 a; _> a; whenever x; >x;. This can be combined with the empirical approach by setting a;
according to max Iv'. -v.l {jlv~5v;}
A more sophisticated approach is to weaken the monotonicity constraint to be robust against occasional outliers.
The length of the watermark, n, determines the degree to which the watermark is spread among the relevant components of the image data. As the size of the watermark increases, so does the number of altered spectral components, and the extent to which each component need be altered decreases for the same resilience to noise.
Consider watermarks of the form x;'=x;+ocw; and a white noise attack by x;'=x;' +r;, where r; are chosen according to independent normal distributions with standard deviation 6. It is possible to recover the watermark when a is proportional to ~~-. That is, quadrupling n the number of components can halve the magnitude of the watermark placed into each component. The sum of the squares of the deviations remains essentially unchanged.
In general, a watermark comprises an arbitrary sequence of real numbers W=w;,...,wn. In practice, each value w; may be chosen independently'from a normal distribution N(0,1 ), where N(p,, c~) with mean p, and variance oz or of a uniform distribution from { 1,-1 }. or {~ 1}.
It is highly unlikely that the extracted mark W* will be identical to the original watermark W. Even the act of requantizing the watermarked document for transmission will cause W* to deviate from W. A preferred measure of the similarity of W and W* is sim(W, W*) _ ~ * . ~ * (4) Large values of sim (W,W*) are significant in view of the following analysis.
Assume that the authors of document D* had no access to W (either through the seller or through a watermarked document). Then for whatever value of W* is obtained, the conditional distribution on w; will be independently distributed according to N(0,1). In this case, n N(0,~,x;2)=N(O,W~~Wi).
Thus, sim(W, W*) is distributed according to N(0,1). Then, one may apply the standard significance tests for the normal distribution. For example, if D* is chosen independently from W, then it is very unlikely that sim(W,W*) > 5. Note that somewhat higher values of sim (W,W*) may be needed when a large number of watermarks are on file. The above analysis required only the independence of W from W*, and did not rely on any specific properties of W* itself. This fact provides further flexibility when preprocessing W*.
The extracted watermark W* may be extracted in several ways to potentially enhance the ability to extract a watermark. For example, experiments on images encountered instances where the average value of W*, denoted E; (W*), differed substantially from 0, due to the effects of a dithering procedure. While this artifact could be easily eliminated as part of the extraction process, it provides a motivation for postprocessing extracted watermarks.
As a result, it was discovered that the simple transformation w;* ~w;*-E;(W*) yielded superior values of sim (W,W*). The improved performance resulted from the decreased value of W*~ W*; the value of W*~ W was only slightly affected.
In experiments it was frequently observed that w;* could be greatly distorted for some values of i. One postprocessing option is to simply ignore such values, setting them to 0.
That is, *
w* ~ wl if Iw; ( > tolerance 0 otherwise The goal of such a transformation is to lower W* ~ W*. A less abrupt version of this approach is to normalize the W* values to be either -1,0 or 1, by ,,~.~.
wl E-sign(wl -E1 (W*)).
This transformation can have a dramatic effect on the statistical significance of the result.
Other robust statistical techniques could also be used to suppress outlier effects.
In principle, any frequency domain transform can be used. In the scheme described below, a Fourier domain method is used, but the use of wavelet based schemes are also useable as a variation. In terms of selecting frequency regions of the transform, it is possible to use models for the perceptual system under consideration.
Frequency analysis may be performed by a wavelet or sub-band transform where the signal is divided into sub-bands by means of a wavelet or multi-resolution transform.
The sub-bands need not be uniformly spaced. Each sub-band may be thought of as representing a frequency region in the domain corresponding to a sub-region of the frequency range of the signal. The watermark is then inserted into the sub-regions.
For audio data, a sliding "window" moves along the signal data and the frequency transform (DCT, FFT, etc.) is taken of. the sample in the window. This process enables the capture of meaningful information of a signal that is time varying in nature.
Each coefficient in the frequency domain is assumed to have a perceptual capacity. That is, it can support the insertion of additional information without any (or with minimal) impact to the perceptual fidelity of the data.
In order to place a length L watermark into an N x N image, the N x N FFT (or DCT) of the image is computed and the watermark is placed into the L highest magnitude coefficients of the transform matrix, excluding the DC component. More generally, L
randomly chosen coefficients could be chosen from the M, M> L most perceptually significant coefficients of the transform. For most images, these coefficients will be the ones corresponding to the low frequencies. The purpose of placing the watermark in these locations is because significant tampering with these frequencies will destroy the image fidelity or perceived quality well before the watermark is destroyed The FFT provides perceptually similar results to the DCT. This is different than the case of transform coding, where the DCT is preferred to the FFT due to its spectral properties.
The DCT tends to have less high frequency information than that the FFT, and places most of the image information in the low frequency regions, making it preferable in situations where data need to be eliminated. In the case of watermarking, image data is preserved, and nothing is eliminated. Thus the FFT is as good as the DCT, and is preferred since it is easier to compute.
In an experiment, a visually imperceptible watermark was intentionally placed in an image.
Subsequently, 100 randomly generated watermarks, only one of which corresponded to the correct watermark, were applied to the watermark detector described above.
The result, as shown in Figure 4, was a very strong positive response corresponding to the correct watermark, suggesting that the method results in a very low number of false positive responses and a very low false negative response rate.
In another test, the watermarked image was scaled to half of its original size. In order to recover the watermark, the image was re-scaled to its original size, albeit with loss of detail due to subsampling of the image using low pass spatial filter operations. The response of the watermark detector was well above random chance levels, suggesting that the watermark is robust to geometric distortions. This result was achieved even though 75 percent of the original data was missing from the scaled down image. -In a further experiment, a JPEG encoded version of the image with parameters of 10 percent quality and 0 percent smoothing, resulting in visible distortions, was used. The results of the watermark detector suggest that the method is robust to common encoding distortions. Even using a version of the image with parameters of the 5 percent quality and 0 percent smoothing, the results were well above that achievable due to random chance.
In experiments using a dithered version of the image, the response of the watermark detector suggested that the method is robust to common encoding distortion.
Moreover, more reliable detection is achieved by removing any non-zero mean from the extracted watermark.
In another experiment, the image was clipped, leaving only the central quarter of the image. In order to extract the watermark from the clipped image, the missing portion of the image was replaced with portions from the original unwatermarked image.
The watermark detector was able to recover the watermark with a response greater than random. When the non-zero mean was removed, and the elements of the watermark were binarized prior to the comparison with the correct watermark, the detector response was improved. This result is achieved even though 75 percent of the data was removed from the image.
In yet another experiment, the image was printed, photocopied, scanned using a 300 dpi Umax PS-2400x scanner and rescaled to a size of 256 x 256 pixels. Clearly, the final image suffered from different levels of distortion introduced at each process.
High frequency pattern noise was particularly noticeable. When the non-zero mean was removed and only the sign of the elements of the watermark was used, the watermark detector response improved to well above random chance levels.
In still another experiment, the image was subject to five successive watermarking operations. That is, the original image was watermarked, the watermarked image was watermarked, and so forth. The process may be considered another form of attack in which it is clear that significant image degradation occurs if the process is repeated.
Figure S shows the response of the watermark detector to 1000 randomly generated watermarks, including the five watermarks present in the image. The five dominant spikes -~ ~ 21 ~~949 in the graph, indicative of the presence of the five watermarks, show that successive watermarking does not interfere with the process.
The fact that successive watermarking is possible means that the history or pedigree of a document is determinable if successive watermarking is added with each copy.
1n a variation of the multiple watermark image, five separately watermarked images were averaged together to simulate simple conclusion attack. Figure 6 shows the response of the watermark detector to 1000 randomly generated watermarks, including the five watermarks present in the original images. The result is that simple collusion based on averaging is ineffective in defeating the present watermarking system.
The result of the above experiments is that the described system can extract a reliable copy of the watermark from images that have been significantly degraded through several common geometric and signal processing procedures. These procedures include zooming (low pass filtering), cropping, lossy JPEG encoding, dithering, printing, photocopying and subsequent rescanning.
While these experiments were, in fact, conducted using an image, similar results are attainable with text images, audio data and video data, although attention must be paid to the time varying nature of these data.
The above implementation of the watermarking system is an electronic system.
Since the basic principle of the invention is the inclusion of a watermark into spectral frequency -components of the data, watermarking can be accomplished by other means using, for example, an optical system as shown in Figure 7. .
In Figure 7, data to be watermarked such as an image 40 is passed through a spatial transform lens 42, such as a Fourier transform lens, the output of which lens is the spatial transform of the image. Concurrently, a watermark image 44 is passed through a second ~~~~~~9 spatial transform lens 46, the output of which lens is the spatial transfer of the watermark image 44. The spatial transform from lens 42 and the spatial transform from lens 46 are combined at an optical combiner 48. The output of the optical combiner 48 is passed through an inverse spatial transform lens 50 from which the watermark image 52 is present. The result is a unique, virtually imperceptible, watermarked image.
Similar results are achievable by transmitting video or multimedia signals through the lenses in the manner described above.
While there have been described and illustrated spread spectrum watermarking of data and variations and modifications thereof, it will be apparent to those skilled in the art that further variations and modifications are possible without deviating from the broad principles and spirit of the present invention which shall be limited solely by the scope of the claims appended hereto.
What is claimed is:
Claims (30)
PROPERTY OR PRIVILEGE IS CLAIMED ARE DEFINED AS FOLLOWS:
1. A method of inserting a watermark into data, comprising the steps of:
obtaining a decomposition of data to be watermarked;
inserting a watermark into perceptually-significant components of the decomposition of data; and, applying an inverse transform to the decomposition of data with the watermark for generating watermarked data.
obtaining a decomposition of data to be watermarked;
inserting a watermark into perceptually-significant components of the decomposition of data; and, applying an inverse transform to the decomposition of data with the watermark for generating watermarked data.
2. A method of inserting a watermark into data as set forth in claim 1, wherein said data comprises image data.
3. A method of inserting a watermark into data as set forth in claim 1, wherein said data comprises video data.
4. A method of inserting a watermark into data as set forth in claim 1, wherein said data comprises audio data.
5. A method of inserting a watermark into data as set forth in claim 1, wherein said data comprises multimedia data.
6. A method of inserting a watermark into data as set forth in claim 1, wherein said inserting a watermark inserts watermark values so that addition of an additional signal into the perceptually-significant components affects a perceived quality of the data.
7. A method of inserting a watermark into data as set forth in claim 1, said obtaining a decomposition of data being obtaining a spectral decomposition of data.
8. A method of inserting a watermark into data as set forth in claim 7, wherein said data comprises image data.
9. A method of inserting a watermark into data as set forth in claim 7, wherein said data comprises video data.
10. A method of inserting a watermark into data as set forth in claim 7, wherein said data comprises audio data.
11. A method of inserting a watermark into data as set forth in claim 7, wherein said data comprises multimedia data.
12. A method of inserting a watermark into data as set forth in claim 7, wherein said obtaining a spectral decomposition of data is selected from the group consisting of Fourier transformation, discrete cosine transformation, Hadamard transformation, and wavelet, multi-resolution, sub-band method.
13. A method of inserting a watermark into data as set forth in claim 12, wherein said inserting a watermark inserts watermark values so that addition of an additional signal into the perceptually-significant components affects a perceived quality of the data.
14. A method of inserting a watermark into data as set forth in claim 7, further comprising:
comparing data with watermarked data for obtaining extracted data values;
comparing extracted data values with watermark values and data for obtaining difference values; and, analyzing difference values to determine the watermark in the watermarked data.
comparing data with watermarked data for obtaining extracted data values;
comparing extracted data values with watermark values and data for obtaining difference values; and, analyzing difference values to determine the watermark in the watermarked data.
15. A method of inserting a watermark into data as set forth in claim 14, wherein watermark values include associated scaling parameters.
16. A method of inserting a watermark into data as set forth in claim 15, wherein scaling parameters are selected such that adding an additional watermark value affects a perceived quality of the data.
17. A method of inserting a watermark into data as set forth in claim 14, wherein the watermark values are chosen according to a normal distribution.
18. A method of inserting a watermark into data comprising the steps of:
extracting values of perceptually-significant components of a spectral decomposition of data;
combining watermark values with the extracted values to create adjusted values; and, inserting the adjusted values into the data in place of the extracted values to produce watermarked data.
extracting values of perceptually-significant components of a spectral decomposition of data;
combining watermark values with the extracted values to create adjusted values; and, inserting the adjusted values into the data in place of the extracted values to produce watermarked data.
19. A method of inserting a watermark into data as set forth in claim 18, wherein watermark values include associated scaling parameters.
20. A method of inserting a watermark into data as set forth in claim 19, wherein scaling parameters are selected such that adding an additional watermark value affects a perceived quality of the data.
21. A method of inserting a watermark into data as set forth in claim 18, wherein the watermark values are chosen according to a random distribution.
22. A method of inserting a watermark into data as set forth in claim 18, further comprising:
comparing data with watermarked data for obtaining extracted data values;
comparing extracted data values with watermark values and data for obtaining difference values; and, analyzing difference values to determine the watermark in the watermarked data.
comparing data with watermarked data for obtaining extracted data values;
comparing extracted data values with watermark values and data for obtaining difference values; and, analyzing difference values to determine the watermark in the watermarked data.
23. A method of inserting a watermark into data as set forth in claim 22, wherein watermark values include associated scaling parameters.
24. A method of inserting a watermark into data as set forth in claim 23, wherein scaling parameters are selected such that adding an additional watermark value affects a perceived quality of the data.
25. A method of inserting a watermark into data as set forth in claim 22, wherein the watermark values are chosen according to a random distribution.
26. A method of inserting a watermark into data as set forth in claim 22, further comprising the step of preprocessing distorted or tampered watermarked data before said comparing data.
27. A method of inserting a watermark into data as set forth in claim 26, wherein said distorted or tampered watermarked data is clipped data, and wherein said preprocessing comprises replacing missing portions of the data with corresponding portions from original unwatermarked data.
28. A system for inserting a watermark into data comprising:
providing image data;
providing watermark image data;
first transform lens for transforming image data passing therethrough into transformed image data;
second transform lens for transforming watermark image data passing therethrough into transformed watermark image data;
optical combiner for combining the transformed image data and the transformed watermark image data to form transformed watermarked data; and, inverse transform lens for forming watermarked data by inverse transformation of transformed watermarked data.
providing image data;
providing watermark image data;
first transform lens for transforming image data passing therethrough into transformed image data;
second transform lens for transforming watermark image data passing therethrough into transformed watermark image data;
optical combiner for combining the transformed image data and the transformed watermark image data to form transformed watermarked data; and, inverse transform lens for forming watermarked data by inverse transformation of transformed watermarked data.
29. A system for inserting a watermark into data as set forth in claim 28, wherein said first transform lens and said second transform lens are Fourier transform lenses, and wherein said inverse transform lens is an inverse Fourier transform lens.
30. A method of inserting a watermark into data, comprising the steps of:
obtaining a decomposition of data to be watermarked;
modifying the data to be watermarked by subjecting the data to distortion and/or tampering;
obtaining a decomposition of the modified data;
comparing the components of the decomposition of data to be watermarked with the components of the decomposition of the modified data; and, inserting a watermark into the data to be watermarked based upon said comparing.
obtaining a decomposition of data to be watermarked;
modifying the data to be watermarked by subjecting the data to distortion and/or tampering;
obtaining a decomposition of the modified data;
comparing the components of the decomposition of data to be watermarked with the components of the decomposition of the modified data; and, inserting a watermark into the data to be watermarked based upon said comparing.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US53489495A | 1995-09-28 | 1995-09-28 | |
US08/534,894 | 1995-09-28 |
Publications (2)
Publication Number | Publication Date |
---|---|
CA2184949A1 CA2184949A1 (en) | 1997-03-29 |
CA2184949C true CA2184949C (en) | 2000-05-30 |
Family
ID=24131962
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002184949A Expired - Fee Related CA2184949C (en) | 1995-09-28 | 1996-09-06 | Secure spread spectrum watermarking for multimedia data |
Country Status (6)
Country | Link |
---|---|
US (1) | US5930369A (en) |
EP (1) | EP0766468B1 (en) |
JP (1) | JP3522056B2 (en) |
AU (1) | AU701639B2 (en) |
CA (1) | CA2184949C (en) |
DE (1) | DE69636084T2 (en) |
Families Citing this family (475)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10361802B1 (en) | 1999-02-01 | 2019-07-23 | Blanding Hovenweep, Llc | Adaptive pattern recognition based control system and method |
US6408082B1 (en) | 1996-04-25 | 2002-06-18 | Digimarc Corporation | Watermark detection using a fourier mellin transform |
US6611607B1 (en) | 1993-11-18 | 2003-08-26 | Digimarc Corporation | Integrating digital watermarks in multimedia content |
US6636615B1 (en) | 1998-01-20 | 2003-10-21 | Digimarc Corporation | Methods and systems using multiple watermarks |
US6122403A (en) | 1995-07-27 | 2000-09-19 | Digimarc Corporation | Computer system linked by using information in data objects |
US5822436A (en) * | 1996-04-25 | 1998-10-13 | Digimarc Corporation | Photographic products and methods employing embedded information |
US6614914B1 (en) | 1995-05-08 | 2003-09-02 | Digimarc Corporation | Watermark embedder and reader |
US7171016B1 (en) * | 1993-11-18 | 2007-01-30 | Digimarc Corporation | Method for monitoring internet dissemination of image, video and/or audio files |
US6516079B1 (en) | 2000-02-14 | 2003-02-04 | Digimarc Corporation | Digital watermark screening and detecting strategies |
US7116781B2 (en) * | 1993-11-18 | 2006-10-03 | Digimarc Corporation | Counteracting geometric distortions in watermarking |
US6574350B1 (en) * | 1995-05-08 | 2003-06-03 | Digimarc Corporation | Digital watermarking employing both frail and robust watermarks |
US5748763A (en) * | 1993-11-18 | 1998-05-05 | Digimarc Corporation | Image steganography system featuring perceptually adaptive and globally scalable signal embedding |
US6424725B1 (en) * | 1996-05-16 | 2002-07-23 | Digimarc Corporation | Determining transformations of media signals with embedded code signals |
US6763122B1 (en) | 1999-11-05 | 2004-07-13 | Tony Rodriguez | Watermarking an image in color plane separations and detecting such watermarks |
US6985600B2 (en) * | 1994-03-17 | 2006-01-10 | Digimarc Corporation | Printing media and methods employing digital watermarking |
US8094949B1 (en) | 1994-10-21 | 2012-01-10 | Digimarc Corporation | Music methods and systems |
US7724919B2 (en) | 1994-10-21 | 2010-05-25 | Digimarc Corporation | Methods and systems for steganographic processing |
US6560349B1 (en) | 1994-10-21 | 2003-05-06 | Digimarc Corporation | Audio monitoring using steganographic information |
US7986806B2 (en) * | 1994-11-16 | 2011-07-26 | Digimarc Corporation | Paper products and physical objects as means to access and control a computer or to navigate over or act as a portal on a network |
US7362775B1 (en) | 1996-07-02 | 2008-04-22 | Wistaria Trading, Inc. | Exchange mechanisms for digital information packages with bandwidth securitization, multichannel digital watermarks, and key management |
US5745569A (en) * | 1996-01-17 | 1998-04-28 | The Dice Company | Method for stega-cipher protection of computer code |
US6590996B1 (en) | 2000-02-14 | 2003-07-08 | Digimarc Corporation | Color adaptive watermarking |
US6721440B2 (en) | 1995-05-08 | 2004-04-13 | Digimarc Corporation | Low visibility watermarks using an out-of-phase color |
US6718046B2 (en) | 1995-05-08 | 2004-04-06 | Digimarc Corporation | Low visibility watermark using time decay fluorescence |
US6763123B2 (en) | 1995-05-08 | 2004-07-13 | Digimarc Corporation | Detection of out-of-phase low visibility watermarks |
US6744906B2 (en) * | 1995-05-08 | 2004-06-01 | Digimarc Corporation | Methods and systems using multiple watermarks |
US7224819B2 (en) * | 1995-05-08 | 2007-05-29 | Digimarc Corporation | Integrating digital watermarks in multimedia content |
US5613004A (en) | 1995-06-07 | 1997-03-18 | The Dice Company | Steganographic method and device |
US6505160B1 (en) * | 1995-07-27 | 2003-01-07 | Digimarc Corporation | Connected audio and other media objects |
US7562392B1 (en) * | 1999-05-19 | 2009-07-14 | Digimarc Corporation | Methods of interacting with audio and ambient music |
US7006661B2 (en) | 1995-07-27 | 2006-02-28 | Digimarc Corp | Digital watermarking systems and methods |
US6829368B2 (en) | 2000-01-26 | 2004-12-07 | Digimarc Corporation | Establishing and interacting with on-line media collections using identifiers in media signals |
US8379908B2 (en) | 1995-07-27 | 2013-02-19 | Digimarc Corporation | Embedding and reading codes on objects |
US7664263B2 (en) | 1998-03-24 | 2010-02-16 | Moskowitz Scott A | Method for combining transfer functions with predetermined key creation |
US6205249B1 (en) | 1998-04-02 | 2001-03-20 | Scott A. Moskowitz | Multiple transform utilization and applications for secure digital watermarking |
US7685426B2 (en) * | 1996-05-07 | 2010-03-23 | Digimarc Corporation | Managing and indexing content on a network with image bookmarks and digital watermarks |
US6307949B1 (en) * | 1996-05-07 | 2001-10-23 | Digimarc Corporation | Methods for optimizing watermark detection |
US6229924B1 (en) * | 1996-05-16 | 2001-05-08 | Digimarc Corporation | Method and apparatus for watermarking video images |
US6381341B1 (en) | 1996-05-16 | 2002-04-30 | Digimarc Corporation | Watermark encoding method exploiting biases inherent in original signal |
US7930546B2 (en) * | 1996-05-16 | 2011-04-19 | Digimarc Corporation | Methods, systems, and sub-combinations useful in media identification |
US6209096B1 (en) | 1996-07-02 | 2001-03-27 | Yamaha Corporation | Method and device for storing main information with associated additional information incorporated therein |
US7095874B2 (en) | 1996-07-02 | 2006-08-22 | Wistaria Trading, Inc. | Optimization methods for the insertion, protection, and detection of digital watermarks in digitized data |
US7177429B2 (en) | 2000-12-07 | 2007-02-13 | Blue Spike, Inc. | System and methods for permitting open access to data objects and for securing data within the data objects |
US7346472B1 (en) | 2000-09-07 | 2008-03-18 | Blue Spike, Inc. | Method and device for monitoring and analyzing signals |
US7457962B2 (en) | 1996-07-02 | 2008-11-25 | Wistaria Trading, Inc | Optimization methods for the insertion, protection, and detection of digital watermarks in digitized data |
GB0023099D0 (en) * | 1996-07-02 | 2000-11-01 | Yamaha Corp | Method and device for storing main information with associated additional information incorporated therein |
US5889868A (en) * | 1996-07-02 | 1999-03-30 | The Dice Company | Optimization methods for the insertion, protection, and detection of digital watermarks in digitized data |
US7159116B2 (en) | 1999-12-07 | 2007-01-02 | Blue Spike, Inc. | Systems, methods and devices for trusted transactions |
DE69734207T2 (en) * | 1996-07-16 | 2006-06-14 | Koninkl Philips Electronics Nv | DETECTION OF AN EMBEDDED WATERMARK IN AN INFORMATION SIGNAL |
US6282299B1 (en) | 1996-08-30 | 2001-08-28 | Regents Of The University Of Minnesota | Method and apparatus for video watermarking using perceptual masks |
US6226387B1 (en) * | 1996-08-30 | 2001-05-01 | Regents Of The University Of Minnesota | Method and apparatus for scene-based video watermarking |
US7366908B2 (en) | 1996-08-30 | 2008-04-29 | Digimarc Corporation | Digital watermarking with content dependent keys and autocorrelation properties for synchronization |
US6069914A (en) * | 1996-09-19 | 2000-05-30 | Nec Research Institute, Inc. | Watermarking of image data using MPEG/JPEG coefficients |
JP3109575B2 (en) | 1996-09-30 | 2000-11-20 | 日本電気株式会社 | Image data processing device |
US5915027A (en) * | 1996-11-05 | 1999-06-22 | Nec Research Institute | Digital watermarking |
JP3649537B2 (en) * | 1996-11-27 | 2005-05-18 | 日本アイ・ビー・エム株式会社 | Data hiding method and data extracting method |
US7730317B2 (en) | 1996-12-20 | 2010-06-01 | Wistaria Trading, Inc. | Linear predictive coding implementation of digital watermarks |
GB9700854D0 (en) | 1997-01-16 | 1997-03-05 | Scient Generics Ltd | Sub-audible acoustic data transmission mechanism |
AU5337598A (en) * | 1997-01-27 | 1998-08-18 | Koninklijke Philips Electronics N.V. | System for copy protection of recorded signals |
US6185312B1 (en) | 1997-01-28 | 2001-02-06 | Nippon Telegraph And Telephone Corporation | Method for embedding and reading watermark-information in digital form, and apparatus thereof |
CA2227381C (en) * | 1997-02-14 | 2001-05-29 | Nec Corporation | Image data encoding system and image inputting apparatus |
JP3686741B2 (en) * | 1997-02-19 | 2005-08-24 | 富士通株式会社 | Identification information embedding method in image data, identification information extraction method from image data in which identification information is embedded, identification information embedding device in image data, identification information extraction device from image data in which identification information is embedded, and computer Readable medium |
AUPO521897A0 (en) * | 1997-02-20 | 1997-04-11 | Telstra R & D Management Pty Ltd | Invisible digital watermarks |
JP3137022B2 (en) * | 1997-02-24 | 2001-02-19 | 日本電気株式会社 | Video encoding device |
EP0860997B1 (en) * | 1997-02-24 | 2008-12-10 | Nec Corporation | Digital data encode system |
KR100280953B1 (en) * | 1997-03-05 | 2001-02-01 | 가네꼬 히사시 | An image data processing apparatus and a program storage recording medium for processing the image data |
BR9714592A (en) * | 1997-03-21 | 2005-04-12 | Canal & Sa Empresa De Telecomu | Data download process for an mpeg receiver / decoder set and an mpeg transmission system for implementation |
GB2324669A (en) * | 1997-04-23 | 1998-10-28 | Ibm | Controlling video or image presentation according to encoded content classification information within the video or image data |
KR19980086811A (en) * | 1997-05-08 | 1998-12-05 | 니시무로 타이조 | Apparatus, method and recording medium for embedding and reproducing additional information |
US6427012B1 (en) * | 1997-05-19 | 2002-07-30 | Verance Corporation | Apparatus and method for embedding and extracting information in analog signals using replica modulation |
US5940135A (en) * | 1997-05-19 | 1999-08-17 | Aris Technologies, Inc. | Apparatus and method for encoding and decoding information in analog signals |
EP0920775A2 (en) * | 1997-05-29 | 1999-06-09 | Koninklijke Philips Electronics N.V. | Method and arrangement for detecting a watermark |
JPH114337A (en) * | 1997-06-11 | 1999-01-06 | Canon Inc | Image processor and image processing method |
JPH118753A (en) * | 1997-06-18 | 1999-01-12 | Nec Corp | Electronic watermark insertion device |
ES2142234B1 (en) * | 1997-06-27 | 2000-09-16 | Telefonica Sa | NEW MARKER AND READER OF DOCUMENTS. |
JPH1132200A (en) | 1997-07-09 | 1999-02-02 | Matsushita Electric Ind Co Ltd | Watermark data insertion method and watermark data detection method |
US6959383B1 (en) | 1997-07-10 | 2005-10-25 | Yamaha Corporation | Method and device for incorporating additional information into main information through electronic watermaking technique |
US8155375B2 (en) * | 1997-07-24 | 2012-04-10 | Regents Of The University Of Minnesota | Video watermarking using temporal analysis |
KR100583359B1 (en) * | 1997-09-02 | 2006-05-25 | 코닌클리케 필립스 일렉트로닉스 엔.브이. | Method and arrangement for detecting a watermark |
CA2271042A1 (en) * | 1997-09-02 | 1999-03-11 | Koninklijke Philips Electronics N.V. | Watermarking an information signal |
EP0901274B1 (en) | 1997-09-03 | 2004-04-07 | Hitachi, Ltd. | Method and system for embedding information into contents |
US6208735B1 (en) * | 1997-09-10 | 2001-03-27 | Nec Research Institute, Inc. | Secure spread spectrum watermarking for multimedia data |
JP3662398B2 (en) * | 1997-09-17 | 2005-06-22 | パイオニア株式会社 | Digital watermark superimposing device and digital watermark detecting device |
US6823074B1 (en) | 1997-09-17 | 2004-11-23 | Pioneer Corporation | Digital-watermark superposing apparatus and digital-watermarker detecting apparatus |
EP0905967A1 (en) * | 1997-09-26 | 1999-03-31 | Digital Copyright Technologies AG | Method for generating digital watermarks and for exchanging data containing digital watermarks |
US6611599B2 (en) | 1997-09-29 | 2003-08-26 | Hewlett-Packard Development Company, L.P. | Watermarking of digital object |
JPH11196262A (en) | 1997-11-07 | 1999-07-21 | Matsushita Electric Ind Co Ltd | Digital information imbedding extracting device/method, and medium recording program to execute the method |
US6330672B1 (en) * | 1997-12-03 | 2001-12-11 | At&T Corp. | Method and apparatus for watermarking digital bitstreams |
EP0921675B1 (en) * | 1997-12-03 | 2006-07-05 | Kabushiki Kaisha Toshiba | Method of processing image information and method of preventing forgery of certificates or the like |
AU1256199A (en) * | 1997-12-22 | 1999-07-12 | Koninklijke Philips Electronics N.V. | Embedding supplemental data in an encoded signal |
US6037984A (en) * | 1997-12-24 | 2000-03-14 | Sarnoff Corporation | Method and apparatus for embedding a watermark into a digital image or image sequence |
US6104812A (en) * | 1998-01-12 | 2000-08-15 | Juratrade, Limited | Anti-counterfeiting method and apparatus using digital screening |
US6064748A (en) * | 1998-01-16 | 2000-05-16 | Hewlett-Packard Company | Method and apparatus for embedding and retrieving additional data in an encoded data stream |
US7054463B2 (en) | 1998-01-20 | 2006-05-30 | Digimarc Corporation | Data encoding using frail watermarks |
JP3986150B2 (en) * | 1998-01-27 | 2007-10-03 | 興和株式会社 | Digital watermarking to one-dimensional data |
US6145081A (en) * | 1998-02-02 | 2000-11-07 | Verance Corporation | Method and apparatus for preventing removal of embedded information in cover signals |
JP3570213B2 (en) * | 1998-03-27 | 2004-09-29 | 株式会社日立製作所 | Digital watermark image processing method |
US6064764A (en) * | 1998-03-30 | 2000-05-16 | Seiko Epson Corporation | Fragile watermarks for detecting tampering in images |
US6137952A (en) * | 1998-04-02 | 2000-10-24 | Hewlett-Packard Company | Apparatus and method for degrading the quality of unauthorized copies of color images and video sequences |
US6256736B1 (en) * | 1998-04-13 | 2001-07-03 | International Business Machines Corporation | Secured signal modification and verification with privacy control |
US6263086B1 (en) * | 1998-04-15 | 2001-07-17 | Xerox Corporation | Automatic detection and retrieval of embedded invisible digital watermarks from halftone images |
US6359998B1 (en) * | 1998-04-23 | 2002-03-19 | 3Com Corporation | Method and apparatus for wavelet-based digital watermarking |
JP3358532B2 (en) | 1998-04-27 | 2002-12-24 | 日本電気株式会社 | Receiving device using electronic watermark |
JP3214554B2 (en) * | 1998-05-06 | 2001-10-02 | 日本電気株式会社 | Digital watermark system, digital watermark insertion device, and electronic image demodulation device |
JP3214555B2 (en) * | 1998-05-06 | 2001-10-02 | 日本電気株式会社 | Digital watermark insertion device |
US6773547B2 (en) * | 1998-05-08 | 2004-08-10 | American Air Liquide, Inc. | Process for the bleaching of low consistency pulp using high partial pressure ozone |
CA2269651A1 (en) | 1998-05-12 | 1999-11-12 | Lucent Technologies, Inc. | Transform domain image watermarking method and system |
JP3201347B2 (en) | 1998-05-15 | 2001-08-20 | 日本電気株式会社 | Image attribute change device and digital watermark device |
US6553127B1 (en) * | 1998-05-20 | 2003-04-22 | Macrovision Corporation | Method and apparatus for selective block processing |
US6021196A (en) * | 1998-05-26 | 2000-02-01 | The Regents University Of California | Reference palette embedding |
US7644282B2 (en) | 1998-05-28 | 2010-01-05 | Verance Corporation | Pre-processed information embedding system |
WO1999063443A1 (en) * | 1998-06-01 | 1999-12-09 | Datamark Technologies Pte Ltd. | Methods for embedding image, audio and video watermarks in digital data |
US6332194B1 (en) * | 1998-06-05 | 2001-12-18 | Signafy, Inc. | Method for data preparation and watermark insertion |
JP2000013585A (en) * | 1998-06-19 | 2000-01-14 | Sony Corp | Superimposing device and method for additional information, image information recorder and its method |
WO1999067942A1 (en) * | 1998-06-22 | 1999-12-29 | Sony Corporation | Signal processing apparatus and method, and signal decoding apparatus and method |
US6154571A (en) * | 1998-06-24 | 2000-11-28 | Nec Research Institute, Inc. | Robust digital watermarking |
US7006555B1 (en) | 1998-07-16 | 2006-02-28 | Nielsen Media Research, Inc. | Spectral audio encoding |
JP2000106625A (en) | 1998-07-27 | 2000-04-11 | Fuji Photo Film Co Ltd | Method and system for printing image and its storage medium |
JP3266569B2 (en) | 1998-07-29 | 2002-03-18 | 日本電気株式会社 | Image attribute change system using digital watermark data |
JP3853541B2 (en) * | 1998-07-30 | 2006-12-06 | 富士写真フイルム株式会社 | Data distribution method |
EP1014618A1 (en) | 1998-07-30 | 2000-06-28 | Sony Corporation | Content processing system |
US20030130954A1 (en) * | 1998-07-31 | 2003-07-10 | Carr J. Scott | Postal applications including digital watermarks |
JP2000059771A (en) * | 1998-08-04 | 2000-02-25 | Hitachi Ltd | Image-pickup device and image data utilizing system |
FR2782224B1 (en) * | 1998-08-06 | 2000-11-03 | Canon Kk | METHOD AND DEVICE FOR INSERTING AND DECODING A MARK IN DIGITAL DATA |
US7953824B2 (en) | 1998-08-06 | 2011-05-31 | Digimarc Corporation | Image sensors worn or attached on humans for imagery identification |
US6944313B1 (en) | 1998-08-06 | 2005-09-13 | Canon Kabushiki Kaisha | Method and device for inserting and decoding a watermark in digital data |
FR2782223B1 (en) * | 1998-08-06 | 2000-11-03 | Canon Kk | METHOD AND DEVICE FOR INSERTING AND DECODING A MARK IN DIGITAL DATA |
JP3592545B2 (en) | 1998-08-07 | 2004-11-24 | 株式会社リコー | Image processing apparatus, image processing method, and information recording medium |
JP3563270B2 (en) * | 1998-08-28 | 2004-09-08 | 株式会社日立製作所 | Authentication method of digital watermark image |
US6643382B1 (en) * | 1998-08-31 | 2003-11-04 | Canon Kabushiki Kaisha | Image processing method, image processing apparatus, image processing system and memory medium |
US6704431B1 (en) * | 1998-09-04 | 2004-03-09 | Nippon Telegraph And Telephone Corporation | Method and apparatus for digital watermarking |
JP4424769B2 (en) * | 1998-09-10 | 2010-03-03 | 興和株式会社 | Digital watermark embedding device |
DE69925087T2 (en) * | 1998-09-22 | 2006-02-02 | Matsushita Electric Industrial Co., Ltd., Kadoma | An optical disc, a method of reproducing additional data from an optical disc, an optical disc reproducing apparatus and an optical disc recording and reproducing apparatus |
US7197156B1 (en) | 1998-09-25 | 2007-03-27 | Digimarc Corporation | Method and apparatus for embedding auxiliary information within original data |
US7373513B2 (en) * | 1998-09-25 | 2008-05-13 | Digimarc Corporation | Transmarking of multimedia signals |
US7055034B1 (en) * | 1998-09-25 | 2006-05-30 | Digimarc Corporation | Method and apparatus for robust embedded data |
KR100341197B1 (en) * | 1998-09-29 | 2002-06-20 | 포만 제프리 엘 | System for embedding additional information in audio data |
US6463162B1 (en) * | 1998-09-30 | 2002-10-08 | Hewlett-Packard Company | Robust watermarking for digital objects |
US6285775B1 (en) * | 1998-10-01 | 2001-09-04 | The Trustees Of The University Of Princeton | Watermarking scheme for image authentication |
WO2000021089A1 (en) | 1998-10-08 | 2000-04-13 | Matsushita Electric Industrial Co., Ltd. | Data processor and data recorded medium |
US6345100B1 (en) * | 1998-10-14 | 2002-02-05 | Liquid Audio, Inc. | Robust watermark method and apparatus for digital signals |
JP3881794B2 (en) * | 1998-10-27 | 2007-02-14 | 興和株式会社 | Digital watermark embedding method and decoding method thereof |
EP1046141B1 (en) * | 1998-10-29 | 2003-06-04 | Koninklijke Philips Electronics N.V. | Watermark detection |
EP1001604B1 (en) * | 1998-11-10 | 2004-04-28 | Canon Kabushiki Kaisha | Embedding a watermark into a compressed image signal |
JP4130503B2 (en) * | 1998-11-30 | 2008-08-06 | 株式会社東芝 | Digital watermark embedding device |
US6563935B1 (en) * | 1998-12-02 | 2003-05-13 | Hitachi, Ltd. | Method of extracting digital watermark information and method of judging bit value of digital watermark information |
WO2000036605A1 (en) * | 1998-12-11 | 2000-06-22 | Kent Ridge Digital Labs | Method and device for generating digital data watermarked with authentication data |
JP3327389B2 (en) | 1998-12-28 | 2002-09-24 | 松下電器産業株式会社 | Copy system, copy method, writing device, and recording medium |
GB2363300B (en) * | 1998-12-29 | 2003-10-01 | Kent Ridge Digital Labs | Digital audio watermarking using content-adaptive multiple echo hopping |
GB2366112B (en) * | 1998-12-29 | 2003-05-28 | Kent Ridge Digital Labs | Method and apparatus for embedding digital information in digital multimedia data |
US7162642B2 (en) * | 1999-01-06 | 2007-01-09 | Digital Video Express, L.P. | Digital content distribution system and method |
US6442283B1 (en) * | 1999-01-11 | 2002-08-27 | Digimarc Corporation | Multimedia data embedding |
CA2323561C (en) * | 1999-01-13 | 2013-03-26 | Koninklijke Philips Electronics N.V. | Embedding supplemental data in an encoded signal |
JP3397157B2 (en) | 1999-01-13 | 2003-04-14 | 日本電気株式会社 | Digital watermark insertion system |
CA2260094C (en) * | 1999-01-19 | 2002-10-01 | Nec Corporation | A method for inserting and detecting electronic watermark data into a digital image and a device for the same |
GB2363302B (en) * | 1999-01-28 | 2003-11-05 | Kent Ridge Digital Labs | Method and apparatus for watermarking wavetable synthesis architectures |
JP4178647B2 (en) | 1999-02-15 | 2008-11-12 | 松下電器産業株式会社 | Digital information embedding / extracting apparatus and method, and recording medium storing a program for executing the method |
US6792128B1 (en) | 1999-02-16 | 2004-09-14 | Canon Kabushiki Kaisha | Method of inserting and extracting a digital signature |
US6963884B1 (en) * | 1999-03-10 | 2005-11-08 | Digimarc Corporation | Recoverable digital content degradation: method and apparatus |
US6868497B1 (en) * | 1999-03-10 | 2005-03-15 | Digimarc Corporation | Method and apparatus for automatic ID management |
EP1157499A4 (en) * | 1999-03-10 | 2003-07-09 | Digimarc Corp | Signal processing methods, devices, and applications for digital rights management |
US6556688B1 (en) * | 1999-03-15 | 2003-04-29 | Seiko Epson Corporation | Watermarking with random zero-mean patches for printer tracking |
CN1129114C (en) * | 1999-03-19 | 2003-11-26 | 索尼公司 | Additional information embedding method and its device, and additional information decoding method and its decoding device |
US7013021B2 (en) * | 1999-03-19 | 2006-03-14 | Digimarc Corporation | Watermark detection utilizing regions with higher probability of success |
US7664264B2 (en) | 1999-03-24 | 2010-02-16 | Blue Spike, Inc. | Utilizing data reduction in steganographic and cryptographic systems |
KR100333163B1 (en) * | 1999-03-29 | 2002-04-18 | 최종욱 | Digital watermarking method and apparatus |
JP3639742B2 (en) * | 1999-03-30 | 2005-04-20 | キヤノン株式会社 | Image processing apparatus and method |
JP3728136B2 (en) * | 1999-03-30 | 2005-12-21 | キヤノン株式会社 | Image processing apparatus, image processing method, and storage medium |
JP2000350013A (en) | 1999-03-31 | 2000-12-15 | Victor Co Of Japan Ltd | Device and method for embedding digital watermark data, transmitting method, recording medium and device and method for readin the watermark data |
WO2000060589A1 (en) * | 1999-04-06 | 2000-10-12 | Kwan Software Engineering, Inc. | System and method for digitally marking a file with a removable mark |
US6792535B1 (en) | 1999-04-06 | 2004-09-14 | Kwan Software Engineering, Inc. | System and method for digitally marking a file with a removable mark |
US6434701B1 (en) | 1999-04-06 | 2002-08-13 | Kwan Software Engineering, Inc. | System and method for digitally marking a file |
FR2792797B1 (en) | 1999-04-23 | 2001-07-13 | Thomson Csf | IMAGE TATTOO PROCESS |
US6424998B2 (en) | 1999-04-28 | 2002-07-23 | World Theatre, Inc. | System permitting the display of video or still image content on selected displays of an electronic display network according to customer dictates |
SG87029A1 (en) | 1999-05-08 | 2002-03-19 | Kent Ridge Digital Labs | Dynamically delayed acknowledgement transmission system |
US7302574B2 (en) | 1999-05-19 | 2007-11-27 | Digimarc Corporation | Content identifiers triggering corresponding responses through collaborative processing |
US8095796B2 (en) | 1999-05-19 | 2012-01-10 | Digimarc Corporation | Content identifiers |
US6952774B1 (en) * | 1999-05-22 | 2005-10-04 | Microsoft Corporation | Audio watermarking with dual watermarks |
FR2794600B1 (en) * | 1999-06-01 | 2001-08-17 | Thomson Multimedia Sa | DATA TATTOO SYSTEM USING NEW TATTOO INSERTION AND DETECTION METHODS |
US6870944B1 (en) * | 1999-06-08 | 2005-03-22 | Sony Corporation | Image processing apparatus, image processing method, and storage medium |
GB2351405B (en) * | 1999-06-21 | 2003-09-24 | Motorola Ltd | Watermarked digital images |
JP3407869B2 (en) | 1999-06-24 | 2003-05-19 | 日本電気株式会社 | Method and method for inserting information into DCT coefficients |
US7020285B1 (en) * | 1999-07-13 | 2006-03-28 | Microsoft Corporation | Stealthy audio watermarking |
US7543148B1 (en) | 1999-07-13 | 2009-06-02 | Microsoft Corporation | Audio watermarking with covert channel and permutations |
JP3651319B2 (en) | 1999-07-16 | 2005-05-25 | 日本ビクター株式会社 | Digital watermark information recording method, reproduction method, digital watermark information recording apparatus, and reproduction apparatus |
TW451171B (en) * | 1999-07-16 | 2001-08-21 | Cyberlink Corp | A method to embed and extract hidden digital watermark |
GB9917985D0 (en) | 1999-07-30 | 1999-09-29 | Scient Generics Ltd | Acoustic communication system |
US7475246B1 (en) | 1999-08-04 | 2009-01-06 | Blue Spike, Inc. | Secure personal content server |
US6654479B1 (en) * | 1999-08-19 | 2003-11-25 | Academia Sinica | Cocktail watermarking on images |
US6792129B1 (en) | 1999-08-25 | 2004-09-14 | Sharp Laboratories Of America | Digital watermarking in a perceptually uniform domain |
US6647417B1 (en) | 2000-02-10 | 2003-11-11 | World Theatre, Inc. | Music distribution systems |
US6952685B1 (en) | 1999-08-27 | 2005-10-04 | Ochoa Optics Llc | Music distribution system and associated antipiracy protection |
US7209900B2 (en) | 1999-08-27 | 2007-04-24 | Charles Eric Hunter | Music distribution systems |
US8090619B1 (en) | 1999-08-27 | 2012-01-03 | Ochoa Optics Llc | Method and system for music distribution |
US7647618B1 (en) | 1999-08-27 | 2010-01-12 | Charles Eric Hunter | Video distribution system |
US20060212908A1 (en) | 1999-08-27 | 2006-09-21 | Ochoa Optics Llc | Video distribution system |
JP2003527779A (en) | 1999-09-01 | 2003-09-16 | ディジマーク コーポレイション | Method of forming watermark on digital image by specifying intensity for each area |
US6456727B1 (en) * | 1999-09-02 | 2002-09-24 | Hitachi, Ltd. | Method of extracting digital watermark information and method of judging but value of digital watermark information |
US6748362B1 (en) * | 1999-09-03 | 2004-06-08 | Thomas W. Meyer | Process, system, and apparatus for embedding data in compressed audio, image video and other media files and the like |
US7188186B1 (en) * | 1999-09-03 | 2007-03-06 | Meyer Thomas W | Process of and system for seamlessly embedding executable program code into media file formats such as MP3 and the like for execution by digital media player and viewing systems |
JP3654077B2 (en) | 1999-09-07 | 2005-06-02 | 日本電気株式会社 | Online digital watermark detection system, online digital watermark detection method, and recording medium on which online digital watermark detection program is recorded |
GB9922904D0 (en) * | 1999-09-28 | 1999-12-01 | Signum Technologies Limited | Method of authenticating digital data works |
JP3407872B2 (en) | 1999-09-29 | 2003-05-19 | 日本電気株式会社 | Method and apparatus for detecting additional information |
JP3735521B2 (en) | 1999-09-30 | 2006-01-18 | 株式会社東芝 | Embedded code generation method and apparatus, embedded code detection method and apparatus, and digital watermark embedding apparatus |
DE19947877C2 (en) * | 1999-10-05 | 2001-09-13 | Fraunhofer Ges Forschung | Method and device for introducing information into a data stream and method and device for encoding an audio signal |
US6850910B1 (en) | 1999-10-22 | 2005-02-01 | Matsushita Electric Industrial Co., Ltd. | Active data hiding for secure electronic media distribution |
CA2310769C (en) * | 1999-10-27 | 2013-05-28 | Nielsen Media Research, Inc. | Audio signature extraction and correlation |
US6754364B1 (en) * | 1999-10-28 | 2004-06-22 | Microsoft Corporation | Methods and systems for fingerprinting digital data |
JP4496574B2 (en) * | 1999-11-15 | 2010-07-07 | セイコーエプソン株式会社 | Image processing device, storage device, image processing system, and image processing method |
JP3470223B2 (en) * | 1999-11-29 | 2003-11-25 | 株式会社サンモアテック | Image processing method, image processing apparatus, recording medium, and transmission medium |
DE69931932T2 (en) * | 1999-12-04 | 2007-05-31 | Deutsche Thomson-Brandt Gmbh | Method and apparatus for decoding and inserting a watermark into a data stream |
US7500004B1 (en) | 1999-12-29 | 2009-03-03 | Gregg Homer | System for tracking files transmitted over the internet |
US6915481B1 (en) * | 2000-01-11 | 2005-07-05 | Cognicity, Inc. | Transactional watermarking |
JP3683766B2 (en) * | 2000-01-21 | 2005-08-17 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Image processing apparatus and method |
WO2001054053A1 (en) * | 2000-01-24 | 2001-07-26 | Ecole Polytechnique Federale De Lausanne | Transform domain allocation for multimedia watermarking |
US9252898B2 (en) | 2000-01-28 | 2016-02-02 | Zarbaña Digital Fund Llc | Music distribution systems |
GB2358999A (en) * | 2000-02-02 | 2001-08-08 | Central Research Lab Ltd | A system and method for labelling a signal |
US6385329B1 (en) * | 2000-02-14 | 2002-05-07 | Digimarc Corporation | Wavelet domain watermarks |
US6737957B1 (en) | 2000-02-16 | 2004-05-18 | Verance Corporation | Remote control signaling using audio watermarks |
US6834308B1 (en) | 2000-02-17 | 2004-12-21 | Audible Magic Corporation | Method and apparatus for identifying media content presented on a media playing device |
US7127744B2 (en) | 2000-03-10 | 2006-10-24 | Digimarc Corporation | Method and apparatus to protect media existing in an insecure format |
US6804356B1 (en) * | 2000-03-20 | 2004-10-12 | Koninklijke Philips Electronics N.V. | Hierarchical authentication system for images and video |
JP2001282619A (en) * | 2000-03-30 | 2001-10-12 | Hitachi Ltd | Method and device for detecting content alteration and recording medium with recorded processing program thereon |
JP3630071B2 (en) * | 2000-04-05 | 2005-03-16 | 日本電気株式会社 | Digital watermark detector and digital watermark detection method used therefor |
WO2001075794A2 (en) | 2000-04-05 | 2001-10-11 | Sony United Kingdom Limited | Identifying material |
US6968564B1 (en) | 2000-04-06 | 2005-11-22 | Nielsen Media Research, Inc. | Multi-band spectral audio encoding |
US7738673B2 (en) * | 2000-04-19 | 2010-06-15 | Digimarc Corporation | Low visible digital watermarks |
US6912295B2 (en) * | 2000-04-19 | 2005-06-28 | Digimarc Corporation | Enhancing embedding of out-of-phase signals |
US6993149B2 (en) * | 2001-09-25 | 2006-01-31 | Digimarc Corporation | Embedding digital watermarks in spot colors |
US8027509B2 (en) | 2000-04-19 | 2011-09-27 | Digimarc Corporation | Digital watermarking in data representing color channels |
US6804377B2 (en) | 2000-04-19 | 2004-10-12 | Digimarc Corporation | Detecting information hidden out-of-phase in color channels |
US6891959B2 (en) * | 2000-04-19 | 2005-05-10 | Digimarc Corporation | Hiding information out-of-phase in color channels |
US7466742B1 (en) | 2000-04-21 | 2008-12-16 | Nielsen Media Research, Inc. | Detection of entropy in connection with audio signals |
DE10023759A1 (en) * | 2000-05-15 | 2001-11-22 | Fraunhofer Ges Forschung | Digital watermark inclusion method in musical note score printing, involves altering geometric elements of note score only in digital form without reducing legibility of note score |
KR100369306B1 (en) * | 2000-05-16 | 2003-02-26 | 주식회사 마크애니 | Digital audio watermarking method and apparatus using a color image as a watermark |
KR20010106815A (en) * | 2000-05-23 | 2001-12-07 | 서평원 | Watermarking method and apparatus in still picture with moving picture |
KR20010111885A (en) * | 2000-06-14 | 2001-12-20 | 박인정 | Method of audio watermarking with image using spectrogram |
KR100611094B1 (en) | 2000-06-15 | 2006-08-09 | 주식회사 케이티 | Apparatus and method for inserting/detecting watermark based stochastic model |
AU7358601A (en) * | 2000-07-14 | 2002-01-30 | Chinook Communications Inc | System and method for backward-compatible modulation and demodulation of data using information embedding in television signals |
US6879652B1 (en) * | 2000-07-14 | 2005-04-12 | Nielsen Media Research, Inc. | Method for encoding an input signal |
US6859217B2 (en) * | 2000-07-19 | 2005-02-22 | Microsoft Corporation | System and method to display and manage data within hierarchies and polyarchies of information |
US7298841B2 (en) | 2000-07-27 | 2007-11-20 | Activated Content Corporation | Stegotext encoder and decoder |
GB2365295A (en) * | 2000-07-27 | 2002-02-13 | Cambridge Consultants | Watermarking key |
WO2002015587A2 (en) * | 2000-08-16 | 2002-02-21 | Dolby Laboratories Licensing Corporation | Modulating one or more parameters of an audio or video perceptual coding system in response to supplemental information |
JP2002092682A (en) * | 2000-08-30 | 2002-03-29 | Internatl Business Mach Corp <Ibm> | Method and system of detecting watermark |
KR100499471B1 (en) * | 2000-09-05 | 2005-07-07 | 엘지전자 주식회사 | Method for Picture Watermarking |
US7246239B2 (en) * | 2001-01-24 | 2007-07-17 | Digimarc Corporation | Digital watermarks for checking authenticity of printed objects |
US6674876B1 (en) | 2000-09-14 | 2004-01-06 | Digimarc Corporation | Watermarking in the time-frequency domain |
US7127615B2 (en) | 2000-09-20 | 2006-10-24 | Blue Spike, Inc. | Security based on subliminal and supraliminal channels for data objects |
US7054256B2 (en) | 2000-10-20 | 2006-05-30 | Ochoa Optics Llc | High capacity digital data storage by transmission of radiant energy through arrays of small diameter holes |
CN1394444A (en) * | 2000-10-25 | 2003-01-29 | 皇家菲利浦电子有限公司 | Method, device and arrangement for inserting extra information |
US7562012B1 (en) * | 2000-11-03 | 2009-07-14 | Audible Magic Corporation | Method and apparatus for creating a unique audio signature |
US6978371B1 (en) | 2000-11-07 | 2005-12-20 | Matsushita Electric Industrial Co., Ltd. | Data hiding in digital multimedia |
WO2002039383A2 (en) * | 2000-11-07 | 2002-05-16 | Koninklijke Philips Electronics N.V. | Method and arrangement for embedding a watermark in an information signal |
BR0107444A (en) * | 2000-11-08 | 2002-10-08 | Koninkl Philips Electronics Nv | Method for communicating a command to a controllable device, arrangement for remotely controlling a controllable device, control device arranged to communicate a command in a first domain to a controllable device, controllable device arranged to receive a command in a first domain from a device control, computer program product, method for presenting an ad to a user, and, sign |
FR2817440B1 (en) * | 2000-11-27 | 2003-02-21 | Canon Kk | INSERTION OF MESSAGES IN DIGITAL DATA |
AU2211102A (en) | 2000-11-30 | 2002-06-11 | Scient Generics Ltd | Acoustic communication system |
US6957230B2 (en) * | 2000-11-30 | 2005-10-18 | Microsoft Corporation | Dynamically generating multiple hierarchies of inter-object relationships based on object attribute values |
ES2388357T3 (en) | 2000-11-30 | 2012-10-11 | Intrasonics S.A.R.L. | Mobile phone to collect audience index data |
EP1220152A3 (en) * | 2000-12-07 | 2004-11-24 | Sony United Kingdom Limited | Embedding data in material |
GB2369949B (en) * | 2000-12-07 | 2005-03-16 | Sony Uk Ltd | Embedding data in material |
EP1750426A1 (en) * | 2000-12-07 | 2007-02-07 | Sony United Kingdom Limited | Methods and apparatus for embedding data and for detecting and recovering embedded data |
EP1215908A3 (en) * | 2000-12-07 | 2005-05-04 | Sony United Kingdom Limited | Apparatus for detecting and recovering embedded data |
EP1215910A3 (en) * | 2000-12-07 | 2003-09-10 | Sony United Kingdom Limited | Watermarking |
EP1215880A3 (en) * | 2000-12-07 | 2003-08-13 | Sony United Kingdom Limited | Embedding data in material |
WO2002051063A1 (en) | 2000-12-21 | 2002-06-27 | Digimarc Corporation | Methods, apparatus and programs for generating and utilizing content signatures |
UY26500A1 (en) * | 2000-12-22 | 2001-01-31 | Carlos Manuel Lopez Vazquez | METHOD FOR INSERTING HIDDEN DATA IN DIGITAL FILES WITH TRAILERS AND DETECTION PROCEDURES |
US20020114299A1 (en) * | 2000-12-27 | 2002-08-22 | Daozheng Lu | Apparatus and method for measuring tuning of a digital broadcast receiver |
US6845170B2 (en) | 2001-01-11 | 2005-01-18 | Sony Corporation | Watermark resistant to resizing and rotation |
KR100400582B1 (en) * | 2001-01-12 | 2003-10-08 | 주식회사 마크애니 | Apparatus and method for issuing, authenticating securities et al. using digital watermarking |
US6754642B2 (en) * | 2001-05-31 | 2004-06-22 | Contentguard Holdings, Inc. | Method and apparatus for dynamically assigning usage rights to digital works |
US7072487B2 (en) * | 2001-01-26 | 2006-07-04 | Digimarc Corporation | Watermark detection using adaptive color projections |
US20020112243A1 (en) * | 2001-02-12 | 2002-08-15 | World Theatre | Video distribution system |
US8112311B2 (en) | 2001-02-12 | 2012-02-07 | Ochoa Optics Llc | Systems and methods for distribution of entertainment and advertising content |
KR20020067853A (en) * | 2001-02-19 | 2002-08-24 | 주식회사 마크애니 | Apparatus and Method for controlling the copy and play of a digital audio contents using digital watermarking |
US7043051B2 (en) * | 2001-02-21 | 2006-05-09 | Lg Electronics Inc. | Proprietary watermark system for secure digital media and content distribution |
US7098931B2 (en) * | 2001-03-05 | 2006-08-29 | Digimarc Corporation | Image management system and methods using digital watermarks |
US7602936B2 (en) * | 2001-03-08 | 2009-10-13 | Sony Corporation | Method to make wavelet watermarks resistant to affine transformations |
KR100390343B1 (en) * | 2001-03-23 | 2003-07-07 | 주식회사 마크애니 | Apparatus for embedding watermark into digital video contents and method thereof |
US7181017B1 (en) | 2001-03-23 | 2007-02-20 | David Felsher | System and method for secure three-party communications |
US7058201B2 (en) * | 2001-03-28 | 2006-06-06 | Lg Electronics Inc. | Method of embedding watermark into digital image |
US7058284B2 (en) * | 2001-03-29 | 2006-06-06 | Matsushita Electric Industrial Co., Ltd. | Universal multimedia optic disc player and its application for revocable copy protection |
US7363278B2 (en) * | 2001-04-05 | 2008-04-22 | Audible Magic Corporation | Copyright detection and protection system and method |
CN1251510C (en) * | 2001-04-12 | 2006-04-12 | 皇家菲利浦电子有限公司 | Watermark embedding |
KR20020079242A (en) * | 2001-04-14 | 2002-10-19 | 주식회사 마크애니 | Audio watermark embedding and extracting method robust against time axis attack and apparatus thereof |
US7607016B2 (en) * | 2001-04-20 | 2009-10-20 | Digimarc Corporation | Including a metric in a digital watermark for media authentication |
US6775393B2 (en) | 2001-04-23 | 2004-08-10 | Hewlett-Packard Development Company, L.P. | Hardcopy watermarking |
US7047413B2 (en) * | 2001-04-23 | 2006-05-16 | Microsoft Corporation | Collusion-resistant watermarking and fingerprinting |
US7046819B2 (en) | 2001-04-25 | 2006-05-16 | Digimarc Corporation | Encoded reference signal for digital watermarks |
CN1284135C (en) * | 2001-05-08 | 2006-11-08 | 皇家菲利浦电子有限公司 | Generation and detection of watermark robust against resampling of audio signal |
KR100493284B1 (en) * | 2001-05-11 | 2005-06-03 | 엘지전자 주식회사 | Copy protection method and system for digital media |
US7113613B2 (en) | 2001-06-08 | 2006-09-26 | Hitachi, Ltd. | Watermark information detection method |
CA2350029A1 (en) * | 2001-06-08 | 2002-12-08 | Cloakware Corporation | Sustainable digital watermarking via tamper-resistant software |
US7496197B2 (en) * | 2001-06-14 | 2009-02-24 | Portauthority Technologies Inc. | Method and system for robust embedding of watermarks and steganograms in digital video content |
US6952209B2 (en) * | 2001-06-27 | 2005-10-04 | Agilent Technologies, Inc. | Variable scaled graphical indicator to display dynamic data |
US8094869B2 (en) | 2001-07-02 | 2012-01-10 | Digimarc Corporation | Fragile and emerging digital watermarks |
US7529659B2 (en) | 2005-09-28 | 2009-05-05 | Audible Magic Corporation | Method and apparatus for identifying an unknown work |
US20030016825A1 (en) * | 2001-07-10 | 2003-01-23 | Eastman Kodak Company | System and method for secure watermarking of a digital image sequence |
US6968337B2 (en) * | 2001-07-10 | 2005-11-22 | Audible Magic Corporation | Method and apparatus for identifying an unknown work |
US8972481B2 (en) | 2001-07-20 | 2015-03-03 | Audible Magic, Inc. | Playlist generation method and apparatus |
US7877438B2 (en) * | 2001-07-20 | 2011-01-25 | Audible Magic Corporation | Method and apparatus for identifying new media content |
US7298865B2 (en) * | 2001-07-30 | 2007-11-20 | Sarnoff Corporation | Secure robust high-fidelity watermarking |
US7162036B2 (en) * | 2001-08-06 | 2007-01-09 | Igt | Digital identification of unique game characteristics |
US6685567B2 (en) * | 2001-08-08 | 2004-02-03 | Igt | Process verification |
US7213757B2 (en) | 2001-08-31 | 2007-05-08 | Digimarc Corporation | Emerging security features for identification documents |
US7537170B2 (en) * | 2001-08-31 | 2009-05-26 | Digimarc Corporation | Machine-readable security features for printed objects |
EP1433175A1 (en) * | 2001-09-05 | 2004-06-30 | Koninklijke Philips Electronics N.V. | A robust watermark for dsd signals |
US7960005B2 (en) | 2001-09-14 | 2011-06-14 | Ochoa Optics Llc | Broadcast distribution of content for storage on hardware protected optical storage media |
US7408680B2 (en) * | 2001-09-26 | 2008-08-05 | Canon Kabushiki Kaisha | Image processing apparatus and method |
US7233781B2 (en) | 2001-10-10 | 2007-06-19 | Ochoa Optics Llc | System and method for emergency notification content delivery |
US20030135623A1 (en) * | 2001-10-23 | 2003-07-17 | Audible Magic, Inc. | Method and apparatus for cache promotion |
KR100837839B1 (en) * | 2001-10-25 | 2008-06-13 | 주식회사 케이티 | Audio watermark rehabilitation apparatus and the method that is damaged by speed alteration attack |
KR100472071B1 (en) * | 2001-10-31 | 2005-03-08 | 한국전자통신연구원 | Apparatus and method of injecting time-domain average removed watermark signal for M-ary watermarking system |
JP4504681B2 (en) | 2001-11-16 | 2010-07-14 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | Method and device for embedding auxiliary data in an information signal |
US7389335B2 (en) * | 2001-11-26 | 2008-06-17 | Microsoft Corporation | Workflow management based on an integrated view of resource identity |
US6952704B2 (en) | 2001-11-26 | 2005-10-04 | Microsoft Corporation | Extending a directory schema independent of schema modification |
US6944626B2 (en) * | 2001-11-26 | 2005-09-13 | Microsoft Corp. | Dynamically generated schema representing multiple hierarchies of inter-object relationships |
GB2383221A (en) * | 2001-12-13 | 2003-06-18 | Sony Uk Ltd | Method of identifying a codeword used as a watermark |
US7187780B2 (en) * | 2001-12-13 | 2007-03-06 | Digimarc Corporation | Image processing methods using reversible watermarking |
PT1456810E (en) | 2001-12-18 | 2011-07-25 | L 1 Secure Credentialing Inc | Multiple image security features for identification documents and methods of making same |
US8248528B2 (en) | 2001-12-24 | 2012-08-21 | Intrasonics S.A.R.L. | Captioning system |
US7728048B2 (en) | 2002-12-20 | 2010-06-01 | L-1 Secure Credentialing, Inc. | Increasing thermal conductivity of host polymer used with laser engraving methods and compositions |
US7260722B2 (en) * | 2001-12-28 | 2007-08-21 | Itt Manufacturing Enterprises, Inc. | Digital multimedia watermarking for source identification |
US20030131350A1 (en) | 2002-01-08 | 2003-07-10 | Peiffer John C. | Method and apparatus for identifying a digital audio signal |
US7567721B2 (en) * | 2002-01-22 | 2009-07-28 | Digimarc Corporation | Digital watermarking of low bit rate video |
US7152786B2 (en) * | 2002-02-12 | 2006-12-26 | Digimarc Corporation | Identification document including embedded data |
JP3940894B2 (en) * | 2002-02-12 | 2007-07-04 | ヤマハ株式会社 | Watermark data embedding device, watermark data extracting device, watermark data embedding program, and watermark data extracting program |
JP4011362B2 (en) * | 2002-02-15 | 2007-11-21 | 浩 近藤 | Passport forgery prevention information creation system, passport and forgery passport detection system |
JP2003244138A (en) * | 2002-02-18 | 2003-08-29 | Fujitsu Ltd | Original creating device, and originality assurance device |
US7076659B2 (en) | 2002-02-25 | 2006-07-11 | Matsushita Electric Industrial Co., Ltd. | Enhanced method for digital data hiding |
KR100445780B1 (en) * | 2002-02-27 | 2004-08-25 | 한국과학기술원 | Digital audio watermarking based on statistical inference |
JP3554825B2 (en) * | 2002-03-11 | 2004-08-18 | 東北大学長 | Digital watermark system |
TR200402517T1 (en) * | 2002-03-29 | 2007-12-24 | Innogenetics N.V. | HBV drug resistance detection methods |
US7287275B2 (en) | 2002-04-17 | 2007-10-23 | Moskowitz Scott A | Methods, systems and devices for packet watermarking and efficient provisioning of bandwidth |
US7389421B2 (en) * | 2002-04-18 | 2008-06-17 | Microsoft Corporation | Countermeasure against estimation-based attacks of spread-spectrum watermarks |
US7824029B2 (en) | 2002-05-10 | 2010-11-02 | L-1 Secure Credentialing, Inc. | Identification card printer-assembler for over the counter card issuing |
US7752446B2 (en) * | 2002-05-15 | 2010-07-06 | International Business Machines Corporation | System and method for digital watermarking of data repository |
US7336800B2 (en) * | 2002-05-16 | 2008-02-26 | Indian Institute Of Information Technology | Method and a device for detecting a watermark in digital data |
US20040003394A1 (en) * | 2002-07-01 | 2004-01-01 | Arun Ramaswamy | System for automatically matching video with ratings information |
US7239981B2 (en) | 2002-07-26 | 2007-07-03 | Arbitron Inc. | Systems and methods for gathering audience measurement data |
JP3976183B2 (en) * | 2002-08-14 | 2007-09-12 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Content receiving apparatus, network system, and program |
US7577841B2 (en) | 2002-08-15 | 2009-08-18 | Digimarc Corporation | Watermark placement in watermarking of time varying media signals |
US7152021B2 (en) * | 2002-08-15 | 2006-12-19 | Digimarc Corporation | Computing distortion of media signals embedded data with repetitive structure and log-polar mapping |
US7133534B2 (en) * | 2002-09-03 | 2006-11-07 | Koninklijke Philips Electronics N.V. | Copy protection via redundant watermark encoding |
US9711153B2 (en) | 2002-09-27 | 2017-07-18 | The Nielsen Company (Us), Llc | Activating functions in processing devices using encoded audio and detecting audio signatures |
US8959016B2 (en) | 2002-09-27 | 2015-02-17 | The Nielsen Company (Us), Llc | Activating functions in processing devices using start codes embedded in audio |
EP2782337A3 (en) | 2002-10-15 | 2014-11-26 | Verance Corporation | Media monitoring, management and information system |
EP1561341A4 (en) | 2002-10-23 | 2010-12-15 | Nielsen Media Res Inc | Digital data insertion apparatus and methods for use with compressed audio/video data |
JP3773482B2 (en) * | 2002-10-30 | 2006-05-10 | 独立行政法人科学技術振興機構 | Tamper detection method, tamper detection program, and recording medium recording the program |
JP4107063B2 (en) * | 2002-11-26 | 2008-06-25 | 日本ビクター株式会社 | Encryption information transmission / reception system, transmission / reception method, encryption information embedding program, and encryption information recording apparatus |
JP2004193964A (en) | 2002-12-11 | 2004-07-08 | Ricoh Co Ltd | Picture processor, picture processing method, program and recording medium |
US7827312B2 (en) | 2002-12-27 | 2010-11-02 | The Nielsen Company (Us), Llc | Methods and apparatus for transcoding metadata |
US8332326B2 (en) | 2003-02-01 | 2012-12-11 | Audible Magic Corporation | Method and apparatus to identify a work received by a processing system |
US9818136B1 (en) | 2003-02-05 | 2017-11-14 | Steven M. Hoffberg | System and method for determining contingent relevance |
US7702125B2 (en) * | 2003-02-05 | 2010-04-20 | Digimarc Corporation | Watermarking systems and methods |
WO2004072845A1 (en) | 2003-02-14 | 2004-08-26 | Canon Kabushiki Kaisha | System for certifying whether printed material corresponds to original |
CN100479338C (en) * | 2003-03-03 | 2009-04-15 | 美商内数位科技公司 | Reduced complexity sliding window based equalizer |
US7042967B2 (en) * | 2003-03-03 | 2006-05-09 | Interdigital Technology Corporation | Reduced complexity sliding window based equalizer |
US7352878B2 (en) * | 2003-04-15 | 2008-04-01 | Digimarc Corporation | Human perceptual model applied to rendering of watermarked signals |
DE602004030434D1 (en) | 2003-04-16 | 2011-01-20 | L 1 Secure Credentialing Inc | THREE-DIMENSIONAL DATA STORAGE |
WO2004102472A2 (en) * | 2003-05-06 | 2004-11-25 | New Jersey Institute Of Technology | Methods and apparatus for reversible data hiding through histogram modification |
JP4602983B2 (en) * | 2003-05-09 | 2010-12-22 | アビッド テクノロジー インコーポレイテッド | Method and apparatus for embedding and detecting structured watermarks |
US7756288B2 (en) * | 2003-05-29 | 2010-07-13 | Jeffrey Lubin | Method and apparatus for analog insertion of low frequency watermarks |
US7460684B2 (en) * | 2003-06-13 | 2008-12-02 | Nielsen Media Research, Inc. | Method and apparatus for embedding watermarks |
US7206649B2 (en) * | 2003-07-15 | 2007-04-17 | Microsoft Corporation | Audio watermarking with dual watermarks |
US7328847B1 (en) | 2003-07-30 | 2008-02-12 | Hewlett-Packard Development Company, L.P. | Barcode data communication methods, barcode embedding methods, and barcode systems |
US6892947B1 (en) | 2003-07-30 | 2005-05-17 | Hewlett-Packard Development Company, L.P. | Barcode embedding methods, barcode communication methods, and barcode systems |
EP1661371A4 (en) * | 2003-08-05 | 2009-05-06 | Inmate Telephone Inc | Three-way call detection using steganography |
WO2005031634A1 (en) * | 2003-08-29 | 2005-04-07 | Nielsen Media Research, Inc. | Methods and apparatus for embedding and recovering an image for use with video content |
JP3917572B2 (en) * | 2003-09-05 | 2007-05-23 | 株式会社東芝 | Digital watermark detection method and apparatus |
US7616776B2 (en) * | 2005-04-26 | 2009-11-10 | Verance Corproation | Methods and apparatus for enhancing the robustness of watermark extraction from digital host content |
US9055239B2 (en) | 2003-10-08 | 2015-06-09 | Verance Corporation | Signal continuity assessment using embedded watermarks |
US7369677B2 (en) | 2005-04-26 | 2008-05-06 | Verance Corporation | System reactions to the detection of embedded watermarks in a digital host content |
US20060239501A1 (en) | 2005-04-26 | 2006-10-26 | Verance Corporation | Security enhancements of digital watermarks for multi-media content |
US7437135B2 (en) | 2003-10-30 | 2008-10-14 | Interdigital Technology Corporation | Joint channel equalizer interference canceller advanced receiver |
JP3997197B2 (en) | 2003-12-02 | 2007-10-24 | キヤノン株式会社 | Image processing system |
US7400692B2 (en) | 2004-01-14 | 2008-07-15 | Interdigital Technology Corporation | Telescoping window based equalization |
TWI404419B (en) * | 2004-04-07 | 2013-08-01 | Nielsen Media Res Inc | Data insertion methods , sysytems, machine readable media and apparatus for use with compressed audio/video data |
US20060017659A1 (en) * | 2004-04-28 | 2006-01-26 | Matsushita Electric Industrial Co., Ltd. | Electronic paper display system |
DE102004021404B4 (en) * | 2004-04-30 | 2007-05-10 | Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. | Watermark embedding |
US8509472B2 (en) * | 2004-06-24 | 2013-08-13 | Digimarc Corporation | Digital watermarking methods, programs and apparatus |
AU2005270105B2 (en) | 2004-07-02 | 2011-03-31 | Nielsen Media Research, Inc. | Methods and apparatus for mixing compressed digital bit streams |
US8130746B2 (en) | 2004-07-28 | 2012-03-06 | Audible Magic Corporation | System for distributing decoy content in a peer to peer network |
JP4519678B2 (en) * | 2005-02-21 | 2010-08-04 | 株式会社東芝 | Digital watermark detection method and apparatus, digital watermark embedding method and apparatus |
JP4118279B2 (en) * | 2005-03-11 | 2008-07-16 | 株式会社東芝 | Digital watermark detection apparatus and method |
JP4602805B2 (en) | 2005-03-16 | 2010-12-22 | 株式会社リコー | Image processing method, image forming apparatus, image processing apparatus, program, and image forming system |
US7711142B2 (en) * | 2005-05-03 | 2010-05-04 | Teselle John | Method and system for composing a digital signature graphic appearance and specifying a document display location thereof |
US7397933B2 (en) * | 2005-05-27 | 2008-07-08 | Microsoft Corporation | Collusion resistant desynchronization for digital video fingerprinting |
US8020004B2 (en) | 2005-07-01 | 2011-09-13 | Verance Corporation | Forensic marking using a common customization function |
US8781967B2 (en) | 2005-07-07 | 2014-07-15 | Verance Corporation | Watermarking in an encrypted domain |
JP2007067871A (en) * | 2005-08-31 | 2007-03-15 | Ricoh Co Ltd | Image data processor, image processor, image forming apparatus, and image data processing method |
WO2007032752A1 (en) * | 2005-09-09 | 2007-03-22 | Thomson Licensing | Video watermark detection |
EP1929441A1 (en) * | 2005-09-09 | 2008-06-11 | Thomson Licensing | Coefficient modification for video watermarking |
US20090220070A1 (en) * | 2005-09-09 | 2009-09-03 | Justin Picard | Video Watermarking |
BRPI0520527A2 (en) * | 2005-09-09 | 2009-05-12 | Thomson Licensing | coefficient selection for watermarked video signaling |
US8874477B2 (en) | 2005-10-04 | 2014-10-28 | Steven Mark Hoffberg | Multifactorial optimization system and method |
US9275157B2 (en) | 2005-12-21 | 2016-03-01 | Digimarc Corporation | Content metadata directory services |
JP4879968B2 (en) | 2006-03-07 | 2012-02-22 | 日本電信電話株式会社 | Digital watermark embedding method and apparatus and program, and digital watermark detection method and apparatus and program |
WO2007148662A1 (en) | 2006-06-19 | 2007-12-27 | Panasonic Corporation | Information burying device and detecting devie |
EP2095560B1 (en) | 2006-10-11 | 2015-09-09 | The Nielsen Company (US), LLC | Methods and apparatus for embedding codes in compressed audio data streams |
IL181167A0 (en) * | 2007-02-05 | 2008-01-06 | Nds Ltd | System for embedding data |
US20080201158A1 (en) | 2007-02-15 | 2008-08-21 | Johnson Mark D | System and method for visitation management in a controlled-access environment |
US8542802B2 (en) | 2007-02-15 | 2013-09-24 | Global Tel*Link Corporation | System and method for three-way call detection |
US8494903B2 (en) | 2007-03-16 | 2013-07-23 | Activated Content Corporation | Universal advertising model utilizing digital linkage technology “U AD” |
US8006314B2 (en) | 2007-07-27 | 2011-08-23 | Audible Magic Corporation | System for identifying content of digital data |
JP5129053B2 (en) * | 2007-07-27 | 2013-01-23 | パナソニック株式会社 | Content reproduction apparatus, content reproduction method, content reproduction program, and integrated circuit |
US20090060257A1 (en) * | 2007-08-29 | 2009-03-05 | Korea Advanced Institute Of Science And Technology | Watermarking method resistant to geometric attack in wavelet transform domain |
JP2009077210A (en) | 2007-09-21 | 2009-04-09 | Canon Inc | Electronic watermark embedding device and electronic watermark embedding method |
WO2009050884A1 (en) * | 2007-10-17 | 2009-04-23 | Panasonic Corporation | Content reproducing device, content reproducing method, recording medium, and integrated circuit |
US8281138B2 (en) * | 2008-04-14 | 2012-10-02 | New Jersey Institute Of Technology | Steganalysis of suspect media |
GB2460306B (en) | 2008-05-29 | 2013-02-13 | Intrasonics Sarl | Data embedding system |
US20150006411A1 (en) * | 2008-06-11 | 2015-01-01 | James D. Bennett | Creative work registry |
EP2134094A1 (en) | 2008-06-13 | 2009-12-16 | Alcatel Lucent | Method and system for performing transactions on multimedia streams being produced over a chain of contributing producers |
US8259938B2 (en) | 2008-06-24 | 2012-09-04 | Verance Corporation | Efficient and secure forensic marking in compressed |
US8320606B1 (en) | 2008-08-29 | 2012-11-27 | Adobe Systems Incorporated | Video watermarking with fast detection |
US9667365B2 (en) | 2008-10-24 | 2017-05-30 | The Nielsen Company (Us), Llc | Methods and apparatus to perform audio watermarking and watermark detection and extraction |
US8121830B2 (en) | 2008-10-24 | 2012-02-21 | The Nielsen Company (Us), Llc | Methods and apparatus to extract data encoded in media content |
US8359205B2 (en) | 2008-10-24 | 2013-01-22 | The Nielsen Company (Us), Llc | Methods and apparatus to perform audio watermarking and watermark detection and extraction |
US8340343B2 (en) | 2008-10-31 | 2012-12-25 | General Instrument Corporation | Adaptive video fingerprinting |
US8385590B1 (en) | 2008-11-05 | 2013-02-26 | Adobe Systems Incorporated | Video watermarking with temporal patterns |
US8508357B2 (en) | 2008-11-26 | 2013-08-13 | The Nielsen Company (Us), Llc | Methods and apparatus to encode and decode audio for shopper location and advertisement presentation tracking |
US9117268B2 (en) * | 2008-12-17 | 2015-08-25 | Digimarc Corporation | Out of phase digital watermarking in two chrominance directions |
US8199969B2 (en) | 2008-12-17 | 2012-06-12 | Digimarc Corporation | Out of phase digital watermarking in two chrominance directions |
US8509474B1 (en) | 2009-12-11 | 2013-08-13 | Digimarc Corporation | Digital watermarking methods, apparatus and systems |
US8630726B2 (en) * | 2009-02-12 | 2014-01-14 | Value-Added Communications, Inc. | System and method for detecting three-way call circumvention attempts |
US9225838B2 (en) | 2009-02-12 | 2015-12-29 | Value-Added Communications, Inc. | System and method for detecting three-way call circumvention attempts |
US8199651B1 (en) | 2009-03-16 | 2012-06-12 | Audible Magic Corporation | Method and system for modifying communication flows at a port level |
CN102625982B (en) | 2009-05-01 | 2015-03-18 | 尼尔森(美国)有限公司 | Methods, apparatus and articles of manufacture to provide secondary content in association with primary broadcast media content |
US8878041B2 (en) * | 2009-05-27 | 2014-11-04 | Microsoft Corporation | Detecting beat information using a diverse set of correlations |
US8213673B2 (en) * | 2009-06-09 | 2012-07-03 | Avio Technology, Inc. | Watermarking of motion pictures |
CN101908201B (en) * | 2010-06-28 | 2012-01-04 | 宁波大学 | Robust digital image adaptive zero-watermarking method |
US8838977B2 (en) | 2010-09-16 | 2014-09-16 | Verance Corporation | Watermark extraction and content screening in a networked environment |
JP5723148B2 (en) * | 2010-12-28 | 2015-05-27 | 日本放送協会 | Encoder |
US9380356B2 (en) | 2011-04-12 | 2016-06-28 | The Nielsen Company (Us), Llc | Methods and apparatus to generate a tag for media content |
US9515904B2 (en) | 2011-06-21 | 2016-12-06 | The Nielsen Company (Us), Llc | Monitoring streaming media content |
US9209978B2 (en) | 2012-05-15 | 2015-12-08 | The Nielsen Company (Us), Llc | Methods and apparatus to measure exposure to streaming media |
US10474858B2 (en) | 2011-08-30 | 2019-11-12 | Digimarc Corporation | Methods of identifying barcoded items by evaluating multiple identification hypotheses, based on data from sensors including inventory sensors and ceiling-mounted cameras |
US8682026B2 (en) | 2011-11-03 | 2014-03-25 | Verance Corporation | Efficient extraction of embedded watermarks in the presence of host content distortions |
US8615104B2 (en) | 2011-11-03 | 2013-12-24 | Verance Corporation | Watermark extraction based on tentative watermarks |
US8533481B2 (en) | 2011-11-03 | 2013-09-10 | Verance Corporation | Extraction of embedded watermarks from a host content based on extrapolation techniques |
US8923548B2 (en) | 2011-11-03 | 2014-12-30 | Verance Corporation | Extraction of embedded watermarks from a host content using a plurality of tentative watermarks |
WO2013067589A1 (en) * | 2011-11-11 | 2013-05-16 | Gauss Research Laboratory, Inc | Digital communications |
US8745403B2 (en) | 2011-11-23 | 2014-06-03 | Verance Corporation | Enhanced content management based on watermark extraction records |
US9323902B2 (en) | 2011-12-13 | 2016-04-26 | Verance Corporation | Conditional access using embedded watermarks |
US9547753B2 (en) | 2011-12-13 | 2017-01-17 | Verance Corporation | Coordinated watermarking |
US9282366B2 (en) | 2012-08-13 | 2016-03-08 | The Nielsen Company (Us), Llc | Methods and apparatus to communicate audience measurement information |
US9571606B2 (en) | 2012-08-31 | 2017-02-14 | Verance Corporation | Social media viewing system |
US8726304B2 (en) | 2012-09-13 | 2014-05-13 | Verance Corporation | Time varying evaluation of multimedia content |
US20140075469A1 (en) | 2012-09-13 | 2014-03-13 | Verance Corporation | Content distribution including advertisements |
US8869222B2 (en) | 2012-09-13 | 2014-10-21 | Verance Corporation | Second screen content |
US9081778B2 (en) | 2012-09-25 | 2015-07-14 | Audible Magic Corporation | Using digital fingerprints to associate data with a work |
US9224184B2 (en) | 2012-10-21 | 2015-12-29 | Digimarc Corporation | Methods and arrangements for identifying objects |
US9313544B2 (en) | 2013-02-14 | 2016-04-12 | The Nielsen Company (Us), Llc | Methods and apparatus to measure exposure to streaming media |
US9262793B2 (en) | 2013-03-14 | 2016-02-16 | Verance Corporation | Transactional video marking system |
CN103390261B (en) * | 2013-07-05 | 2016-01-06 | 兰州交通大学 | Based on the vectorial geographical spatial data total blindness water mark method that error reduces |
NL2011201C2 (en) * | 2013-07-19 | 2015-01-21 | Civolution B V | Method and system for watermarking content prior to fragmenting. |
US9251549B2 (en) | 2013-07-23 | 2016-02-02 | Verance Corporation | Watermark extractor enhancements based on payload ranking |
US9711152B2 (en) | 2013-07-31 | 2017-07-18 | The Nielsen Company (Us), Llc | Systems apparatus and methods for encoding/decoding persistent universal media codes to encoded audio |
US20150039321A1 (en) | 2013-07-31 | 2015-02-05 | Arbitron Inc. | Apparatus, System and Method for Reading Codes From Digital Audio on a Processing Device |
US9208334B2 (en) | 2013-10-25 | 2015-12-08 | Verance Corporation | Content management using multiple abstraction layers |
RU2541865C1 (en) * | 2013-12-04 | 2015-02-20 | Федеральное государственное образовательное бюджетное учреждение высшего профессионального образования "Санкт-Петербургский государственный университет телекоммуникаций им. проф. М.А. Бонч-Бруевича" | Method of forming digital watermark-certified electronic colour image |
KR101731770B1 (en) | 2014-03-13 | 2017-04-28 | 베란스 코오포레이션 | Interactive content acquisition using embedded codes |
US9699499B2 (en) | 2014-04-30 | 2017-07-04 | The Nielsen Company (Us), Llc | Methods and apparatus to measure exposure to streaming media |
US9548830B2 (en) | 2014-09-05 | 2017-01-17 | The Nielsen Company (Us), Llc | Methods and apparatus to generate signatures representative of media |
US10652127B2 (en) | 2014-10-03 | 2020-05-12 | The Nielsen Company (Us), Llc | Fusing online media monitoring data with secondary online data feeds to generate ratings data for online media exposure |
CN104504645A (en) * | 2014-12-25 | 2015-04-08 | 辽宁师范大学 | Method for embedding and detecting robust image watermarks on basis of circular-harmonic-Fourier moments |
US9762965B2 (en) | 2015-05-29 | 2017-09-12 | The Nielsen Company (Us), Llc | Methods and apparatus to measure exposure to streaming media |
EP3133597A1 (en) | 2015-08-19 | 2017-02-22 | Tracklib Holdings AB | Method and apparatus for watermarking of audio tracks |
US10572961B2 (en) | 2016-03-15 | 2020-02-25 | Global Tel*Link Corporation | Detection and prevention of inmate to inmate message relay |
US9609121B1 (en) | 2016-04-07 | 2017-03-28 | Global Tel*Link Corporation | System and method for third party monitoring of voice and video calls |
US10027797B1 (en) | 2017-05-10 | 2018-07-17 | Global Tel*Link Corporation | Alarm control for inmate call monitoring |
US10225396B2 (en) | 2017-05-18 | 2019-03-05 | Global Tel*Link Corporation | Third party monitoring of a activity within a monitoring platform |
US10860786B2 (en) | 2017-06-01 | 2020-12-08 | Global Tel*Link Corporation | System and method for analyzing and investigating communication data from a controlled environment |
US9930088B1 (en) | 2017-06-22 | 2018-03-27 | Global Tel*Link Corporation | Utilizing VoIP codec negotiation during a controlled environment call |
CN108646710A (en) * | 2018-05-10 | 2018-10-12 | 中国民航大学 | A kind of electro-hydraulic joint steering engine method for estimating state based on improvement volume particle filter |
Family Cites Families (20)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4707077A (en) * | 1986-01-30 | 1987-11-17 | Hughes Aircraft Company | Real time image subtraction with a single liquid crystal light valve |
GB2196167B (en) * | 1986-10-01 | 1991-01-02 | Emi Plc Thorn | Apparatus for marking a recorded signal |
GB8806452D0 (en) * | 1988-03-18 | 1988-04-20 | Imperial College | Digital data security system |
US4939515A (en) * | 1988-09-30 | 1990-07-03 | General Electric Company | Digital signal encoding and decoding apparatus |
US5072314A (en) * | 1990-04-04 | 1991-12-10 | Rockwell International Corporation | Image enhancement techniques using selective amplification of spatial frequency components |
US5319735A (en) * | 1991-12-17 | 1994-06-07 | Bolt Beranek And Newman Inc. | Embedded signalling |
JPH07212712A (en) * | 1993-10-29 | 1995-08-11 | Eastman Kodak Co | Method and equipment for adding and deleting digital watermark in hierarchical picture memory and fetch system |
ATE199469T1 (en) * | 1993-11-18 | 2001-03-15 | Digimarc Corp | VIDEO COPY CONTROL WITH VARIOUS EMBEDDED SIGNALS |
GB9400971D0 (en) * | 1994-01-19 | 1994-03-16 | Mor Limited | Method of and apparatus for manipulating digital data |
US5488664A (en) * | 1994-04-22 | 1996-01-30 | Yeda Research And Development Co., Ltd. | Method and apparatus for protecting visual information with printed cryptographic watermarks |
US5530751A (en) * | 1994-06-30 | 1996-06-25 | Hewlett-Packard Company | Embedded hidden identification codes in digital objects |
US5568570A (en) * | 1994-09-30 | 1996-10-22 | Eastman Kodak Company | Method and apparatus for reducing quantization artifacts in a hierarchical image storage and retrieval system |
US5646997A (en) * | 1994-12-14 | 1997-07-08 | Barton; James M. | Method and apparatus for embedding authentication information within digital data |
GB9500285D0 (en) * | 1995-01-07 | 1995-03-01 | Central Research Lab Ltd | A method of labelling an audio signal |
US5530759A (en) * | 1995-02-01 | 1996-06-25 | International Business Machines Corporation | Color correct digital watermarking of images |
GB9502274D0 (en) * | 1995-02-06 | 1995-03-29 | Central Research Lab Ltd | Method and apparatus for coding information |
US5659726A (en) * | 1995-02-23 | 1997-08-19 | Sandford, Ii; Maxwell T. | Data embedding |
GB9504221D0 (en) * | 1995-03-02 | 1995-04-19 | Mor Limited | Method of and apparatus for manipulating digital data works |
US5664018A (en) * | 1996-03-12 | 1997-09-02 | Leighton; Frank Thomson | Watermarking process resilient to collusion attacks |
US5734752A (en) * | 1996-09-24 | 1998-03-31 | Xerox Corporation | Digital watermarking using stochastic screen patterns |
-
1996
- 1996-09-06 EP EP96114304A patent/EP0766468B1/en not_active Expired - Lifetime
- 1996-09-06 DE DE69636084T patent/DE69636084T2/en not_active Expired - Lifetime
- 1996-09-06 CA CA002184949A patent/CA2184949C/en not_active Expired - Fee Related
- 1996-09-24 JP JP25180196A patent/JP3522056B2/en not_active Expired - Lifetime
- 1996-09-25 AU AU65840/96A patent/AU701639B2/en not_active Ceased
-
1997
- 1997-09-10 US US08/926,720 patent/US5930369A/en not_active Expired - Lifetime
Also Published As
Publication number | Publication date |
---|---|
AU701639B2 (en) | 1999-02-04 |
EP0766468B1 (en) | 2006-05-03 |
DE69636084T2 (en) | 2006-09-14 |
CA2184949A1 (en) | 1997-03-29 |
DE69636084D1 (en) | 2006-06-08 |
JP3522056B2 (en) | 2004-04-26 |
AU6584096A (en) | 1997-04-10 |
EP0766468A3 (en) | 1999-07-07 |
US5930369A (en) | 1999-07-27 |
JPH09191394A (en) | 1997-07-22 |
EP0766468A2 (en) | 1997-04-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CA2184949C (en) | Secure spread spectrum watermarking for multimedia data | |
US6208735B1 (en) | Secure spread spectrum watermarking for multimedia data | |
Cox et al. | A secure, robust watermark for multimedia | |
Cox et al. | Secure spread spectrum watermarking for multimedia | |
Swanson et al. | Multiresolution scene-based video watermarking using perceptual models | |
Cox et al. | Review of watermarking and the importance of perceptual modeling | |
Nikolaidis et al. | Digital image watermarking: an overview | |
US6359985B1 (en) | Procedure for marking binary coded data sets | |
Su et al. | Digital watermarking of text, image, and video documents | |
US8037311B2 (en) | Digital watermark systems and methods | |
Podilchuk et al. | Digital image watermarking using visual models | |
US20030026422A1 (en) | Method and apparatus for digitally fingerprinting videos | |
Chandramouli et al. | Digital watermarking | |
Pal et al. | Study on watermarking techniques in digital images | |
Jain et al. | Robust Multiple Image Watermarking Based on Spread Transform | |
Duan et al. | A short summary of digital watermarking techniques for multimedia data | |
Genov | Digital watermarking of bitmap images | |
Vana | Digital Watermarking for color images using wavelet transform | |
Padmaa et al. | Spread spectrum image watermarking in wavelet domain | |
Daham | Encryption Based Watermarking Technique For Security Of Medical Image | |
Sagetong et al. | Dynamic wavelet feature-based watermarking for copyright tracking in digital movie distribution systems | |
George | Spread spectrum watermarking for images and video. | |
GARG | AN IMAGE WATERMARKING TECHNIQUE USING POWER SPECTRUM CONDITION | |
Garg et al. | THE PRAGMATIC REVIEW ON WATERMARKING TECHNIQUES IN DIGITAL IMAGE PROCESSING | |
Guo | Digital image watermarking for ownership verification |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
EEER | Examination request | ||
MKLA | Lapsed |
Effective date: 20150908 |
|
MKLA | Lapsed |
Effective date: 20150908 |