Source: http://www.google.fr/patents/US8681978
Timestamp: 2018-01-21 03:12:58
Document Index: 703709797

Matched Legal Cases: ['Application No. 61', 'arts 1024', 'Application No. 07836262', 'Application No. 12150742', 'Application No. 03774648', 'Application No. 06758537', 'Application No. 06758577', 'Application No. 2008', 'Application No. 2008', 'Application No. 03774648', 'Application No. 2009', 'Application No. 2011', 'Application No. 2011']

Brevet US8681978 - Efficient and secure forensic marking in compressed domain - Google Brevets
Methods, devices, and computer program products enable the embedding of forensic marks in a host content that is in compressed domain. These and other features are achieved by preprocessing of a host content to provide a plurality of host content versions with different embedded watermarks that are subsequently...http://www.google.fr/patents/US8681978?utm_source=gb-gplus-shareBrevet US8681978 - Efficient and secure forensic marking in compressed domain
Numéro de publication US8681978 B2
Numéro de demande US 13/717,449
Date de priorité 24 juin 2008
Autre référence de publication US8259938, US8346567, US20090326961, US20120300977, US20130108101
Numéro de publication 13717449, 717449, US 8681978 B2, US 8681978B2, US-B2-8681978, US8681978 B2, US8681978B2
Inventeurs Rade Petriovic, Dai Yang
Citations de brevets (567), Citations hors brevets (103), Référencé par (9), Classifications (7), Événements juridiques (2)
US 8681978 B2
Methods, devices, and computer program products enable the embedding of forensic marks in a host content that is in compressed domain. These and other features are achieved by preprocessing of a host content to provide a plurality of host content versions with different embedded watermarks that are subsequently compressed. A host content may then be efficiently marked with forensic marks in response to a request for such content. The marking process is conducted in compressed domain, thus reducing the computational burden of decompressing and re-compressing the content, and avoiding further perceptual degradation of the host content. In addition, methods, devices and computer program products are disclosed that obstruct differential analysis of such forensically marked content.
selecting a watermark symbol interval for embedding watermark symbols within a host content, wherein the watermark symbol interval spans an integer multiple of compression units of a particular compression algorithm;
obtaining at least a portion of the host content in uncompressed format;
producing a first tributary by embedding a first watermark symbol in at least one watermark symbol interval within the uncompressed host content and compressing at least the embedded portions of the host content thereafter using the particular compression algorithm; and
making the first tributary and at least a second tributary available to one of a content handling device or a computer readable storage medium for production of a marked host content.
2. The method of claim 1, wherein the particular compression algorithm is selected from a group of compression algorithms consisting of: AAC, AACplus, MP3, JPEG, JPEG2000 and MPEG.
3. The method of claim 1, wherein the host content is one of: a still image, a video content or an audio content.
4. The method of claim 1, wherein the watermark symbol interval corresponds to one or more of:
a duration of the host content in uncompressed format;
a spatial extent of the host content in uncompressed format;
a combination of spatial and temporal extent of the host content in uncompressed format; or
an extent of the host content in a frequency domain in uncompressed format.
5. The method of claim 1, wherein the second tributary is an unmarked version of the host content in compressed format.
6. The method of claim 1, wherein at least a portion of the second tributary comprises a second watermark symbol, and the second tributary is produced by embedding the second watermark symbol in the at least one watermark symbol interval within the uncompressed host content and compressing at least the portions of the host content embedded with the second watermark symbol thereafter using the particular compression algorithm.
making a third tributary available to the to one of a content handling device and a computer readable storage medium, wherein at least a portion of the third tributary comprises a third watermark symbol, and the third tributary is produced by embedding the third watermark symbol in the at least one watermark symbol interval within the uncompressed host content and compressing the at least portions of the host content embedded with the third watermark symbol thereafter using the particular compression algorithm.
8. The method of claim 1, wherein corresponding portions of each of the first and at least the second tributary are perceptually similar.
9. The method of claim 1, wherein one or more of the first tributary or the at least the second tributary comprises less than all segments of the host content.
10. A method for producing a marked content, comprising:
accessing, by a marking device, a first and at least a second tributary, the first tributary having been produced by embedding a first watermark symbol within an uncompressed version of the host content in at least a first watermark symbol interval and compressing at least the embedded portions of the host content thereafter according to a particular compression format, the first watermark symbol interval spanning an integer number of compression units of the particular compression algorithm;
selecting at least one segment from each of the first and the at least the second tributary based on a code, wherein each of the selected segments spans an integer number of compression units of the particular compression algorithm;
assembling the selected segments at the marking device, without decompressing the selected segments, to produce a marked content.
11. The method of claim 10, wherein the particular compression algorithm is selected from a group of compression algorithms consisting of: AAC, AACplus, MP3, JPEG, JPEG2000 and MPEG.
12. The method of claim 10, wherein the marked content is one of: a still image, a video content or an audio content.
13. The method of claim 10, wherein the first watermark interval corresponds to one or more of:
14. The method of claim 10, wherein the second tributary is an unmarked version of the host content in compressed format.
15. The method of claim 10, wherein at least a portion of the second tributary comprises a second watermark symbol, the second tributary having been produced by embedding the second watermark symbol in the at least one watermark symbol interval within the uncompressed host content and compressing at least portions of the host content embedded with the second watermark symbol thereafter using the particular compression algorithm.
16. The method of claim 15, comprising accessing a third tributary, wherein at least a portion of the third tributary comprises a third watermark symbol, the third tributary having been produced by embedding the third watermark symbol in the at least one watermark symbol interval within the uncompressed host content and compressing at least portions of the host content embedded with the third watermark symbol thereafter using the particular compression algorithm.
the code comprises a sequence of logical values; and
selecting at least one segment from each of the first and at least the second tributaries comprises selecting a first segment from the first tributary to represent a first logical value within the sequence of logical values and selecting a second segment from the second tributary to represent a second logical value, different from the first logical value, within the sequence of logical values.
18. The method of claim 10, wherein one or more of the first tributary and the at least the second tributary comprises less than all segments of the host content.
an embedder configured to:
select a watermark interval for embedding watermark symbols within a host content, wherein the watermark symbol interval spans an integer multiple of compression units of a particular compression algorithm,
obtain at least a portion of the host content in uncompressed format, and
embed a first watermark symbol in at least one watermark symbol interval within the uncompressed host content;
a compressor configured to compress at least the portions of the host content embedded with the first watermark symbol to produce a first tributary; and
a storage unit configured to store at least a portion of the first tributary and at least a portion of at least a second tributary.
20. The device of claim 19, wherein the compressor is configured to compress the host content using a compression algorithm selected from a group of compression algorithms consisting of: H.264, AAC, AACplus, MP3, JPEG, JPEG2000 and MPEG.
21. The device of claim 19, wherein the host content is one of: a still image, a video content or an audio content.
22. The device of claim 19, wherein the watermark symbol interval corresponds to one or more of:
23. The device of claim 19, wherein the compressor is configured to produce the second tributary by compressing an unmarked version of the host content.
24. The device of claim 19, wherein embedder is configured to embed a second watermark symbol in the at least one watermark symbol interval within the uncompressed host content, and the compressor is configured to compress at least the portions of the host content embedded with the second watermark symbol to produce the second tributary.
25. The device of claim 24, wherein embedder is configured to embed a third watermark symbol in the at least one watermark symbol interval within the uncompressed host content, and the compressor is configured to compress at least the portions of the host content embedded with the third watermark symbol to produce the third tributary.
26. The device of claim 19, wherein one or more of the first tributary or the at least the second tributary comprises less than all segments of the host content.
a multiplexer configured to access a first and at least a second tributary, the first tributary having been produced by embedding a first watermark symbol within an uncompressed version of the host content in at least a first watermark symbol interval and compressing at least the embedded portions of the host content thereafter according to a particular compression format, the first watermark symbol interval spanning an integer number of compression units of the particular compression algorithm; and
a selector configured to select at least one segment from each of the first and at least the second tributaries based on a code, wherein each of the selected segments spans an integer number of compression units of the particular compression algorithm;
the multiplexer further configured to assemble the selected segments, without decompressing the selected segments, to produce a marked content.
28. The device of claim 27, wherein the particular compression algorithm is selected from a group of compression algorithms consisting of: H.264, AAC, AACplus, MP3, JPEG, JPEG2000 and MPEG.
29. The device of claim 27, wherein the marked content is one of: a still image, a video content or an audio content.
30. The device of claim 27, wherein the first watermark interval corresponds to one or more of:
31. The device of claim 27, wherein the second tributary is an unmarked version of the host content in compressed format.
32. The device of claim 27, wherein at least a portion of the second tributary comprises a second watermark symbol, the second tributary having been produced by embedding the second watermark symbol in the at least one watermark symbol interval within the uncompressed host content and compressing at least the portions of the host content embedded with the second watermark symbol thereafter using the particular compression algorithm.
33. The device of claim 32, wherein the multiplexer is configured to access a third tributary, wherein at least a portion of the third tributary comprises a third watermark symbol, the third tributary having been produced by embedding the third watermark symbol in the at least one watermark symbol interval within the uncompressed host content and compressing at least the portions of the host content embedded with the third watermark symbol thereafter using the particular compression algorithm.
34. The device of claim 27, wherein
the selector is configured to select a first segment from the first tributary to represent a first logical value within the sequence of logical values and selecting a second segment from the second tributary to represent a second logical value, different from the first logical value, within the sequence of logical values.
35. The device of claim 27, wherein one or more of the first tributary or the at least the second tributary comprises less than all segments of the host content.
36. A computer program product, embodied on a non-transitory computer readable medium, the computer program product comprising:
computer code for selecting a watermark symbol interval for embedding watermark symbols within a host content, wherein the watermark symbol interval spans an integer multiple of compression units of a particular compression algorithm;
computer code for obtaining at least a portion of the host content in uncompressed format;
computer code for producing a first tributary by embedding a first watermark symbol in at least one watermark symbol interval within the uncompressed host content and compressing at least the embedded portions of the host content thereafter using the particular compression algorithm; and
computer code for making the first tributary and at least a second tributary available to one of a content handling device or a computer readable storage medium.
37. A computer program product, embodied on a non-transitory computer readable medium, the computer program product comprising:
computer code for accessing a first and at least a second tributary, the first tributary having been produced by embedding a first watermark symbol within an uncompressed version of the host content in at least a first watermark symbol interval and compressing at least the embedded portions of the host content thereafter according to a particular compression format, the first watermark symbol interval spanning an integer number of compression units of the particular compression algorithm;
computer code for selecting at least one segment from each of the first and at least the second tributaries based on a code, wherein each of the selected segments spans an integer number of compression units of the particular compression algorithm; and
computer code for assembling the selected segments at the marking device, without decompressing the selected segments, to produce a marked content.
This patent application is a continuation application of and claims priority to U.S. patent application Ser. No. 13/567,792, filed Aug. 6, 2012, which is a continuation of U.S. patent application Ser. No. 12/488,397, filed Jun. 19, 2009, now U.S. Pat. No. 8,259,938, which claims the benefit of priority to U.S. Provisional Patent Application No. 61/075,289 filed on Jun. 24, 2008, which is incorporated herein by reference in its entirety for all purposes.
The present invention generally relates to the field of digital watermarking. More particularly, the present invention relates to efficient and secure embedding and detection of watermarks in a content that is in compressed domain.
Digital watermarks have been proposed and used for copyright protection of signals such as audio, video, and images. An objective of such watermarking systems is to hide an auxiliary signal within a host signal in such a way that it is substantially imperceptible, and at the same time, difficult to remove without damaging the host signal. The auxiliary signal may carry information that is used to carry out copyright protection mechanisms to varying degrees. For example, the auxiliary signal may merely comprise a “no copy allowed” indication that, once detected and interpreted by a compliant copying device, prevents copying of the host signal. Additionally, or alternatively, the embedded auxiliary signal may carry information that identifies one or more of the rightful owner, author, title or serial number of the host signal. The information contained in the auxiliary signal can also be used for other applications, such as to monitor the usage of embedded content, resolve ownership disputes, keep track of royalties, and the like.
Another application related to digital watermarking involves distinguishing different copies of the same host signal by embedding a unique watermark value into individual copies of a host signal. These applications are sometimes referred to as forensic marking (because the unique watermarks may be used to trace the content to an offending party), transaction marking (because the unique watermarks can identify each legitimate transaction), or fingerprinting (because the unique watermarks can identify perceptually similar host signals, much like fingerprints can identify individuals). Once a content is forensically marked, the embedded watermarks may be used to identify the original source (i.e., legitimate purchaser) of a content, and monitor the subsequent spread of that content through piracy channels. For example, a pirate may purchase a music track over the Internet from a legitimate distributor, directly or using a proxy. Then, the pirate may resell or otherwise redistribute the content in an unauthorized fashion. A similar scenario can occur in the distribution of video or other types of content such as still photos, computer graphics, computer games, and the like that may be distributed over the Internet, or in case of video or music, over “pay-per-view” channels in a cable or satellite TV network. Similarly, copyrighted content that is distributed internally within a content production/distribution entity, or to reviewers or critics prior to their public release, may be illegally used or redistributed. In all of the above cases, it is important to identify the offending party and recover and/or prevent further unauthorized dissemination of the content. Often the fact that forensic marks are present in the content is enough to deter such illegal activities.
Efficient design of a forensic marking procedure is often an important consideration of forensic marking systems since the same host signal often needs to be marked many times. On the other hand, efficient detection of embedded marks may not be a critical consideration for forensic marking systems since watermark detection often takes place only when an illicit activity is detected or suspected. This feature of forensic marking systems may be contrasted to copy-control watermarking systems, where the emphasis is typically on providing a simple extraction method that is easily implemented and carried out in consumer devices, while the embedding (or marking) procedure can be more elaborate and computationally expensive.
Efficiency of a forensic marking system is further complicated due to the fact that a host content (e.g., music, image or video), especially a content that is distributed over the Internet, is often stored and distributed in a compressed format (e.g., MP3 format for music files). In a conventional marking system, the forensic marks are typically applied by first decompressing the host content, embedding the appropriate marks, and re-compressing the content prior to distribution or storage. This procedure has several disadvantages. First, since most compression algorithms involve lossy operations, each round of content decompression and re-compression may further degrades the perceptual quality of the host content. Second, decompression, and, particularly, compression operations are computationally expensive. Therefore, it may not be computationally feasible to decompress and re-compress a content in response to each individual purchase request of that content. It is thus advantageous to apply forensic marks without decompressing and re-compressing the host content.
The present invention relates to systems, methods, devices, and computer program products that enable the application of forensic marks to a host content that is in compressed domain. One aspect of the present invention is related to a method for embedding forensic marks in a host content in compressed domain, comprising: receiving metadata associated with a request for the host content, generating a code in accordance with the metadata, selecting a plurality of tributary segments that are in compressed domain in accordance with the code, and assembling the segments to produce a forensically marked host content in compressed domain. In one example embodiment, the metadata comprises information for identifying the request, while in another example embodiment, the information comprises at least one of a transaction identification, intended destination of the forensically marked host content, and time, date, and source of the request.
In accordance with another example embodiment, the transaction metadata and the code are stored in a database. In yet another example embodiment, the plurality of tributaries are generated by a preprocessing module and stored in a storage unit. According to another embodiment, the tributaries comprise one or more versions of the host content, each version having been embedded with a string of unique watermark symbols and compressed thereafter. In a different embodiment, the watermark symbols are embedded contiguously in each of the versions. Still, in a different embodiment, the tributaries comprise an unmarked host content and at least one version of the host content that is embedded with a string of unique watermark symbols.
According to another embodiment, the tributaries comprise compression units, each compression unit having been embedded with a unique string of watermark symbols. In one example embodiment, the compression units span the entirety of the host content with no intervening unmarked segments. In another embodiment, a watermark symbol interval spans an integer multiple number of the compression units, and in a different embodiment, a watermark symbol interval boundary matches the boundary of an integer number of the compression units. According to another embodiment, the compression units correspond to at least one of a time, a space, and a time-and-space domains. In yet another embodiment, watermarking parameters are adjusted in accordance with compression techniques used for compressing the tributaries. In another example embodiment, the host content is an audio content, and the tributaries are produced using at least one of an AAC, AACplus, and MP3 compression techniques. In still a different embodiment, assembling comprises back-to-back concatenation of the segments.
In another embodiment, the host content is an audio content, the tributaries are compressed using a AAC compressor, and the selecting comprises: selecting a first segment from a first tributary in accordance with a first symbol of the code, selecting a second segment in accordance with a second symbol of the code, wherein if the second symbol is the same as the first symbol, selecting the second segment from the first tributary, and if the second symbol is different from the first symbol, selecting the second segment from a second tributary. According to another embodiment, if selecting the second segment from a second tributary creates perceptual artifacts, selecting the second segment from the first tributary.
According to yet another embodiment, the tributaries are distorted to obstruct differential analysis of the forensically marked host content. In one example embodiment, the distortion comprises non-linear amplitude modification of the host content samples, while in another example embodiment, the distortion comprises applying a different random phase offset to samples of each of the plurality of tributaries prior to the selecting. In still another example embodiment, the distortion comprises modifying the Dynamic Range Control (DRC) bits associated with the tributaries that are in AAC format.
Another aspect of the present invention relates to a device for embedding forensic marks in a host content in compressed domain, comprising: a receiving means configured to receive metadata associated with a request for the host content; a code generator configured to generate a code in accordance with the metadata; a selector configured to select a plurality of tributary segments that are in compressed domain in accordance with the code; and an assembly means configured to assemble the segments to produce a forensically marked host content in compressed domain. Yet another aspect of the present invention relates to a computer program product, embodied on a computer readable medium, for embedding forensic marks in a host content in compressed domain, the computer program product comprising: a computer code for receive metadata associated with a request for the host content; a computer code for generating a code in accordance with the metadata; a computer code for selecting a plurality of tributary segments that are in compressed domain in accordance with the code; and a computer code for assembling the segments to produce a forensically marked host content in compressed domain.
FIG. 1 illustrates a block diagram for forensic marking in accordance with an example embodiment of the present invention;
FIG. 2 illustrates the formation of forensically marked content in accordance with an example embodiment of the present invention;
FIG. 3 illustrates a block diagram for preprocessing operations in accordance with an example embodiment of the present invention;
FIG. 4 illustrates a block diagram for marking operations in accordance with an example embodiment of the present invention;
FIG. 5 illustrates a forensically marked content in accordance with an example embodiment of the present invention;
FIG. 6 illustrates example window shapes in Advanced Audio Coding (AAC) compression algorithm;
FIG. 7 illustrates a flow diagram for switch inhibit operation in accordance with an example embodiment of the present invention;
FIG. 8(A) illustrates a non-linear amplitude modifier in accordance with an example embodiment of the present invention; and
FIG. 8(B) illustrates an example characteristic plot of the non-linear amplitude modifier of FIG. 8(A).
The various embodiments of the present invention enable the application of forensic marks to a host content that is in compressed domain. The detection and recovery of such forensic marks from the host content may be carried out using either conventional watermark detection systems (e.g., computationally inexpensive detectors that are implemented in consumer devices) or may be accomplished with more sophisticated forensic detectors with enhanced detection capabilities.
One consideration in designing and applying the forensic marks to a host content is resiliency of the embedded marks against collusion attacks and differential analysis. For example, an attacker may obtain two copies of a host content with different embedded marks, subtract the two copies, analyze the difference signal in order to gain information regarding the watermarking technique, and devise sophisticated attacks to remove or interfere with the embedded watermarks. Furthermore, an attacker may average a number of copies of a host content in order to weaken individual marks within each content, make them interfere, and eventually render them undetectable. An attacker may also cut different segments from different copies of a host content and splice them together to produce a single copy with multiple forensic marks. This type of attack makes it difficult to identify a single source of piracy.
Commonly owned U.S. Pat. No. 6,430,301, entitled “Formation and Analysis of Signals with Common and Transaction Watermarks,” describes a technique that allows the application of forensic marks in compressed domain while providing substantial immunity against collusion attacks. However, the technique disclosed in U.S. Pat. No. 6,430,301 requires the presence of “Common Watermarks” within a host content that are interleaved with “Transaction Watermarks.” The Common Watermark intervals are situated between adjacent symbols of Transaction Watermarks and occupy substantial portions of the host content, however, they do not contain transactional information. The forensic marking techniques described in accordance with the various embodiments of the present invention similarly provide for the embedding of forensic watermarks into a content that is in compressed format but they eliminate the need for Common Watermark intervals, thus improving the density of Transaction Watermark symbols, and efficiency of forensic marking. These and other features of the various embodiments of the present invention are achieved while avoiding perceptual artifacts beyond those inherent to the watermarking technology itself.
Furthermore, while the U.S. Pat. No. 6,430,301 discloses a technique that allows identifying multiple offending parties involved in a collusion attack, it doesn't thwart the threat of a differential analysis attack. Such an attack may reveal information regarding the deployed watermarking technology and may lead to the design of attacks that destroy (e.g., erase or jam) the embedded watermarks. The forensic marking techniques described in accordance with the various embodiments of the present invention have the further advantage of obstructing an attacker's attempts to reverse engineer the deployed watermarking technology, thus thwarting potential differential analysis attack.
FIG. 1 illustrates a block diagram for embedding forensic marks in a host content 41 in accordance with an example embodiment of the present invention. The forensic marking system 10 includes a preprocessing module 12, a marking module 14 and a database 16. The preprocessing stage, which typically comprises computationally expensive operations such as watermark embedding and compression, may be carried out at a different time, and/or at a different location, than the marking stage. The preprocessing module 12 comprises one or more embedder modules 18 to 22 that embed a host signal 41 with a plurality of marks. Each embedder 18 to 22 embeds a distinct string of symbols in the host content 41. For example, a first embedder 18 may embed a first logical value, while a second embedder 20 may embed a second logical value in the host content 41 to produce two different versions of the host content. Note that some symbols may be the same in the different versions of the embedded host content (e.g. headers), and one version of the embedded host content may comprise a first string of symbols, for example, the binary pattern “0101 . . . ” while another may comprise, for example, the binary string “1010 . . . ” It should be noted that while the example embodiment of the present invention as shown in FIG. 1 illustrates separate embedders 18 to 22 that are deployed in parallel for embedding each distinct watermark symbol, a single embedder module may be used to embed all symbols, for example, in a serial fashion. Alternatively, the embedding of the plurality of symbols may be carried out by separate embedders that share one or more components or modules.
It should also be noted that the embedding of the different symbols may, but is not required to, be conducted using the same embedding technology or algorithm. Thus, for example, a first symbol may be embedded using a first watermarking technology while a second symbol may be embedded using a second embedding technology. However, the important restriction is that all watermark symbols use the same symbol interval, and be embedded synchronously within the host content 41. As a result, the outputs of embedders 18 to 22 comprise different versions of a host content, which although perceptually similar, comprise different embedded watermarks. The term “symbol interval” is generically used herein to refer to the extent of a host content that is used to carry an individual watermark symbol. For example, when embedding a one dimensional host content, such as an audio signal, a symbol interval may correspond to the duration of the host content that accommodates the embedding of a watermark symbol. Analogously, when embedding a two dimensional host content, such as a still image, a symbol interval may correspond to the spatial extent of the host content that accommodates the embedding of a watermark symbol. For a multi-dimensional host content, such as a video signal, a symbol interval may comprise a temporal, spatial, or combination of temporal and spatial, extent of the host content that accommodates the embedding of a watermark symbol. Furthermore, a symbol interval may comprise an extent of a host content that can accommodate the embedding of a watermark symbol in a different domain, such as in frequency domain.
Referring back to FIG. 1, after embedding of the host content 41 with a plurality of watermark symbols, the different versions of marked host content are compressed by compressors 24 to 28 using one or more perceptual compression techniques, such as MPEG, JPEG, and the like. The compressed content may then be saved in a storage unit 32 that comprises, for example, one or more hard disks, RAMs, optical disks, flash memory devices, and the like. In addition, the un-marked host content 41 may optionally be compressed in compressor 30, and saved in the storage unit 32, as well. It should be noted that while the example embodiment of the present invention as shown in FIG. 1 illustrates separate compressors 24 to 30 that are deployed in parallel for embedding different versions of the host content, a single compressor 24 may be used for compression the different versions of the host content, for example, in a serial fashion. Alternatively, the different versions of the host content may be compressed using separate compressors that share one or more components or modules. The term “tributary” is used herein to refer to the different versions of the host content that have been compressed and are made available to the marking module 14. It should be noted that while the exemplary embodiment of the present invention as shown in FIG. 1 illustrates a memory unit 32 that is located within the preprocessing module, such memory unit 32 may reside outside of the preprocessing module 12. Furthermore, in an example embodiment of the present invention, the need for a permanent storage unit may be eliminated by saving the tributaries in temporary storage, such as in RAM, or run-time memory. This configuration may be used, for example, for a one-time generation of a number of forensically marked content that are distributed to content reviewers.
In accordance with an example embodiment of the present invention, at the end of the preprocessing stage, at least two distinct versions of the host content that are at least partially overlapping are produced. For example, at the end of the preprocessing stage, the storage unit 32 may contain a complete compressed copy of the unmarked content together with a partial copy of the host content that is marked by a first embedder 18. Alternatively, the storage unit 32 may contain two full copies of the host content, one marked by a first embedder 18, and the other marked by a second embedder 20, but without a compressed version of the unmarked host content. Note that marked and unmarked versions of the host content are perceptually similar, and thus either version, or a composite version that is produced by splicing different segments of each version, may be presented to the user. The particular selection of candidate segments from the plurality tributaries forms the basis of forensic marking in accordance with the various embodiments of the present invention. For example, with only two distinct versions of the host content at the output of the preprocessing stage, the marking module 14 can create a marked content 40 that comprises binary watermark symbols. However, if M distinct tributaries are created by the pre-processing module 12, each comprising a different watermark symbol, the marking module 14 can generate a marked content 40 with M-ary watermark symbols.
The preprocessing operations in accordance with an example embodiment of the present invention is further described in the flow diagram of FIG. 3. In Step 300, a host content is received at the preprocessing module. In Step 302, the received host content is embedded with one or more strings of watermark symbols to create different versions of the embedded host content. Note that some embedded symbols in the different versions of the embedded host content may be the same among different copies, yet the overall string of embedded symbols may be unique for each version. In Step 304, the different versions of the embedded host content, including the unmarked host content, are compressed to form a plurality of tributaries. Finally, in Step 306, the plurality of tributaries are stored in a storage unit that is accessible to the marking module.
Referring back to FIG. 1, the marking module 14 is responsible for creating forensically marked content 40 in compressed domain using relatively inexpensive operations. This task may be accomplished by combining portions of two or more tributaries using a multiplexer (MUX) 34. In one example embodiment, the generation of the forensically marked content 40 may be initiated as a single transaction, for example, upon a user's request to purchase a content, while in a different example embodiment, the marking may be initiated by a batch process that results in the creation of a plurality of uniquely marked content for subsequent distribution. In either example embodiment, the marking request is associated with transaction metadata 38 that describes the details of transaction, such as the intended destination of the marked content, time, date and source of the request, or other information that uniquely identifies the transaction. Each request for the creation of a marked content 40 may trigger the generation of a unique code in Code Generator 36. This code that is ultimately embedded in the marked content 40, is also saved in database 16, along with the associated transaction metadata 38. The database 16 may later be used to link the codes that are extracted from a marked content to the transaction that caused the creation of that particular content. It should be noted that the marked content may alternatively, or additionally, be viewed and/or transmitted to a remote location for viewing. For example, the marked content may be viewed in real time subsequent to, or during, the forensic marking process. The forensically marked content may also be saved on different kinds of computer readable media, including, but not limited to, DVDs, CDs, Flash memory devices and the like.
The code generated by the code generator 36 controls the operation of the MUX 34, and governs the selection of content segments from different tributaries. It should be noted that the MUX 34 has access to some or all of the tributaries. As such, the MUX may select the appropriate tributaries from the available tributaries. Alternatively, or additionally, the MUX may request and receive the desired tributaries, or portions thereof, from one or more entities that have access to and/or contain the tributaries. Further, the MUX 34 may comprise various components and subcomponents that allow the selection, retrieval, and assembly of a plurality of content segments. For example, the MUX may be equipped with a processor, memory, and communication ports that allow the implementation and execution of the various data manipulations, as well as data and command input/output operations. To this end, the MUX 34 may be implemented as software, hardware, firmware or combinations thereof. The operation of the MUX 34 may be further illustrated using an example embodiment of the present invention depicted in FIG. 2, in which two one-dimensional tributaries are available for marking a host content using binary watermark symbols. In the example embodiment of FIG. 2, a first tributary 42 may correspond to a compressed version of a host content that is embedded repeatedly and consecutively with all-zero watermark symbols, and a second tributary 44 may correspond to a compressed version of a host content that is embedded repeatedly and consecutively with all-one watermark symbols. Generally, perceptual compression algorithms, such as MPEG or JPEG, divide the host content into compression units or frames, where each compression unit is independently processed and stored. The compression units 48-1, 48-2, . . . , 48-K corresponding to the first tributary 42, and the compression units 50-1, 50-2, . . . , 50-K corresponding to the second tributary 44 are illustrated in FIG. 2. Once a transaction request is initiated, the code generator 36 generates a unique transaction code in accordance with the transaction metadata 38 associated with the transaction request. For example, the code generator 36 may generate a binary code “00101” associated with a particular request. The MUX 34 then selects the appropriate compression units from tributaries according to the code provided by the code generator 36, and assembles the marked content 40 as concatenations of the various segments of the two tributaries. This technique is often referred to as a cut-and-splice procedure.
The cut-and-splice procedure for forming the forensically marked content 40 corresponding to the exemplary binary code “00101” involves selecting the first compression unit 48-1 from the first tributary 42, the second compression unit 48-2 from the first tributary 42, the third compression unit 50-3 from the second tributary 44, the fourth compression unit 48-4 from the first tributary, and the fifth compression unit 50-5 from the second tributary 44. The forensically marked content 40 may be produced by back-to-back concatenation of the above noted compression units.
Note that each compression unit should contain information that can be independently interpreted by the matching perceptual decoder to reconstruct the host content. Moreover, the length of the watermark symbol interval should be equal to the length of one or more compression units. That is, a watermark symbol interval may span an integer multiple number of compression units. Additionally, a symbol boundary may substantially match the boundary of a compression unit (or an integer number of compression units). For instance, the example embodiment of FIG. 2 illustrates the case where the bit interval matches the length of one compression unit. Although the above example embodiment have been described using a binary watermarking alphabet, those skilled in the art can readily generalize this procedure to deliver M tributaries to the marking module 14, generate M-ary codes using the code generator 36, and assemble a forensically marked content with M-ary symbols using the MUX.
In accordance with another example embodiment, only portions of the content may be marked using the above described cut-and-splice technique. In such an example embodiment, the forensically marked content may comprise unmarked sections that are selected from the unmarked tributary (i.e., the output of compressor 30). The unmarked segments of the content may be used, for example, to embed another forensic mark at a different node within the sales/distribution chain of the content.
FIG. 4 illustrates the marking operations in accordance with an example embodiment of the present invention. Once a request for a particular host content is submitted, the transaction metadata associated with that request is received by the marking module in Step 400. In Step 402, a unique code associated with the received transaction metadata is generated, and in Step 404, this code, along with the appropriate transaction metadata is stored in one or more databases. In Step 406, segments of different tributaries associated with the requested host content are selected in accordance with the generated code. In Step 408, the marked content is generated by back-to-back concatenation of the tributary segments in accordance with the particular order that corresponds to the generated code.
The above-described cut-and-splice procedure may be adapted to operate with different perceptual compression technologies that utilize compression units of different size. This approach requires more flexibility in selecting and designing the particular parameters associated with watermark embedding technologies. For example, different watermark symbol intervals may need to be selected for Advanced Audio Coding (AAC) audio compression as opposed to MPEG audio compression algorithm. However, this is not a significant restriction since the list of candidate compression technologies is finite. Thus, a set of watermarking parameters that are suitable for use with the most commonly used (or even with an exhaustive list of) compression technologies can be created. Once a compression technology for compression of the host content is selected, the marking of different symbols at the preprocessing stage can be readily conducted in accordance with the watermarking parameters that are suited for that particular compression technology. The extraction of the embedded forensic marks can be similarly conducted using the above-noted list of watermarking parameters. If the content is still in compressed format (or the compression technology is otherwise known), the appropriate watermark parameters associated with that compression technology can be retrieved and used for extracting the embedded watermarks. If the content is not in compressed format (and the compression technology is not otherwise known), watermark extraction may be conducted by selecting candidate watermark parameters, one at a time, in multiple attempts to extract the embedded forensic marks. However, since the code extraction is likely to be conducted in a forensic environment, watermark parameters for a particular content is likely to be known prior to the extraction process (e.g., stored in a database along with transaction metadata). For example, a music track that is released by a certain music studio is likely to be released in only one or two different compressed formats. Accordingly, when such a music track is discovered in a piracy network, watermark parameters associated with one or two candidate compression technologies are merely needed to successfully extract the embedded watermarks.
By the way of example, and not by limitation, the following provides an detailed example of how watermarking parameters may be adjusted for use with a particular perceptual compression technology. In accordance with this example embodiment, audio watermarking parameters are tailored to be used with AAC compression technology. In AAC, as in most other audio compression technologies, time domain audio samples are first transformed to frequency domain samples. The transformation used in AAC is Modified Discrete Cosine Transform (MDCT) with 50% windowed overlap. The compressed bitstream contains all information needed to reconstruct the spectrum. Frequency domain values in each bitstream unit are independent from those of other units. Note that, with AAC, this occurs when the inter-frame prediction is disabled (prediction can be inter-frame or intra-frame, i.e., between adjacent frames or within one frame). In order to reconstruct the time domain audio samples, an Inverse Modified Discrete Cosine Transform (IMDCT) is performed with 50% windowed overlap. Details of AAC compression and decompression algorithms may be found in various references, for example, in “Dai Tracy Yang, Chris Kyriakakis, and C.-C. Jay Kuo, “High Fidelity Multichannel Audio Coding”, EURASIP book series on Signal Processing and Communications, 2004.” FIG. 5 illustrates an example string of overlapping windows 60 for compression units with matching watermarking bits.
Note that in the example embodiment of FIG. 5, two compression units (or frames) are used for embedding one watermark bit. More specifically, in AAC compression, each frame comprises exactly 2048 samples converted into MDCT domain, but in accordance with an example embodiment of the present invention, the start of each frame is shifted by 1024 samples in order to create a 50% overlap. Each frame is 2048 samples, but with 50% overlap, the next frame starts 1024 samples after the start of the current frame. By having a bit interval with 2048 samples, each watermark bit may be selected to span two consecutive frames of a tributary. This way, the middle 1024 samples, where the two frames overlap, carry the undisturbed watermark symbol. On each side, of the undisturbed portion, there are 1024-sample tails that transition into the adjacent bit intervals. Due to the window shape, the watermark bit is dominant in half of the tail on each side of the 1024-sample undisturbed portion, making each bit interval 1024+2*512=2048 samples long. Using this technique, up to 1024 samples of each bit interval may produce interference with the adjacent bit intervals if the adjacent bits are selected from different tributaries. However, if adjacent bits are selected from the same tributary as the current bit tributary, the overlapping bit segments do not produce any interference. In the example case where an audio sampling rate of 44.1 kHz is used, the watermarking bit rate of the forensic mark is 44100/2048=21.533 bits per second.
Referring back to FIG. 1, the MUX 34 selects the appropriate frames from the tributaries in accordance with the code generated by the code generator 36. Transition from one tributary to another takes place when there is a transition in the generated code from one symbol to another. This transition does not produce noticeable artifacts as long as the tributaries are perceptually similar, and the window shapes associated with the compression technologies of all tributaries are substantially similar to each other. However, if the window shapes are appreciably different, it is possible to create perceptible artifacts at symbol transition points within the marked content.
In accordance with another example embodiment of the present invention, these perceptible artifacts may be avoided even if the window shapes are not the same. FIG. 6 illustrates the various window shapes that are utilized in the AAC compression algorithm. The top portion of FIG. 6 contains a sequence of the so-called long windows 80. The long windows 80 provide good audio quality for slowly changing audio signals, such as tonal music. However, in the presence of fast changing audio signals, such as a percussion attack, the long windows 80 may introduce undesirable effects of a pre-echo in the audio signal. In this case, a better audio quality is achieved by using the so-called short windows 84-1 to 84-8 that are shown in FIG. 6. The AAC compressor is capable of automatically detecting audio attacks and changing the window shape from long to short, as needed, to provide the desirable audio quality. Note that one compression unit (or frame) carries data that is associated with one long window, or eight short windows. In order to smooth the transition points from a long to a short window, and from a short to a long window, and to avoid audible artifacts, the AAC algorithm introduces two additional windows: a long-start window 82, and a long-stop window 86, as also illustrated in FIG. 6. In AAC, the criterion for design of the transition window is that the squared sum of the first half of the window and the second half of the window should equal to one. Therefore, if a short window is required after several long windows, then the last window before the start of the short window should be a long start window. Similarly, when short window is followed by a long window, the first window after the short window should be a long stop window.
When AAC audio compression is used to carry out forensic marking according to the various embodiments of the present invention, the transition points from one tributary to another may trigger the selection of a different window type. Typically different tributaries that are created in accordance with the various embodiments of the present invention are perceptually similar. Therefore, the AAC window selection mechanism is likely to detect audio attacks (and switch to short windows) at the same locations within the compression frames of all tributaries. However, occasionally the AAC compressor may select different window types for different tributaries. This disparity of window selection between the different tributaries may create audible artifacts in the forensically marked content. For example, the transition from a tributary frame with a long window to another tributary with a short window, without the intermediate long-start window, may create an audible artifact in the output audio stream since such transition violates the window transition criterion discussed above. One example scenario may involve the case where the percussion attack in the second tributary is detected slightly earlier than in the first tributary, and as a result the position of the short windows are shifted by one frame. So, for example, the first tributary may comprise the following sequence of windows: long, long-start, short, long-stop, while the second tributary may comprise the following sequence: long-start, short, long-stop, long. If now the embedding of the forensic marks necessitates a transition from the first tributary to a second tributary between the first and the second unit of the sequence of windows, the resulting window sequence will be long, short, long-stop, long, which can potentially produce an audio artifact in the middle of the window sequence.
In order to avoid such perceptible artifacts, the MUX 34 of FIG. 1, in accordance with an example embodiment of the present invention, may be configured to receive information regarding the various window shapes that are employed in frames of different tributaries, whenever a switch between different tributaries is mandated by the generated code. In this example embodiment, if the MUX 34 detects a window mismatch between the tributary frames, switching to the new tributary may be inhibited by asserting a “switch abandon” action. The switch abandon, when asserted, effectively introduces a symbol error in the embedded forensic marks that are embedded in the host content. FIG. 7 illustrates a block diagram of the different steps involved in determination of a switch abandon assertion. The process starts in Step 700 of FIG. 7 when a transition in the generated forensic mark code value is detected. In Step 702, information regarding the window utilized by the compressor for at least the tributary corresponding to the new symbol value is retrieved. The window information, such as window shape information, is compared to the window information corresponding to the currently used tributary in Step 704. If the window information is the same, switching to the tributary that corresponds to the new symbol value is permitted in Step 708. If the window information is not the same, it is determined, in Step 706, whether or not switching to a different tributary results in perceptible artifacts. For example, if the switching occurs from one tributary having long and long windows, to another tributary with long and long-start windows, there is no need to hold switching, since at the transition moment, long and long-start windows have the same tails. Furthermore, if the transition region coincides with a “silent” portion of the audio content, switching to a different tributary with a different window shape may not produce perceptible artifacts. When no perceptible artifacts are produced, switching to a different tributary is permitted in Step 708. If switching produces perceptible artifacts, the switching may be abandoned in Step 710. As a result of Step 710, the use of the current tributary persists until switching to a new tributary is initiated by another transition in the code value.
According to the experimental results conducted for audio signals, bit errors introduced as a result of abandon switch assertions are fairly rare, and can be corrected by error correction codes that are normally used in the formation of watermark bit streams. Alternatively, or additionally, bit error locations due to switch abandon assertions can be saved in a database that is accessible to the forensic mark extractor. This information can be used during the extraction process to identify and correct these bit errors.
The abandon switch may be asserted whenever the concatenation of content segments from different tributaries is likely to create perceptible artifacts. As such, the abandon switch may be asserted not only when window shapes differ (e.g., a mismatch between long and short windows), but also when different types of windows are used. For example, an abandon switch action may be asserted when one tributary is using a Kaiser-Bessel Derived (KBD) window, while the other tributary is using a Sine window. Experimental results on audio signals have confirmed that the number of switch abandon instances depend strongly on the type of perceptual compressor and the operation mode selection used in a particular application. Note that AAC compressor may allow the use of a mixture of KBD and Sine window types, or the use Sine windows only. Since some perceptual compressors do not use Kaiser-Bessel Derived windows at all, the mismatch with Sine window is avoided altogether when such compressors are utilized. Accordingly, if there is some flexibility in selecting a perceptual compressor, it may be advantageous to test multiple compressor candidates to determine which compressor is likely to produce the minimum number, and density, of switch abandon events.
In the case of a multi-channel content (such as a multi-channel audio content), each channel may be embedded independently, but synchronously, with the same forensic mark. However, in such cases, it may be possible that abandon switch action is asserted in some, but not all, of the channels. This is an undesirable situation since it may lead to the embedding of different symbols in different channels, which may cause audio artifacts. For example, such a mismatch in the embedding of the left and right channels of a stereo signal may cause a shift in space of the sound source, which may or may not result in a significant audio artifact. Furthermore, if an attacker attempts to use a channel mixdown attack (i.e., when two or more channels are mixed into a single channel) to weaken or remove the embedded watermarks, the differing symbols embedded in the corresponding locations of the different channels are likely to interfere with each other. Therefore, in accordance with an example embodiment of the present invention, the assertion of an abandon switch action in one channel may automatically trigger an abandon switch assertion in all other channels at the same content location. Additionally, or alternatively, many perceptual compressors may be configurable to use the same set of compression parameters, such as window shapes, for all channels. By selecting this configuration option, the number and density of abandon switch activations may be further reduced.
The procedures described above in connection with AAC compression algorithm can be readily applicable to other compression techniques. For example, MPEG-1, 2 and 4 audio compression techniques all use a similar frame structure. In particular, while the frame size of AAC compression is 1024 samples, AACplus frames contain 2048 samples, and MP3 frames contain 1152 samples. Many popular speech codecs, such as CELP, EVRC, AMR, and the like, also use a frame-based compression architecture (e.g., the general frame size is 20 ms), and therefore can be readily adapted for forensic marking in accordance with the various embodiments of the present invention. Typical image and video compression techniques are also similarly designed in accordance with fixed block-size architectures. For example, JPEG compression technique is based on 8×8 DCT transform blocks, which may be treated as one compression unit. JPEG2000 uses wavelet transforms, which are not block based in time domain However, it is still possible to carryout similar cut-and-splice operations in a compressed transformed domain to apply the forensic marks in accordance with the various embodiments of the present invention to JPEG2000 content. Forensic marking techniques in accordance with the various embodiments of the present invention may also be readily adapted for use with video compression techniques. For example, in MPEG compression algorithm, a video stream is comprised of three different Intra-coded (I), Bi-directional (B), and Predicted (P) frames. P and B frames are predicted from other frames. But I frames are independently compressed and decompressed, and thus can be treated as independent units (or as a still image with multiple independent units) for the purposes of forensic marking in accordance with the various embodiments of the present invention.
Differential Analysis Obstruction
An attacker may attempt to defeat a forensic watermarking system by obtaining two or more copies of the same content marked by distinct forensic marks. By subtracting one copy from the other, the attacker may find content locations that carry different forensic symbols, and obtain the difference between the embedded symbols. By analyzing this difference signal, an attacker may be able to reverse engineer the watermarking technology and find the secret information (i.e., the stego key) used for embedding the forensic marks. Using this information, the attacker may be able to further devise attacks to remove, jam, or even forge the embedded watermarks. In accordance with example embodiments of the present invention, differential analysis attacks on forensically marked content may be thwarted. The disclosed methods may be used separately, or in combination with each other, to obstruct the differential analysis of forensically marked contents.
In accordance with one example embodiment, one or more signal distortions may be introduced in different tributaries during the preprocessing stage. These distortions, which do not convey any watermark information, must be different in each tributary, and at the same time, must be perceptually insignificant. The introduced distortions effectively mask the presence of the embedded watermarks. An attacker is then faced with the challenge of distinguishing between the components of the difference signal that are truly related to the watermark technology and those that are merely due to the introduced distortion. By the way of example, and not by limitation, non-linear amplitude modification of the content is one such distortion that may be introduced as part of each embedder 18 to 22 functionality in FIG. 1. This distortion may be applied, for example, to each version of the host content, either before or after embedding of the symbol values. This technique produces different distortions in each tributary but has insignificant impact on the embedded host quality.
FIG. 8(A) shows an example embodiment of the present invention illustrating the application of nonlinear amplitude modification to input samples of a host content. In FIG. 8(A), each input sample 92 of a host content is modified by the non-linear amplitude modifier 90 to produce an output sample 94. FIG. 8(B) illustrates an example plot in the form of an input—output sample characteristic deviating from a straight line that is associated with the non-linear modifier 90 of FIG. 8(A). The straight line 96 is produced when the input and output samples are equal. When non-linear amplitude modification is applied, the output samples deviate from the input samples as illustrated by the characteristic (curved) line 98 of FIG. 8(B). In order to thwart differential analysis of the embedded content, a different characteristic line must be produced for each version of the host content that is subjected to non-linear amplitude modification. However, it is also desirable to make the variations due to non-linear amplitude modification to change slowly and randomly with time to make reverse engineering of the applied distortion more difficult.
Another candidate distortion for thwarting differential analysis is the introduction of random phase offsets into the host content that is disclosed in the commonly owned U.S. Pat. No. 6,145,081. This distortion may be applied independently to each version of the host content as part of the embedder 18 to 22 functionality. Similar to the above-described non-linear amplitude modification, the introduction of random phase offsets does not produce perceptible artifacts but creates a large difference between the different versions of the host content. This large difference obstructs differential analysis of the content that may be conducted by an attacker to gain insights into the watermarking technology. Note that the technique disclosed in U.S. Pat. No. 6,145,081 introduces a different phase offset into each copy (not tributary) of the fully embedded host content, with the objective to produce annoying artifacts when averaging or splicing attacks are used. In accordance with the example embodiments of the present invention, however, each tributary is subjected to a random phase offset. Accordingly, a forensically marked content may comprise a plurality of sections, where each section has undergone a different random phase modification. Therefore, an attacker is faced with the challenge of defeating a plurality of phase offset distortions.
In accordance with another embodiment of the present invention, differential attack obstruction may be effected by using two or more distinct watermarking technologies for embedding the same symbol in the same compression unit(s). This way, an attacker is further frustrated by facing the challenge of determining which of the plurality of features of the difference signal is associated with a particular embedding technology.
In accordance with another embodiment of the present invention, differential analysis obstruction through the introduction of host signal variations may be implemented at the marking stage, after the multiplexing. In devising different techniques to obscure differential analysis of embedded content, the objective is to increase the difference between distinct copies of the marked content by manipulating parameters of compressed domain stream differently for each copy. In accordance with another example embodiment of the present invention, this task may be accomplished in an AAC compressor by introducing small, random amplitude modifications using AAC Fill elements, without introducing noticeable audio artifacts. This process doesn't require decompression of the host content, and thus is computationally inexpensive. At the same time, it effectively masks the watermark features that may be otherwise detectable in the difference signal. Furthermore, the random nature of modifications makes it difficult to reverse engineer the obstruction methodology.
In one example embodiment, changing the Dynamic Range Control (DRC) in the Fill element of a compressed AAC bitstream may effect masking of the watermark symbols. Note that DRC is part of the regular bitstream for each frame and is used by the AAC decompressor to produce de-compressed audio samples with a proper dynamic range. With DRC bits enabled, the final decompressed audio content is produced according to Equation (1):
sound_data′=sound_data*Δ (1)
where sound_data′ represents the decompressed audio samples after applying DRC, sound_data represents the decompressed audio samples before applying DRC, and Δ is a factor (i.e., a number) that is calculated from the DRC bits in order to produce decompressed audio samples with a proper dynamic range. A detailed description of the various DRC data elements may be found, for example, in “International Organisation For Standardisation Organisation Internationale De Normalisation ISO/IEC JTC1/SC29/WG11 Coding Of Moving Pictures And Audio, MPEG-4 Audio.” Note that the absence of DRC bits in the bitstream (i.e., the DRC signaling bit is 0) may be treated as having a Δ value of 1. The value of Δ can be changed from one compression frame to another, or even from one sub-frame to another sub-frame, depending on the bit information in the DRC bitstream. The higher the number of the sub-frames, the more bits are inserted in the DRC portion of the bitstream. In accordance with an example embodiment of the present invention, in order to obstruct differential analysis of a decompressed content, the value of Δ associated with each tributary may be varied from its original value by a small amount in order to effect random amplitude modifications in the decompressed audio samples. Since Δ is calculated from the DRC bits of the compressed bitstream, by changing and/or inserting a few bits into the DRC portion of each compressed tributary, the final value of the decompressed audio samples may be changed. Since a compressed AAC tributary may not have any DRC bits (i.e., DRC signaling bit is 0), DRC bits may be added to the compressed bitstream in accordance with another example embodiment of the present invention. For example, at least 39 bits per frame may be added to a compressed AAC bitstream to allow the extraction of a Δ value from the compressed bit stream (while setting the DRC signaling bit to 1). Note that the addition of such additional bits (e.g., 39 bits) only amounts to about one percent increase in the total number of bits in a frame. If the DRC bits are already present in the bitstream, the modification of these bits to produce a different Δ value, in accordance to the example embodiments of the present invention, may or may not result in an increase in the total number of bits per frame. Any increase, however, is likely to be very small.
It is understood that the various embodiments of the present invention may be implemented individually, or collectively, in devices comprised of various hardware and/or software modules and components. These devices, for example, may comprise a processor, a memory unit, an interface that are communicatively connected to each other, and may range from desktop and/or laptop computers, to consumer electronic devices such as media players, mobile devices and the like. For example, referring back to FIG. 1, the Preprocessing and Marking modules may be implemented in software, hardware, firmware, or combinations thereof. Similarly, the various components or sub-components within each module may be implemented in software, hardware, firmware. The connectivity between the modules and/or components within the modules may be provided using any one of the connectivity methods and media that is known in the art, including, but not limited to, communications over the Internet, wired, or wireless networks using the appropriate protocols.
Various embodiments described herein are described in the general context of methods or processes, which may be implemented in one embodiment by a computer program product, embodied in a computer-readable medium, including computer-executable instructions, such as program code, executed by computers in networked environments. A computer-readable medium may include removable and non-removable storage devices including, but not limited to, Read Only Memory (ROM), Random Access Memory (RAM), compact discs (CDs), digital versatile discs (DVD), etc. Generally, program modules may include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Computer-executable instructions, associated data structures, and program modules represent examples of program code for executing steps of the methods disclosed herein. The particular sequence of such executable instructions or associated data structures represents examples of corresponding acts for implementing the functions described in such steps or processes.
US3842196 12 nov. 1973 15 oct. 1974 Hazeltine Research Inc System for transmission of auxiliary information in a video spectrum
US3973206 22 mai 1975 3 août 1976 A. C. Nielsen Company Monitoring system for voltage tunable receivers and converters utilizing an analog function generator
US4048562 22 mai 1975 13 sept. 1977 A. C. Nielsen Company Monitoring system for voltage tunable receivers and converters utilizing voltage comparison techniques
US4176379 17 oct. 1977 27 nov. 1979 Xerox Corporation Video input circuits for video hard copy controller
US4199788 23 mai 1978 22 avr. 1980 Sony Corporation Video special effects generator
US4281217 12 mars 1979 28 juil. 1981 Dolby Ray Milton Apparatus and method for the identification of specially encoded FM stereophonic broadcasts
US4295128 26 mars 1979 13 oct. 1981 University Of Tennessee Research Corp. Apparatus for measuring the degradation of a sensor time constant
US4425578 12 janv. 1981 10 janv. 1984 A. C. Nielsen Company Monitoring system and method utilizing signal injection for determining channel reception of video receivers
US4464656 28 août 1981 7 août 1984 Takeda Riken Kogyo Kabushiki Kaisha Waveform display apparatus
US4564862 9 août 1982 14 janv. 1986 Edwin Cohen Ghost signal elimination circuit
US4669089 30 sept. 1985 26 mai 1987 The Boeing Company Suppressed clock pulse-duration modulator for direct sequence spread spectrum transmission systems
US4686707 29 mai 1985 11 août 1987 Pioneer Electronic Corporation Program identifier signal receiver
US4706282 23 déc. 1985 10 nov. 1987 Minnesota Mining And Manufacturing Company Decoder for a recorder-decoder system
US4723302 5 août 1986 2 févr. 1988 A. C. Nielsen Company Method and apparatus for determining channel reception of a receiver
US4729398 20 janv. 1987 8 mars 1988 Bellofram Corp. Current-to-pressure transducers
US4755884 13 janv. 1986 5 juil. 1988 Discovision Associates Audio evaluation of information stored on a record medium under control of video picture frame number
US4764608 10 juil. 1987 16 août 1988 Kyorin Pharmaceutical Co., Ltd. Process for the manufacture of spiro-linked pyrrolidine-2,5-dione derivatives
US4764808 5 mai 1987 16 août 1988 A. C. Nielsen Company Monitoring system and method for determining channel reception of video receivers
US4807013 8 avr. 1987 21 févr. 1989 American Telephone And Telegraph Company At&T Bell Laboratories Polysilicon fillet
US4876736 23 sept. 1987 24 oct. 1989 A. C. Nielsen Company Method and apparatus for determining channel reception of a receiver
US5080479 30 juil. 1990 14 janv. 1992 Rosenberg Stanley L Automatic implanting of identification data in any recorded medium
US5161251 29 juil. 1991 3 nov. 1992 Mankovitz Roy J Apparatus and methods for providing text information identifying audio program selections
US5210831 30 oct. 1989 11 mai 1993 International Business Machines Corporation Methods and apparatus for insulating a branch prediction mechanism from data dependent branch table updates that result from variable test operand locations
US5251041 21 juin 1991 5 oct. 1993 Young Philip L Method and apparatus for modifying a video signal to inhibit unauthorized videotape recording and subsequent reproduction thereof
US5294962 5 nov. 1992 15 mars 1994 Casio Electronics Manufacturing Co., Ltd. Contact-type electroconductive brush for electrically charging an image carrier of an image forming apparatus
US5351304 22 déc. 1993 27 sept. 1994 Yozan, Inc. Fingerprint data registration method
US5402488 30 août 1991 28 mars 1995 Karlock; James A. Method and apparatus for modifying a video signal
US5414729 29 nov. 1993 9 mai 1995 Novatel Communications Ltd. Pseudorandom noise ranging receiver which compensates for multipath distortion by making use of multiple correlator time delay spacing
US5432799 19 mai 1993 11 juil. 1995 Sony Corporation Modulating method
US5452901 29 juin 1994 26 sept. 1995 Kabushiki Kaisha B-Ai Remote controllable toy
US5497372 8 mars 1994 5 mars 1996 Sanyo Electric Co., Ltd. FM multiplex broadcasting and receiving system
US5519454 21 avr. 1995 21 mai 1996 Thomson Consumer Electronics, Inc. Luma/chroma separation filter with common delay element for comb filter separation and recursive noise reduction of composite video input signal
US5537484 20 avr. 1995 16 juil. 1996 Nippon Telegraph And Telephone Corporation Method and apparatus for image processing
US5805635 17 mars 1964 8 sept. 1998 The United States Of America As Represented By The Secretary Of The Navy Secure communication system
US5809064 2 août 1996 15 sept. 1998 Novatel, Inc. Pseudorandom noise ranging receiver which compensates for multipath distortion by dynamically adjusting the time delay spacing between early and late correlators
US5940124 18 juil. 1997 17 août 1999 Tektronix, Inc. Attentional maps in objective measurement of video quality degradation
US5940429 25 févr. 1997 17 août 1999 Solana Technology Development Corporation Cross-term compensation power adjustment of embedded auxiliary data in a primary data signal
US5945932 30 oct. 1997 31 août 1999 Audiotrack Corporation Technique for embedding a code in an audio signal and for detecting the embedded code
US6035171 4 févr. 1999 7 mars 2000 Sharp Kabushiki Kaisha Developing apparatus having means for removing electric charge of toner
US6067440 12 juin 1997 23 mai 2000 Diefes; Gunther Cable services security system
US6101310 5 sept. 1996 8 août 2000 Sony Corporation Apparatus for reading and writing information from and to a time code track in a recording medium
US6128597 17 juin 1998 3 oct. 2000 Lsi Logic Corporation Audio decoder with a reconfigurable downmixing/windowing pipeline and method therefor
US6160986 19 mai 1998 12 déc. 2000 Creator Ltd Interactive toy
US6173271 26 nov. 1997 9 janv. 2001 California Institute Of Technology Television advertising automated billing system
US6209094 14 oct. 1998 27 mars 2001 Liquid Audio Inc. Robust watermark method and apparatus for digital signals
US6246775 14 sept. 1998 12 juin 2001 Pioneer Electronic Corporation Method and appartus for superposing a digital watermark and method and apparatus for detecting a digital watermark
US6246802 31 oct. 1997 12 juin 2001 Nec Corporation Image data processor
US6249870 24 déc. 1997 19 juin 2001 International Business Machines Corporation Data hiding method and data extraction method using statistical examination
US6268866 18 juin 1998 31 juil. 2001 Nec Corporation Digital watermarking system for making a digital watermark with few colors of input image
US6282299 27 août 1997 28 août 2001 Regents Of The University Of Minnesota Method and apparatus for video watermarking using perceptual masks
US6373974 30 sept. 1998 16 avr. 2002 Sharp Laboratories Of America, Inc. Method for extracting multiresolution watermark images to determine rightful ownership
US6385330 28 août 2001 7 mai 2002 Digimarc Corporation Method for encoding auxiliary data within a source signal
US6404781 1 sept. 1998 11 juin 2002 Hitachi, Ltd. Data transmission method for embedded data, data transmitting and reproducing apparatuses and information recording medium therefor
US6415040 20 mai 1998 2 juil. 2002 Koninklijke Philips Electronics N.V. Device for optically scanning a record carrier
US6424726 17 juil. 2001 23 juil. 2002 Nec Corporation Image data encoding system and image inputting apparatus
US6473560 18 mars 1999 29 oct. 2002 U.S. Philips Corporation Copy protection schemes for copy protected digital material
US6510233 3 mai 1999 21 janv. 2003 Nec Corporation Electronic watermark insertion device
US6510234 12 mai 1999 21 janv. 2003 Signafy, Inc. Method for increasing the functionality of a media player/recorder device
US6529506 8 oct. 1999 4 mars 2003 Matsushita Electric Industrial Co., Ltd. Data processing apparatus and data recording media
US6553127 18 nov. 1998 22 avr. 2003 Macrovision Corporation Method and apparatus for selective block processing
US6570996 2 sept. 1998 27 mai 2003 Koninklijke Philips Electronics N.V. Watermarking an informational signal
US6571144 20 oct. 1999 27 mai 2003 Intel Corporation System for providing a digital watermark in an audio signal
US6584138 24 janv. 1997 24 juin 2003 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Coding process for inserting an inaudible data signal into an audio signal, decoding process, coder and decoder
US6592516 9 oct. 2001 15 juil. 2003 Ching-Chuan Lee Interactive control system of a sexual delight appliance
US6633653 4 févr. 2000 14 oct. 2003 Motorola, Inc. Watermarked digital images
US6654501 6 mars 2000 25 nov. 2003 Intel Corporation Method of integrating a watermark into an image
US6665419 10 janv. 2000 16 déc. 2003 Nec Corporation Digital watermark inserting system and digital watermark characteristic parameter table generating method
US6671388 25 sept. 2000 30 déc. 2003 Koninklijke Philips Electronics N.V. Method and apparatus for detecting a watermark in a manipulated image
US6674861 27 janv. 1999 6 janv. 2004 Kent Ridge Digital Labs Digital audio watermarking using content-adaptive, multiple echo hopping
US6704431 31 août 1999 9 mars 2004 Nippon Telegraph And Telephone Corporation Method and apparatus for digital watermarking
US6707926 31 mars 2000 16 mars 2004 Intel Corporation Template for watermark decoder synchronization
US6757908 28 mai 1999 29 juin 2004 3Com Corporation Graphical representation of impairment or other conditions in a data-over-cable system
US6768807 23 mars 2000 27 juil. 2004 Kabushiki Kaisha Toshiba Digital watermark embedding device, digital watermark detection device, digital information distribution device, and, storage medium
US6785399 27 avr. 1999 31 août 2004 Nec Corporation Receiving apparatus, transmitting apparatus, and communication system which utilize a watermark insertion technique
US6785401 9 avr. 2001 31 août 2004 Tektronix, Inc. Temporal synchronization of video watermark decoding
US6798893 18 août 2000 28 sept. 2004 Nec Corporation Digital watermarking technique
US6834344 17 sept. 1999 21 déc. 2004 International Business Machines Corporation Semi-fragile watermarks
US6856693 9 oct. 2001 15 févr. 2005 Nec Laboratories America, Inc. Watermarking with cone-forest detection regions
US6880082 15 mai 2001 12 avr. 2005 Nec Corporation Broadcast verification system, broadcast verification method, broadcast verification apparatus and storage medium storing broadcast verification program
US6891958 27 févr. 2001 10 mai 2005 Microsoft Corporation Asymmetric spread-spectrum watermarking systems and methods of use
US6912010 15 avr. 2002 28 juin 2005 Tektronix, Inc. Automated lip sync error correction
US6915002 14 juil. 2003 5 juil. 2005 Digimarc Corporation Multi-carrier watermarks using carrier signals modulated with auxiliary messages
US6915422 22 juin 2000 5 juil. 2005 Namco Ltd. Personal identification system
US6944313 7 juil. 1999 13 sept. 2005 Canon Kabushiki Kaisha Method and device for inserting and decoding a watermark in digital data
US6947893 16 nov. 2000 20 sept. 2005 Nippon Telegraph & Telephone Corporation Acoustic signal transmission with insertion signal for machine control
US6973195 26 oct. 1999 6 déc. 2005 Kowa Co., Ltd. Method for embedding electronic watermark and method for decoding the same
US6996249 4 avr. 2002 7 févr. 2006 Nec Laboratories America, Inc. Applying informed coding, informed embedding and perceptual shaping to design a robust, high-capacity watermark
US7043049 30 nov. 2000 9 mai 2006 Intel Corporation Apparatus and method for monitoring streamed multimedia quality using digital watermark
US7068809 27 août 2001 27 juin 2006 Digimarc Corporation Segmentation in digital watermarking
US7072492 4 août 2003 4 juil. 2006 Nippon Telegraph And Telephone Corporation Method and apparatus for digital watermarking
US7103678 * 19 déc. 2000 5 sept. 2006 Fuji Photo Film Co., Ltd. Method and apparatus for distributing digital contents to various terminals and recording medium containing same
US7164778 18 nov. 1999 16 janv. 2007 Nippon Telegraph And Telephone Corporation Digital watermark embedding method, digital watermark embedding apparatus, and storage medium storing a digital watermark embedding program
US7167599 27 avr. 2000 23 janv. 2007 Thomson Licensing Method and device for controlling multimedia data watermark
US7197368 15 juil. 2003 27 mars 2007 Microsoft Corporation Audio watermarking with dual watermarks
US7298865 18 avr. 2002 20 nov. 2007 Sarnoff Corporation Secure robust high-fidelity watermarking
US7319759 15 mars 2000 15 janv. 2008 Microsoft Corporation Producing a new black box for a digital rights management (DRM) system
US7334247 24 mars 2000 19 févr. 2008 The Directv Group, Inc. Method and apparatus for watermarking received television content
US7336802 12 sept. 2005 26 févr. 2008 Sanyo Electric Co., Ltd. Digital watermarking system using scrambling method
US7346514 10 mai 2002 18 mars 2008 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Device and method for embedding a watermark in an audio signal
US7389421 18 avr. 2002 17 juin 2008 Microsoft Corporation Countermeasure against estimation-based attacks of spread-spectrum watermarks
US7450727 2 mai 2003 11 nov. 2008 Harman International Industries, Incorporated Multichannel downmixing device
US7581103 13 juin 2002 25 août 2009 Intertrust Technologies Corporation Software self-checking systems and methods
US7630497 19 sept. 2005 8 déc. 2009 International Business Machines Corporation System and method for assigning sequence keys to a media player to enable hybrid traitor tracing
US7660991 5 sept. 2001 9 févr. 2010 International Business Machines Corporation Embedding, processing and detection of digital content, information and data
US7693297 4 août 2005 6 avr. 2010 Xiao-Ping Zhang Watermark embedding and detecting methods, systems, devices and components
US7840006 19 juil. 2006 23 nov. 2010 Sony Corporation Content distribution system and content distribution method
US8346532 * 11 juil. 2008 1 janv. 2013 International Business Machines Corporation Managing the creation, detection, and maintenance of sensitive information
US20010001159 11 déc. 2000 10 mai 2001 United Video Properties, Inc., System for filtering content from videos
US20010022786 1 juin 2001 20 sept. 2001 Wai King Receive processing for dedicated bandwidth data communication switch backplane
US20020007403 6 mars 2001 17 janv. 2002 Isao Echizen Digital watermark data embedding method, and digital watermark data embeddability analyzing method
US20020012443 8 déc. 2000 31 janv. 2002 Rhoads Geoffrey B. Controlling operation of a device using a re-configurable watermark detector
US20020044659 15 mai 2001 18 avr. 2002 Nec Corporation Broadcast verification system, broadcast verification method, broadcast verification apparatus and storage medium storing broadcast verification program
US20020052885 11 sept. 2001 2 mai 2002 Levy Kenneth L. Using embedded data with file sharing
US20020054089 14 mars 2001 9 mai 2002 Nicholas Donald L. Method of selecting content for a user
US20020080976 28 févr. 2002 27 juin 2002 Schreer Scott P. System and method for accessing authorized recordings
US20020120849 2 nov. 2001 29 août 2002 Mckinley Tyler J. Parallel processing of digital watermarking operations
US20020120854 21 sept. 2001 29 août 2002 Levine Richard B. Systems and methods for preventing unauthorized use of digital content
US20020126842 6 mars 2001 12 sept. 2002 Hollar Mark A. Enhanced copy protection of proprietary material employing multiple watermarks
US20020138734 4 déc. 2001 26 sept. 2002 David Morgan William Amos Identifying material
US20020154144 13 mars 2002 24 oct. 2002 Lofgren Neil E. Image management system and methods using digital watermarks
US20020168087 23 avr. 2002 14 nov. 2002 Verance Corporation Watermark position modulation
US20030009671 23 avr. 2001 9 janv. 2003 Yacov Yacobi Collusion-resistant watermarking and fingerprinting
US20030021439 18 avr. 2002 30 janv. 2003 Jeffrey Lubin Secure robust high-fidelity watermarking
US20030021441 27 juin 2002 30 janv. 2003 Levy Kenneth L. Connected audio and other media objects
US20030031317 13 août 2001 13 févr. 2003 Michael Epstein Increasing the size of a data-set and watermarking
US20030053655 16 août 2002 20 mars 2003 Barone Samuel T. Digital data monitoring and logging in an ITV system
US20030061489 29 août 2002 27 mars 2003 Pelly Jason Charles Embedding data in material
US20030063747 29 juil. 2002 3 avr. 2003 Rade Petrovic Apparatus and method for embedding and extracting information in analog signals using distributed signal features and replica modulation
US20030072468 18 nov. 2002 17 avr. 2003 Digimarc Corporation Curve fitting for synchronizing readers of hidden auxiliary data
US20030076955 18 oct. 2001 24 avr. 2003 Jukka Alve System and method for controlled copying and moving of content between devices and domains based on conditional encryption of content key depending on usage state
US20030078891 17 oct. 2002 24 avr. 2003 Capitant Patrice J. Systems and methods for providing digital rights management compatibility
US20030112997 27 janv. 2003 19 juin 2003 Farid Ahmed Watermarks carrying content dependent signal signal metrics for detecting and characterizing signal alteration
US20030115504 19 déc. 2001 19 juin 2003 Holliman Matthew J. Measurement of data degradation using watermarks
US20030131350 8 janv. 2002 10 juil. 2003 Peiffer John C. Method and apparatus for identifying a digital audio signal
US20030152225 5 févr. 2003 14 août 2003 Sanyo Electric Co., Ltd. Digital watermarking system using scrambling method
US20030174862 4 févr. 2003 18 sept. 2003 Rhoads Geoffrey B. Digital watermark screening and detection strategies
US20030177359 21 janv. 2003 18 sept. 2003 Bradley Brett A. Adaptive prediction filtering for digital watermarking
US20030179901 13 déc. 2002 25 sept. 2003 Jun Tian Progressive image quality control using watermarking
US20030185417 22 janv. 2003 2 oct. 2003 Alattar Adnan M. Digital watermarking and fingerprinting including synchronization, layering, version control, and compressed embedding
US20030187679 15 oct. 2002 2 oct. 2003 Odgers Chris R. Methods and apparatus for uniquely identifying a large number of film prints
US20030188166 12 déc. 2002 2 oct. 2003 Pelly Jason Charles Data processing apparatus and method
US20030190054 3 oct. 2001 9 oct. 2003 Lidror Troyansky Method and system for distributing digital content with embedded message
US20030190055 8 avr. 2003 9 oct. 2003 Kalker Antonius Adrianus Cornelis M Detection of auxiliary data in an information signal
US20030200438 18 avr. 2002 23 oct. 2003 Darko Kirovski Countermeasure against estimation-based attacks of spread-spectrum watermarks
US20030223584 29 mai 2002 4 déc. 2003 Bradley Brett Alan Layered security in digital watermarking
US20040005076 17 nov. 1999 8 janv. 2004 Kazuhisa Hosaka Associated information adding apparatus and method associated information detecting apparatus and method and illegal use preventing system
US20040008864 31 janv. 2003 15 janv. 2004 Kaleidescape, Inc. Watermarking and fingerprinting digital content using alternative blocks to embed information
US20040009763 20 juin 2003 15 janv. 2004 Stone Chris L. Secure tracking system and method for video program content
US20040010692 28 févr. 2003 15 janv. 2004 Kaleidescape Detecting collusion among multiple recipients of fingerprinted information
US20040015400 19 juin 2003 22 janv. 2004 Whymark Thomas J. Multi-market broadcast tracking, management and reporting method and system
US20040025176 2 août 2002 5 févr. 2004 David Franklin Method and apparatus to provide verification of data using a fingerprint
US20040028255 9 oct. 2001 12 févr. 2004 Nec Research Institute, Inc. Watermarking with cone-forest detection regions
US20040042635 3 sept. 2002 4 mars 2004 Koninklijke Philips Electronics N.V. Copy protection via redundant watermark encoding
US20040042636 18 juin 2003 4 mars 2004 Samsung Electronics Co., Ltd. Method of and apparatus for extracting watermark from repeatedly watermarked data
US20040078575 29 janv. 2003 22 avr. 2004 Morten Glenn A. Method and system for end to end securing of content for video on demand
US20040091111 16 juil. 2003 13 mai 2004 Levy Kenneth L. Digital watermarking and fingerprinting applications
US20040093202 * 19 févr. 2002 13 mai 2004 Uwe Fischer Method and system for the automatic detection of similar or identical segments in audio recordings
US20040093523 28 août 2003 13 mai 2004 Natsume Matsuzaki Group formation/management system, group management device, and member device
US20040098593 27 août 2003 20 mai 2004 Hirofumi Muratani Digital watermark embedding apparatus and method, and digital watermark analysis apparatus, method and program
US20040101160 3 nov. 2003 27 mai 2004 Sanyo Electric Co., Ltd. Multilayered digital watermarking system
US20040103293 7 nov. 2003 27 mai 2004 Ryan John O. Scaling independent technique for watermarking images
US20040133794 7 juil. 2003 8 juil. 2004 Kocher Paul C. Self-protecting digital content
US20040151316 26 janv. 2004 5 août 2004 Rade Petrovic Apparatus and method for embedding and extracting information in analog signals using distributed signal features and replica modulation
US20040169581 5 mars 2004 2 sept. 2004 Verance Corporation Remote control signaling using audio watermarks
US20040174996 30 avr. 2001 9 sept. 2004 Ahmed Tewfik Digital rights management
US20040202324 31 mars 2004 14 oct. 2004 Matsushita Electric Industrial Co., Ltd Program electronic watermark processing apparatus
US20040204943 3 mai 2004 14 oct. 2004 Microsoft Corporation Stealthy audio watermarking
US20040216157 25 avr. 2003 28 oct. 2004 Richard Shain System and method for advertising purchase verification
US20040250078 22 mars 2002 9 déc. 2004 John Stach Quantization -based data hiding employing calibration and locally adaptive quantization
US20050008190 11 mai 2004 13 janv. 2005 Levy Kenneth L. Digital watermarking systems and methods
US20050010779 5 août 2004 13 janv. 2005 Tadashi Kobayashi Method and apparatus for recording content containing watermark
US20050025332 31 juil. 2003 3 févr. 2005 Gadiel Seroussi Watermark embedding and extraction method and apparatus in compressed streams
US20050196051 5 mai 2005 8 sept. 2005 Verance Corporation Pre-processed information embedding system
US20050202781 8 mars 2005 15 sept. 2005 Ryan Steelberg Dynamic data delivery apparatus and method for same
US20050251683 14 juin 2005 10 nov. 2005 Levy Kenneth L Audio/video commerce application architectural framework
US20060056653 12 sept. 2005 16 mars 2006 Sanyo Electric Co., Ltd. Digital watermarking system using scrambling method
US20060062426 19 août 2005 23 mars 2006 Levy Kenneth L Rights management systems and methods using digital watermarking
US20060104477 20 sept. 2005 18 mai 2006 Kabushiki Kaisha Toshiba Digital watermark detection apparatus and digital watermark detection method
US20060227968 8 avr. 2005 12 oct. 2006 Chen Oscal T Speech watermark system
US20070003103 13 janv. 2005 4 janv. 2007 Koninklijke Philips Electronic, N.V. Method of allocating optimal payload space
US20070005500 22 août 2006 4 janv. 2007 Microsoft Corporation Secure online transactions using a captcha image as a watermark
US20070100483 29 sept. 2006 3 mai 2007 Sony United Kingdom Limited Audio processing
US20070110237 7 juil. 2006 17 mai 2007 Verance Corporation Watermarking in an encrypted domain
US20070143617 21 févr. 2003 21 juin 2007 Nikolaus Farber Method for embedding and detecting a watermark in a digital audio signal
US20070150418 27 déc. 2005 28 juin 2007 Microsoft Corporation Software licensing using certificate issued by authorized authority
US20070168673 12 janv. 2005 19 juil. 2007 Koninklijke Philips Electronic, N.V. Method of allocating payload bits of a watermark
US20070177761 28 nov. 2006 2 août 2007 Levy Kenneth L Watermark embedding functions adapted for transmission channels
US20070192261 14 févr. 2006 16 août 2007 International Business Machines Corporation Resource allocation using relational fuzzy modeling
US20070208711 21 déc. 2006 6 sept. 2007 Rhoads Geoffrey B Rules Driven Pan ID Metadata Routing System and Network
US20070223708 1 sept. 2006 27 sept. 2007 Lars Villemoes Generation of spatial downmixes from parametric representations of multi channel signals
US20080002854 19 juil. 2007 3 janv. 2008 Verance Corporation Signal continuity assessment using embedded watermarks
US20080016360 17 juil. 2007 17 janv. 2008 Rodriguez Tony F Digital Watermarks for Checking Authenticity of Printed Objects
US20080031463 31 juil. 2007 7 févr. 2008 Davis Mark F Multichannel audio coding
US20080209219 16 janv. 2006 28 août 2008 Hanspeter Rhein Method Of Embedding A Digital Watermark In A Useful Signal
US20080310629 10 nov. 2006 18 déc. 2008 Kpmomklijke Phillips Electroncis N.V. Multibit Forensic Watermark with Encrypted Detection Key
US20080310673 11 mars 2008 18 déc. 2008 Verance Corporation System reactions to the detection of embedded watermarks in a digital host content
US20080313741 27 août 2008 18 déc. 2008 Nokia Corporation System and method for controlled copying and moving of content between devices and domains based on conditional encryption of content key depending on usage state
US20090031134 24 juin 2008 29 janv. 2009 Levy Kenneth L Digital watermarking with variable orientation and protocols
US20090172405 9 oct. 2008 2 juil. 2009 Kabushiki Kaisha Toshiba Audio data processing apparatus and audio data processing method
US20090262932 17 avr. 2009 22 oct. 2009 Verance Corporation Embedding and extraction of information from an embedded content using replica modulation
US20090326961 19 juin 2009 31 déc. 2009 Verance Corporation Efficient and secure forensic marking in compressed domain
US20100034513 19 juin 2007 11 févr. 2010 Toshihisa Nakano Information burying device and detecting device
US20100121608 14 juin 2007 13 mai 2010 Jun Tian Method and apparatus for setting a detection threshold given a desired false probability
US20100146286 3 déc. 2009 10 juin 2010 Verance Corporation Pre-Processed Information Embedding System
US20100214307 27 juil. 2009 26 août 2010 Samsung Electronics Co., Ltd. Method and apparatus for embedding watermark
US20100226525 8 sept. 2009 9 sept. 2010 Levy Kenneth L Processing Audio or Video Content with Multiple Watermark Layers
US20100228857 20 mai 2010 9 sept. 2010 Verance Corporation Media monitoring, management and information system
US20100287579 10 mai 2010 11 nov. 2010 Verance Corporation Media monitoring, management and information system
US20100287609 20 juil. 2010 11 nov. 2010 Cox Communications, Inc. Content protection management system
US20110016172 16 juil. 2010 20 janv. 2011 Ajay Shah Synchronized delivery of interactive content
US20110068898 1 déc. 2010 24 mars 2011 Verance Corporation Remote control signaling using audio watermarks
US20110103444 7 oct. 2009 5 mai 2011 Thomson Licensing Method and apparatus for regaining watermark data that were embedded in an original signal by modifying sections of said original signal in relation to at least two different
US20110123063 22 nov. 2010 26 mai 2011 Delp Edward J Synchronization of Digital Watermarks
US20110202687 28 avr. 2011 18 août 2011 Glitsch Hans M Synchronizing audience feedback from live and time-shifted broadcast views
US20110209191 29 avr. 2011 25 août 2011 Ajay Shah Device for presenting interactive content
US20110219229 2 mars 2010 8 sept. 2011 Chris Cholas Apparatus and methods for rights-managed content and data delivery
US20110225427 15 mars 2010 15 sept. 2011 Research In Motion Limited Use of certificate authority to control a device's access to services
US20110286625 19 nov. 2010 24 nov. 2011 Verance Corporation System reactions to the detection of embedded watermarks in a digital host content
US20110311056 29 août 2011 22 déc. 2011 Verance Corporation Forensic marking using a common customization function
US20120017091 28 sept. 2011 19 janv. 2012 Verance Corporation Methods and apparatus for thwarting watermark detection circumvention
US20120026393 12 oct. 2011 2 févr. 2012 Verance Corporation Media monitoring, management and information system
US20120072729 5 avr. 2011 22 mars 2012 Verance Corporation Watermark extraction and content screening in a networked environment
US20120072730 5 avr. 2011 22 mars 2012 Verance Corporation Context access management using watermark extraction information
US20120084870 9 déc. 2011 5 avr. 2012 Verance Corporation Apparatus and method for embedding and extracting information in analog signals using distributed signal features and replica modulation
US20120130719 30 janv. 2012 24 mai 2012 Verance Corporation Remote control signaling using audio watermarks
US20120300977 6 août 2012 29 nov. 2012 Verance Corporation Efficient and secure forensic marking in compressed domain
US20130007462 4 sept. 2012 3 janv. 2013 Verance Corporation Circumvention of watermark analysis in a host content
US20130011006 4 sept. 2012 10 janv. 2013 Verance Corporation Asymmetric watermark embedding/extraction
US20130114847 3 nov. 2011 9 mai 2013 Verance Corporation Extraction of embedded watermarks from a host content using a plurality of tentative watermarks
US20130114848 3 nov. 2011 9 mai 2013 Verance Corporation Efficient extraction of embedded watermarks in the presence of host content distortions
US20130117570 3 nov. 2011 9 mai 2013 Verance Corporation Watermark extraction based on tentative watermarks
US20130117571 3 nov. 2011 9 mai 2013 Verance Corporation Extraction of embedded watermarks from a host content based on extrapolation techniques
US20130132727 23 nov. 2011 23 mai 2013 Verance Corporation Enhanced content management based on watermark extraction records
US20130142382 20 nov. 2012 6 juin 2013 Verance Corporation Pre-processed information embedding system
CA2276638A1 29 juin 1999 6 janv. 2000 Kaori Kondo Method of providing digital contents, method of monitoring illegal use of digital contents, apparatus for providing digital contents, and apparatus for monitoring illegal use of digital contents
EP282734A1 Titre non disponible
EP1137250A1 22 mars 2000 26 sept. 2001 Hewlett-Packard Company, A Delaware Corporation Improvements relating to digital watermarks
EP2166725A1 28 août 2008 24 mars 2010 Alcatel, Lucent Control of delivery of digital content, and an apparatus therefor
GB2363027A Titre non disponible
JP10150548A Titre non disponible
JP11086435A Titre non disponible
JP11284516A Titre non disponible
JP11346302A Titre non disponible
JP2000069273A Titre non disponible
JP2000083159A Titre non disponible
JP2000163870A Titre non disponible
JP2000174628A Titre non disponible
JP2000216981A Titre non disponible
JP2001022366A Titre non disponible
JP2001119555A Titre non disponible
JP2001175270A Titre non disponible
JP2001188549A Titre non disponible
JP2001216763A Titre non disponible
JP2001218006A Titre non disponible
JP2001245132A Titre non disponible
JP2001312570A Titre non disponible
JP2001527660A Titre non disponible
JP2002024095A Titre non disponible
JP2002027223A Titre non disponible
JP2002091465A Titre non disponible
JP2002091712A Titre non disponible
JP2002135557A Titre non disponible
JP2002165191A Titre non disponible
JP2002176614A Titre non disponible
JP2002232412A Titre non disponible
JP2002232693A Titre non disponible
JP2002319924A Titre non disponible
JP2002354232A Titre non disponible
JP2002519916A Titre non disponible
JP2003008873A Titre non disponible
JP2003039770A Titre non disponible
JP2003091927A Titre non disponible
JP2003230095A Titre non disponible
JP2003244419A Titre non disponible
JP2003283802A Titre non disponible
JP2003316556A Titre non disponible
JP2004023786A Titre non disponible
JP2004070606A Titre non disponible
WO2001097128A1 11 juin 2001 20 déc. 2001 Markany Inc. System and method of providing and authenticating works of authorship based on watermark technique
WO2002019589A1 27 août 2001 7 mars 2002 Verance Corporation Method and apparatus for transaction code embedding
WO2002023883A2 13 sept. 2001 21 mars 2002 Digimarc Corporation Watermarking in the time-frequency domain
WO2002049363A1 15 déc. 2000 20 juin 2002 Agency For Science, Technology And Research Method and system of digital watermarking for compressed audio
WO2002095727A1 14 mai 2002 28 nov. 2002 International Business Machines Corporation Content boundary detecting device, monitoring method, content position determining method, program, and storge medium
WO2003052598A1 9 déc. 2002 26 juin 2003 Digimarc Corporation Forensic digital watermarking with variable orientation and protocols
WO2013067439A1 2 nov. 2012 10 mai 2013 Verance Corporation Watermark extraction based on tentative watermarks
1 "Advanced Access Content System (AACS), Pre-recorded Video Book," Revision 0.951, Sep. 2009 (86 pages).
2 "Content Protection-Self Protecting Digital Content," http://www.cryptography.com/technology/spdc/index.html, May 2010 (1 page).
3 "Content Protection—Self Protecting Digital Content," http://www.cryptography.com/technology/spdc/index.html, May 2010 (1 page).
4 "Microsoft response to CfP for technology solutions to screen digital audio content for LCM acceptance," Microsoft Corporation, May 23, 1999 (9 pages).
5 "Task AC122-copy protection for distribution services," Http://acad.bg/WISE/english/rd/partners/acts/areal/ac122-t.html, Jul. 1, 1997 (2 pages).
6 Adelsbach, A., et al., "Proving Ownership of Digital Content," Proc. 3rd Int. Workshop on Information Hiding, 1768:117-133, Sep. 1999.
7 Aggarwal, A., et al., "Multi-Layer Grid Embeddings," Foundations of Computer Science, 26th Annual Symposium on Foundations of Computer Science, 85:186-196, Oct. 1985.
8 Aris Technologies, Inc. "Audio Watermarking System to Screen Digital Audio Content for LCM Acceptance," May 1999 (17 pages).
9 Bangaleea, R., et al., "Performance improvement of spread spectrum spatial-domain watermarking scheme through diversity and attack characterisation," IEEE Africon, pp. 293-298, 2002.
10 Barreto, P.S.L.M., et al. "Toward Secure Public-Key Blockwise Fragile Authentication Watermarking," IEEE Proceedings Vision, Image, and Signal Processing, 149(2):57-62, Apr. 2002.
11 Boney, L., et al., "Digital Watermarks for Audio Signals," Dept. of Electrical Engineering, Univ. of Minnesota, Mar. 1996 (4 pages).
12 Cappellini, V., et al. "Robust Frame-based Watermarking for Digital Video," Proceedings of the 12th International Workshop on Database and Expert Systems Applications, Sep. 2001 (5 pages).
13 Caronni, G., "Assuring Ownership Rights for Digital Images," Proceedings of reliable IT systems VIS 95, Vieweg Publishing Company, Germany, 1995 (10 pages).
14 Chen, B. et al., "Quantization index modulation: a class of provably good methods for digital watermarking and information embedding," IEEE Transactions on Information Theory, 47(4):1423-1443 May 2001.
15 Chou, J., et al., "A Robust Blind Watermarking Scheme based on Distributed Source Coding Principles," Multimedial 2000 Proceedings of the eighth ACM international conference on multimedia, Los Angeles, California, 2000 (8 pages).
16 Chou, J., et al., "A Robust Optimization Solution to the Data Hiding Problem using Distributed Source Coding Principles," Pro. SPIE, 3971, San Jose, California, Jan. 2000 (10 pages).
17 Cinea, Inc., "Forensic watermarking deterring video piracy," 2004, (9 pages).; [http://www.cinea.com/whitepapers/forensic-watermarking.pdf].
18 Cinea, Inc., "Forensic watermarking deterring video piracy," 2004, (9 pages).; [http://www.cinea.com/whitepapers/forensic—watermarking.pdf].
19 Costa, M., "Writing on Dirty Paper," IEEE Trans. on Info. Theory, 29(3):439-441, May 1983.
20 Cox, I. J., et al., "Some general methods for tampering with watermarks," IEEE Journal on Selected Areas in Communications, 16(4): 587-593, May 1998.
21 Coxford, A., et al., "Advanced Mathematics: A Preparation for Calculus, Second Edition," Harcourt Brace Jovanovish, Inc., 1978 (14 pages).
22 Das, et al., "Distributed Priority Queues on Hybercube Architectures," IEEE, 1996, pp. 620-627.
23 Davidson, M.F., "Music File Filter," Sony Music, New York, May 23, 1999 (2 pages).
24 Digimarc Corporation, "Digimarc Watermarking Guide," 1999 (22 pages).
25 Dittmann, J., "Combining digital watermarks and collusion secure fingerprints for customer copy monitoring," Proc. IEEE Seminar on Secure Images and Image Authentication, Apr. 2000 (6 pages).
26 Dittmann, J., et al., "Combining digital watermarks and collusion secure fingerprints for digital images," Proc. SPIE 3657:171-182, Jan. 1999 (12 pages).
27 Epp, L.W., et al., "Generalized scattering matrices for unit cell characterization of grid amplifiers and device de-embedding," IEEE, 2:1288-1291, Jun. 1995.
28 European Search Report dated Apr. 12, 2012 for European Patent Application No. 07836262.1 filed Jul. 25, 2007 (12 pages).
29 European Search Report dated Jul. 3, 2012 for European Patent Application No. 12150742.0, filed Oct. 7, 2003 (5 pages).
30 European Search Report dated Nov. 10, 2010 for European Patent Application No. 03774648.4, filed Oct. 7, 2003 (5 pages).
31 European Search Report dated Oct. 24, 2012 for European Patent Application No. 06758537.2, filed Apr. 21, 2006 (6 pages).
32 European Search Report dated Oct. 31, 2012 for European Patent Application No. 06758577.8, filed Apr. 25, 2006 (6 pages).
33 Furon, T., et al., "An asymmetric watermarking method," IEEE Trans. Signal Processing, 4(51):981-995, Apr. 2003.
34 Guth, H.J. et al., "Error-and collusion-secure fingerprinting for digital data," Proc. 3rd Int. Workshop on Information . Hiding, LNCS 1768:134-145, Sep./Oct. 1999.
35 Hartung, F., et al., "Digital watermarking of MPEG-2 coded video in the bitstream domain," Proc. IEEE Int. Conf. on Acoustics, Speech and Signal Processing, 4:2621-2624, Apr. 1997.
36 Hartung, F., et al., "Watermarking of MPEG-2 encoded video without decoding and re-coding," Proc. SPIE Multimedia Computing and Networking 97, 3020:264-274, Feb. 1997.
37 Hartung, F., et al., "Watermarking of uncompressed and compressed video," Signal Processing, 3(66):283-301, May 1998.
38 Heegard, C., et al., "On the capacity of computer memory with defects," IEEE Trans. Info. Theory, 5(IT-29):731-739, Sep. 1983.
39 International Search Report and Written Opinion dated Apr. 24, 2012 for International Application No. PCT/US2011/051857, filed Sep. 15, 2011 (9 pages).
40 International Search Report and Written Opinion dated Apr. 8, 2013 for International Application No. PCT/US2012/069306, filed Dec. 12, 2012 (12 pages).
41 International Search Report and Written Opinion dated Aug. 14, 1998 for International Application No. PCT/US1998/009587, filed May 12, 1998 (3 pages).
42 International Search Report and Written Opinion dated Aug. 22, 2007 for International Application No. PCT/US2006/031267, filed Aug. 9, 2006 (2 pages).
43 International Search Report and Written Opinion dated Feb. 14, 2002 for International Application No. PCT/US2001/026505, filed Aug. 27, 2001 (2 pages).
44 International Search Report and Written Opinion dated Feb. 28, 2013 for International Application No. PCT/US2012/066138, filed Nov. 20, 2012 (11 pages).
45 International Search Report and Written Opinion dated Jan. 4, 2008 for International Application No. PCT/US2006/015615, filed Apr. 25, 2006 (5 pages).
46 International Search Report and Written Opinion dated Mar. 14, 2013 for International Application No. PCT/US2012/069308, filed Dec. 12, 2012 (10 pages).
47 International Search Report and Written Opinion dated Mar. 18, 2013 for International Application No. PCT/US2012/063431, filed Nov. 2, 2012 (10 pages).
48 International Search Report and Written Opinion dated Mar. 25, 2013 for International Application No. PCT/US2012/069302, filed Dec. 12, 2012 (22 pages).
49 International Search Report and Written Opinion dated Mar. 28, 2012 for International Application No. PCT/US2011/051855, filed Sep. 15, 2011 (8 pages).
50 International Search Report and Written Opinion dated May 13, 2008 for International Application No. PCT/US2006/025090, filed Jun. 27, 2006 (2 pages).
51 International Search Report and Written Opinion dated May 19, 2004 for International Application No. PCT/US2003/031816, filed Apr. 29, 2004 (3 pages).
52 International Search Report and Written Opinion dated May 29, 2008 for International Application No. PCT/US2006/015410, filed Apr. 21, 2006 (6 pages).
53 International Search Report and Written Opinion dated Sep. 26, 2008 for International Application No. PCT/US2007/016812, filed Jul. 25, 2007 (6 pages).
54 Jacobsmeyer, J., et al., "Introduction to error-control coding," Pericle Communications Company, 2004 (16 pages).
55 Kalker, T., et al., "A security risk for publicly available watermark detectors," Proc. Benelux Info. Theory Symp., Veldhoven, The Netherlands, May 1998 (7 pages).
56 Kalker, T., et al., "System issues in digital image and video watermarking for copy protection," Proc. IEEE Int. Conf. on Multimedia Computing and Systems, pp. 562-567, Jun. 1999.
57 Kang, X., et al., "A DWT-DFT composite watermarking scheme robust to both affine transform and JPEG compression," IEEE Transactions on Circuits and Systems for Video Technology, 8(13):776-786 Aug. 2003.
58 Kim, T.Y., et al., "An asymmetric watermarking system with many embedding watermarks corresponding to one detection watermark," IEEE Signal Processing Letters, 3(11):375-377, Mar. 2004.
59 Kirovski, D., et al., "Multimedia content screening using a dual watermarking and fingerprinting system," Multimedia '02 Proceedings of the ACM international conference on Multimedia, 2002 (11 pages).
60 Kirovski, D., et al., "Multimedia content screening using a dual watermarking and fingerprinting system," Proceedings of the tenth ACM international conference, pp. 372-381, 2002.
61 Kirovski, D., et al., "Randomizing the replacement attack," ICASSP, pp. 381-384, 2004.
62 Kirovski, D., et al., "Robust spread-spectrum audio watermarking," IEEE International Conference on Acoustics, Speech, and Signal Processing, 3:1345-1348, 2001.
63 Kocher, P., et al., "Self-Protecting Digital Content: A Technical Report from the CRI Content Security Research Initiative," Cryptography Research, Inc. (CRI), 2002-2003 (14 pages).
64 Kutter, M., et al., "The watermark copy attack," Proc. of the SPIE: Security and Watermarking of Multimedia Content II, 3971:1-10, Jan. 2000.
65 Kuznetsov, A.V., et al., "An error correcting scheme for defective memory," IEEE Trans. Inf. Theory, 6(4):712-718, Nov. 1978 (7 pages).
66 Lacy, J., et al., "Intellectual property protection systems and digital watermarking," Proceedings: Information Hiding, Second International Workshop, Portland, Oregon, pp. 158-168, 1998.
67 Lin, E.T., et al., "Detection of image alterations using semi-fragile watermarks," Proceedings of the SPIE International Conference on Security and Watermarking of Multimedia Contents II, Jan. 2000 (12 pages).
68 Lin, P.L., et al., "Robust transparent image watermarking system with spatial mechanisms," The Journal of Systems and Software, 50:107-116, Feb. 2000.
69 Lotspeich, J., "The Advanced Access Content System's Use of Digital Watermarking," MCPS '06, Oct. 28, 2006, pp. 19-21.
70 Lu, C.S., et al., "Oblivious cocktail watermarking by sparse code shrinkage: A regional-and global-based scheme," IEEE Transactions on Multimedia, 4(2):209-224, Dec. 2000.
71 Maehara, F., et al., "A proposal of multimedial home education terminal system based on flash-squeak OS," Technical report of the institute of image information and television engineers, 28(43):21-24, Jul. 2004.
72 Mason, A. J., et al., "User requirements for watermarking in broadcast applications," IEEE Conference Publication, International Broadcasting Convention (BC 2000), Amsterdam, Sep. 8-12, 2000 (7 pages).
73 Mintzer, F., et al., "If one watermark is good, are more better?," Acoustics, Speech, and Signal Processing, ICASSP, 4:2067-2069, Mar. 1999.
74 Mobasseri, B.G., et al. "Content authentication and tamper detection in digital video," Image Processing Proceedings, International Conference, 1:458-461, 2000.
75 Moulin, P., et al., "Detection-theoretic analysis of desynchronization attacks in watermarking, " Technical Report MSR-TR-2002-24, Microsoft Corporation, Mar. 2002.
76 Muranoi, R., et al., "Video retrieval method using shotID for copyright protection systems," Proc. SPIE Multimedia Storage and Archiving Systems III, 3527:245-252, Nov. 1998.
77 Nikolaidis, N., et al., "Watermark detection: benchmarking perspectives," 2002 IEEE Conference on Multimedia and Expo, 2002 (4 pages).
78 Office Action dated Jul. 21, 2011 for Japanese Patent Application No. 2008-508985 (6 pages).
79 Office Action dated Mar. 16, 2012 for Japanese Patent Application No. 2008-508985 (8 pages).
80 Office Action dated Mar. 18, 2011 for European Patent Application No. 03774648.4 (6 pages).
81 Office Action dated May 8, 2012 for Japanese Patent Application No. 2009-522802 (4 pages).
82 Office Action dated Nov. 26, 2012 for Japanese Patent Application No. 2011-114667 (8 pages).
83 Office Action dated Nov. 28, 2012 for Japanese Patent Application No. 2011-114666 (8 pages).
84 Park, J.H., et al., "Robust and fragile watermarking techniques for documents using bidirectional diagonal profiles," Information and Communications Security: Third International Conference, Xian, China, Nov. 2001, pp. 483-494.
85 Perez-Gonzalez, F., et al., "Approaching the capacity limit in image watermarking a perspective on coding techniques for data hiding applications," Signal Processing, 6(81):1215-1238 Jun. 2001.
86 Petitcolas, F., et al., "The blind pattern matching attack on watermark systems," IEEE Trans. Signal Processing, Apr. 2003 (4 pages).
87 Petitcolas, F.A.P., et al., "Attacks on copyright marking systems," Second Workshop on Information Hiding, Lecture Notes in Computer Science, Portland, Oregon, pp. 218-238, Apr. 1998.
88 Philips Research Liquid Audio Fraunhofer Institute, "Digital Audio Screening Technology for Phased Rollout," Version 1.00, May 1999 (38 pages).
89 Pytlak, J.,"Anti-piracy coding," URL: http://www.tele.com/pipermail/tig/2003-November/003842.html; Nov. 2003 (2 pages).
90 RSA Laboratories, "Frequently asked questions about today's cryptography," Version 4.1, May 2000 (37 pages).
91 Schneier, B., "Applied cryptography, second edition: protocols, algorithms and source code in C," Oct. 1995 (10 pages).
92 Seok, J., et al., "A novel audio watermarking algorithm for copyright protection of digital audio," ETRI Journal, 24 (3):181-189, Jun. 2002.
93 Shih, F.Y., et al., "Combinational, image watermarking in the spatial and frequency domains," Pattern Recognition, 36:696-975, May 2002.
94 Solanki, K., et al., "Robust image-adaptive data hiding: modeling, source coding and channel coding", 41st Allerton Conference on Communications, Control and Computing, Oct. 2003 (10 pages).
95 Steinebach, M., et al., "Stir Mark benchmark: audio watermarking attacks," International Conference on Information Technology: Coding and Computing (ITCC 2001), Las Vegas, Nevada, Apr. 2001 (6 pages).
96 Tanaka, K., et al., "Secret transmission method of character data in motion picture communication," SPIE Visual Communications and Image Processing '91, 1605:646-649, 1991.
97 Tsai, M.J., et al., "Wavelet packet and adaptive spatial transformation of watermark for digital image authentication," IEEE Image Processing, 2000 International Conference, 1:450-453, 2000 (4 pages).
98 Verance Corporation, "Confirmedia," PowerPoint presentation made to National Association of Broadcasters; Apr. 24, 2001 (40 pages).
99 Wolfgang, R., et al., "Perceptual watermarks for digital images and video," Proceedings of the IEEE, 87 (7):1108-1126, Jul. 1999.
100 Xu, C., et al., "Applications of digital watermarking technology in audio signals," Journal of Audio Eng. Soc., 10 (47):805-812, Oct. 1999.
101 Yeung, M. M., et al., "An invisible watermarking technique for image verification," Image Processing, International Conference Proceedings, 2:680-683, Oct. 26-29 1997.
102 Zhao, J., "A WWW service to embed and prove digital copyright watermarks," Proc. European Conf. on Multimedia Applications, Services and Techniques (ECMAST'96), May 1996 (15 pages).
103 Zhao, J., "Applying digital watermarking techniques to online multimedia commerce," Proc. Int. Conf. on Imaging Science, Systems and Applications (CISSA'97), Jun./Jul. 1997 (7 pages).
US9117270 * 2 juin 2014 25 août 2015 Verance Corporation Pre-processed information embedding system
US9680844 6 juil. 2015 13 juin 2017 Bank Of America Corporation Automation of collection of forensic evidence
US20140355817 * 2 juin 2014 4 déc. 2014 Verance Corporation Pre-processed information embedding system
Classification aux États-Unis 380/203, 713/176, 704/200, 704/500
Classification internationale G10L19/018
Classification coopérative G06T1/0021, G10L19/018
7 févr. 2013 AS Assignment
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:PETROVIC, RADE;YANG, DAI;REEL/FRAME:029775/0937
29 mars 2016 CC Certificate of correction