Source: http://www.google.com/patents/US8121343?dq=7,003,515
Timestamp: 2014-03-15 19:47:20
Document Index: 303662249

Matched Legal Cases: ['Application No. 60', 'Application No. 60', 'Application No. 60', 'Application No. 96919405', 'Application No. 07112420', 'Application No. 96919405']

Patent US8121343 - Optimization methods for the insertion, protection, and detection of digital ... - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsThe 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...http://www.google.com/patents/US8121343?utm_source=gb-gplus-sharePatent US8121343 - Optimization methods for the insertion, protection, and detection of digital watermarks in digitized dataAdvanced Patent SearchPublication numberUS8121343 B2Publication typeGrantApplication numberUS 12/901,568Publication dateFeb 21, 2012Filing dateOct 10, 2010Priority dateJul 2, 1996Also published asUS7095874, US7409073, US7844074, US8175330, US20030219143, US20060285722, US20100002904, US20110103639, US20110305365Publication number12901568, 901568, US 8121343 B2, US 8121343B2, US-B2-8121343, US8121343 B2, US8121343B2InventorsScott Moskowitz, Marc CoopermanOriginal AssigneeWistaria Trading, IncExport CitationBiBTeX, EndNote, RefManPatent Citations (106), Non-Patent Citations (165), Classifications (33), Legal Events (3) External Links: USPTO, USPTO Assignment, EspacenetOptimization methods for the insertion, protection, and detection of digital watermarks in digitized dataUS 8121343 B2Abstract 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.
What is claimed: 1. A method of detecting a watermark message comprising:
identifying, with a processor, signal characteristics suitable for embedding one or more bits of a watermark message within a signal;
using a watermarking key to detect said watermark message from the identified signal characteristics.
2. The method of claim 1 further comprising converting said signal from analog to digital.
3. The method of claim 1 wherein said signal is a digital signal.
4. An article of manufacture comprising a non-transitory machine readable medium, having thereon stored instructions adapted to be executed by a processor, which instructions when executed result in a process comprising:
identifying signal characteristics within a signal that are signal characteristics are suitable for embedding one or more bits of a watermark message; using a watermarking key to detect the watermark message from the identified signal characteristics.
5. An article of manufacture comprising a non-transitory machine readable medium, having thereon stored instructions adapted to be executed by a processor, which instructions when executed result in a process comprising:
identifying signal characteristics within a signal, which signal characteristics are suitable for embedding one or more bits of a watermark message; using a watermarking key to detect the watermark message from the identified signal characteristics.
6. A method of decoding a watermark message from a signal, comprising:
analyzing said signal to identify signal features within said signal that are suitable for embedding one or more bits of a watermark message; and decoding a watermark message from said signal using said signal features identified by the analyzing step.
7. An article of manufacture comprising a non-transitory machine readable medium, having thereon stored instructions adapted to be executed by a processor, which instructions when executed result in a process comprising:
identifying signal characteristics within a signal that are suitable for embedding one or more bits of a watermark message; using a watermark key to embed the watermark message into the identified signal characteristics.
8. A method of embedding a watermark message comprising:
identifying, with a processor, signal characteristics within a signal that are suitable for embedding one or more bits of a watermark message; using a watermark key to embed the watermark message into the identified signal characteristics.
9. The method of claim 8 further comprising converting said signal from analog to digital.
10. The method of claim 8 wherein said signal is a digital signal.
11. An article of manufacture comprising a non-transitory machine readable medium, having thereon stored instructions adapted to be executed by a processor, which instructions when executed result in a process comprising:
identifying signal features capable of carrying one or more bits of a watermark message within a signal, using a perceptual model; and
analyzing at least a portion of the signal to determine at least a portion of the watermark message.
12. The article of claim 11 wherein said analyzing comprises analyzing the identified signal features.
13. The method of claim 12 wherein said analyzing comprises analyzing the identified signal features.
14. A method of determining at least a portion of the watermark message comprising:
identifying, using a processor, signal features capable of carrying one or more bits of a watermark message within a signal, using a perceptual model; and analyzing, using said processor, at least a portion of the signal to determine at least a portion of the watermark message.
15. The method of claim 14 further comprising converting said signal from analog to digital.
16. The method of claim 14 wherein said signal is a digital signal. Description
RELATED APPLICATIONS This application is a continuation of U.S. patent application Ser. No. 12/215,812, filed Jun. 30, 2008 now U.S. Pat. No. 7,844,074, which is a continuation of U.S. patent application Ser. No. 11/482,654, filed Jul. 7, 2006 (now U.S. Pat. No. 7,409,073), which is a continuation U.S. patent application Ser. No. 10/369,344, filed Feb. 18, 2003 (now U.S. Pat. No. 7,095,874), which is a continuation of U.S. application Ser. No. 09/281,279, filed Mar. 30, 1999 (now U.S. Pat. No. 6,522,767), which is a continuation of U.S. patent application Ser. No. 08/677,435, filed Jul. 2, 1996 (now U.S. Pat. No. 5,889,868). The previously identified patents and/or patent applications are hereby incorporated by reference in their entireties, as if fully stated herein.
This application is also related to the following pending applications: U.S. patent application Ser. No. 08/674,726, filed Jul. 2, 1996, entitled �Exchange Mechanisms for Digital Information Packages with Bandwidth Securitization, Multichannel Digital Watermarks, and Key Management� (issued as U.S. Pat. No. 7,362,775); pending U.S. patent application Ser. No. 08/999,766, filed Jul. 23, 1997, entitled �Steganographic Method and Device�; U.S. patent application Ser. No. 09/046,627, filed Mar. 24, 1998, entitled �Method for Combining Transfer Function with Predetermined Key Creation� (issued as U.S. Pat. No. 6,598,162); U.S. patent application Ser. No. 09/053,628, filed Apr. 2, 1998, entitled �Multiple Transform Utilization and Application for Secure Digital Watermarking� (issued as U.S. Pat. No. 6,205,249); U.S. patent application Ser. No. 09/281,279, filed Mar. 30, 1999, entitled �Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digital Data� (issued as U.S. Pat. No. 6,522,767); pending U.S. Provisional Application No. 60/169,274, filed Dec. 7, 1999, entitled �Systems, Methods And Devices For Trusted Transactions�; U.S. patent application Ser. No. 09/456,319, filed Dec. 8, 1999, entitled �Z-Transform Implementation of Digital Watermarks� (issued as U.S. Pat. No. 6,853,726); U.S. patent application Ser. No. 09/545,589, filed Apr. 7, 2000, entitled �Method and System for Digital Watermarking� (issued as U.S. Pat. No. 7,007,166); U.S. patent application Ser. No. 09/594,719, filed Jun. 16, 2000, entitled �Utilizing Data Reduction in Steganographic and Cryptographic Systems� (issued as U.S. Pat. No. 7,123,718) (which is a continuation-in-part of International Application No. PCT/US00/06522, filed Mar. 14, 2000, which PCT application claimed priority to U.S. Provisional Application No. 60/125,990, filed Mar. 24, 1999); U.S. patent application Ser. No. 10/049,101, filed Feb. 8, 2002, entitled �A Secure Personal Content Server� (which claims priority to International Application No. PCT/US00/21189, filed Aug. 4, 2000, which claims priority to U.S. patent application Ser. No. 60/147,134, filed Aug. 4, 1999, and to U.S. patent application Ser. No. 60/213,489, filed Jun. 23, 2000), U.S. patent application Ser. No. 09/657,181, filed Sep. 7, 2000, entitled �Method And Device For Monitoring And Analyzing Signals� (issued as U.S. Pat. No. 7,343,492); U.S. Provisional Patent Application No. 60/234,199, filed Sep. 20, 2000, entitled �Improved Security Based on Subliminal and Supraliminal Channels For Data Objects�; and U.S. patent application Ser. No. 09/671,739, filed Sep. 29, 2000, entitled �Method And Device For Monitoring And Analyzing Signals,� (now abandoned) U.S. patent application Ser. No. 09/731,039, entitled �System and Method for Permitting Open Access to Data Objects and For Securing Data Within the Data Objects,� filed Dec. 7, 2000 (issued as U.S. Pat. No. 7,177,429); and U.S. patent application Ser. No. 09/731,040, entitled �Systems, Methods and Devices for Trusted Transactions,� filed Dec. 7, 2000 (issued as U.S. Pat. No. 7,159,116). The previously identified patents and/or patent applications are hereby incorporated by reference, in their entireties as if fully stated herein.
In addition, this application hereby incorporates by reference, as if fully stated herein, the disclosures of the following patents: U.S. Pat. No. 5,822,432, entitled �Method for Human Assisted Random Key Generation . . . �; U.S. Pat. No. 5,905,800, entitled �Method & System for Digital Watermarking�; U.S. Pat. No. 5,613,004, entitled �Steganographic Method and Device�; U.S. Pat. No. 5,687,236, entitled �Steganographic Method and Device�; U.S. Pat. No. 5,745,569, entitled �Method for Stega-Protection of Computer Code�; U.S. Pat. No. 6,078,664, entitled �Z-Transform Implementation of Digital Watermarks�; U.S. Pat. No. 5,428,606, entitled �Digital Commodities Exchange�; U.S. Pat. No. 5,889,868, entitled �Optimization Methods for the Insertion, Protection and Detection . . . �; U.S. Pat. No. 5,539,735, entitled �Digital Information Commodities Exchange�.
BACKGROUND OF THE INVENTION The present invention relates to digital watermarks.
Digital watermarks exist at a convergence point where creators and publishers of digitized multimedia content demand localized, secured identification and authentication of that content. Because existence of piracy is clearly a disincentive to the digital distribution of copyrighted works, establishment of responsibility for copies and derivative copies of such works is invaluable. In considering the various forms of multimedia content, whether �master,� stereo, NTSC video, audio tape or compact disc, tolerance of quality degradation will vary with individuals and affect the underlying commercial and aesthetic value of the content. It is desirable to tie copyrights, ownership rights, purchaser information or some combination of these and related data to the content in such a manner that the content must undergo damage, and therefore a reduction in value, with subsequent, unauthorized distribution of the content, whether it be commercial or otherwise.
Presumably, the commercial value of some works will dictate some level of piracy not detectable in practice and deemed �reasonable� by rights holders given the overall economic return. For example, there will always be fake $100 bills, LEVI jeans, and GUCCI bags, given the sizes of the overall markets and potential economic returns for pirates in these markets�as there also will be unauthorized copies of works of music, operating systems (Windows95, etc.), video and future multimedia goods.
However, what differentiates the �digital marketplace� from the physical marketplace is the absence of any scheme that establishes responsibility and trust in the authenticity of goods. For physical products, corporations and governments mark the goods and monitor manufacturing capacity and sales to estimate loss from piracy. There also exist reinforcing mechanisms, including legal, electronic, and informational campaigns to better educate consumers.
SUMMARY OF THE INVENTION The present invention relates to implementations of digital watermarks that are optimally suited to particular transmission, distribution and storage mediums given the nature of digitally-sampled audio, video, and other multimedia works.
The present invention additionally relates to the implementation of digital watermarks that are feature-based. That is, a system where watermark information is not carried in individual samples, but is carried in the relationships between multiple samples, such as in a waveform shape. The present invention envisions natural extensions for digital watermarks that may also separate frequencies (color or audio), channels in 3D while utilizing discreteness in feature-based encoding only known to those with pseudo-random keys (i.e., cryptographic keys) or possibly tools to access such information, which may one day exist on a quantum level.
The present invention additionally relates to a method for obtaining more optimal models to design watermark systems that are tamper-resistant given the number and breadth of existent digitized-sample options with differing frequency and time components (audio, video, pictures, multimedia, virtual reality, etc.).
The present invention additionally preserves quality of underlying content signals, while using methods for quantifying this quality to identify and highlight advantageous locations for the insertion of digital watermarks.
The present invention relates to a method for amplitude independent encoding of digital watermark information in a signal including steps of determining in the signal a sample window having a minimum and a maximum, determining a quantization interval of the sample window, normalizing the sample window, normalizing the sample window to provide normalized samples, analyzing the normalized samples, comparing the normalized samples to message bits, adjusting the quantization level of the sample window to correspond to the message bit when a bit conflicts with the quantization level and de-normalizing the analyzed samples.
The present invention also relates to a method for amplitude independent decoding of digital watermark information in a signal including steps of determining in the signal a sample window having a minimum and a maximum, determining a quantization interval of the sample window, normalizing the sample window to provide samples, and analyzing the quantization level of the samples to determine a message bit value.
The present invention additionally relates to a method of encoding and decoding watermarks in a signal where, rather than individual samples, insertion and detection of abstract signal features to carry watermark information in the signal is done.
The present invention also relates to a method for pre-analyzing a digital signal for encoding digital watermarks using an optimal digital filter in which it is determined what noise elements in the digital signal will be removed by the optimal digital filter based on response characteristics of the filter.
The present invention also relates to 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.
The present invention additionally relates to a method of pre-processing a watermark message certificate including a step of determining an absolute bit length of the watermark message as it will be encoded.
The present invention additionally relates to a method of generating watermark pseudo-random key bits using a non-linear (chaotic) generator or to a method of mapping pseudo-random key and processing state information to affect an encode/decode map using a non-linear (chaotic) generator.
The present invention additionally relates to a method of guaranteeing watermark certificate uniqueness including a step of attaching a time stamp or user identification dependent hash or message digest of watermark certificate data to the certificate.
The present invention also relates to a method of generating and quantizing a local noise signal to contain watermark information where the noise signal is a function of at least one variable which depends on key and processing state information.
The present invention also relates to 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.
The present invention further relates to a method of encoding watermarks including inverting at least one watermark bit stream and encoding a watermark including the inverted watermark bit stream.
The present invention also relates to a method of decoding watermarks by considering an original watermark synchronization marker, an inverted watermark synchronization marker, and inverted watermarks, and decoding based on those considerations.
The present invention also relates to 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 randomized over both frequency and time.
The present invention additionally relates to a method of analyzing composite digitized signals for watermarks including 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 the composite signal, 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 for the composite signal, and scanning the estimated watermark sample signal for watermarks.
The present invention additionally relates to a method for varying watermark encode/decode algorithms automatically during the encoding or decoding of a watermark including 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 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).
The present invention also relates to a method for varying watermark encode/decode algorithms automatically during the encoding or decoding of a watermark, including steps of (a) assigning a list of desired CODECs to a list of index values which correspond to values computed 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).
Disclosed herein is a process comprising: a) pre-analyzing a digital signal to identify potential watermarking locations within the digital signal, which potential watermarking locations are suitable for embedding one or more bits of a watermark message; b) pre-processing a watermark message to determine an exact length of the watermark message to be embedded within the digital signal based on the pre-analyzing step; and c) embedding the exact length of the watermark message into the digital signal using the locations identified by the pre-analyzing step. The process may also include the step of determining the size of a watermarking key to embed the exact length of the watermark message as determined by the pre-processing step, into the digital signal as determined by the pre-analyzing step, which key may then be used to embed the watermark message. Theses processes may also be implemented in articles of manufacture comprising a machine readable medium with stored instructions that will be executed by a processor.
Also disclosed herein is an article of manufacture comprising a machine readable medium, having thereon stored instructions adapted to be executed by a processor, which instructions when executed result in a process comprising: a) selecting a sample window in a digital signal having embedded watermarks; b) determining a quantization interval of the sample window, wherein the quantization interval can be used to quantize normalized sample windows; c) normalizing the sample window to provide normalized samples, wherein the normalized samples conform to a limited range of normalized values that can be divided by the quantization interval into distinct quantization levels; d) identifying potential watermark locations within the sample window using a psychoacoustics and/or psycho-visual model, which potential watermark locations are capable of carrying one or more bits of a watermark message; and analyzing quantization level of the normalized samples to determine a portion of the watermark message. The above described process may also be carried out on general purpose computers.
Also disclosed is a method of analyzing a potentially watermarked, digital signal for watermarks comprising steps of: a) obtaining a potentially watermarked digital signal; b) obtaining an unwatermarked sample signal, said sample signal being different in length than the potentially watermarked digital signal; c) time aligning the unwatermarked sample signal to the potentially watermarked digital signal to identify a segment of the potentially watermarked digital signal that corresponds to the unwatermarked sample signal; d) gain adjusting the unwatermarked sample signal to the corresponding segment of the potentially watermarked digital signal; e) estimating a watermarked sample by subtracting the gain-adjusted unwatermarked sample from the corresponding segment of the potentially watermarked digital signal; and f) scanning the estimated watermarked sample signal for one or more portions of a watermark message.
Also disclosed is a system for encoding of a digital watermark into a signal, comprising: a) a window selector for selecting a sample window in the signal; b) an interval calculator for determining a quantization interval of a selected sample window, where the quantization interval may be used to quantize normalized window samples; c) a sampler for normalizing the sample window to provide normalized samples, where the normalized samples conform to a limited range of normalized values that are proportional to un-normalized samples, and where the normalized values can be divided by the quantization interval into distinct quantization levels; d) a processor for identifying a plurality of optimal locations in the signal for embedding a digital watermark; and e) an encoder for randomly encoding one or more portions of a digital watermark into the plurality of identified optimal locations in the signal.
DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate two embodiments of the invention and, together with a general description of the other embodiments discussed herein, serve to explain the principles of the invention.
FIG. 1 depicts a process for amplitude independent encoding of digital watermark information in a signal in accordance with an embodiment of the invention, and FIG. 2 depicts a process for amplitude independent decoding of digital watermark information in a signal in accordance with another embodiment of the invention.
In particular, FIG. 1 depicts an embodiment of the invention that includes the steps of: selecting a sample window 101 having a minimum and a maximum, determining a quantization interval of the sample window 102, normalizing the sample window 103 to provide normalized samples, analyzing the normalized samples 104, comparing the normalized samples to message bits 105, adjusting the quantization level 106 of the sample window to correspond to the message bit when a bit conflicts with the quantization level and de-normalizing the analyzed samples 107.
FIG. 2 depicts the steps used for amplitude independent decoding of digital watermark information in a signal including steps of: determining in the signal a sample window 201 having a minimum and a maximum, determining a quantization interval of the sample window 202, normalizing the sample window 203 to provide samples, and analyzing the quantization level of the samples 204 to determine a message bit value.
DETAILED DESCRIPTION The present invention relates to implementations of digital watermarks that are optimally suited to particular transmission, distribution and storage mediums given the nature of digitally sampled audio, video, and other multimedia works.
The present invention additionally relates to the implementation of digital watermarks that are feature-based. That is, a system where watermark information is not carried in individual samples, but is carried in the relationships between multiple samples, such as in a waveform shape. For example, in the same manner a US $100 bill has copy protection features including ink type, paper stock, fiber, angles of artwork that distort in photocopier machines, inserted magnetic strips, and composite art, the present invention envisions natural extensions for digital watermarks that may also separate frequencies (color or audio), channels in 3D while utilizing discreteness in feature-based encoding only known to those with pseudo-random keys (i.e., cryptographic keys) or possibly tools to access such information, which may one day exist on a quantum level.
There are a number of hardware and software approaches in the prior art that attempt to provide protection of multimedia content, including encryption, cryptographic containers, cryptographic envelopes or �cryptolopes�, and trusted systems in general. None of these systems places control of copy protection in the hands of the content creator as the content is created, nor provides an economically feasible model for exchanging the content to be exchanged with identification data embedded within the content.
Cryptolopes are suited specifically for copyrighted text that is time-sensitive, such as newspapers, where intellectual property rights and origin data are made a permanent part of the file. For information on public-key cryptosystems see U.S. Pat. No. 4,200,770 to Hellman et al., U.S. Pat. No. 4,218,582 to Hellman et al., U.S. Pat. No. 4,405,829 to Rivest et al., and U.S. Pat. No. 4,424,414 to Hellman et al. Systems are proposed by IBM and Electronic Publishing Resources to accomplish cryptographic container security.
Digitally-sampled copyrighted material, that is binary data on a fundamental level, is a special case because of its long term value coupled with the ease and perfectness of copying and transmission by general purpose computing and telecommunications devices. In particular, in digitally-sampled material, there is no loss of quality in copies and no identifiable differences between one copy and any other subsequent copy. For creators of content, distribution costs may be minimized with electronic transmission of copyrighted works. Unfortunately, seeking some form of informational or commercial return via electronic exchange is ill-advised absent the use of digital watermarks to establish responsibility for specific copies and unauthorized copying. Absent digital watermarks, the unlikely instance of a market of trusted parties who report any distribution or exchange of unauthorized copies of the protected work must be relied upon for enforcement. Simply, content creators still cannot independently verify watermarks should they choose to do so.
For a discussion of systems that are oriented around content-based addresses and directories, see U.S. Pat. No. 5,428,606 to Moskowitz.
In combining steganographic methods for insertion of information identifying the title, copyright holder, pricing, distribution path, licensed owner of a particular copy, or a myriad of other related information, with pseudo-random keys (which map insertion location of the information) similar to those used in cryptographic applications, randomly placed signals (digital watermarks) can be encoded as random noise in a content signal. Optimal planning of digital watermark insertion can be based on the inversion of optimal digital filters to establish or map areas comprising a given content signal insertion envelope. Taken further, planning operations will vary for different digitized content: audio, video, multimedia, virtual reality, etc. Optimization techniques for processes are described in the copending related applications entitled �Steganographic Method and Device� and �Method for Human Assisted Random Key Generation and Application for Digital Watermark System�.
Optimization processes must take into consideration the general art of digitization systems where sampling and quantizing are fundamental physical parameters. For instance, discrete time sampling has a natural limit if packets of time are used, estimated at 1�10−42 second. This provides a natural limit to the sampling operation. Also, since noise is preferable to distortion, quantizing will vary given different storage mediums (magnetic, optical, etc.) or transmission mediums (copper, fiber optic, satellite, etc.) for given digitized samples (audio, video, etc.). Reducing random bit error, quantization error, burst error, and the like is done for the singular goal of preserving quality in a given digitized sample. Theoretical perfect error correction is not efficient, given the requirement of a huge allocation of redundant data to detect and correct errors. In the absence of such overhead, all error correction is still based on data redundancy and requires the following operations: error detection to check data validity, error correction to replace erroneous data, and error concealment to hide large errors or substitute data for insufficient data correction. Even with perfect error correction, the goal of a workable digital watermark system for the protection of copyrights would be to distribute copies that are less than perfect but not perceivably different from the original. Ironically, in the present distribution of multimedia, this is the approach taken by content creators when faced with such distribution mechanisms as the INTERNET. As an example, for audio clips commercially exchanged on the World Wide Web (WWW), a part of the INTERNET, 8 bit sampled audio or audio downsampled from 44.1 kHz (CD-quality), to 22 kHz and lower. Digital filters, however, are not ideal because of trade-offs between attenuation and time-domain response, but provide the engineer or similarly-trained individual with a set of decisions to make about maximizing content quality with minimum data overhead and consideration of the ultimate delivery mechanism for the content (CDs, cable television, satellite, audio tape, stereo amplifier, etc.).
For audio signals and more generally for other frequency-based content, such as video, one method of using digital filters is to include the use of an input filter to prevent frequency aliasing higher than the so-called Nyquist frequencies. The Nyquist theorem specifies that the sampling frequency must be at least twice the highest signal frequency of the sampled information (e.g., for the case of audio, human perception of audio frequencies is in a range between 20 Hz and 20 kHz). Without an input filter, aliases can still occur leaving an aliased signal in the original bandwidth that cannot be removed.
Even with anti-aliasing filters, quantization error can still cause low level aliasing which may be removed with a dither technique. Dither is a method of adding random noise to the signal, and is used to de-correlate quantization error from the signal while reducing the audibility of the remaining noise. Distortion may be removed, but at the cost of adding more noise to the filtered output signal. An important effect is the subsequent randomization of the quantization error while still leaving an envelope of an unremovable signaling band of noise. Thus, dither is done at low signal levels, effecting only the least significant bits of the samples. Conversely, digital watermarks, which are essentially randomly-mapped noise, are intended to be inserted into samples of digitized content in a manner such as to maximize encoding levels while minimizing any perceivable artifacts that would indicate their presence or allow for removal by filters, and without destroying the content signal. Further, digital watermarks should be inserted with processes that necessitate random searching in the content signal for watermarks if an attacker lacks the keys. Attempts to over-encode noise into known watermarked signal locations to eliminate the information signal can be made difficult or impossible without damaging the content signal by relying on temporal encoding and randomization in the generation of keys during digital watermark insertion. As a result, although the watermark occupies only a small percentage of the signal, an attacker is forced to over-encode the entire signal at the highest encoding level, which creates audible artifacts.
Additionally, where a watermark location is determined in a random or pseudo-random operation dependent on the creation of a pseudo-random key, as described in copending related application entitled �Steganographic Method and Device� assigned to the present assignee, and unlike other forms of manipulating digitized sample streams to improve quality or encode known frequency ranges, an engineer seeking to provide high levels of protection of copyrights, ownership, etc. is concerned with the size of a given key, the size of the watermark message and the most suitable area and method of insertion. Robustness is improved through highly redundant error correction codes and interleaving, including codes known generally as q-ary Bose-Chaudhuri-Hocquenghem (BCH) codes, a subset of Hamming coding operations, and codes combining error correction and interleaving, such as the Cross-interleave Reed-Solomon Code. Using such codes to store watermark information in the signal increases the number of changes required to obliterate a given watermark. Preprocessing the certificate by considering error correction and the introduction of random data to make watermark discovery more difficult, prior to watermarking, will help determine sufficient key size. More generally, absolute key size can be determined through preprocessing the message and the actual digital watermark (a file including information regarding the copyright owner, publisher, or some other party in the chain of exchange of the content) to compute the absolute encoded bit stream and limiting or adjusting the key size parameter to optimize the usage of key bits. The number of bits in the primary key should match or exceed the number of bits in the watermark message, to prevent redundant usage of key bits. Optimally, the number of bits in the primary key should exactly match the watermark size, since any extra bits are wasted computation.
Insertion of informational signals into content signals and ranges from applications that originate in spread spectrum techniques have been contemplated. More detailed discussions are included in copending related applications entitled �Steganographic Method and Device� and entitled �Method for Human Assisted Random Key Generation and Application for Digital Watermark System�.
The following discussion illustrates some previously disclosed systems and their weaknesses.
Typically, previously disclosed systems lack emphasis or implementation of any pseudo-random operations to determine the insertion location, or map, of information signals relating to the watermarks. Instead, previous implementations provide �copy protect� flags in obvious, apparent and easily removable locations. Further, previous implementations do not emphasize the alteration of the content signal upon removal of the copy protection.
Standards for digital audio tape (DAT) prescribe insertion of data such as ISRC (Industry Standard Recording Codes) codes, title, and time in sub-code according to the Serial. Copy Management System (SCMS) to prevent multiple copying of the content. One time copying is permitted, however, and systems with AES3 connectors, which essentially override copy protection in the sub-code as implemented by SCMS, actually have no copy limitations. The present invention provides improvement over this implementation with regard to the ability of unscrupulous users to load digital data into unprotected systems, such general computing devices, that may store the audio clip in a generalized file format to be distributed over an on-line system for further duplication. The security of SCMS (Serial Copy Management System) can only exist as far as the support of similarly oriented hardware and the lack of attempts by those skilled in the art to simply remove the subcode data in question.
Previous methods seek to protect content, but shortcomings are apparent. U.S. Pat. No. 5,319,735 to Preuss et al. discusses a spread spectrum method that would allow for over-encoding of the described, thus known, frequency range and is severely limited in the amount of data that can be encoded�4.3 8-bit symbols per second. However, with the Preuss et al. method, randomization attacks will not result in audible artifacts in the carrier signal, or degradation of the content as the information signal is in the subaudible range. It is important to note the difference in application between spread spectrum in military field use for protection of real-time radio signals, and encoding information into static audio files. In the protection of real-time communications, spread spectrum has anti jam features, since information is sent over several channels at once. Therefore, in order to jam the signal, one has to jam all channels, including their own. In a static audio file, however, an attacker has practically unlimited time and processing power to randomize each sub-channel in the signaling band without penalty to themselves, so the anti jam advantages of spread spectrum do not extend to this domain.
Other methods include techniques similar to those disclosed in related copending patent applications mentioned above by the present assignee, but lack the pseudo-random dimension of those patent applications for securing the location of the signals inserted into the content. One implementation conducted by Michael Gerzon and Peter Craven, and described by Ken Pohlmann in the 3rd edition of Principles of Digital Audio, illustrates a technology called �buried data technique,� but does not address the importance of randomness in establishing the insertion locations of the informational signals in a given content signal, as no pseudo-random methods are used as a basis for insertion. The overriding concern of the �buried data techniques� appears to be to provide for a �known channel� to be inserted in such a manner as to leave little or no perceivable artifacts in the content signal while prescribing the exact location of the information (i.e., replacing the least significant bits (LSB) in a given information signal). In Gerzon and Craven's example, a 20-bit signal gives way to 4-bits of LSBs for adding about 27 dB of noise to the music. Per channel data insertion reached 176.4 kilobits per second per channel, or 352.8 kbps with stereo channels. Similarly attempted data insertion by the present inventors using random data insertion yielded similar rates. The described techniques may be invaluable to manufacturers seeking to support improvements in audio, video and multimedia quality improvements. These include multiple audio channel support, surround sound, compressed information on dynamic range, or any combination of these and similar data to improve quality. Unfortunately, this does little or nothing to protect the interests of copyright holders from unscrupulous pirates, as they attempt to create unmarked, perfect copies of copyrighted works.
The present invention also relates to copending patent applications entitled �Staganographicc Method and Device�; �Method for Human-Assisted Random Key Generation and Application for Digital Watermark System�; and �Method for Stega-Cipher Protection of Computer Code� as mentioned above, specifically addressing the weakness of inserting informational signals or digital watermarks into known locations or known frequency ranges, which are sub-audible. The present invention seeks to improve on the methods disclosed in these patent applications and other methods by describing specific optimization techniques at the disposal of those skilled in the art. These techniques provide an a la carte method for rethinking error correction, interleaving, digital and analog filters, noise shaping, nonlinear random location mapping in digitized samples, hashing, or making unique individual watermarks, localized noise signal mimic encoding to defeat noise filtering over the entire sample stream, super audible spread spectrum techniques, watermark inversion, preanalyzing watermark key noise signatures, and derivative analysis of suspect samples against original masters to evaluate the existence of watermarks with statistical techniques.
The goal of a digital watermark system is to insert a given information signal or signals in such a manner as to leave few or no artifacts in the underlying content signal, while maximizing its encoding level and location sensitivity in the signal to force damage to the content signal when removal is attempted. The present invention establishes methods for estimating and utilizing parameters, given principles of the digitization of multimedia content (audio, video, virtual reality, etc.), to create an optimized �envelope� for insertion of watermarks, and thus establish secured responsibility for digitally sampled content. The pseudo-random key that is generated is the only map to access the information signal while not compromising the quality of the content. A digital watermark naturally resists attempts at removal because it exists as purely random or pseudo-random noise in a given digitized sample. At the same time, inversion techniques and mimicking operations, as well as encoding signal features instead of given samples, can make the removal of each and every unique encoded watermark in a given content signal economically infeasible (given the potential commercial returns of the life of a given copyright) or impossible without significantly degrading the quality of the underlying, �protected� signal. Lacking this aesthetic quality, the marketability or commercial value of the copy is correspondingly reduced.
General methods for watermarking digitized content, as well as computer code, are described in copending related patent applications entitled �Steganographic Method and Device� and entitled �Method for Stega-Cipher Protection of Computer Code�, both assigned to the present assignee. Recognizing the importance of perceptual encoding of watermarks by the authors and engineers who actually create content is addressed in copending related application entitled �Method for Human Assisted Random Key Generation and Application for Digital Watermark System�.
The present invention describes methods of random noise creation given the necessary consequence of improving signal quality with digitization techniques. Additionally, methods are described for optimizing projections of data redundancy and overhead in error correction methods to better define and generate parameters by which a watermarking system can successfully create random keys and watermark messages that subsequently cannot be located and erased without possession of the key that acts as the map for finding each encoded watermark. This description will provide the backdrop for establishing truly optimized watermark insertion including: use of nonlinear (chaotic) generators; error correction and data redundancy analysis to establish a system for optimizing key and watermark message length; and more general issues regarding desired quality relating to the importance of subjecting watermarked content to different models when the content may be distributed or sold in a number of prerecorded media formats or transmitted via different electronic transmission systems; this includes the use of perceptual coding; particularized methods such as noise shaping; evaluating watermark noise signatures for predictability; localized noise function mimic encoding; encoding signal features; randomizing time to sample encoding of watermarks; and, finally, a statistical method for analyzing composite watermarked content against a master sample content to allow watermark recovery. All of these features can be incorporated into specialized digital signal processing microprocessors to apply watermarks to nongeneralized computing devices, such as set-top boxes, video recorders that require time stamping or authentication, digital video disc (DVD) machines and a multitude of other mechanisms that play or record copyrighted content.
The sampling theorem, known specifically as the Nyquist Theorem, proves that bandlimited signals can be sampled, stored, processed, transmitted, reconstructed, desampled or processed as discrete values. In order for the theorem to hold true, the sampling must be done at a frequency that is at least twice the frequency of the highest signal frequency to be captured and reproduced. Aliasing will occur as a form of signal fold over, if the signal contains components above the Nyquist frequency. To establish the highest possible quality in a digital signal, aliasing is prevented by low-pass filtering the input signal to a given digitization system by a low-pass or anti-aliasing filter. Any residue aliasing which may result in signal distortion, relates to another area of signal quality control, namely, quantization error removal.
+Q/2 and −Q/2, where Q is the quantization interval.
Indeed, describing maximization of the quantization error and its ratio with the maximum signal amplitude, as measured, will yield a signal-to-error ratio (S/E) which is closely related to the analog signal-to-noise ratio (S/N). To establish more precise boundaries for determining the S/E, with root mean square (rms) quantization error Erms, and assuming a uniform probability density function 1/Q (amplitude), the following describes the error:
E rms =Q/(12)1/2 Signal to quantization error is expressed as:
S/E=[S rms /E rms]2=3/2(22n)
S/E(dB)=10 log [3/2(22n)]=10 log 3/2+2n log 2(or �=20 log [(3/2)1/2(2n)]�)=6.02n+1.76
Quantization distortion is directly related with the original signal and is thus contained in the output signal, it is not simply an error. This being the case, implementation of so-called quality control of the signal must use dither. As discussed above, dither is a method of adding random noise to the signal to de-correlate quantization error from the signal while reducing the audibility of the remaining noise. Distortion may be removed at the cost of adding more noise to the filtered output signal. An important effect is the subsequent randomization of the quantization error while still leaving an envelope of an unremovable signaling band of noise. Dither, done at low signal levels, effects only the least significant bits of the samples.
Use of linear and nonlinear quantization can effect the trade-off in the output signal and must be considered for a system of watermarks designed to determine acceptable quantization distortion to contain the digital watermark. For audio systems, block linear quantization implementations have been chosen. However, block floating point and floating point systems, nonuniform companding, adaptive delta modulation, adaptive differential pulse-code modulation, and perceptual coding schemes (which are oriented around the design of filters that closely match the actual perception of humans) appear to provide alternative method implementations that would cause higher perceptible noise artifacts if filtering for watermarks was undertaken by pirates. The choice of method is related to the information overhead desired.
According to one aspect of the present invention, the envelope described in the quantization equations above is suitable for preanalysis of a digitized sample to evaluate optimal locations for watermarks. The present example is for audio, but corresponding applications for digitization of video would be apparent in the quantization of color frequencies.
The matter of dither complicates preanalysis of a sample evaluated for digital watermarks. Therefore, the present invention also defines the optimal envelope more closely given the three types of dither (this example is for audio, others exist for video): triangular probability density function (pdf), Gaussian pdf, and rectangular pdf. Again, to establish better boundaries for the random or pseudo-random insertion of a watermark to exist in a region of a content signal that would represent an area for hiding watermarks in a manner most likely to cause damage to the content signal if unauthorized searches or removal are undertaken. Dither makes removal of quantization error more economical through lower data overhead in a system by shifting the signal range to decorrelate errors from the underlying signal. When dither is used, the dither noise and signal are quantized together to randomize the error. Dither which is subtractive requires removing the dither signal after requantization and creates total error statistical independence. It would also provide further parameters for digital watermark insertion given the ultimate removal of the dither signal before finalizing the production of the content signal. With nonsubtractive dither, the dither signal is permanently left in the content signal. Errors would not be independent between samples. For this reason, further analysis with the three types of dither should reveal an acceptable dither signal without materially affecting the signal quality.
Some proposed systems for implementing copyright protection into digitally-sampled content, such as that proposed by Digimarc Corporation, predicate the natural occurrence of artifacts that cannot be removed. Methods for creating a digital signature in the minimized error that is evident, as demonstrated by explanations of dither, point out another significant improvement over the art in the system described in the present invention and its antecedents. Every attempt is made to raise the error level of error from LSBs to a level at which erasure necessarily leads to the degradation of the �protected� content signal. Furthermore, with such a system, pirates are forced to make guesses, and then changes, at a high enough encoding level over a maximum amount of the content signal so as to cause signal degradation, because guessing naturally introduces error. Thus, dither affects the present invention's envelope by establishing a minimum encoding level. Any encoding done below the dither level might be erased by the dither.
To facilitate understanding of how this does not cause audible artifacts, consider the meaning of such encoding in terms of the S/E ratio. In a normal 16-bit signal, there is a 98 dB S/E according to the equation S/E=6.02n+1.76. Consider that the encoding of watermark information looks like any other error, except it moves beyond the quantization level, out of the LSBs. If the error is of a magnitude expressed in, say, 8 bits, then at that moment, the signal effectively drops to 8 bits (16−8). This corresponds to a momentary drop in S/E, referred to herein as the momentary S/E. Yet, these errors are relatively few and far between and therefore, since the signal is otherwise comprised of higher-bit samples, a �Perceived S/E� may be derived which is simply the weighted average of the samples using the �Pure S/E� (the samples without watermark information) and those with the Momentary S/E. As a direct consequence, it may be observed that the more sparse the watermark map, the fewer errors introduced in a given range, and the higher the perceived S/E. It also helps that the error is random, and so over time, appears as white noise, which is relatively unobtrusive. In general, it is observed that as long as introduced errors leave resulting samples within an envelope in the sample window described by minimum and maximum values, before error introduction, and the map is sufficiently sparse, the effects are not perceived.
A watermarking cipher could perform this operation and may also introduce the further step of local dither (or other noise) significantly above the quantization amplitude on a window by window basis randomly, to restrict total correlation between the watermark signal and the probability that it remains independent between samples, as with subtractive dither implementations that are mostly concerned with the ultimate removal of the dither signal with requantization. This ability could be used to accomplish signal doping, which adds a degree of random errors that do not contain watermark information so as to prevent differential analysis of multiple watermarked copies. Alternatively, it could be used to mimic a specific noise function in a segment of the signal in order to defeat attempts to filter a particular type of noise over the entire signal. By varying this function between watermarks, it may be guaranteed that any particular filter is of no use over the whole signal. By applying several filters in series, it seems intuitive that the net results would be significantly different from the original signal.
The discussion may be more appropriately introduced with perceptual coding techniques, but a watermarking system could also defeat some detection and correction with dither by inserting watermarks into signal features, instead of signal samples. This would be equivalent to looking for signal characteristics, independent of the overall sample as it exists as a composite of a number of signals. Basically, instead of encoding on a bit per sample basis, one might spread bits over several samples. The point of doing this is that filtering and convolution operations, like �flanging�, which definitely change individual samples on a large scale, might leave intact enough of a recognizable overall signal structure (the relationship between multiple samples) to preserve the watermark information. This may be done by measuring, generalizing, and altering features determined by the relationships between samples or frequency bands. Because quantization is strictly an art of approximation, signal-to-error ratios, and thus the dynamic range of a given system are determined.
The choice of eliminating quantization distortion at the expense of leaving artifacts (not perceptible) is a permanent trade-off evident in all digitization systems which are necessarily based on approximation (the design goal of the present invention in preanalyzing a signal to mask the digital watermarks make imperceptibility possible). The high fidelity of duplication and thus subsequent ability to digitally or electronically transmit the finished content (signal) is favored by consumers and artists alike. Moreover, where there continues to be a question of approximating in quantization�digital watermark systems will have a natural partner in seeking optimized envelopes in the multitude and variety of created digitized content.
Another aspect of optimizing the insertion of digital watermarks regards error correction. Highly redundant error codes and interleaving might create a buffer against burst errors introduced into digital watermarks through randomization attacks. A detailed description follows from the nature of a digitization system�binary data can be corrected or concealed when errors exist.
Random bit errors and burst errors differ in their occurrence:
Random bit errors are error bits occurring in a random manner, whereas burst errors may exist over large sequences of the binary data comprising a digitized signal. Outside the scope of the present invention are errors caused by physical objects, such as dust and fingerprints, that contribute to the creation of dropouts are different from the errors addressed herein.
the detection probability of burst errors of m+1 bits=1−2−m+1.
the detection probability of burst errors longer than m+1 bits=1−2−m random errors up to 3 consecutive bits long can be detected.
What is important for establishing parameters for determining optimized error coding in systems such as digital audio are more specifically known as Reed-Solomon Codes which are effective methods for correcting burst errors. Certain embodiments of the present invention presuppose the necessity of highly redundant error codes and interleaving, such as that done in Cross Interleave Reed-Solomon Code, to counter burst errors typically resulting from randomization attacks. More generally, certain embodiments of the present invention include the use of Hamming Codes of (n,n) to provide n−1 bit error detection and n−2 bit error correction. Further, a Hamming distance of n (or greater than n) is significant because of the nature of randomization attacks. Such an attack seeks to randomize the bits of the watermark message. A bit can be either 0 or 1, so any random change has a 50% chance of actually changing a bit from what it was (50% is indicative of perfect randomness). Therefore, one must assume that a good attack will change approximately half the bits (50%). A Hamming distance of n or greater, affords redundancy on a close par with such randomization. In other words, even if half the bits are changed, it would still be possible to recover the message.
Because interleaving and parity makes data robust for error avoidance, certain embodiments of the present invention seek to perform time interleaving to randomly boost momentary S/E ratio and give a better estimate of not removing keys and watermarks that may be subsequently determined to be �errors�.
Uncorrected errors can be concealed in digital systems. Concealment offers a different dynamic to establish insertion parameters for the present invention. Error concealment techniques exist because it is generally more economical to hide some errors instead of requiring overly expensive encoders and decoders and huge information overheads in digitization systems. Muting, interpolation, and methods for signal restoration (removal of noise) relate to methods suggested by the present invention to invert some percentage or number of watermarks so as to ensure that at least some or as many as half of the watermarks must still remain in the content signal to effectively eliminate the other half. Given that a recording contains noise, whether due to watermarks or not, a restoration which �removes� such noise is likely to result in the changing of some bit of the watermark message. Therefore, by inverting every other watermark, it is possible to insure that the very act of such corrections inverts enough watermark bits to create an inverse watermark. This inversion presupposes that the optimized watermark insertion is not truly optimal, given the will of a determined pirate to remove watermarks from particularly valuable content.
Ultimately, the inability to resell or openly trade unwatermarked content will help enforce, as well as dictate, the necessity of watermarked content for legal transactions.
The mechanisms discussed above reach physical limits as the intent of signal filtering and error correction are ultimately determined to be effective by humans�decidedly analog creatures. All output devices are thus also analog for playback.
The basis for a perceptual coding system, for audio, is psychoacoustics and the analysis of only what the human ear is able to perceive. Similar analysis is conducted for video systems, and some may argue abused, with such approaches as �subliminal seduction� in advertising campaigns. Using the human for design goals is vastly different than describing mathematical or theoretical parameters for watermarks. On some level of digital watermark technology, the two approaches may actually complement each other and provide for a truly optimized model.
The following example applies to audio applications. However, this example and other examples provided herein are relevant to video systems as well as audio systems. Where a human ear can discern between energy inside and outside the �critical band,� (described by Harvey Fletcher) masking can be achieved. This is particularly important as quantization noise can be made imperceptible with perceptual coders given the maintenance of a sampling frequency, decreased word length (data) based on signaling conditions. This is contrasted with the necessary decrease of 6 dB/bit with decreases in the sampling frequency as described above in the explanation of the Nyquist Theorem. Indeed, data quantity can be reduced by 75%. This is an extremely important variable to feed into the preprocessor that evaluates the signal in advance of �imprinting� the digital watermark.
In multichannel systems, such as MPEG-1, AC-3 and other compression schemes, the data requirement (bits) is proportional to the square root of the number of channels. What is accomplished is masking that is nonexistent perceptually, only acoustically.
Taken to another level for digital watermarking, which is necessary for content that may be compressed and decompressed, forward adaptive allocation of bits and backward adaptive allocation provide for encoding signals into content signals in a manner such that information can be conveyed in the transmission of a given content signal that is subsequently decoded to convey the relatively same audible signal to a signal that carries all of its bits�e.g., no perceptual differences between two signals that differ in bit size. This coding technique must also be preanalyzed to determine the most likely sample bits, or signal components, that will exist in the smaller sized signal. This is also clearly a means to remove digital watermarks placed into LSBs, especially when they do not contribute theoretically perceptible value to the analyzed signal. Further methods for data reduction coding are similarly important for preanalyzing a given content signal prior to watermarking. Frequency domain coders such as subband and transform bands can achieve data reduction of ratios between 4:1 and 12:1. The coders adaptively quantize samples in each subband based on the masking threshold in that subband (See Pohlmann, Principles of Digital Audio). Transform coders, however, convert time domain samples into the frequency domain for accomplishing lossless compression. Hybrid coders combine both subband and transform coding, again with the ultimate goal of reducing the overall amount of data in a given content signal without loss of perceptible quality.
With digital watermarks, descriptive analysis of an information signal is important to preanalyze a given watermark's noise signature. Analysis of this signature versus the preanalysis of the target content signal for optimized insertion location and key/message length, are potentially important components to the overall implementation of a secure watermark. It is important that the noise signature of a digital watermark be unpredictable without the pseudo-random key used to encode it. Noise shaping, thus, has important applications in the implementation of the present invention. In fact, adaptive dither signals can be designed to correlate with a signal so as to mask the additional noise�in this case a digital watermark. This relates to the above discussion of buried data techniques and becomes independently important for digital watermark systems. Each instance of a watermark, where many are added to a given content signal given the size of the content and the size of the watermark message, can be �noise shaped� and the binary description of the watermark signature may be made unique by �hashing� the data that comprises the watermark. Generally, hashing the watermark certificate prior to insertion is recommended to establish differences between the data in each and every watermark �file�.
Assume the provision of the suspect composite signal Cw(t) (w subscript denotes a possible watermark) and the unwatermarked original sample Suw(t). These are the only two recordings the analyzer is likely to have access to.
Now, it is necessary to recover a watermarked sample Sw(t).
The methods of digital signal processing allow for the computation of an optimal estimate of a signal. The signal to be estimated is the composite minus the watermarked sample, or C″w(t)=Cw(t)−Sw(t). The analyzer, however, cannot determine a value of Sw(t), since it does not know which of the many possible Sw(t) signals was used in the composite. However, a close estimate may be obtained by using Suw(t), since watermarking makes relatively minor changes to a signal.
So, C″w(t) (an estimate of C′w(t) given Cw(t) and Suw(t)) may be obtained. Once C″w(t) is calculated, it is simply subtracted from Cw(t). This yields S′w(t)=Cw(t)−C″w(t). If the watermark is robust enough, and the estimate good enough, then S′w(t), which is approximately equal to Sw(t), can be processed to extract the watermark. It is simply a matter of attempting watermark decoding against a set of likely encoding key candidates.
Two methods for varying of the encoding/decoding algorithms according to embodiments of the present invention are described herein. The first method corresponded to adaptation to changing signal characteristics. This method requires a continuous analysis of the sample windows comprising the signal stream as passed to the framework. Based on these characteristics, which are mathematically well-defined functions of the sample stream (such as RMS energy, RMS/peak ratio, RMS difference between samples�which could reflect a measure of distortion), a new CODEC module, from among a list of pre-defined CODECs, and the algorithms implemented in them, can be applied to the window in question. For the purpose of this discussion, windows are assumed to be equivalent to frames. And, in a frame-based system, this is a straightforward application of the architecture to provide automated variance of algorithms to encode and decode a single watermark.
The second method for varying of the encoding/decoding algorithms corresponds to increased security. This method is easier, since it does not require the relatively computationally-expensive process of further analyzing the samples in a frame passed to the Framework. In this method, the Framework selects a new CODEC, from among a list of pre-defined CODECs, to which to pass the sample frame as a function of the pseudo-random key employed to encode/decode the watermark. Again, this is a straightforward application of framework architecture which provides automated variance of algorithms to encode and decode a single watermark versus limitations evident in the analysis of a single random noise signal inserted over the entire content signal as proposed by Digimarc, NEC, Thorn EMI and IBM under the general guise of spread spectrum, embedded signaling schemes.
Automated analysis of composited copyrighted material offers obvious advantages over subjective �human listening� and �human viewing� methods currently used in copyright infringement cases pursued in the courts.
Other embodiments and uses of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. All references cited herein, including all U.S. and foreign patents and patent applications, are specifically and entirely hereby incorporated by reference herein. It is intended that the specification and examples be considered exemplary only, with the true scope and spirit of the invention indicated by the claims below. As will be easily understood by those of ordinary skill in the art, variations and modifications of each of the disclosed embodiments can be easily made within the scope of this invention as defined by the claims below.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS3947825May 7, 1975Mar 30, 1976International Business Machines CorporationAbstracting system for index search machineUS3984624Jul 25, 1974Oct 5, 1976Weston Instruments, Inc.Video system for conveying digital and analog informationUS3986624Nov 16, 1973Oct 19, 1976International Incinerators, Inc.Disposal feeding system including selective container controlUS4038596Jul 2, 1975Jul 26, 1977E M I LimitedMethod and apparatus for authenticating a record medium consisting of applying two different strength magnetizing fields and monitoring the remanent fieldsUS4200770Sep 6, 1977Apr 29, 1980Stanford UniversityCryptographic apparatus and methodUS4218582Oct 6, 1977Aug 19, 1980The Board Of Trustees Of The Leland Stanford Junior UniversityPublic key cryptographic apparatus and methodUS4339134Jul 5, 1977Jul 13, 1982Rockwell International CorporationElectronic card gameUS4390898Mar 23, 1981Jun 28, 1983Northern Telecom LimitedScrambling and unscrambling video signals in a pay TV systemUS4405829Dec 14, 1977Sep 20, 1983Massachusetts Institute Of TechnologyCryptographic communications system and methodUS4424414May 1, 1978Jan 3, 1984Board Of Trustees Of The Leland Stanford Junior UniversityExponentiation cryptographic apparatus and methodUS4528588Sep 25, 1981Jul 9, 1985Loefberg BoMethod and apparatus for marking the information content of an information carrying signalUS4672605Mar 20, 1984Jun 9, 1987Applied Spectrum Technologies, Inc.Data and voice communications systemUS4748668Jul 9, 1986May 31, 1988Yeda Research And Development Company LimitedMethod, apparatus and article for identification and signatureUS4789928Jan 30, 1987Dec 6, 1988Aucnet Inc.Auction information transmission processingUS4827508Oct 14, 1986May 2, 1989Personal Library Software, Inc.Database usage metering and protection system and methodUS4876617May 5, 1987Oct 24, 1989Thorn Emi PlcSignal identificationUS4896275Jul 10, 1987Jan 23, 1990Bull Hn Information Systems Inc.Full page graphics image display data reductionUS4908873May 13, 1983Mar 13, 1990Philibert Alex CDocument reproduction security systemUS4939515Sep 30, 1988Jul 3, 1990General Electric CompanyDigital signal encoding and decoding apparatusUS4969204Nov 29, 1989Nov 6, 1990Eastman Kodak CompanyHybrid residual-based hierarchical storage and display method for high resolution digital images in a multiuse environmentUS4972471May 15, 1989Nov 20, 1990Gary GrossEncoding systemUS4977594Feb 16, 1989Dec 11, 1990Electronic Publishing Resources, Inc.Database usage metering and protection system and methodUS4979210Jul 8, 1988Dec 18, 1990Matsushita Electric Industrial Co., Ltd.Method and apparatus for protection of signal copyUS4980782Jun 3, 1985Dec 25, 1990Peter GinkelSoftware protection and identification systemUS5050213Aug 6, 1990Sep 17, 1991Electronic Publishing Resources, Inc.Database usage metering and protection system and methodUS5073925Jun 13, 1990Dec 17, 1991Matsushita Electric Industrial Co., Ltd.Method and apparatus for the protection of signal copyUS5077665May 25, 1989Dec 31, 1991Reuters LimitedDistributed matching systemUS5113437Oct 25, 1989May 12, 1992Thorn Emi PlcSignal identification systemUS5136581Jul 2, 1990Aug 4, 1992At&T Bell LaboratoriesArrangement for reserving and allocating a plurality of competing demands for an ordered bus communication networkUS5136646Mar 8, 1991Aug 4, 1992Bell Communications Research, Inc.Digital document time-stamping with catenate certificateUS5136647Aug 2, 1990Aug 4, 1992Bell Communications Research, Inc.Method for secure time-stamping of digital documentsUS5142576May 6, 1991Aug 25, 1992Market Data CorporationSystem for securely providing restricted video informationUS5161210Nov 8, 1989Nov 3, 1992U.S. Philips CorporationCoder for incorporating an auxiliary information signal in a digital audio signal, decoder for recovering such signals from the combined signal, and record carrier having such combined signal recorded thereonUS5210820May 2, 1990May 11, 1993Broadcast Data Systems Limited PartnershipSignal recognition system and methodUS5243423Dec 20, 1991Sep 7, 1993A. C. Nielsen CompanySpread spectrum digital data transmission over TV videoUS5243515Oct 30, 1990Sep 7, 1993Lee Wayne MSecure teleprocessing bidding systemUS5287407May 23, 1991Feb 15, 1994International Business Machines CorporationComputer software protectionUS5319735Dec 17, 1991Jun 7, 1994Bolt Beranek And Newman Inc.Embedded signallingUS5341429Dec 4, 1992Aug 23, 1994Testdrive CorporationTransformation of ephemeral materialUS5341477Aug 6, 1993Aug 23, 1994Digital Equipment CorporationBroker for computer network server selectionUS5363448Jun 30, 1993Nov 8, 1994United Technologies Automotive, Inc.Pseudorandom number generation and cryptographic authenticationUS5365586Apr 9, 1993Nov 15, 1994Washington UniversityMethod and apparatus for fingerprinting magnetic mediaUS5369707Jan 27, 1993Nov 29, 1994Tecsec IncorporatedSecure network method and apparatusUS5379345 *Jan 29, 1993Jan 3, 1995Radio Audit Systems, Inc.Method and apparatus for the processing of encoded data in conjunction with an audio broadcastUS5394324Dec 8, 1993Feb 28, 1995Xerox CorporationAuction-based control system for energy resource management in a buildingUS5398285Dec 30, 1993Mar 14, 1995Motorola, Inc.Method for generating a password using public key cryptographyUS5406627Dec 28, 1992Apr 11, 1995Nec Home Electronics, Ltd.Digital data cryptographic systemUS5408505Oct 29, 1993Apr 18, 1995Washington UniversityMethod and apparatus for process control, tension control, and testing of magnetic mediaUS5410598Sep 27, 1994Apr 25, 1995Electronic Publishing Resources, Inc.Database usage metering and protection system and methodUS5412718Sep 13, 1993May 2, 1995Institute Of Systems ScienceMethod for utilizing medium nonuniformities to minimize unauthorized duplication of digital informationUS5418713Aug 5, 1993May 23, 1995Allen; RichardApparatus and method for an on demand data delivery system for the preview, selection, retrieval and reproduction at a remote location of previously recorded or programmed materialsUS5428606Jun 30, 1993Jun 27, 1995Moskowitz; Scott A.Digital information commodities exchangeUS5450490Mar 31, 1994Sep 12, 1995The Arbitron CompanyApparatus and methods for including codes in audio signals and decodingUS5469536May 21, 1993Nov 21, 1995Imageware Software, Inc.Image editing system including masking capabilityUS5471533May 20, 1994Nov 28, 1995Symbol Technologies, Inc.Record with encoded dataUS5478990Oct 14, 1993Dec 26, 1995Coleman Environmental Systems, Inc.Method for tracking the production history of food productsUS5479210Jun 7, 1994Dec 26, 1995Quantel, Ltd.Video image processing system having variable data compressionUS5487168Dec 20, 1994Jan 23, 1996International Business Machines CorporationMethod and system for global optimization of device allocationUS5493677Jun 8, 1994Feb 20, 1996Systems Research & Applications CorporationGeneration, archiving, and retrieval of digital images with evoked suggestion-set captions and natural language interfaceUS5497419Apr 19, 1994Mar 5, 1996Prima Facie, Inc.Method and apparatus for recording sensor dataUS5506795Feb 18, 1993Apr 9, 1996Yamakawa; TakeshiApparatus and method for generating chaotic signals and chaos deviceUS5513126Oct 4, 1993Apr 30, 1996Xerox CorporationNetwork having selectively accessible recipient prioritized communication channel profilesUS5513261Dec 29, 1993Apr 30, 1996At&T Corp.Key management scheme for use with electronic cardsUS5530739Mar 18, 1992Jun 25, 1996Fujitsu LimitedMail center management systemUS5530751Jun 30, 1994Jun 25, 1996Hewlett-Packard CompanyEmbedded hidden identification codes in digital objectsUS5530759Feb 1, 1995Jun 25, 1996International Business Machines CorporationColor correct digital watermarking of imagesUS5539735Dec 28, 1994Jul 23, 1996Moskowitz; Scott A.Digital information commodities exchangeUS5548579Jun 21, 1995Aug 20, 1996International Business Machines CorporationSystem for effective allocation of network-wide bandwidthUS5568570 *Sep 30, 1994Oct 22, 1996Eastman Kodak CompanyMethod and apparatus for reducing quantization artifacts in a hierarchical image storage and retrieval systemUS5579124Feb 28, 1995Nov 26, 1996The Arbitron CompanyMethod and apparatus for encoding/decoding broadcast or recorded segments and monitoring audience exposure theretoUS5581703Jun 29, 1993Dec 3, 1996International Business Machines CorporationMethod and apparatus for reserving system resources to assure quality of serviceUS5583488Apr 28, 1995Dec 10, 1996Sala; Nicola R.Proximity alarm systemUS5598470Apr 25, 1994Jan 28, 1997International Business Machines CorporationMethod and apparatus for enabling trial period use of software products: Method and apparatus for utilizing a decryption blockUS5606609Sep 19, 1994Feb 25, 1997Scientific-AtlantaElectronic document verification system and methodUS5613004Jun 7, 1995Mar 18, 1997The Dice CompanySteganographic method and deviceUS5617119Jun 7, 1995Apr 1, 1997Systems Research & Applications CorporationProtection of an electronically stored image in a first color space by the alteration of a digital component in a second color spaceUS5625690Nov 15, 1993Apr 29, 1997Lucent Technologies Inc.Software pay per use systemUS5629980Nov 23, 1994May 13, 1997Xerox CorporationSystem for controlling the distribution and use of digital worksUS5633932Dec 19, 1995May 27, 1997Intel CorporationApparatus and method for preventing disclosure through user-authentication at a printing nodeUS5634040Dec 18, 1995May 27, 1997Samsung Electronics Co., Ltd.Data communication apparatus and method having concurrent image overlay functionUS5636276Apr 18, 1995Jun 3, 1997Brugger; RolfDevice for the distribution of music information in digital formUS5636292May 8, 1995Jun 3, 1997Digimarc CorporationSteganography methods employing embedded calibration dataUS5640569Apr 28, 1995Jun 17, 1997Sun Microsystems, Inc.Diverse goods arbitration system and method for allocating resources in a distributed computer systemUS5646997Dec 14, 1994Jul 8, 1997Barton; James M.Method and apparatus for embedding authentication information within digital dataUS5657461Oct 4, 1993Aug 12, 1997Xerox CorporationUser interface for defining and automatically transmitting data according to preferred communication channelsUS5659726Feb 23, 1995Aug 19, 1997Sandford, Ii; Maxwell T.Data embeddingUS5664018Mar 12, 1996Sep 2, 1997Leighton; Frank ThomsonWatermarking process resilient to collusion attacksUS5673316Mar 29, 1996Sep 30, 1997International Business Machines CorporationCreation and distribution of cryptographic envelopeUS5677952Dec 6, 1994Oct 14, 1997International Business Machines CorporationMethod to protect information on a computer storage deviceUS5680462Aug 7, 1995Oct 21, 1997Sandia CorporationInformation encoder/decoder using chaotic systemsUS5687236Dec 31, 1996Nov 11, 1997The Dice CompanySteganographic method and deviceUS5689587Feb 9, 1996Nov 18, 1997Massachusetts Institute Of TechnologyMethod and apparatus for data hiding in imagesUS5696828Sep 22, 1995Dec 9, 1997United Technologies Automotive, Inc.Random number generating system and process based on chaosUS5719937Sep 12, 1996Feb 17, 1998Solana Technology Develpment CorporationMulti-media copy management systemUS5721788Jul 31, 1992Feb 24, 1998Corbis CorporationMethod and system for digital image signaturesUS5734752Sep 24, 1996Mar 31, 1998Xerox CorporationDigital watermarking using stochastic screen patternsUS5737416Aug 2, 1996Apr 7, 1998International Business Machines CorporationMethod and apparatus for enabling trial period use of software products: method and apparatus for utilizing a decryption stubUS5737733Sep 26, 1996Apr 7, 1998Microsoft CorporationMethod and system for searching compressed dataUS5740244May 7, 1996Apr 14, 1998Washington UniversityMethod and apparatus for improved fingerprinting and authenticating various magnetic mediaUS5745569Jan 17, 1996Apr 28, 1998The Dice CompanyMethod for stega-cipher protection of computer codeUS5748783May 8, 1995May 5, 1998Digimarc CorporationMethod and apparatus for robust information codingUS5790677 *Jun 29, 1995Aug 4, 1998Microsoft CorporationSystem and method for secure electronic commerce transactionsUS5859920 *Nov 30, 1995Jan 12, 1999Eastman Kodak CompanyMethod for embedding digital information in an imageUS5862260 *May 16, 1996Jan 19, 1999Digimarc CorporationMethods for surveying dissemination of proprietary empirical dataUS5893067 *May 31, 1996Apr 6, 1999Massachusetts Institute Of TechnologyMethod and apparatus for echo data hiding in audio signalsUS5923763 *Mar 21, 1996Jul 13, 1999Walker Asset Management Limited PartnershipMethod and apparatus for secure document timestamping* Cited by examinerNon-Patent CitationsReference11969, Kahn, D., "The Code Breakers", The MacMillan Company, 1969, pp. xIII, 81-83, 513, 515, 522-526, 863.21984, Brealy, et al., Principles of Corporate Finance, "Appendix A-Using Option Valuation Models", 1984, pp. 448-449.31984, Brealy, et al., Principles of Corporate Finance, "Appendix A�Using Option Valuation Models", 1984, pp. 448-449.41984, Jayant, N.S. et al., Digital Coding of Waveforms, Prentice Hall Inc., Englewood Cliffs, NJ, pp. 486-509 (1984).51988, Low, S.H., "Equilibrium Allocation and Pricing of Variable Resources Among User-Suppliers", 1988. http://www.citesear.nj.nec.com/366503.html.61988, Press, et al., "Numerical Recipes in C", Cambridge Univ. Press, 1988, pp. 398-417.71988, Sklar, Bernard, Digital Communications, pp. 601-603 (1988).81989, Horowitz, et al., The Art of Eletronics. 2nd Ed., 1989, pp. 7.91990, Ten Kate, W. et al., "Digital Audio Carrying Extra Information", IEEE, CH 2847-2/90/0000-1097, (1990).101991, Pohlmann, Ken C., "Principles of Digital Audio", 2nd Ed., 1991, pp. 1-9, 19-25, 30-33, 41-48, 54-57, 86-107, 375-387.111992, Ten Kate, W. et al., A New Surround-Stereo-Surround Coding Techniques, J. Audio Eng.Soc., vol. 40,No. 5,pp. 376-383 (1992).121993, Gerzon, Michael et al., A High Rate Buried Data Channel for Audio CD, presentation notes, Audio Engineering Soc. 94th Convention (1993).131994, Schneier, Bruce, Applied Cryptography, 1st Ed., pp. 67-68, 1994.141994, Schneier, Bruce, Applied Cryptography, John Wiley & Sons, Inc., New York, 1994, pp. 68, 69, 387-392, 1-57, 273-275, 321-324.151994, Van Schyndel, et al., "A digital Watermark," IEEE Int'l Computer Processing Conference, Austin,TX, Nov. 13-16, 1994, pp. 86-90.161995, "Techniques for Data Hiding in Audio Files," by Morimoto, 1995.171995, Bender, Walter R. et al., Techniques for Data Hiding, SPIE Int. Soc. Opt. Eng., vol. 2420, pp. 164-173, 1995.181995, Caronni, Germano, "Assuring Ownership Rights for Digital Images", published proceeds of reliable IT systems, v15 '95, H.H. Bruggemann and W. Gerhardt-Hackel (Ed) Viewing Publishing Company Germany 1995.191995, Crawford, D.W. "Pricing Network Usage: A Market for Bandwidth of Market Communication?" presented MIT Workshop on Internet Economics, Mar. 1995 http://www.press.vmich.edu/iep/works/CrawMarket.html on March.201995, Koch, E., et al., "Towards Robust and Hidden Image Copyright Labeling", 1995 IEEE Workshop on Nonlinear Signal and Image Processing, Jun. 1995 Neos Marmaras pp. 4.211995, Oomen, A.W.J. et al., A Variable Bit Rate Buried Data Channel for Compact Disc, J.AudioEng. Sc., vol. 43, No. 1/2, pp. 23-28 (1995).221995, Pohlmann, Ken C., "Principles of Digital Audio", 3rd Ed., 1995, pp. 32-37, 40-48:138, 147-149, 332, 333, 364, 499-501, 508-509, 564-571.231995, Sarkar, M. "An Assessment of Pricing Mechanisms for the Internet-A Regulatory Imperative", presented MIT Workshop on Internet Economics, Mar. 1995 http://www.press.vmich.edu/iep/works/SarkAsses.html on.241995, Sirbu, M. et al., "Net Bill: An Internet Commerce System Optimized for Network Delivered Services", Digest of Papers of the Computer Society Computer Conference (Spring) Mar. 5, 1995 pp. 20-25 vol. CONF40.251995, Tirkel,A.Z., "A Two-Dimensional Digital Watermark", DICTA '95, Univ. of Queensland, Brisbane, Dec. 5-8, 1995, pp. 7.261995, Van Schyandel, et al., "Towards a Robust Digital Watermark", Second Asain Image Processing Conference, Dec. 6-8, 1995, Singapore, vol. 2, pp. 504-508.271995, Zhao, Jian et al., Embedding Robust Labels into Images for Copyright Protection, (XP 000571976), pp. 242-251, 1995.281996, Bender, et al., "Techniques for Data Hiding", IBM Systems Journal, (1996) vol. 35, Nos. 3 & 4,1996, pp. 313-336.291996, Boney, et al., Digital Watermarks for Audio Signals, Proceedings of the International Conf. on Multimedia Computing and Systems, Jun. 17-23, 1996 Hiroshima, Japan, 0-8186-7436-9196, pp. 473-480.301996, Craver, et al., "Can Invisible Watermarks Resolve Rightful Ownerships?", IBM Research Report, RC 20509 (Jul. 25, 1996) 21 pp.311996, Dept. of Electrical Engineering, Del Ft University of Technology, Del Ft the Netherlands, Cr.C. Langelaar et al.,"Copy Protection for Multimedia Data based on Labeling Techniques", Jul. 1996 9 pp.321996, Gruhl, Daniel et al., Echo Hiding. In Proceeding of the Workshop on Information Hiding. No. 1174 in Lecture Notes in Computer Science, Cambridge, England (May/Jun. 1996).331996, O'Ruanaidh, et al. "Watermarking Digital Images for Copyright Protection", IEEE Proceedings, vol. 143, No. 4, Aug. 1996, pp. 250-256.341996, Rivest, et al., "Pay Word and Micromint: Two Simple Micropayment Schemes," MIT Laboratory for Computer Science, Cambridge, MA, May 7, 1996 pp. 1-18.351996, Ross Anderson, "Stretching the Limits of Steganography," LNCS, vol. 1174, May/Jun. 1996, 10 pages, ISBN: 3-540-61996-8.361996, Schneider, M., et al. "A Robust Content Based Digital Signature for Image Authentication," Proceedings of the International Conference on Image Processing (IC. Lausanne) Sep. 16-19, 1996, pp. 227-230, IEEE ISBN.371996, Schneier, Bruce, Applied Cryptography, 2nd Ed., John Wiley & Sons, pp. 9-10, 1996.381996, Smith, et al. "Modulation and Information Hiding in Images", Springer Verlag, 1st Int'l Workshop, Cambridge, UK, May 30-Jun. 1, 1996, pp. 207-227.391996, Swanson, Mitchell D., et al. "Robust Data Hiding for Images", 7th IEEE Digital Signal Processing Workshop, Leon, Norway. Sep. 1-4, 1996, pp. 37-40.401996, Swanson, Mitchell D.,et al., "Transparent Robust Image Watermarking", Proc. of the 1996 IEEE Int'l Conf. on Image Processing, vol. 111, 1996 , pp. 211-214.411996, Tirkel,A.Z., "Image Watermarking-A Spread Spectrum Application", ISSSTA '96, Sep. 1996, Mainz, German, pp. 6.421996, Tirkel,A.Z., "Image Watermarking�A Spread Spectrum Application", ISSSTA '96, Sep. 1996, Mainz, German, pp. 6.431996, Zhao, Jian. "A WWW Service to Embed and Prove Digital Copyright Watermarks", Proc. of the European conf. on Multimedia Applications, Services & Techniques Louvain-La-Nevve Belgium May 1996.441997, Boney, et al., Digital Watermarks for Audio Signals, EVSIPCO, 96, pp. 473-480 (Mar. 14, 1997).451997, Cox, I. J., et al. "Secure Spread Spectrum Watermarking for Multimedia," IEEE Transactions on Image Processing, vol. 6 No. 12, Dec. 1, 1997, pp. 1673-1686.461997, Joseph J.K. O'Ruanaidh and Thierry Pun, "Rotation, Scale and Translation Invariant Digital Image Watermarking", pre-publication, Summer 1997 4 pages.471997, Joseph J.K. O'Ruanaidh and Thierry Pun, "Rotation, Scale and Translation Invariant Digital Image Watermarking", Submitted to Signal Processing Aug. 21, 1997, 19 pages.481997, Kutter, Martin et al., "Digital Signature of Color Images Using Amplitude Modulation", SPIE-E197, vol. 3022, pp. 518-527.491997, Menezes, Alfred J., Handbook of Applied Cryptography, CRC Press, p. 175, 1997.501997, Menezes, Alfred J., Handbook of Applied Cryptography, CRC Press, p. 46, 1997.511997, Merriam-Webster's Collegiate Dictionary, 10th Ed., Merriam Webster, Inc., p. 207.521997, Namgoong, H., "An Integrated Approach to Legacy Data for Multimedia Applications", Proceedings of the 23rd EUROMICRO Conference, vol., Issue 1-4, Sep. 1997, pp. 387-391.531997, Puate, Joan et al., "Using Fractal Compression Scheme to Embed a Digital Signature into an Image", SPIE-96 Proceedings, vol. 2915, Mar. 1997, pp. 108-118.541997, Steinauer D. D., et al., "Trust and Traceability in Electronic Commerce", Standard View, Sep. 1997, pp. 118-124, vol. 5 No. 3, ACM, USA.551998, Fabien A.P. Petitcolas, Ross J. Anderson and Markkus G. Kuhn, "Attacks on Copyright Marking Systems," LNCS, vol. 1525, Apr. 14-17, 1998, pp. 218-238 ISBN: 3-540-65386-4.561998, Howe, Dennis Jul. 13, 1998 http://foldoc..org//steganography.571998, Johnson, et al., "Transform Permuted Watermarking for Copyright Protection of Digital Video", IEEE Globecom 1998, Nov. 8-12, 1998, New York New York vol. 2 1998 pp. 684-689 (ISBN 0-7803-4985-7).581998, Kini, et al., "Trust in Electronic Commerce: Definition and Theoretical Considerations", Proceedings of the 31st Hawaii Int'l Conf on System Sciences (Cat. No. 98TB100216). Jan. 6-9, 1998. pp. 51-61. Los.591998, Rivest, R. "Chaffing and Winnowing: Confidentiality without Encryption", MIT Lab for Computer Science, http://people.csail.mit.edu/rivest/Chaffing.txt Apr. 24, 1998, 9 pages.601998, Schunter, M. et al., "A Status Report on the SEMPER framework for Secure Electronic Commerce", Computer Networks and ISDN Systems, Sep. 30, 1998, pp. 1501-1510 vol. 30 No. 16-18 NL North Holland.611998, Wong, Ping Wah. "A Public Key Watermark for Image Verification and Authentication," IEEE International Conference on Image Processing, vol. 1 Oct. 4-7, 1998, pp. 455-459.621999, Hartung, et al. "Multimedia Watermarking Techniques", Proceedings of the IEEE, Special Issue, Identification & Protection of Mulitmedia Information, pp. 1079-1107 Jul. 1999 vol. 87 No. 7 IEEE.631999, Konrad, K. et al., "Trust and Electronic Commerce-more than a technical problem," Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems Oct. 19-22, 1999, pp. 360-365 Lausanne.641999, Konrad, K. et al., "Trust and Electronic Commerce�more than a technical problem," Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems Oct. 19-22, 1999, pp. 360-365 Lausanne.651999, Wayback Machine, dated Jan. 17, 1999, http://web.archive.org/web/19990117020420/http://www.netzero.com/, accessed on Feb. 19, 2008.662000, Graham, Robert Aug. 21, 2000 "Hacking Lexicon" http://robertgraham.com/pubs/hacking-dict.html.672000, Tomsich, et al., "Towards a secure and de-centralized digital watermarking infrastructure for the protection of Intellectual Property", in Electronic Commerce and Web Technologies, Proceedings (ECWEB)(2000).682001, Aerosmith ("Just Push Play"), Pre-Release CD image, 2001, 1 page.692001, Copeland, et al., Real Options: A Practitioner's Guide, 2001 pp. 106-107, 201-202, 204-208.702001, Rivest, et al., "PayWord and Micromint: Two Simple Micropayment Schemes," MIT Laboratory for Computer Science, Cambridge, MA, Apr. 27, 2001, pp. 1-18.712001, VeriDisc, "The Search for a Rational Solution to Digital Rights Management (DRM)", http://64.244.235.240/news/whitepaper, /docs/veridisc.sub.�white.sub.�paper.pdf, 2001, 15 pages.722002, Kocher, et al., "Self Protecting Digital Content", Technical Report from the CRI Content Security Research Initiative, Cryptography Research, Inc. 2002-2003 14 pages.732002, Moskowitz, "What is Acceptable Quality in the Application of Digital Watermarking: Trade-offs of Security; Robustness and Quality", IEEE Computer Society Proceedings of ITCC 2002 Apr. 10, 2002 pp. 80-84.742002, Phil Collins(Testify) Atlantic, Pre-Release CD image, 2002, 1 page.752003, Moskowitz, "Bandwith as Currency", IEEE Multimedia, Jan.-Mar. 2003, pp. 14-21.762003, PortalPlayer, PP502 digital media management system-on-chip, May 1, 2003, 4 pages.772003, Radiohead ("Hail To The Theif"), EMI Music Group-Capitol, Pre-Release CD image, 2003, 1 page.782003, Radiohead ("Hail To The Theif"), EMI Music Group�Capitol, Pre-Release CD image, 2003, 1 page.792004, Jimmy eat world ("futures"), Interscope Records, Pre-Release CD image, 2004, 1 page.802006, Lemma, et al. "Secure Watermark Embedding through Partial Encryption", International Workshop on Digital Watermarking ("IWDW" 2006). Springer Lecture Notes in Computer Science 2006 (to appear) 13.812006, Moskowitz, Multimedia Security Technologies for Digital Rights Management, 2006, Academic Press, "Introduction-Digital Rights Management" pp. 3-22.822006, Moskowitz, Multimedia Security Technologies for Digital Rights Management, 2006, Academic Press, "Introduction�Digital Rights Management" pp. 3-22.832006, Staind (The Single 1996-2006), Warner Music-Atlantic, Pre-Release CD image, 2006, 1 page.842006, Staind (The Single 1996-2006), Warner Music�Atlantic, Pre-Release CD image, 2006, 1 page.852007, Wayback Machine, dated Aug. 26, 2007, http://web.archive,org/web/20070826151732/http://www.screenpl aysmag.com/t-abid/96/articleType/ArticleView/articleId/495/Defa ult.aspx/.862008, Cayre, et al., "Kerckhoff s-Based Embedding Security Classes for WOA Data Hiding", IEEE Transactions on Information Forensics and Security, vol. 3 No. 1, Mar. 2008, 15 pp.872008, Oasis (Dig Out Your Soul), Big Brother Recordings Ltd, Promotional CD image, 2008, 1 page.882009, "YouTube Copyright Policy: Video Identification tool�YouTube Help", accessed Jun. 4, 2009, http://www.google.com/support/youtube/bin/answer.py?h1=en&a nswer=83766, 3 pp.892010, Farkex, Inc 2010 "Steganography definition of steganography in the Free Online Encyclopedia" http://encyclopedia2.Thefreedictionary.com/steganography.902010, QuinStreet Inc. 2010 What is steganography?�A word definition from the Webopedia Computer Dictionary http://www.webopedia.com/terms/steganography.html.91Cox, et al., Secure Spread Spectrum Watermarking for Multimedia, NEC Research Institude, Techinal Report 95-10, pp. 33.92CSG, Computer Support Group and CSGNetwork.com 1973 http://www.csgnetwork.com/glossarys.html.93Delaigle, J.-F., et al. "Digital Watermarking," Proceedings of the SPIE, vol. 2659, Feb 1, 1996, pp. 99-110.94EPO Application No. 96919405.9, entitled "Steganographic Method and Device"; published as EP0872073 (A2), Oct. 21, 1998.95EPO Divisional Patent Application No. 07112420.0, entitled "Steganographic Method and Device" corresponding to PCT Application No. PCT/US96/10257, published as WO/1996/042151, Dec. 27, 1996.96European Search Report & European Search Opinion in EP0711240.97F. Hartung, et al., "Digital Watermarking of Raw and Compressed Video", SPIE vol. 2952, pp. 205-213.98Jap. App. No. 2000-542907, entitled "Multiple Transform Utilization and Application for Secure Digital Watermarking"; which is a JP national stage of PCT/US1999/007262, published as WO/1999/052271, Oct. 14, 1999.99PCT Application No. PCT/US00/06522, filed Mar. 14, 2000, entitled, "Utilizing Data Reduction in Steganographic and Cryptographic Systems", published as WO/2000/057643; Publication Date: Sep. 28, 2000.100PCT Application No. PCT/US00/18411, filed Jul. 5, 2000, entitled, "Copy Protection of Digital Data Combining Steganographic and Cryptographic Techniques".101PCT Application No. PCT/US00/21189, filed Aug. 4, 2000, entitled, "A Secure Personal Content Server", Pub. No. WO/2001/018628 ; Publication Date: Mar. 15, 2001.102PCT Application No. PCT/US00/33126, filed Dec. 7, 2000, entitled "Systems, Methods and Devices for Trusted Transactions", published as WO/2001/043026; Publication Date: Jun. 14, 2001103PCT Application No. PCT/US95/08159, filed Jun. 26, 1995, entitled, "Digital Information Commodities Exchange with Virtual Menuing", published as WO/1997/001892; Publication Date: Jan. 16, 2001, F24.104PCT Application No. PCT/US96/10257, filed Jun. 7, 1996, entitled "Steganographic Method and Device"�corresponding to�EPO Application No. 96919405.9, entitled "Steganographic Method and Device", published as WO/1996/042151; Publication Date: Dec. 27, 1996; F19.105PCT Application No. PCT/US97/00651, filed Jan. 16, 1997, entitled, "Method for Stega-Cipher Protection of Computer Code", published as WO/1997/026732; Publication Date: Jul. 24, 2007.106PCT Application No. PCT/US97/00652, filed Jan. 17, 1997, entitled, "Method for an Encrypted Digital Watermark", published as WO/1997/026733; Publication Date: Jul. 24, 1997.107PCT Application No. PCT/US97/11455, filed Jul. 2, 1997, entitled, "Optimization Methods for the Insertion, Protection and Detection of Digital Watermarks in Digitized Data", published as WO/1998/002864; Publication Date: Jan. 22, 1998.108PCT Application No. PCT/US99/07262, filed Apr. 2, 1999, entitled, "Multiple Transform Utilization and Applications for Secure Digital Watermarking", published as WO/1999/052271; Publication Date: Oct. 14, 1999.109PCT International Search Report in PCT/US00/06522.110PCT International Search Report in PCT/US00/18411.111PCT International Search Report in PCT/US00/21189.112PCT International Search Report in PCT/US00/33126.113PCT International Search Report in PCT/US95/08159.114PCT International Search Report in PCT/US96/10257.115PCT International Search Report in PCT/US97/00651.116PCT International Search Report in PCT/US97/00652.117PCT International Search Report in PCT/US97/11455.118PCT International Search Report in PCT/US99/07262.119Supplementary European Search Report in EP 96919405.120Supplementary European Search Report in EP00919398.121Tirkel, A.Z., "A Two-Dimensional Digital Watermark", Scientific Technology, 686, 14, date unknown.122U.S. Appl. No. 08/674,726, filed Jul. 2, 1996, entitled "Exchange Mechanisms for Digital Information Packages with Bandwidth Securitization, Multichannel Digital Watermarks, and Key Management", published as 7362775 Apr. 22, 2008.123U.S. Appl. No. 09/046,627, filed Mar. 24, 1998, entitled "Method for Combining Transfer Function with Predetermined Key Creation", published as 6,598,162 Jul. 22, 2003.124U.S. Appl. No. 09/053,628, filed Apr. 2, 1998, entitled "Multiple Transform Utilization and Application for Secure Digital Watermarking", 6,205,249 Mar. 20, 2001.125U.S. Appl. No. 09/545,589, filed Apr. 7, 2000, entitled "Method and System for Digital Watermarking", published as 7007166 Feb. 28, 2006.126U.S. Appl. No. 09/594,719, filed Jun. 16, 2000, entitled "Utilizing Data Reduction in Steganographic and Cryptographic Systems", published as 7,123,718 Oct. 17, 2006.127U.S. Appl. No. 09/644,098, filed Aug. 23, 2000, entitled "Multiple Transform Utilization and Application for Secure Digital Watermarking", published as 7,035,409 Apr. 25, 2006.128U.S. Appl. No. 09/657,181, filed Sep. 7, 2000, entitled "Method and Device for Monitoring and Analyzing Signals", published as 7,346,472 Mar. 18, 2008.129U.S. Appl. No. 09/671,739, filed Sep. 29, 2000, entitled "Method and Device for Monitoring and Analyzing Signals".130U.S. Appl. No. 09/731,039, filed Dec. 7, 2000, entitled "System and Methods for Permitting Open Access to Data Objects and for Securing Data within the Data Objects", published as 2002-0071556 A1 Jun. 13, 2002.131U.S. Appl. No. 09/731,040, filed Dec. 7, 2000, entitled "Systems, Methods and Devices for Trusted Transactions", 2002-0010684 A1 Jan. 24, 2002.132U.S. Appl. No. 09/767,733, filed Jan. 24, 2001 entitled "Multiple Transform Utilization and Application for Secure Digital Watermarking", published as 2001-0010078 A1 Jul. 26, 2001.133U.S. Appl. No. 09/789,711, filed Feb. 22, 2001, entitled "Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digital Data", published as 2001-0029580 A1 Oct. 11, 2001.134U.S. Appl. No. 09/956,262, filed Sep. 20, 2001, entitled "Improved Security Based on Subliminal and Supraliminal Channels for Data Objects", published as 2002-0056041 A1 May 9, 2002.135U.S. Appl. No. 10/049,101, filed Feb. 8, 2002, entitled "A Secure Personal Content Server", published as 7,475,246 Jan. 6, 2009.136U.S. Appl. No. 10/369,344, filed Feb. 18, 2003, entitled "Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digitized Data", published as 2003-0219143 A1 Nov. 27, 2003.137U.S. Appl. No. 10/417,231, filed Apr. 17, 2003, entitled "Methods, Systems and Devices for Packet Watermarking and Efficient Provisioning of Bandwidth", published as 2003-0200439 A1 Oct. 23, 2003.138U.S. Appl. No. 10/602,777, filed Jun. 25, 2003, entitled "Method for Combining Transfer Function with Predetermined Key Creation", published as 2004-0086119 Al May 6, 2004.139U.S. Appl. No. 10/805,484, filed Mar. 22, 2004, entitled "Method and Device for Monitoring and Analyzing Signals", published as 2004-0243540 A1 Dec. 2, 2004.140U.S. Appl. No. 11/026,234, filed Dec. 30, 2004, entitled "Z-Transform Implementation of Digital Watermarks" , published as 2005-0135615 A1 Jun. 23, 2005.141U.S. Appl. No. 11/050,779, filed Feb. 7, 2005, entitled "Steganographic Method and Device", published as 20050177727 A1 Aug. 11, 2005.142U.S. Appl. No. 11/244,213, filed Oct. 5, 2005, entitled "Method and System for Digital Watermarking", published as 2006-0101269 A1 May 11, 2006.143U.S. Appl. No. 11/358,874, filed Feb. 21, 2006, entitled "Multiple Transform Utilization and Application for Secure Digital Watermarking", published as 2006-0140403 A1 Jun. 29, 2006.144U.S. Appl. No. 11/458,639, filed Jul. 19, 2006 entitled "Methods and Systems for Inserting Watermarks in Digital Signals", published as 20060251291 A1 Nov. 9, 2006, P82.145U.S. Appl. No. 11/482,654, filed Jul. 7, 2006, entitled "Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digitized Data", published as 2006-0285722 A1 Dec. 21, 2006.146U.S. Appl. No. 11/497,822, filed Aug. 2, 2006, entitled "Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digital Data", published as 2007-0011458 A1 Jan. 11, 2007.147U.S. Appl. No. 11/512,701, filed Aug. 29, 2006, entitled "Systems, Methods and Devices for Trusted Transactions", published as 2007-0028113 A1 Feb. 1, 2007.148U.S. Appl. No. 11/518,806, filed Sep. 11, 2006, entitled "Improved Security Based on Subliminal and Supraliminal Channels for Data Objects", 2008-0028222 A1 Jan. 31, 2008.149U.S. Appl. No. 11/519,467, filed Sep. 12, 2006, entitled "Utilizing Data Reduction in Steganographic and Cryptographic Systems", published as 2007-0064940 A1 Mar. 22, 2007.150U.S. Appl. No. 11/592,079, filed Nov. 2, 2006, entitled "Linear Predictive Coding Implementation of Digital Watermarks", published as 2007-0079131 A1 Apr. 5, 2007.151U.S. Appl. No. 11/599,838, filed Nov. 15, 2006, entitled "Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digital Data", published as 2007-0226506 A1 Sep. 27, 2007.152U.S. Appl. No. 11/599,964, filed Nov. 15, 2006, entitled "Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digital Data", published as 2008-0046742 A1 Feb. 21, 2008.153U.S. Appl. No. 11/647,861, filed Dec. 29, 2006, entitled "System and Methods for Permitting Open Access to Data Objects and for Securing Data within the Data Objects", published as 2007-0110240 A1 May 17, 2007.154U.S. Appl. No. 11/649,026, filed Jan. 3, 2007, entitled "Method and System for Digital Watermarking", published as 2007-0113094 A1 May 17, 2007.155U.S. Appl. No. 12/590,553, filed Nov. 10, 2009, entitled "Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digital Data", published as 20100077219 A1 Mar. 25, 2010, P78.156U.S. Appl. No. 12/590,681, filed Nov. 12, 2009, entitled "Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digital Data", published as 20100064140 A1 Mar. 11, 2010, P79.157U.S. Appl. No. 12/592,331, filed Nov. 23, 2009, entitled "Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digital Data", published as 20100077220 A1 Mar. 25, 2010, P77.158U.S. Appl. No. 12/655,036, filed Dec. 22, 2009, entitled "Utilizing Data Reduction in Steganographic and Cryptographic Systems", published as 20100153734 A1 Jun. 17, 2010, P80.159U.S. Appl. No. 12/655,357, filed Dec. 22, 2009, entitled "Method and Device for Monitoring and Analyzing Signals", published as 20100106736 A1 Apr. 29, 2010, P81.160U.S. Appl. No. 12/665,002, filed Dec. 22, 2009, entitled "Method for Combining Transfer Function with Predetermined Key Creation", published as 20100182570 A1 Jul. 22, 2010, P76.161U.S. Appl. No. 60/169,274, filed Dec. 7, 1999, entitled "Systems, Methods and Devices for Trusted Transactions".162U.S. Appl. No. 60/222,023, filed Jul. 31, 2007 entitled "Method and apparatus for recognizing sound and signals in high noise and distortion".163U.S. Appl. No. 60/234,199, filed Sep. 20, 2000, "Improved Security Based on Subliminal and Supraliminal Channels for Data Objects".164US. Appl. No. 08/999,766, filed Jul. 23, 1997, entitled "Steganographic Method and Device", published as 7568100 Jul. 28, 2009.165Zhao, Jian et al., "Embedding Robust Labels into Images for Copyright Protection", Proceeding of the Know Right '95 Conference, pp. 242-251.Classifications U.S. Classification382/100, 713/176International ClassificationG06K9/00, H04L9/32, G06T1/00Cooperative ClassificationH04N1/32187, G06T1/0028, H04N1/3232, H04L2209/608, G06T2201/0064, H04K1/00, H04N2201/3233, H04N21/23892, H04N2201/327, H04L2209/34, H04L2209/08, H04N1/32149, G06T1/005, H04N1/32229, H04N21/8358, G06T1/0092European ClassificationH04N1/32C19B, G06T1/00W2, H04K1/00, G06T1/00W10, H04N1/32C19B2S, H04N1/32C19B3E, H04N1/32C19B9, G06T1/00W6, H04N21/2389B, H04N21/8358, H04L9/32, H04L9/32MLegal EventsDateCodeEventDescriptionApr 17, 2012CCCertificate of correctionJan 14, 2011ASAssignmentOwner name: WISTARIA TRADING, INC., FLORIDAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:COOPERMAN, MARC;REEL/FRAME:025640/0360Effective date: 20030515Nov 24, 2010ASAssignmentFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MOSKOWITZ, SCOTT A.;COOPERMAN, MARC S.;SIGNING DATES FROM 20060630 TO 20101010;REEL/FRAME:025420/0602Owner name: WISTARIA TRADING, INC, FLORIDARotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google