US5889868A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Optimization methods for the insertion, protection, and detection of digital watermarks in digitized data
Assignee: Wistaria Trading Ltd
•
Filing: 1996-07-02
•
Granted: 1999-03-30
•
Expires: 2016-07-02
Abstract
Abstract The implementations of digital watermarks can be optimally suited to particular transmission, distribution and storage mediums given the nature of digitally-sampled audio, video and other multimedia works. Watermark application parameters can be adapted to the individual characteristics of a given digital sample stream. Watermark information can be either carried in individual samples or in relationships between multiple samples, such as in a waveform shape. More optimal models may be obtained to design watermark systems that are tamper-resistant given the number and breadth of existent digitized sample options with different frequency and time components. The highest quality of a given content signal may be maintained as it is mastered, with the watermark suitably hidden, taking into account usage of digital filters and error correction. The quality of the underlying content signals can be used to identify and highlight advantageous locations for the insertion of digital watermarks. The watermark is integrated as closely as possible to the content signal, at a maximum level to force degradation of the content signal when attempts are made to remove the watermarks.
Inventors
- 👤 Scott A. Moskowitz
- 👤 Marc Cooperman
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 12:29
CPC Classifications
H; H04; H04N; H04N21/00; H04N21/80; H04N21/83; H04N21/835; H04N21/8358; H04L; H04L9/00; H04L9/32; H04L9/3263; H04N21/20; H04N21/23; H04N21/238; H04N21/2389; H04N21/23892; H04L2209/00; H04L2209/34; H04L2209/60; H04L2209/603; H04L2209/608
Claims Analysis
Total Claims: 77
Claim 1
Independent Claim
157 words
A method for amplitude independent encoding of digital watermark information in a signal, comprising steps of: determining in said signal a sample window having a minimum and a maximum; determining a quantization interval of said sample window, where said quantitization interval can be used to quantize normalized window samples; normalizing the sample window to provide normalized samples, where normalized samples conform to a limited range of values, proportional to real sample values, and comprise a representation of the real sample values with a resolution higher than the real range of values, and where the normalized values can be divided by the quantization interval into distinct quantization levels; analyzing the normalized samples to determine quantization levels; comparing the message bits to the corresponding quantization level information from the analyzing step; when a bit conflicts with the quantization level, adjusting the quantization level of said sample window to correspond to the message bit; and de-normalizing the analyzed normalized samples.
Claim 2
Independent Claim
157 words
A method for amplitude independent encoding of digital watermark information in a signal, comprising steps of: determining in said signal a sample window having a minimum and a maximum; determining a quantization interval of said sample window, where said quantitization interval can be used to quantize normalized window samples; normalizing the sample window to provide normalized samples, where normalized samples conform to a limited range of values, proportional to real sample values, and comprise a representation of the real sample values with a resolution higher than the real range of values, and where the normalized values can be divided by the quantization interval into distinct quantization levels; analyzing the normalized samples to determine quantization levels; comparing the message bits to the corresponding quantization level information from the analyzing step; when a bit conflicts with the quantization level, adjusting the quantization level of said sample window to correspond to the message bit; and de-normalizing the analyzed normalized samples.
Claim 3
Dependent Claim
17 words
The method according to claim 1, wherein watermark signal characteristics or a watermark certificate can be compressed.
Claim 4
Independent Claim
120 words
A method for amplitude independent decoding of digital watermark information in a signal comprising steps of: determining in said signal a sample window having a minimum and a maximum; determining a quantization interval of said sample window, where said quantitization interval can be used to quantize normalized window samples; normalizing the sample window to provide samples, where normalized samples conform to a limited range of values, proportional to real sample values, and comprise a representation of the real sample values with a resolution higher than the real range of values, and where the normalized values can be divided by the quantization interval into distinct quantization levels; and analyzing the quantization level of said samples to determine a message bit value.
Claim 5
Independent Claim
120 words
A method for amplitude independent decoding of digital watermark information in a signal comprising steps of: determining in said signal a sample window having a minimum and a maximum; determining a quantization interval of said sample window, where said quantitization interval can be used to quantize normalized window samples; normalizing the sample window to provide samples, where normalized samples conform to a limited range of values, proportional to real sample values, and comprise a representation of the real sample values with a resolution higher than the real range of values, and where the normalized values can be divided by the quantization interval into distinct quantization levels; and analyzing the quantization level of said samples to determine a message bit value.
Claim 6
Dependent Claim
17 words
The method according to claim 3, wherein watermark signal characteristics or a watermark certificate can be compressed.
Claim 7
Independent Claim
44 words
A method of encoding and decoding watermarks in a signal, comprising insertion and detection of abstract signal features in said signal to carry watermark information, wherein said abstract signal features are mathematical functions of the input sample window, and by extension, adjacent sample windows.
Claim 8
Independent Claim
44 words
A method of encoding and decoding watermarks in a signal, comprising insertion and detection of abstract signal features in said signal to carry watermark information, wherein said abstract signal features are mathematical functions of the input sample window, and by extension, adjacent sample windows.
Claim 9
Independent Claim
30 words
A method of pre-analyzing a digital signal for encoding digital watermarks using a digital filter comprising determining what changes in the digital signal will be affected by the digital filter.
Claim 10
Independent Claim
30 words
A method of pre-analyzing a digital signal for encoding digital watermarks using a digital filter comprising determining what changes in the digital signal will be affected by the digital filter.
Claim 11
Dependent Claim
48 words
The method according to claim 6, further comprising a step of encoding watermarks so as to either avoid frequency or time delimited areas of the signal which will be changed by the digital filter, or ensure that the watermark will survive the changes instroduced by the digital filter.
Claim 12
Independent Claim
42 words
A method of error coding watermark message certificates using cross interleaved codes which use error codes of high redundancy, including codes with Hamming distances of greater than or equal to n, wherein n is a number of bits in a message block.
Claim 13
Independent Claim
42 words
A method of error coding watermark message certificates using cross interleaved codes which use error codes of high redundancy, including codes with Hamming distances of greater than or equal to n, wherein n is a number of bits in a message block.
Claim 14
Independent Claim
22 words
A method of pre-processing a watermark message certificate comprising determining an exact length of the watermark message as it will be encoded.
Claim 15
Independent Claim
22 words
A method of pre-processing a watermark message certificate comprising determining an exact length of the watermark message as it will be encoded.
Claim 16
Dependent Claim
30 words
The method according to claim 9, further comprising a step of generating a watermark key which will provide at least one unique bit for each bit comprising the watermark message.
Claim 17
Independent Claim
43 words
A method of encoding a watermark in a digital signal, comprising the steps of: generating watermark pseudo-random key bits using a non-linear generator; and encoding the watermark in the digital signal using the watermark pseudo-random key bits and characteristics of the digital signal.
Claim 18
Independent Claim
43 words
A method of encoding a watermark in a digital signal, comprising the steps of: generating watermark pseudo-random key bits using a non-linear generator; and encoding the watermark in the digital signal using the watermark pseudo-random key bits and characteristics of the digital signal.
Claim 19
Independent Claim
43 words
A method of encoding a watermark in a digital signal, comprising the steps of: generating watermark pseudo-random key bits using a chaotic generator; and encoding the watermark in the digital signal using the watermark pseudo-random key bits and characteristics of the digital signal.
Claim 20
Independent Claim
43 words
A method of encoding a watermark in a digital signal, comprising the steps of: generating watermark pseudo-random key bits using a chaotic generator; and encoding the watermark in the digital signal using the watermark pseudo-random key bits and characteristics of the digital signal.
Claim 21
Independent Claim
48 words
A method of encoding a watermark in a digital signal, comprising the steps of: mapping pseudo-random key and processing state information to effect an encode/decode map using a non-linear generator; and encoding the watermark in the digital signal using the encode/decode map and characteristics of the digital signal.
Claim 22
Independent Claim
48 words
A method of encoding a watermark in a digital signal, comprising the steps of: mapping pseudo-random key and processing state information to effect an encode/decode map using a non-linear generator; and encoding the watermark in the digital signal using the encode/decode map and characteristics of the digital signal.
Claim 23
Independent Claim
48 words
A method of encoding a watermark in a digital signal, comprising the steps of: mapping pseudo-random key and processing state information to effect an encode/decode map using a chaotic generator; and encoding the watermark in the digital signal using the encode/decode map and characteristics of the digital signal.
Claim 24
Independent Claim
48 words
A method of encoding a watermark in a digital signal, comprising the steps of: mapping pseudo-random key and processing state information to effect an encode/decode map using a chaotic generator; and encoding the watermark in the digital signal using the encode/decode map and characteristics of the digital signal.
Claim 25
Independent Claim
26 words
A method of guaranteeing watermark certificate uniqueness comprising attaching a timestamp or user identification dependent hash or message digest of watermark certificate data to the certificate.
Claim 26
Independent Claim
26 words
A method of guaranteeing watermark certificate uniqueness comprising attaching a timestamp or user identification dependent hash or message digest of watermark certificate data to the certificate.
Claim 27
Independent Claim
34 words
A method of generating and modulating a local noise signal to contain watermark information, wherein the noise signal is a function of at least one variable which depends on key and processing state information.
Claim 28
Independent Claim
34 words
A method of generating and modulating a local noise signal to contain watermark information, wherein the noise signal is a function of at least one variable which depends on key and processing state information.
Claim 29
Independent Claim
28 words
A method of varying watermark quantizations such that the dither changes an absolute quantization value, but does not change a quantization level or information carried in the quantization.
Claim 30
Independent Claim
28 words
A method of varying watermark quantizations such that the dither changes an absolute quantization value, but does not change a quantization level or information carried in the quantization.
Claim 31
Independent Claim
37 words
A method of encoding watermarks comprising steps of: inverting at least one instance of the watermark bit stream; and p1 encoding at least one instance of the watermark using said inverted instance of the watermark bit stream.
Claim 32
Independent Claim
37 words
A method of encoding watermarks comprising steps of: inverting at least one instance of the watermark bit stream; and p1 encoding at least one instance of the watermark using said inverted instance of the watermark bit stream.
Claim 33
Independent Claim
29 words
A method of decoding watermarks comprising steps of: considering an original watermark synchronization marker, an inverted watermark synchronization marker, and inverted watermarks; and decoding based on the considering step.
Claim 34
Independent Claim
29 words
A method of decoding watermarks comprising steps of: considering an original watermark synchronization marker, an inverted watermark synchronization marker, and inverted watermarks; and decoding based on the considering step.
Claim 35
Independent Claim
38 words
A method of encoding and decoding watermarks in a signal using a spread spectrum technique to encode or decode where information is encoded or decoded at audible levels and the encoding and decoding methods are pseudo-random over frequency.
Claim 36
Independent Claim
38 words
A method of encoding and decoding watermarks in a signal using a spread spectrum technique to encode or decode where information is encoded or decoded at audible levels and the encoding and decoding methods are pseudo-random over frequency.
Claim 37
Independent Claim
38 words
A method of encoding and decoding watermarks in a signal using a spread spectrum technique to encode or decode where information is encoded or decoded at audible levels and the encoding and decoding methods are pseudo-random over time.
Claim 38
Independent Claim
38 words
A method of encoding and decoding watermarks in a signal using a spread spectrum technique to encode or decode where information is encoded or decoded at audible levels and the encoding and decoding methods are pseudo-random over time.
Claim 39
Dependent Claim
28 words
The method of claim 21, wherein the information is encoded or decoded at audible levels and the encoding and decoding methods are pseudo-random, over both frequency and time.
Claim 40
Independent Claim
92 words
A method of analyzing composite digitized signals for watermarks comprising steps of: obtaining a composite signal; obtaining an unwatermarked sample signal; time aligning the unwatermarked sample signal to the composite signal; gain adjusting the time aligned unwatermarked sample signal to a corresponding segment of the composite signal, determined in the time aligning step; estimating a pre-composite signal using the composite signal and the gain adjusted unwatermarked sample signal; estimating a watermarked sample signal by subtracting the estimated pre-composite signal from the composite signal; and scanning the estimated watermarked sample signal for watermarks.
Claim 41
Independent Claim
92 words
A method of analyzing composite digitized signals for watermarks comprising steps of: obtaining a composite signal; obtaining an unwatermarked sample signal; time aligning the unwatermarked sample signal to the composite signal; gain adjusting the time aligned unwatermarked sample signal to a corresponding segment of the composite signal, determined in the time aligning step; estimating a pre-composite signal using the composite signal and the gain adjusted unwatermarked sample signal; estimating a watermarked sample signal by subtracting the estimated pre-composite signal from the composite signal; and scanning the estimated watermarked sample signal for watermarks.
Claim 42
Independent Claim
112 words
A method for varying watermark encode/decode algorithms automatically during the encoding or decoding of a watermark comprising steps of: a) assigning a list of desired CODECs to a list of corresponding signal characteristics which indicate use of particular CODECs; b) during encoding/decoding, analyzing characteristics of the current sample frame in the signal stream, prior to delivering the frame to a CODEC; c) looking up the corresponding CODEC from the list of CODECs in step (a) which matches the observed signal characteristics from step (b); d) loading and/or preparing the desired CODEC; e) passing the sample frame to the CODEC selected in step (c); and f) receiving the output samples from step (e).
Claim 43
Independent Claim
112 words
A method for varying watermark encode/decode algorithms automatically during the encoding or decoding of a watermark comprising steps of: a) assigning a list of desired CODECs to a list of corresponding signal characteristics which indicate use of particular CODECs; b) during encoding/decoding, analyzing characteristics of the current sample frame in the signal stream, prior to delivering the frame to a CODEC; c) looking up the corresponding CODEC from the list of CODECs in step (a) which matches the observed signal characteristics from step (b); d) loading and/or preparing the desired CODEC; e) passing the sample frame to the CODEC selected in step (c); and f) receiving the output samples from step (e).
Claim 44
Dependent Claim
17 words
The method according to claim 24, wherein watermark signal characteristics or a watermark certificate can be compressed.
Claim 45
Independent Claim
128 words
A method for varying watermark encode/decode algorithms automatically during the encoding or decoding of a watermark comprising steps of: a) assigning a list of desired CODECs to a list of index values which correspond to values computed as a function of the pseudo-random watermark key and the state of the processing framework; b) during encoding/decoding, computing the pseudo-random key index value for the current sample frame in the signal stream, prior to delivering the frame to a CODEC; c) looking up the corresponding CODEC from the list of CODECs in step (a) which matches the index value from step (b); d) loading and/or preparing the desired CODEC; e) passing the sample frame to the CODEC selected in step (c); and f) receiving the output samples from step (e).
Claim 46
Independent Claim
128 words
A method for varying watermark encode/decode algorithms automatically during the encoding or decoding of a watermark comprising steps of: a) assigning a list of desired CODECs to a list of index values which correspond to values computed as a function of the pseudo-random watermark key and the state of the processing framework; b) during encoding/decoding, computing the pseudo-random key index value for the current sample frame in the signal stream, prior to delivering the frame to a CODEC; c) looking up the corresponding CODEC from the list of CODECs in step (a) which matches the index value from step (b); d) loading and/or preparing the desired CODEC; e) passing the sample frame to the CODEC selected in step (c); and f) receiving the output samples from step (e).
Claim 47
Dependent Claim
17 words
The method according to claim 26, wherein watermark signal characteristics or a watermark certificate can be compressed.
Claim 48
Dependent Claim
20 words
The method of claim 23, further comprising the step of accessing spectral coefficient amplitude information in the watermarked sample signal.
Claim 49
Dependent Claim
24 words
The method of claim 28, wherein the spectral coefficient amplitude information represents less than a total number of bits in the unwatermarked sample signal.
Claim 50
Dependent Claim
21 words
The method of claim 28, wherein the spectral coefficient amplitude information represents a signal characteristic parameter for use in watermark decoding.
Claim 51
Dependent Claim
48 words
The method of claim 1, further comprising the step of randomly encoding watermark bits in the signal, wherein less than a total number of available candidate watermark bits are encoded as determined by at least one of a primary mask, a convolution mask, and a message delimiter mask.
Claim 52
Dependent Claim
26 words
The method of claim 31, wherein at least one of the primary mask, the convolution mask, and the message delimiter mask comprise an optimal digital filter.
Claim 53
Dependent Claim
21 words
The method of claim 32, further comprising the step of encoding additional bits in the signal using a separate predetermined key.
Claim 54
Dependent Claim
17 words
The method of claim 31, further comprising the step of decorrelating additional bits using a dither technique.
Claim 55
Dependent Claim
50 words
The method of claim 1, further comprising the step of randomly encoding message delimiter bits in the signal, wherein less than a total number of available candidate message delimiter bits are encoded as determined by at least one of a primary mask, a convolution mask, and a message delimiter mask.
Claim 56
Dependent Claim
26 words
The method of claim 35, wherein at least one of the primary mask, the convolution mask, and the message delimiter mask comprise an optimal digital filter.
Claim 57
Dependent Claim
21 words
The method of claim 36, further comprising the step of encoding additional bits in the signal using a separate predetermined key.
Claim 58
Dependent Claim
17 words
The method of claim 35, further comprising the step of decorrelating additional bits using a dither technique.
Claim 59
Dependent Claim
28 words
The method of claim 15, further comprising the step of using a predetermined key to decode message delimiter bits for verification of one or more digital signature bits.
Claim 60
Dependent Claim
29 words
The method of claim 1, further comprising the step of adding one or more random noise bits to a set of bits representing a watermark before encoding the watermark.
Claim 61
Dependent Claim
18 words
The method of claim 1, further comprising the step of randomly varying two or more adjacent sample windows.
Claim 62
Dependent Claim
18 words
The method of claim 5, further comprising the step of randomly varying two or more adjacent sample windows.
Claim 63
Dependent Claim
15 words
The method of claim 3, further comprising the step of changing a transform coefficient amplitude.
Claim 64
Dependent Claim
17 words
The method of claim 3, wherein a watermark bit occupies more time than a single transform frame.
Claim 65
Dependent Claim
39 words
The method of claim 44, wherein a redundant block code is used to encode watermark bits, such that n bits are encoded into a block having a length of m bits, where m is several times greater than n.
Claim 66
Dependent Claim
51 words
The method of claim 6, further comprising the step of encoding a watermark using a psychoacoustic model by first determining where watermark bits are inaudibly suited without introducing audible artifacts using a psychoacoustic filter, and then encoding the watermark bits by making signal modifications that are below a predicted masking level.
Claim 67
Dependent Claim
22 words
The method of claim 46, wherein the watermark bits are encoded into a subset of time regions below the predicted masking level.
Claim 68
Dependent Claim
22 words
The method of claim 46, wherein the watermark bits are encoded into a subset of frequency regions below the predicted masking level.
Claim 69
Dependent Claim
51 words
The method of claim 7, further comprising the step of encoding a watermark using a psychoacoustic model by first determining where watermark bits are inaudibly suited without introducing audible artifacts using a psychoacoustic filter, and then encoding the watermark bits by making signal modifications that are below a predicted masking level.
Claim 70
Dependent Claim
22 words
The method of claim 49, wherein the watermark bits are encoded into a subset of time regions below the predicted masking level.
Claim 71
Dependent Claim
22 words
The method of claim 49, wherein the watermark bits are encoded into a subset of frequency regions below the predicted masking level.
Claim 72
Dependent Claim
51 words
The method of claim 6, further comprising the step of encoding a watermark using a psychovisual model by first determining where watermark bits are invisibly suited without introducing visible artifacts using a psychovisual filter, and then encoding the watermark bits by making signal modifications that are below a predicted masking level.
Claim 73
Dependent Claim
22 words
The method of claim 52, wherein the watermark bits are encoded into a subset of time regions below the predicted masking level.
Claim 74
Dependent Claim
22 words
The method of claim 52, wherein the watermark bits are encoded into a subset of frequency regions below the predicted masking level.
Claim 75
Dependent Claim
51 words
The method of claim 7, further comprising the step of encoding a watermark using a psychovisual model by first determining where watermark bits are invisibly suited without introducing visible artifacts using a psychovisual filter, and then encoding the watermark bits by making signal modifications that are below a predicted masking level.
Claim 76
Dependent Claim
22 words
The method of claim 55, wherein the watermark bits are encoded into a subset of time regions below the predicted masking level.
Claim 77
Dependent Claim
22 words
The method of claim 55, wherein the watermark bits are encoded into a subset of frequency regions below the predicted masking level.
References Cited (Backward Citations)
US4200770A
Cited
US4218582A
Cited
US4405829A
Cited
US4424414A
Cited
US4908873A
Cited
US4980782A
Cited
US4748668A
Cited
US4979210A
Cited
US5073925A
Cited
US5287407A
Cited
US5319735A
Cited
US5506795A
Cited
US5379345A
Cited
US5365586A
Cited
US5408505A
Cited
US5740244A
Cited
US5428606A
Cited
US5412718A
Cited
US5680462A
Cited
US5751811A
Cited
US5696828A
Cited
US5757923A
Cited
US5745569A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-03-29 | 2002-09-28 | 2003-03-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-03-29 | 2006-09-28 | 2007-03-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-03-29 | 2010-09-28 | 2011-03-30 | $7700.00 | Window Closed / Lapsed |