Steganographic systems and methods

Information

  • Patent Grant
  • 7986845
  • Patent Number
    7,986,845
  • Date Filed
    Tuesday, November 17, 2009
    15 years ago
  • Date Issued
    Tuesday, July 26, 2011
    13 years ago
Abstract
The present invention relates to steganographic systems and methods. One claim recites an apparatus including: electronic memory to buffer a compressed digital watermark object, the digital watermark object is a separate object relative to a compressed video object; and an electronic processor. The electronic processor is programmed for: decompressing the compressed video object to yield a decompressed video object, the decompressed video object comprising data representing video picture elements and data representing audio elements; decompressing the digital watermark object to obtain digital watermark data; steganographically hiding the digital watermark data in the data representing video picture elements or in the data representing audio elements to yield digital watermarked video or audio; and rendering the digital watermarked video or audio. Other claims and combinations are provided too.
Description
BACKGROUND AND SUMMARY OF THE INVENTION

In a recent article, “Paranoid Hollywood Wracked by Hack Attacks,” author Marc Graser reported that “[h]ollywood is experiencing the revelation that everything it saves on a computer is available to prying eyes at any time. Nothing is safe. Paranoia is running rampant. Through legal (and freely accessible) software, anyone with a computer and an Internet connection can enter studio databases containing the most private information.” (Reuters distributed Graser's article on Aug. 8, 2001.).


Graser continued “[r]ecent breaches have allowed hackers to exchange: rough-cuts of Warner Bros.' “Ocean's 11” and Columbia Pictures' Jet Li actioner “The One”; emails among executives at Warner Bros. TV; scripts transferred from production companies such as Bruckheimer Films; databases at agencies like Creative Artists Agency, Endeavor and William Morris; personal records at law corporations and accounting offices; and digitally stored media at New Line and VDI Multimedia.” (See id.).


Piracy is raking showbiz in the tune of $1 trillion in damages annually. The film industry is losing $2.5 billion a year to piracy and the music industry is losing an additional $4.1 billion per year. (See id.).


Yet the biggest threat comes from money-hungry professionals, and company employees are increasingly to blame. See id. Graser reports that most companies do not realize that 90% of the attacks performed on the systems they try so hard to protect are the result of inside jobs.


A solution is needed to help curve the onslaught of movie theft and piracy, particularly theft from film studios and editing facilities.


Digital Watermarking can provide a deterrence and tracking solution.


Digital watermarking technology, a form of steganography, encompasses a great variety of techniques by which plural bits of digital data are hidden in some other object, preferably without leaving human-apparent evidence of alteration.


Digital watermarking may be used to modify media content (audio, video, images, etc.) to embed a machine-readable code into the media content. The media may be modified such that the embedded code is imperceptible or nearly imperceptible to a viewer, yet may be detected through an automated detection process.


There are many processes by which media content can be processed to encode a digital watermark. In media (e.g., digital audio or imagery—including video), the data may be encoded as slight variations in sample values. Or, if the object is represented in a so-called orthogonal domain (also termed “non-perceptual,” e.g., MPEG, DCT, wavelet, etc.), the data may be encoded as slight variations in quantization values or levels. The present Assignee's U.S. Pat. No. 6,122,403 and application Ser. No. 09/503,881 (now U.S. Pat. No. 6,614,914) are illustrative of certain watermarking technologies. Of course, artisans in the digital watermarking field are familiar with other technologies that are suitably interchangeable with some aspects of the present invention.


Digital watermarking systems typically have two primary components: an embedding component that embeds a watermark in the media content, and a reading component that detects and reads the embedded watermark. The embedding component embeds a watermark pattern by altering data samples of the media content. The reading component analyzes content to detect whether a watermark pattern is present. In applications where the watermark encodes information, the reading component extracts this information from the detected watermark.


One problem that arises in many watermarking applications is that of object corruption. If the object is reproduced, or distorted, in some manner such that the content presented for watermark decoding is not identical to the object as originally watermarked, then the decoding process may be unable to recognize and decode the watermark. To deal with such problems, the watermark can convey a reference signal. The reference signal is of such a character as to permit its detection even in the presence of relatively severe distortion. Once found, the attributes of the distorted reference signal can be used to quantify the content's distortion. Watermark decoding can then proceed—informed by information about the particular distortion present.


The Assignee's U.S. patent application Ser. Nos. 09/503,881 (now U.S. Pat. No. 6,614,914) and 09/452,023 (now U.S. Pat. No. 6,408,082) detail certain reference signals, and processing methods, that permit such watermark decoding even in the presence of distortion. In some image watermarking embodiments, the reference signal comprises a constellation of quasi-impulse functions in the Fourier magnitude domain, each with pseudorandom phase. To detect and quantify the distortion, the watermark decoder converts the watermarked image to the Fourier magnitude domain and then performs a log polar resampling of the Fourier magnitude image. A generalized matched filter correlates the known orientation signal with the re-sampled watermarked signal to find the rotation and scale parameters providing the highest correlation. The watermark decoder performs additional correlation operations between the phase information of the known orientation signal and the watermarked signal to determine translation parameters, which identify the origin of the watermark message signal. Having determined the rotation, scale and translation of the watermark signal, the reader then adjusts the image data to compensate for this distortion, and extracts the watermark message signal as described above.


To provide a comprehensive disclosure without unduly lengthening this specification, each of the patents and patent applications cited in this document are hereby incorporated by reference.


In one implementation of the invention, we provide steganographic markings for studio rough cuts. The marks provide nearly imperceptible identification and forensic tracking clues.


In another implementation, content is marked with serialized or unique codes efficiently using different objects for the content and watermark data via object based encoding systems such as MPEG-4. The watermark object can be efficiently created if the original compressed content is analyzed and perceptual model results and calibration signals that are constant when a watermark payload is changed are saved. This or another forensic embedding system can be used to track content as well as lock content to a recipient. For example, the content may be rendered only if the individual or their rendering device has a secret code that coincides with the embedded ID.


With the foregoing by way of background and summary, the specification next turns to various digital watermarking improvements. It will be recognized that these improvements can typically be employed in many applications, and in various combinations with the subject matter of the patent documents cited herein. These improvements will be more readily apparent from the following detailed description, which proceeds with reference to the accompanying drawings.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a diagram illustrating a network system, including a flow diagram for a security procedure.



FIG. 2 is a block diagram illustrating a transaction procedure.



FIG. 3 is a block diagram illustrating another transaction procedure, include a pre-computational stage.





DETAILED DESCRIPTION

Consider a typical film production process. After shooting on location, the resulting film is digitized or converted to a digital format. (Or digital images can be initially captured. Of course, there are special effects and other effects filters (e.g., a flame effect filter) that are essentially produced in the digital domain.). The digitized film (and any special effects scenes) represents the many scenes that will be edited to create a movie, video or other viewing program. We refer to this collection of digital scenes as a “master cut.” This master cut can be further refined into so-called rough-cuts, in which a movie sequence begins to take shape.


Often, rough-cuts are provided to editors and effects specialists. Similarly, rough-cuts are often provided to directors, critics, executives, advertisers, etc. One aspect of the present invention helps to identify and track rough-cuts as they are distributed from a studio.


A conventional security feature provides a digital “bug” or label that visually appears in a corner (or other) screen position of a rough-cut. Or the rough-cut includes a visible banner-like text message throughout each scene or frame. These techniques are easily defeated by pirates through simple cropping and editing techniques.


According to one aspect of the present invention, a rough-cut is digitally watermarked, particularly when communicated to a non-secure location. Even rough-cut copies that are “checked-out” as a file, instead of rendering (or streaming) to a network workstation, can be digitally watermarked. The digital watermark is preferably redundantly embedded throughout the rough-cut, or the watermark can be placed in only specific frames or placed to cover certain film segments or video objects. Preferably, the digital watermark includes an identifier. Suitable watermarking techniques are disclosed in the applications and patents mentioned above. In some implementations, other digital watermarking techniques can be suitably interchanged with this aspect of the present invention, so long as the watermark conveys sufficient payload capacity.


A digital watermark identifier preferably uniquely identifies a rough-cut version (e.g., cut 1 of 12, date/time, editing details, distribution trail, etc.). Alternatively (or additionally), the identifier uniquely identifies a party to which the rough-cut is being transferred. The identifier is stored in a database or other record to facilitate tracking. The identifier is associated in the database with information relating to the rough-cut or to the receiving party. (The data record can include additional information such as time of rough-cut checkout, distribution/rendering channel, usage restrictions, etc.). Thereafter, when the rough-cut is found in an unexpected or unauthorized location, e.g., a web site, video store shelf, competitor's studio, counterfeited DVD, etc., the embedded watermark identifier is extracted and used to interrogate the database. The database information is retrieved and the source of the leak or distribution channel can be identified.


In another embodiment, the identifier is used as a security feature to prevent unauthorized viewing or handling. With reference to FIG. 1, a rough-cut is transferred from a network studio to a user workstation (e.g., editor, director, etc.) via a network. The transfer can occur through a conventional network, such as a wide area network, local area network, private network, wireless network, or even the Internet. Alternatively, the user receives the rough-cut on physical media. The rough-cut includes a digital watermark embedded therein. Of course, a digital watermark can be redundantly embedded throughout the cut.


Access to the rough-cut is regulated by a software security application operating on the user's workstation. The software security application can be integrated with software editing tools such as Adobe Premier, Affects Effects and Media100 products, among others. The security software preferably includes (or cooperates with) a digital watermark reader. The reader can be a plug-in or an independent software application. The watermark reader extracts the digital watermark identifier (S10) from the rough-cut and the user is prompted to enter a corresponding code. The code is preferably rough-cut specific in that a user has (or receives from a studio) a code that corresponds only to a digital watermark identifier embedded in her rough-cut. Once entered, the watermark detector determines whether the identifier and code coincide (S12). If the code and watermark identifier coincide, the user is granted access to the rough-cut (S14). Else, the user is denied access (S16). The code and watermark ID need not perfectly match to coincide. Indeed, the code and identifier can be related via a hash, mathematical relationship or algorithm. Or the code/identifier can be related by a symmetrical or asymmetrical encryption key.


In other implementations, the code is cached on the editor's computer (or video rendering device), e.g., like storing so-called web cookies that securely store account IDs and passwords on a user's terminal, so the code does not need to be manually entered each time. In addition, the code can be locked (or tied) to a computer, such as including the date of a Windows garbage can. In one implementation, the computer is secure, requiring the user to enter a password and/or pass biometrics, such as a fingerprint scan or security dongle or card, such that other users do not have access to the cached ID. In other words, only a specified user can use the cached ID, even though it is stored on the PC since the cache is locked for access only by a qualifying PC user. In another implementation, the code is implicitly part of a computer system, such as a private cryptography key. In this case, the code is used to decrypt or otherwise unscramble the rough-cut or the digital watermark embedded in the rough cut or both.


As will be appreciated, an editing process typically involves the creation of an instruction set, which is used to create a final cut. The instruction set outlines (e.g., by codes or markers) the editor's edits, cuts, etc. Most often the instruction set is applied against a high quality cut to create the final cut (or further rough-cuts). Of course, a final cut can likewise be watermarked.


In still another implementation of this aspect of the present invention, an editor's rendering device (e.g., personal computer executing editing software instructions, set-top-box or other device) embeds a watermark identifier in a rough-cut. The identifier is preferably unique to the editor or to a team of editors. Accordingly, if the rough-cut is discovered in an unanticipated or unauthorized channel, the watermark identifier, once extracted, can be used to track the source of the leak.


Consider a modification of this implementation for adaptation to a peer-to-peer (P2P) network environment. When presenting a pre-release movie clip in a P2P network, e.g., like x-ShareThis, every ShareThis client that handles (or routes) the movie clip digitally watermarks the clip with a unique identifying watermark (e.g., a unique serial number, etc.). Illegal or unauthorized copies of the movie clip can be traced through the peer lineage of the unique identifiers.


Transactional Watermarks: a System Level Approach


Forensic tracking can be facilitated by watermarking each version or content copy with a transaction ID. Content is defined broadly herein and may include audio, video, data, images or multimedia combinations. A transaction (or dynamic) identifier preferably includes multi-bit data that uniquely identifies a user, a user device or a transaction. In some cases the transaction identifier serves as a database interrogator to retrieve additional information. (Forensic tracking involves identifying content and/or tracking a distribution source or history of the content. Forensic tracking can also involve uniquely serializing content to a user or user device. Forensic tracking is particularly helpful in identifying content or a distribution source when the content is discovered in an unexpected or unauthorized channel or location.). A content owner may want a serial account of each content copy, or to tie the content to an end-user or playing device ID. This requirement means that the content is preferably watermarked on the fly at the server with video streamed over IP, or at a set-top box (STB) in broadcast video system.


Some robust watermark embedding algorithms are too computationally intensive for this approach and/or adversely degrade content. For broadcast video, a set-top-box (STB) is designed to be as inexpensive as possible, but for use in a watermark embedding/decoding system, the STB must contain enough computational resources for a watermark embedder and/or decoder. For video streamed over IP, compressed content is often digitally watermarked on a server, which may require the content to be decompressed, watermarked and re-compressed. These steps are not only computationally intense but may also degrade the content.


Looking at a complete system, we have invented improvements for efficiently embedding a transaction ID in content. Our improvements are discussed below.


Watermarking Compressed Content


Digitally watermarking compressed audio, video or images, where a watermark ID can dynamically change (e.g., potentially to identify a user, transaction or requesting/rendering device), presents computational and content degradation (due to a re-compression) challenges. Conventional approaches often require content to be decompressed, watermark and recompressed.


Our improvements and solutions to these challenges are expressed in the following two embodiments.


First Embodiment

Our first embodiment is discussed with reference to FIG. 2. Compressed content 100 is decompressed 110. A watermark including a dynamic identifier 140 is determined (or constructed) for the decompressed content 120. Preferably, a dynamic identifier (or transaction identifier) uniquely identifies a particular user or user device. Or the dynamic identifier can be unique to a particular transaction in a receipt-like manner. Optionally, the dynamic identifier is associated in a database with additional information such as user information, distribution channel, content usage rights, transaction details, account information, etc. (Once decoded, the dynamic identifier is used to interrogate the database to retrieve the additional information.). The watermark is compressed as a separate object 130, such as defined in MPEG-4, without being embedded in the decompressed content. Two objects—namely the original compressed content and the compressed watermark—are communicated to a rendering device (e.g., personal computer, media player, set-top-box, DVD, or other consumer device) 150. In one example, a copy of the original compressed content 100 is retained, so as to avoid recompressing the decompressed original content. The objects can be communicated via a network, such as the Internet or a LAN or WAN. In a network environment, steps 100-140 are preferably carried-out on a network server.


The rendering device combines the two objects 160. For example, the objects can be decompressed and the content can be embedded with the watermark by a watermark embedded associated with the rendering device. The watermark object can include embedding hints, such a spatial or frequency-embedding clues, start sequences or points, etc. Or the two objects can be associated or linked together, e.g., with a header or file structure. Still further, the content and watermark can be otherwise combined, e.g., during rendering or storing.


The first embodiment associates a dynamic ID with content without recompressing the original content. The decompressed content 110 can be optionally saved on the network server so that the decompressing step is skipped for following transactions involving the same original content, thus reducing computational requirements.


Although not required, it is preferable that the two objects, i.e., the original compressed content and the compressed watermark, are delivered as a secure stream to a secure player (or rendering device) so that a would-be pirate cannot restrict or separate the watermark from the content.


Second Embodiment

Our second embodiment is described with reference to FIG. 3, where like stages/steps are numbered with the same reference numbers as shown in FIG. 2. This embodiment includes a pre-computation stage, where original compressed content 100 is decompressed 110. Static watermark features and/or embedding instructions are determined 220. For example, the static watermark signal many include features based on perceptual modeling of the content, or may include watermark orientation or reference signals. The watermark features (e.g., perceptual model and/or orientation signal) are saved in a related file 230. Preferably, the related file contains those watermarking features that do not change when the transactional (or dynamic) ID changes. With these features saved in related file 230, the original content does not need to be again de-compressed. Overall computational time can be reduced by saving such a related file in the pre-computational stage. This related file 230 is preferably saved for future requests for the same original content 100, saving additional computational time.


Then, in a transaction stage, where the content 100 is delivered to a user, a watermark is efficiently created 120 using the related file 230 (including the perceptual model and/or orientation signal). The watermark preferably includes a watermark identifier based on a dynamic ID 140. As in the first embodiment, the dynamic or transactional ID uniquely identifies the user, user device or the transaction. The watermark is compressed 130 and sent as an object with the original compressed content 150 as discussed above with respect to FIG. 2. As such, in the transaction stage, the original compressed file need not be decompressed. In other words, the content file needs to be decompressed and analyzed for perceptual features only once, while the distributed versions can be watermarked with numerous IDs.


Additionally, in step 160, the watermark can efficiently be read before being added to the content. This reading will be very efficient and robust. Even if the watermark is read after being combined with the content, the watermark ID can be used to produce so-called hot-branding, where a related central database produces a dynamic brand logo to appear with the content, such as a logo in video or images and audio with audio.


Modifications


We also envision that the original compressed content may be encrypted. When encrypted, decryption does not have to be performed, except initially in the pre-computational stage when the related file 230 is created. This is both more efficient and more secure than having to decrypt the content to add the watermark during each subsequent transaction. As with the first embodiment, if the decompressed content is saved, the system is more efficient, but not necessarily more secure since non-secure content is available on the server.


As an optional feature for the FIG. 2 and FIG. 3 embodiments, the content is embedded with a watermark content ID, and optionally with a distributor ID, before it is broadcast or streamed. This process need only occur once and not each time it is streamed. For example, a watermark-embedding step is included after decompression 110. Or the illustrated transaction processes act on compressed content that has been previously watermarked. The individual dynamic or transaction ID is then determined according to the FIG. 2 and FIG. 3 embodiments.


As will be appreciated, in the FIG. 2 and FIG. 3 embodiments, the original content and watermark objects are securely combined at a rendering device, thus creating a uniquely identified content display (e.g., such as a video display).


It also should be appreciated that the FIG. 2 and FIG. 3 transaction systems are envisioned to handle many transfers of the same original content to many different users (or rendering devices). A unique dynamic or transaction identifier is preferably generated for each transfer or for each user.


With reference to FIG. 2, in an alternative embodiment, the original content 100 includes a digital watermark, and the watermark is extracted and supplemented with a dynamic (or transactional) identifier in step 120.


CONCLUSION

The foregoing are just exemplary implementations of the present invention. It will be recognized that there are a great number of variations on these basic themes. The foregoing illustrates but a few applications of the detailed technology. There are many others.


To provide a comprehensive disclosure without unduly lengthening this specification, each of the above-mentioned patents and patent applications, along with U.S. patent application Ser. Nos. 09/574,668 (now U.S. Pat. No. 6,522,769), 09/620,019 (now U.S. Pat. No. 7,689,532), 09/636,102, 60/257,822, and 09/574,668 (now U.S. Pat. No. 6,522,769), are hereby incorporated by reference. Applicants also herein incorporate by reference Assignee's U.S. patent application Ser. No. 10/277,617, published as US 2003-0103645 A1; now U.S. Pat. No. 7,224,819. The particular combinations of elements and features in the above-detailed embodiments are exemplary only; the interchanging and substitution of these teachings with other teachings in this application and the incorporated-by-reference patents/applications are expressly contemplated.


Many of the above-described methods and related functionality can be facilitated with computer executable software stored on computer readable media, such as electronic memory circuits, RAM, ROM, EPROM, flash memory, magnetic media, optical media, magnetic-optical media, memory sticks, hard disks, removable media, etc., etc. Such software may be stored and/or executed on a general-purpose computer, or on a server for distributed use. Also, instead of software, a hardware implementation, or a software-hardware implementation can be used.


While the first aspect of the present invention has been described with respect to editor rough-cuts, the invention is not so limited. Indeed, any movie segment, trailer, preview, or confidential documents can be watermarked. Also, while the rough-cuts are described as if in a digital format, they need not be so. Instead, the rough-cuts can be film, which includes a digital watermark identifier embedded therein. It also should be appreciated that the watermark embedding can occur while the rough-cut is being rendered.


Also, a studio rough-cut can include a plurality of watermarks. For example, the rough-cut may include a content identifying watermark, which uniquely identifies the content, and a user specific watermark, which uniquely identifies the user. The studio rough-cut can also include a so-called semi-fragile digital watermark. A semi-fragile watermark is designed such that it can withstand routine signal processing (e.g., compression) but is destroyed or degrades predictably with a malicious attack. The status of a fragile watermark in a studio rough-cut will help to announce a copy.


In view of the wide variety of embodiments to which the principles and features discussed above can be applied, it should be apparent that the detailed embodiments are illustrative only and should not be taken as limiting the scope of the invention.

Claims
  • 1. An apparatus comprising: a memory configured to buffer a compressed digital watermark object, wherein the compressed digital watermark object is a separate object relative to a compressed video object;a processor operatively coupled to the memory and configured to: decompress the compressed video object to yield a decompressed video object, wherein the decompressed video object includes data representing video picture elements and data representing audio elements;decompress the digital watermark object to obtain digital watermark data;steganographically hide the digital watermark data in the data representing video picture elements or in the data representing audio elements to yield digital watermarked video or audio; andrender the digital watermarked video or audio.
  • 2. The apparatus of claim 1, wherein the digital watermark data comprises transaction information.
  • 3. The apparatus of claim 1, wherein the digital watermark data comprises distribution information.
  • 4. The apparatus of claim 1, wherein the digital watermark data comprises information uniquely associated with the apparatus.
  • 5. The apparatus of claim 1, wherein the apparatus comprises a set-top box.
  • 6. The apparatus of claim 1, wherein the digital watermark data comprises information based on perceptual modeling of the video picture elements or the audio elements.
  • 7. The apparatus of claim 1, wherein the processor is further configured to alter the digital watermark data prior to steganographically hiding the digital watermark data in the data representing video picture elements or in the data representing audio elements.
  • 8. The apparatus of claim 7, wherein alterations to the digital watermark data provide transaction information.
  • 9. The apparatus of claim 7, wherein alterations to the digital watermark data uniquely associate the digital watermark data with the apparatus.
  • 10. A method comprising: storing, in a memory, a compressed digital watermark object, wherein the compressed digital watermark object is a separate object relative to a compressed video object;decompressing, with a processor, the compressed video object to yield a decompressed video object, wherein the decompressed video object includes data representing video picture elements and data representing audio elements;decompressing the digital watermark object to obtain digital watermark data;steganographically hiding the digital watermark data in the data representing video picture elements or in the data representing audio elements to yield digital watermarked video or audio; andcommunicating the digital watermarked video or audio to a display device.
  • 11. The method of claim 10, further comprising altering the digital watermark data prior to steganographically hiding the digital watermark data in the data representing video picture elements or in the data representing audio elements.
  • 12. The method of claim 10, wherein the computing device comprises a set-top box.
  • 13. The method of claim 10, wherein the digital watermark data comprises information based on perceptual modeling of the video picture elements or the audio elements.
  • 14. The method of claim 10, wherein the digital watermark data comprises transaction information.
  • 15. An apparatus comprising: means for buffering a compressed digital watermark object, wherein the compressed digital watermark object is a separate object relative to a compressed video object;means for decompressing the compressed video object to yield a decompressed video object, wherein the decompressed video object includes data representing video picture elements and data representing audio elements;means for decompressing the digital watermark object to obtain digital watermark data;means for steganographically hiding the digital watermark data in the data representing video picture elements or in the data representing audio elements to yield digital watermarked video or audio; andmeans for communicating the digital watermarked video or audio to a means for rendering the digital watermarked video or audio.
  • 16. The apparatus of claim 15, further comprising means for altering the digital watermark data prior to steganographically hiding the digital watermark data in the data representing video picture elements or in the data representing audio elements.
  • 17. The apparatus of claim 15, wherein the apparatus comprises a set-top box.
  • 18. The apparatus of claim 15, wherein the digital watermark data comprises information based on perceptual modeling of the video picture elements or the audio elements.
  • 19. The apparatus of claim 15, wherein the digital watermark data comprises transaction information.
  • 20. A tangible computer-readable medium having instructions stored thereon, the instructions comprising: instructions to buffer a compressed digital watermark object, wherein the compressed digital watermark object is a separate object relative to a compressed video object;instructions to decompress the compressed video object to yield a decompressed video object, wherein the decompressed video object includes data representing video picture elements and data representing audio elements;instructions to decompress the digital watermark object to obtain digital watermark data;instructions to steganographically hide the digital watermark data in the data representing video picture elements or in the data representing audio elements to yield digital watermarked video or audio; andinstructions to render the digital watermarked video or audio.
  • 21. The tangible computer-readable medium of claim 20, wherein the digital watermark data comprises transaction information.
  • 22. The tangible computer-readable medium of claim 20, wherein the digital watermark data comprises distribution information.
  • 23. The tangible computer-readable medium of claim 20, wherein the digital watermark data comprises information uniquely associated with an apparatus that includes the tangible computer-readable medium.
  • 24. The tangible computer-readable medium of claim 20, wherein the tangible computer-readable medium forms part of a set-top box.
  • 25. The tangible computer-readable medium of claim 20, wherein the digital watermark data comprises information based on perceptual modeling of the video picture elements or the audio elements.
  • 26. The tangible computer-readable medium of claim 20, wherein the instructions further comprise instructions to alter the digital watermark data prior to steganographically hiding the digital watermark data in the data representing video picture elements or in the data representing audio elements.
  • 27. The tangible computer-readable medium of claim 26, wherein alterations to the digital watermark data provide transaction information.
  • 28. The tangible computer-readable medium of claim 26, wherein alterations to the digital watermark data uniquely associate the digital watermark data with an apparatus that includes the tangible computer-readable medium.
RELATED APPLICATION DATA

This application is a continuation of U.S. patent application Ser. No. 12/272,432, filed Nov. 17, 2008 (now U.S. Pat. No. 7,620,253), which is a continuation of U.S. patent application Ser. No. 11/361,671, filed Feb. 24, 2006 (now U.S. Pat. No. 7,454,035), which is a continuation of U.S. patent application Ser. No. 10/278,742, filed Oct. 21, 2002 (now U.S. Pat. No. 7,006,661), which is a continuation-in-part of U.S. patent application Ser. No. 10/017,678 (now U.S. Pat. No. 7,050,603), which is a continuation of U.S. patent application Ser. No. 09/597,209 (now U.S. Pat. No. 6,411,725). The application Ser. No. 09/597,209 is a continuation-in-part of U.S. patent application Ser. No. 09/408,902 (now U.S. Pat. No. 6,408,331), which is a division of U.S. patent application Ser. No. 09/130,624 (now U.S. Pat. No. 6,324,573), which is a continuation of U.S. patent application Ser. No. 08/508,083 (now U.S. Pat. No. 5,841,978). The application Ser. No. 10/278,742 also claims the benefit of U.S. Provisional Patent Application No. 60/349,970, filed Oct. 19, 2001.

US Referenced Citations (365)
Number Name Date Kind
3984624 Waggener Oct 1976 A
4238849 Gassmann Dec 1980 A
4425642 Moses et al. Jan 1984 A
4528588 Lofberg Jul 1985 A
4547804 Greenberg Oct 1985 A
4805020 Greenberg Feb 1989 A
4807031 Broughton et al. Feb 1989 A
4829569 Seth-Smith et al. May 1989 A
4945412 Kramer Jul 1990 A
4969041 O'Grady et al. Nov 1990 A
5228056 Schilling Jul 1993 A
5243423 DeJean et al. Sep 1993 A
5428606 Moskowitz Jun 1995 A
5481294 Thomas et al. Jan 1996 A
5526427 Thomas et al. Jun 1996 A
5613004 Cooperman et al. Mar 1997 A
5636292 Rhoads Jun 1997 A
5646997 Barton Jul 1997 A
5664018 Leighton Sep 1997 A
5687236 Moskowitz et al. Nov 1997 A
5710834 Rhoads Jan 1998 A
5715403 Stefik Feb 1998 A
5719937 Warren Feb 1998 A
5748763 Rhoads May 1998 A
5765152 Erickson Jun 1998 A
5768426 Rhoads Jun 1998 A
5774452 Wolosewicz Jun 1998 A
5809139 Girod et al. Sep 1998 A
5809317 Kogan et al. Sep 1998 A
5822436 Rhoads Oct 1998 A
5832119 Rhoads Nov 1998 A
5838906 Doyle et al. Nov 1998 A
5841886 Rhoads Nov 1998 A
5841978 Rhoads Nov 1998 A
5845281 Benson Dec 1998 A
5862260 Rhoads Jan 1999 A
5892900 Ginter et al. Apr 1999 A
5901178 Lee May 1999 A
5905800 Moskowitz et al. May 1999 A
5910987 Ginter et al. Jun 1999 A
5915027 Cox Jun 1999 A
5933798 Linnartz Aug 1999 A
5940504 Griswold Aug 1999 A
5943422 Van Wie et al. Aug 1999 A
5949885 Leighton Sep 1999 A
5963909 Warren Oct 1999 A
5991876 Johnson et al. Nov 1999 A
5995625 Sudia Nov 1999 A
6018369 Patterson Jan 2000 A
6021491 Renaud Feb 2000 A
6078664 Moskowitz et al. Jun 2000 A
6086706 Brasil Jul 2000 A
6104812 Koltai et al. Aug 2000 A
6115741 Domenikos et al. Sep 2000 A
6122403 Rhoads Sep 2000 A
6141753 Zhao et al. Oct 2000 A
6175639 Satoh et al. Jan 2001 B1
6185312 Nakamura et al. Feb 2001 B1
6185683 Ginter et al. Feb 2001 B1
6192138 Yamadaji Feb 2001 B1
6199076 Logan et al. Mar 2001 B1
6209092 Linnartz Mar 2001 B1
6216228 Chapman Apr 2001 B1
6229924 Rhoads et al. May 2001 B1
6233684 Stefik May 2001 B1
6236971 Stefik May 2001 B1
6240185 Van Wie et al. May 2001 B1
6243480 Zhao et al. Jun 2001 B1
6263087 Miller Jul 2001 B1
6269394 Kenner et al. Jul 2001 B1
6272176 Srinivasan Aug 2001 B1
6272634 Tewfik et al. Aug 2001 B1
6282654 Ikeda et al. Aug 2001 B1
6283036 Rhoads Sep 2001 B1
6285774 Schumann Sep 2001 B1
6298142 Nakano Oct 2001 B1
6307949 Rhoads Oct 2001 B1
6310962 Chung et al. Oct 2001 B1
6311214 Rhoads Oct 2001 B1
6314192 Chen et al. Nov 2001 B1
6324573 Rhoads Nov 2001 B1
6332031 Rhoads et al. Dec 2001 B1
6334187 Kadono Dec 2001 B1
6351815 Adams Feb 2002 B1
6373960 Conover et al. Apr 2002 B1
6381341 Rhoads Apr 2002 B1
6385329 Sharma et al. May 2002 B1
6398245 Gruse et al. Jun 2002 B1
6408082 Rhoads et al. Jun 2002 B1
6408331 Rhoads Jun 2002 B1
6411725 Rhoads Jun 2002 B1
6418232 Nakano et al. Jul 2002 B1
6421070 Ramos et al. Jul 2002 B1
6424725 Rhoads et al. Jul 2002 B1
6425081 Iwamura Jul 2002 B1
6427020 Rhoads Jul 2002 B1
6456726 Yu et al. Sep 2002 B1
6466670 Tsuria et al. Oct 2002 B1
6477707 King et al. Nov 2002 B1
6493457 Quackenbush Dec 2002 B1
6499105 Yoshiura et al. Dec 2002 B1
6505160 Levy et al. Jan 2003 B1
6516079 Rhoads et al. Feb 2003 B1
6522769 Rhoads et al. Feb 2003 B1
6522770 Seder et al. Feb 2003 B1
6535614 Kimura Mar 2003 B1
6535617 Hannigan et al. Mar 2003 B1
6542927 Rhoads Apr 2003 B2
6553129 Rhoads Apr 2003 B1
6567533 Rhoads May 2003 B1
6574350 Rhoads Jun 2003 B1
6580808 Rhoads Jun 2003 B2
6587944 Yeung Jul 2003 B2
6590996 Reed et al. Jul 2003 B1
6590998 Rhoads Jul 2003 B2
6601046 Epstein Jul 2003 B1
6611607 Davis et al. Aug 2003 B1
6614914 Rhoads et al. Sep 2003 B1
6636615 Rhoads et al. Oct 2003 B1
6647128 Rhoads Nov 2003 B1
6647130 Rhoads Nov 2003 B2
6650761 Rodriguez et al. Nov 2003 B1
6654887 Rhoads Nov 2003 B2
6664976 Lofgren et al. Dec 2003 B2
6681028 Rhoads et al. Jan 2004 B2
6681029 Rhoads Jan 2004 B1
6694042 Seder et al. Feb 2004 B2
6694043 Seder et al. Feb 2004 B2
6700990 Rhoads Mar 2004 B1
6700995 Reed Mar 2004 B2
6704869 Rhoads et al. Mar 2004 B2
6718046 Reed et al. Apr 2004 B2
6718047 Rhoads Apr 2004 B2
6721440 Reed et al. Apr 2004 B2
6728390 Rhoads et al. Apr 2004 B2
6744906 Rhoads et al. Jun 2004 B2
6748533 Wu et al. Jun 2004 B1
6757407 Bruckstein et al. Jun 2004 B2
6760463 Rhoads Jul 2004 B2
6763123 Reed et al. Jul 2004 B2
6768809 Rhoads et al. Jul 2004 B2
6775392 Rhoads Aug 2004 B1
6785815 Serret-Avila et al. Aug 2004 B1
6788800 Carr et al. Sep 2004 B1
6798894 Rhoads Sep 2004 B2
6807285 Iwamura Oct 2004 B1
6813366 Rhoads Nov 2004 B1
6879701 Rhoads Apr 2005 B1
6917724 Seder et al. Jul 2005 B2
6920232 Rhoads Jul 2005 B2
6922480 Rhoads Jul 2005 B2
6947571 Rhoads et al. Sep 2005 B1
6975746 Davis et al. Dec 2005 B2
6988202 Rhoads et al. Jan 2006 B1
6996252 Reed et al. Feb 2006 B2
7003731 Rhoads et al. Feb 2006 B1
7006661 Miller Feb 2006 B2
7024016 Rhoads et al. Apr 2006 B2
7027614 Reed Apr 2006 B2
7035427 Rhoads Apr 2006 B2
7044395 Davis et al. May 2006 B1
7046808 Metois et al. May 2006 B1
7050603 Rhoads et al. May 2006 B2
7051086 Rhoads et al. May 2006 B2
7054465 Rhoads May 2006 B2
7055034 Levy May 2006 B1
7062068 Hirai et al. Jun 2006 B2
7062069 Rhoads Jun 2006 B2
7095871 Jones et al. Aug 2006 B2
7111170 Rhoads et al. Sep 2006 B2
7113614 Rhoads Sep 2006 B2
7139408 Rhoads et al. Nov 2006 B2
7158654 Rhoads Jan 2007 B2
7164780 Brundage et al. Jan 2007 B2
7171016 Rhoads Jan 2007 B1
7171020 Rhoads et al. Jan 2007 B2
7174031 Rhoads et al. Feb 2007 B2
7177443 Rhoads Feb 2007 B2
7197156 Levy Mar 2007 B1
7213757 Jones et al. May 2007 B2
7224819 Levy et al. May 2007 B2
7248717 Rhoads Jul 2007 B2
7261612 Hannigan et al. Aug 2007 B1
7305104 Carr et al. Dec 2007 B2
7308110 Rhoads Dec 2007 B2
7313251 Rhoads Dec 2007 B2
7319775 Sharma et al. Jan 2008 B2
7330564 Brundage et al. Feb 2008 B2
7369678 Rhoads May 2008 B2
7373513 Levy May 2008 B2
7377421 Rhoads May 2008 B2
7391880 Reed et al. Jun 2008 B2
7400743 Rhoads et al. Jul 2008 B2
7406214 Rhoads et al. Jul 2008 B2
7424131 Alattar et al. Sep 2008 B2
7427030 Jones et al. Sep 2008 B2
7433491 Rhoads Oct 2008 B2
7436976 Levy et al. Oct 2008 B2
7437430 Rhoads Oct 2008 B2
7444000 Rhoads Oct 2008 B2
7444392 Rhoads et al. Oct 2008 B2
7450734 Rodriguez et al. Nov 2008 B2
7454035 Miller et al. Nov 2008 B2
7460726 Levy et al. Dec 2008 B2
7466840 Rhoads Dec 2008 B2
7486799 Rhoads Feb 2009 B2
7499566 Rhoads Mar 2009 B2
7502759 Hannigan et al. Mar 2009 B2
7508955 Carr et al. Mar 2009 B2
7515733 Rhoads Apr 2009 B2
7536034 Rhoads et al. May 2009 B2
7537170 Reed et al. May 2009 B2
7545952 Brundage et al. Jun 2009 B2
7564992 Rhoads Jul 2009 B2
7577273 Rhoads et al. Aug 2009 B2
RE40919 Rhoads Sep 2009 E
7602978 Levy et al. Oct 2009 B2
7620253 Miller et al. Nov 2009 B2
7628320 Rhoads Dec 2009 B2
7643649 Davis et al. Jan 2010 B2
7650009 Rhoads Jan 2010 B2
7653210 Rhoads Jan 2010 B2
7657058 Sharma Feb 2010 B2
7685426 Ramos et al. Mar 2010 B2
7689532 Levy Mar 2010 B1
7693300 Reed et al. Apr 2010 B2
7693965 Rhoads Apr 2010 B2
7697719 Rhoads Apr 2010 B2
7711143 Rhoads May 2010 B2
7738673 Reed Jun 2010 B2
7747038 Rhoads Jun 2010 B2
7751588 Rhoads Jul 2010 B2
7751596 Rhoads Jul 2010 B2
7756290 Rhoads Jul 2010 B2
7760905 Rhoads et al. Jul 2010 B2
7762468 Reed et al. Jul 2010 B2
7787653 Rhoads Aug 2010 B2
7792325 Rhoads et al. Sep 2010 B2
7805500 Rhoads Sep 2010 B2
7822225 Alattar Oct 2010 B2
7837094 Rhoads Nov 2010 B2
20010001613 Hashimoto May 2001 A1
20010016052 Miller Aug 2001 A1
20010017885 Asai et al. Aug 2001 A1
20010018742 Hirai Aug 2001 A1
20010021144 Oshima et al. Sep 2001 A1
20010024510 Iwamura Sep 2001 A1
20010026377 Ikegami Oct 2001 A1
20010026618 Van Wie Oct 2001 A1
20010032312 Runje Oct 2001 A1
20010033674 Chen Oct 2001 A1
20010034705 Rhoads et al. Oct 2001 A1
20010037465 Hart Nov 2001 A1
20010044899 Levy Nov 2001 A1
20010047478 Mase Nov 2001 A1
20010051996 Cooper et al. Dec 2001 A1
20010054144 Epstein et al. Dec 2001 A1
20010055391 Jacobs Dec 2001 A1
20010055407 Rhoads Dec 2001 A1
20020009208 Alattar et al. Jan 2002 A1
20020010826 Takahashi Jan 2002 A1
20020013772 Peinado Jan 2002 A1
20020023058 Taniguchi et al. Feb 2002 A1
20020032502 Russell Mar 2002 A1
20020032698 Cox Mar 2002 A1
20020033844 Levy et al. Mar 2002 A1
20020052885 Levy May 2002 A1
20020056081 Morley May 2002 A1
20020056118 Hunter May 2002 A1
20020059238 Saito May 2002 A1
20020061120 Carr et al. May 2002 A1
20020061122 Fujihara et al. May 2002 A1
20020062442 Kurahashi May 2002 A1
20020064759 Durbin et al. May 2002 A1
20020065781 Hillegass May 2002 A1
20020065832 Mack May 2002 A1
20020069359 Watanabe Jun 2002 A1
20020069370 Mack Jun 2002 A1
20020071556 Moskowitz et al. Jun 2002 A1
20020080271 Eveleens Jun 2002 A1
20020080964 Stone et al. Jun 2002 A1
20020087885 Peled Jul 2002 A1
20020090114 Rhoads et al. Jul 2002 A1
20020091575 Collart Jul 2002 A1
20020091592 Sugiura Jul 2002 A1
20020107803 Lisanke Aug 2002 A1
20020108050 Raley Aug 2002 A1
20020111136 McCoy Aug 2002 A1
20020111878 Namba et al. Aug 2002 A1
20020114458 Belenko Aug 2002 A1
20020120515 Morimoto et al. Aug 2002 A1
20020120517 Proidl Aug 2002 A1
20020122567 Kuzmich et al. Sep 2002 A1
20020131076 Davis Sep 2002 A1
20020138744 Schleicher et al. Sep 2002 A1
20020141584 Razdan Oct 2002 A1
20020146148 Levy Oct 2002 A1
20020152388 Linnartz Oct 2002 A1
20020165793 Brand Nov 2002 A1
20020168082 Razdan Nov 2002 A1
20020176003 Seder et al. Nov 2002 A1
20020186886 Rhoads Dec 2002 A1
20020188841 Jones et al. Dec 2002 A1
20020196272 Ramos et al. Dec 2002 A1
20030009669 White Jan 2003 A1
20030009671 Yacobi et al. Jan 2003 A1
20030012548 Levy et al. Jan 2003 A1
20030021439 Lubin et al. Jan 2003 A1
20030032033 Anglin et al. Feb 2003 A1
20030035565 Rhoads Feb 2003 A1
20030037010 Schmelzer Feb 2003 A1
20030040957 Rhoads et al. Feb 2003 A1
20030056103 Levy et al. Mar 2003 A1
20030076955 Alve Apr 2003 A1
20030078889 Lee Apr 2003 A1
20030084284 Ando May 2003 A1
20030088775 Weimerskirch May 2003 A1
20030098345 Kobayashi et al. May 2003 A1
20030103645 Levy et al. Jun 2003 A1
20030105730 Davis et al. Jun 2003 A1
20030110126 Dunkeld et al. Jun 2003 A1
20030112974 Levy Jun 2003 A1
20030130954 Carr et al. Jul 2003 A1
20040001606 Levy Jan 2004 A1
20040005093 Rhoads Jan 2004 A1
20040022412 Iwamura et al. Feb 2004 A1
20040117629 Koto et al. Jun 2004 A1
20040169892 Yoda Sep 2004 A1
20040190750 Rodriguez et al. Sep 2004 A1
20040240704 Reed Dec 2004 A1
20040264733 Rhoads et al. Dec 2004 A1
20050013462 Rhoads Jan 2005 A1
20050041835 Reed et al. Feb 2005 A1
20050058318 Rhoads Mar 2005 A1
20050192933 Rhoads et al. Sep 2005 A1
20050249374 Levy Nov 2005 A1
20060013435 Rhoads Jan 2006 A1
20060041591 Rhoads Feb 2006 A1
20060251291 Rhoads Nov 2006 A1
20070055884 Rhoads Mar 2007 A1
20070108287 Davis et al. May 2007 A1
20070154064 Rhoads et al. Jul 2007 A1
20070276841 Rhoads et al. Nov 2007 A1
20070276928 Rhoads et al. Nov 2007 A1
20080121728 Rodriguez May 2008 A1
20080133555 Rhoads et al. Jun 2008 A1
20080292134 Sharma et al. Nov 2008 A1
20090012944 Rodriguez et al. Jan 2009 A1
20090116687 Rhoads et al. May 2009 A1
20090125475 Rhoads et al. May 2009 A1
20090129627 Levy et al. May 2009 A1
20090232352 Carr et al. Sep 2009 A1
20090262975 Rhoads Oct 2009 A1
20090286572 Rhoads et al. Nov 2009 A1
20090290754 Rhoads Nov 2009 A1
20100027837 Levy et al. Feb 2010 A1
20100045816 Rhoads Feb 2010 A1
20100054529 Rhoads Mar 2010 A1
20100062819 Hannigan et al. Mar 2010 A1
20100094639 Rhoads Apr 2010 A1
20100142749 Ellingson et al. Jun 2010 A1
20100172540 Davis et al. Jul 2010 A1
20100198941 Rhoads Aug 2010 A1
20100296526 Rhoads Nov 2010 A1
20110007936 Rhoads Jan 2011 A1
Foreign Referenced Citations (8)
Number Date Country
1077570 Feb 2001 EP
WO 0105075 Jan 2001 WO
WO 0106703 Jan 2001 WO
WO0176253 Oct 2001 WO
WO0207425 Jan 2002 WO
WO0207442 Jan 2002 WO
WO0219589 Mar 2002 WO
WO 0237489 May 2002 WO
Related Publications (1)
Number Date Country
20100067737 A1 Mar 2010 US
Provisional Applications (1)
Number Date Country
60349970 Oct 2001 US
Divisions (1)
Number Date Country
Parent 09130624 Aug 1998 US
Child 09408902 US
Continuations (5)
Number Date Country
Parent 12272432 Nov 2008 US
Child 12620295 US
Parent 11361671 Feb 2006 US
Child 12272432 US
Parent 10278742 Oct 2002 US
Child 11361671 US
Parent 09597209 Jun 2000 US
Child 10017678 US
Parent 08508083 Jul 1995 US
Child 09130624 US
Continuation in Parts (2)
Number Date Country
Parent 10017678 Dec 2001 US
Child 10278742 US
Parent 09408902 Sep 1999 US
Child 09597209 US