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:
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. 
    
    
     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&#39;s article on Aug. 8, 2001.). 
     Graser continued “[r]ecent breaches have allowed hackers to exchange: rough-cuts of Warner Bros.&#39; “Ocean&#39;s 11” and Columbia Pictures&#39; 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&#39;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&#39;s distortion. Watermark decoding can then proceed—informed by information about the particular distortion present. 
     The Assignee&#39;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&#39;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&#39;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 (S 10 ) 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 (S 12 ). If the code and watermark identifier coincide, the user is granted access to the rough-cut (S 14 ). Else, the user is denied access (S 16 ). 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&#39;s computer (or video rendering device), e.g., like storing so-called web cookies that securely store account IDs and passwords on a user&#39;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&#39;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&#39;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&#39;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.