JP5571756B2 - Watermark encoded content - Google Patents

Description

  The present invention relates to digital watermarks, and more particularly to embedding, deleting / replacement, and detection of digital watermarks in encoded content.

  The encoded content needs to be “decoded” in order to use the content. Some examples of encoded content are: MPEG-1, MPEG-2, H264 / AVC, WMA, MPEG4, JPEG2000, MP3, PDF, Windows® word, Postscript, etc. and their ciphers Including version.

  One conventional way of watermarking encoded content is to insert a watermark signal at the structure and syntax elements. There is an example for data embedded in syntax elements in a coded bitstream such as MPEG-1 and MPEG-2 (see, for example, Patent Document 1). However, such watermarks cannot survive format changes or digital-to-analog conversion.

  Another conventional method for watermarking encoded content is to embed the watermark in MPEG encoded content by adding noise to the DCT coefficients. An example of this approach is disclosed in Non-Patent Document 1, for example. The method of Non-Patent Document 1 does not use a perceptual method.

  Yet another conventional method of watermarking encoded content is to directly transform the encoded content. In the present specification, “Conover” hereinafter refers to a method of watermarking an MPEG-compressed video bit stream by modifying some DCT coefficients (see, for example, Patent Document 2). ). This method does not change the entropy-encoded length of these DCT coefficients after deformation. There is no specific watermark embedding method specified in Conover. The method of selecting a watermark site in Conover is limited to a 0 run-zero factor. Conover's coefficients exist in the high frequency region. Conover's method does not include a pre-processing phase, and there is no “alternative value” for the actual watermark insertion in a later phase described below. The concept of creating and using a “watermark unit” is not disclosed or taught anywhere in Conover.

US Pat. No. 6,687,384 US Pat. No. 6,373,960

F. Hartung, B. Girod, “Digital Watermarking of MPEG-2 Coded Video in the Bit Stream Domain”, Proc. IEEE ICASSP, April 1997, p.2621-2624

  Conventional methods for watermarking encoded content do not have pre-processing to generate “alternate values” for some parts of the encoded content. Traditional methods of watermarking encoded content further exclude encoded content that is masked, obfuscated, scrambled, or encrypted (collectively "encrypted") .

  The present invention watermarks the encoded content by embedding the watermark at a selected position in the encoded content. This is accomplished by replacing the original value in the content encoded with the alternative value. Each original value may have one or more alternative values, and each alternative value includes a watermark signal. Further, the watermark can be deleted by replacing the alternative value with the original value or by substituting one alternative value with another alternative value.

The present invention accomplishes the following by selecting one of the alternative values and substituting the original value at the corresponding position in the encoded content.
The alternative value is identical in size to the original value, and replacement by any one of the alternative values generates an encoded content according to a defined format and is encoded Do not introduce perceptual artifacts in the rendered content.
• Alternative values can improve the quality of the encoded content. For example, the original value can or cannot be a reasonable value. That is, the encoded content cannot be in a valid format without replacement with one of the alternative values. In another case where the original value is a reasonable value, the original value can introduce degradation of the encoded content without being replaced by an alternative value.
Each alternate value includes a watermark signal. This watermark signal may have one or more embedded information units with other watermark signals at other locations in the encoded content, or with the watermark itself. An information unit is composed of one or more bits.
The data size for the alternative values (defined by the data size for each alternative value and the number of alternative values) can be smaller than the data volume of the content to be encoded.

  One important objective of directly watermarking encrypted content is “localized encryption”. Local encryption considers the correspondence between plain text and encrypted text. For example, a trivial unit of text includes components c1, c2,. After local encryption, the encrypted text consists of c1 ′, c2 ′,..., Cn ′. Here, ci ′ is an encrypted version of ci (1 ≦ i ≦ n). A simple example for local encryption is to separate the content into parts and individual parts that are encrypted. One category of encryption, local encryption if possible, is selected encryption or partial encryption. Instead of treating content (audio or video) as a binary data stream (or referred to as “intrinsic encryption”), a selective encryption method can be used with a content syntax structure (eg, MPEG-2). "Understand") and only selectively encrypt some parts of the content. Selective encryption is performed after compression. Encrypted content will not have a commercial value, although a portion of the content can be made visible. Some selective encryption schemes preserve the format, bit rate, and selectively unencrypted encoded content. Other selective encryption schemes can increase the bit rate or require a special decoder.

  Taking MPEG-2 as an example, a simple selective algorithm encrypts only I frames. Selectively encrypted MPEG can be a valid MPEG stream. Although P-frames and B-frames in MPEG-2 are not important without the corresponding I-frame information, a large portion of the MPEG video remains visible due to internal frame correlation, mainly P-frames and This is from the unencrypted I block in the B frame. Other optional encryption schemes include encryption for MPEG-2 headers and / or encryption of DCT coefficients. The DCT coefficient is divided into “DC coefficient” and “AC coefficient”. The DC coefficient is the coefficient due to zero frequency in both dimensions, and the AC coefficient is the remaining coefficient due to non-zero frequency. All DC coefficients or partial values of all I-block AC coefficients can be encrypted.

  Systems and methods for inserting watermarks in encoded content receive encoded content, receive at least one watermark unit, and directly replace the number of bits starting at a position with an alternative value That is, an alternative value includes having an embedded watermark signal. The apparatus and method for generating a watermark unit further includes selecting a position, wherein values in the encoded content are replaced by alternative values and calculating alternative values. Further, a system and method for transposing watermarks in encoded content includes receiving encoded content, receiving at least one watermark unit, and a number of bits starting at a position in the encoded content. Substituting with a value, the value is specified in at least one watermark unit, and the position is specified in at least one watermark unit.

  Further, a system and method for inserting a watermark in encoded content includes receiving the encoded content, receiving at least one watermark unit, and a bit string including watermark payload information. Receiving, performing one of the direct replacement of the number of bits starting at a position with an alternative value, leaving the number of bits starting at a position based on the bit value of the bit string of the watermark payload information unchanged The alternative value includes being embedded in the watermark signal. A system and method for watermark detection includes receiving at least one watermark unit, receiving watermarked content, retrieving a plurality of coefficient values from the watermarked content, and from coefficient values Including retrieving the bit value of the watermark.

FIG. 6 is a block diagram illustrating a pre-processing workflow for embedding a watermark according to the principles of the present invention. It is a figure which shows the watermark unit of this invention. FIG. 5 is a flow diagram of a method for detecting a watermark according to the principles of the present invention. FIG. 3 is a block diagram of a playback device that receives encoded content with an embedded watermark unit.

  The invention is best understood from the following detailed description when read with the accompanying drawing figures.

Watermarking the encoded content can be divided into three distinct steps.
Position selection, which is the selection of a position where the value in the encoded content can be replaced by an alternative value including a watermark signal.
The calculation of an alternative value, which is the determination of the alternative value, the alternative value having the same number of bits as the value and replacing it in the encoded content, the replacement being perceptual to the content Avoid changes. In addition, this alternative value includes a watermark signal.
Watermark embedding / insertion, which is the actual permutation of values in content encoded with one of the alternative values.

  The first two steps can be preprocessing. As a result of the preprocessing, a set of watermark units (WU) is generated. The WU contains all the information for actually embedding / inserting the watermark. The watermark preprocessing device receives the encoded content and watermark key as input and outputs a sequence of watermark units. If only one alternative value is generated for each WU, the watermark payload can be an additional input to the preprocessor. This watermark unit can be used as metadata of the encoded content, as a separate channel multiplexed with the content, as syntax element or steganographic data hidden in the content, or as a physical medium (optical disc, tape) Integrated into the final content as a separate file stored on a hard drive, etc.) or transmitted by a network (TCP / IP, satellite, etc.).

  The watermark payload information is embedded by being selected from among alternative values in the WU. One WU has at least one alternative value. If each WU has only one alternative value, there are two ways to embed / insert watermark information (payload). The first method is to embed a single fixed watermark payload by replacing all original values in the WU with alternative values. The second method allows the WU to embed various watermark payloads by switching between replacement or non-replacement. For example, permutation indicates a positive bit value but non-replacement for negative bit values. In order to embed the watermark payload “00101001”, the original values in the first and second WUs are not replaced, and the original values in the third WU are replaced with alternative values of the third WU. For WUs having one or more alternative values, each alternative value includes a watermark signal that can represent a different information unit of the watermark payload. Alternative values can be selected for replacement based on the watermark payload. For example, to embed 1 bit in the WU, only two alternative values V1 and V2 are required. To embed the bit value “0”, select V1, replace the original value in the encoded content, and select V2 to embed the bit value “1”. The two values V1 and V2 can represent a “0” bit and a “1” bit. If there are four alternative values (V1, V2, V3 and V4), 2-bit information (ie, “00”, “01”, “10” and “11”) can be embedded. More bits can be embedded with more alternative values at one location, allowing information to be embedded very efficiently.

  Usually, the watermark payload is received in the third step “Watermark Insertion”. The watermark payload can be stored or calculated by a component external to the watermark system. Usually, the watermark payload information is an identifier that uniquely identifies the reception and playback device (manufacturer, model and / or serial number) and the date and time of playback of the content. The difference between the original value, V and the alternative value of V is stored in the WU, potentially reducing the size of the WU. Furthermore, the WU can be compressed.

  It is important to protect the WU against unauthorized access or modification. Because the information not only makes the watermark system vulnerable to various attacks, it is also easy for hackers to insert fake watermarks or modify or delete existing watermarks. is there. If the WU is stored and transmitted as steganographic data (watermark), access can be controlled by the watermark key. If the WU is stored and transmitted over any other channel, encryption of the WU is necessary.

  As described above, the first and second steps can be executed as preprocessing. Thus, prior to the third step, the encoded content is not watermarked. The third step performs watermark embedding by replacing multiple values in the content encoded with alternative values specified in the WU. These values can be embedded syntax elements such as package identification, headers, quantization tables, Huffman tables for entropy coding, encoded coefficients or encoded motion vectors. The WU identifies where the watermark signal (in the alternative value) is embedded and which watermark signal is placed in these locations by selecting the appropriate alternative value.

  FIG. 1 is a block diagram illustrating a workflow for preprocessing encoded content that generates a WU. FIG. 2 represents a watermark according to the principles of the present invention. Each WU is described by a vector (P, L, C, {V}, V1, V2,..., Vn). Where P is the position of the original value V that can be replaced in the future by alternative values in the encoded content, L is the number of bits used for the original value V in the encoded content starting at P, C is the overall set of coefficients (eg, DCT or wavelet quantized coefficients) encoded with L bits (in the encoded content) by the entropy encoding method. Entropy coding, such as Huffman coding, is usually applied to the last stage of encoding to produce encoded content. V1, V2,..., Vn are valid alternative values for V, and each such value includes a watermark signal. Each coefficient position is expressed by c (ch, f, b, co). Where ch is a channel index, f is a frame index, b is a block index, and co is a coefficient index within a block for a unit of video content. An alternative value is valid, and if this value replaces the current value, it retains compliance with the format and has no perceptual effect on the content. Furthermore, V1, V2,..., Vn use L bits as V in the encoded content. {V} indicates that the original value is optional in the embedding / insertion process. The original value can be needed in the watermark deletion process.

  The original value V can include one or more coefficients in encoded form. Once the WU is generated, if the input is encoded content such as MPEG-2 or MPEG-4, entropy coding, or VLC (Variable Length Coding), first “accesses” the coefficients. Not ", then find the appropriate location and alternative values, and store the original coefficients and these alternative values. The alternative value Vi can correspond to the same coefficient on which V is performed, but in some cases Vi can correspond to more or less coefficients than V is performed on.

  In MPEG-2, a normal 8 × 8 block for quantized DCT coefficients is shown as follows: Most of the higher order coefficients are quantized to zero.

  After performing a zigzag scan on the sequence of DCT coefficients, it is transmitted as follows.

The first DCT coefficient (12) is transmitted by a separate Huffman table. After run-level parsing, the remaining coefficients and associated zero runs are as follows:

Using the DCT coefficient table zero specified below in the MPEG-2 standard, these coefficients are encoded into 6 VLC (Variable Length Code) (in binary bit representation) as follows:

  For ease of reading, the above VLC (also referred to as an encoding code) is separated by “|”. The first and second DCT coefficients encode the run and level according to the table “MPEG-2 Encoding for Run and Level Following Escape Code” using a fixed length code, and the remaining DCT The coefficients are coded according to “MPEG-2 DCT coefficient table zero”. The last VLC is a special “end of block” code that indicates the remaining coefficients when the block is zero.

  The alternative value can be any part of the encoded bits described above. For example, one alternative value may consist of a portion of a VLC, one or more consecutive VLCs, or a portion of one VLC and the next VLC.

  In the following WU example, the alternative value consists of one VLC, which is the fifth VLC.

Each element in the above WU can be described as follows.
P0 is the start position of this block in the encoded content. “63” is a relative position to the start of this block. 7 indicates the length L, and C is composed of the following seven coefficients.

Where f is the current frame index, ch is the current channel index, and b is the current block index of this block in the example.
The size of the alternative value is 7 bits, ie L = 7.
00001010 is the original value (V) and there are three alternative values 0001110 (V1), 0001100 (V2), and 0001000 (V3). These alternative values are encoded as run and level values (see MPEG-2 DCT coefficient table zero) as follows:

  The set of runs (R) and levels (L) represents a sequence starting with R zero and followed by L. For example, the run-level set (5, 3), ie Run = 5 and Level = 3, represents 000003. Thus, the above alternative values represent the coefficients that follow before entropy coding as follows:

Since the fifth VLC is the last VLC encoding of the non-zero coefficient in this block, the alternative value does not necessarily correspond to the same coefficient encoded by V. For V2 and V3, instead of encoding the seven coefficients in V1, V2 encodes only two coefficients and V3 encodes seven coefficients.

  If the first alternative value in the WU example is selected by the watermark inserter in step 3, this block is changed to the next quantized DCT coefficient.

  Another example for encoded content is content encoded by H264 (MPEG-4Profile10). There are some significant differences in entropy coding between MPEG-2 and H264:

H264 supports both CAVLC (Context-Adaptive Variable Length Coding) and CABAC (Context-Adaptive Binary Arithmetic Coding).
• Instead of 8 × 8 DCT blocks in MPEG-2, H264 can also use 4 × 4 DCT blocks.
Unlike AVLC (Adaptive Variable Length Coding) in MPEG-2, CAVLC uses a smaller VLC table by coding levels and runs separately.
-Instead of the fixed VLC table in MPEG-2, the VLC table can be exchanged by context information.

For context-based entropy coding in H264, it is more difficult to predict the encoded value after the coefficients are changed than MPEG-2. However, for one thing, the H264 encoder can reduce such context-based encoding during encoding. For example, the encoder can use a fixed NumTrail table (NumTrail table 0) instead of a NumTrail table based on certain characteristics of adjacent blocks. In another example, a fixed length code xxxyyyy is used to encode a non-zero number (NumCoeff) and a T1 (trailing one) number for a 4 × 4 quantized DCT block. However, xxx is for non-zero (0-16) number of encodings, and yy is for T1 (0 ... 3) number of encodings. For one, it is also possible to have the encoder use only 4 × 4 blocks. In the following example, some of the rules described above are applied to encode 4 × 4 blocks.
1.4 × 4 quantized DCT coefficients:

After zigzag scanning, the coefficients of this block are:
0 3 0 1 -1 -1 0 1 0 ... 0
2. CAVLC coding consists of the following five steps: a. Encode the number of non-zero (NumCoef) and the number of T1 (5, 3). The maximum number of T1 is limited to 3. These two numbers (NumCoef and T1) are encoded into bits “0001011” by using a 17 × 4 Huffman table (see below) (NumCoef: 0-16, T1: 0-3).

        b. If present, encode the sign of T1 in reverse order (0 for positive and 1 for negative), eg, 0, 1, 1.

        c. In the reverse order, the remaining non-zero coefficients are encoded, for example, 1 and 3. The non-zero coefficients are encoded as “1” by the level VLC0 table and “0010” by the level VLC1 table, respectively.

d. Encode (TotalZero) to all zeros from the first non-zero coefficient to the last non-zero coefficient. The maximum to all zeros is 16 NumCoefs. If NumCoef is 16, TotalZero must be zero. If NumCoef is 0, no further code is needed. That is, the end of encoding for the block. In contrast to the remaining 15 cases, in each case, the Huffman table is used to encode TotalZero (see TotalZero table). In this case, TotalZero is 3, and is encoded as “1110” by the TotalZero table [NumCoef = 5].

    e. Coding all zero positions from the first non-zero coefficient to the last non-zero coefficient. In this case, all zero positions are coded to “001101”.

The last encoded bit for the 4x4 block is divided into the next 25 bits.
0001011 | 011 | 10010 | 1110 | 001101
One example of an alternative value is the encoded bits of the entire encoded 4x4 block. Another example of an alternative value may be bit coding of the T1 code, as described in step C) above. In this case, the alternative value is changed only to the sign of T1, and the total number of bits of the encoded block is not changed.

  Yet another example of encoded content is a JPEG2000 image. Instead of DCT transformation, JPEG2000 uses DWT (Digital Wavelet Transform). The DWT of the pixelated image is calculated by successively applying vertical and horizontal low-pass and high-pass filters to the image pixels. Here, the resulting value is referred to as a “wavelet coefficient”. A wavelet is an oscillating waveform that maintains only one or a few cycles. At each iteration, the wavelet coefficients that are only low-pass filtered for the previous iteration are reduced and then passed through a low-pass vertical filter and a high-bus vertical filter. The result of this process passes through the low-pass horizontal filter and the high-pass horizontal filter. The resulting set of coefficients is grouped into four “subbands”: LL subband, LH subband, HL subband, and HH subband. Each iteration corresponds to a certain “layer” or “level” of coefficients. The first layer for the coefficients corresponds to the highest resolution level for the image, while the last layer corresponds to the lowest resolution level. One example of an alternative value for a JPEG 2000 encoded image is an encoded LL subband at a particular layer (eg, the lowest resolution).

A simple way to generate a WU is to use “try and error” by performing the following steps for each WU.
a) For each entropy code (eg VLC in MPEG-2), randomly selecting a value as a candidate for an alternative value b) Formatting after the above candidates are replaced with candidates for existing values To determine whether it is a valid value by checking that If not a valid value, return to step a) c) Check the perceptual change after changing the existing value to the above candidate. If perceptual changes are acceptable, record the above candidate as an alternative value to WU. Otherwise, return to step a) Repeat the above steps until all necessary WUs are generated.

In one embodiment, the WU can be generated by an existing watermark system that operates in the transformation domain. First, the selected watermark system generates two watermark copies (A and B, both in encoded form) of the original encoded content with two different payload information. That is, the first copy includes a watermark payload where each bit is “1”, and the other copy includes a watermark payload where each bit is “0”. Steps 1 and 2 (see FIG. 1) can be performed in the following selection method, and a WU can be generated by scanning A and B until the next condition is met.
(Position selection) P1a and P2a are the start position and end position for a plurality of consecutive encoded coefficients in the encoded content A, and the same in content B in which P1b and P2b are encoded And (P2b-P2a) and (P1b-P1a) are equal (equal to length L).
(Calculation of alternative values) At least one bit for the watermark payload information is embedded in the encoded coefficients (both A and B). In the following method, one watermark unit (P, L, C, V, V1, V2) is recorded. P = P1a, L = P2a−P1a, where V is not usable, V1 is a value from position P1a to position P2a in A, and V2 is a value from position P1b to position P2b in B.
Repeat the second step above to select N watermark units.

In an alternative embodiment, the watermark payload bits are encoded as a relationship between two selected quantization coefficients at intermediate frequencies. By scanning the encoded content, the watermark units (P, L, C, V, V1, V2,..., Vn) are set and determined by the following conditions.
V includes a plurality of consecutive, encoded coefficients, and at least one relationship between these coefficients and / or within these coefficients (relationship type / category is predefined) There is). For example, if C1, C2 are two consecutive embedded coefficients, and there is a relationship, C1> C2 + T. However, T is a threshold that can be used to adjust the strength of the relationship, and further determines the watermark robustness.
According to the perceptual model of the watermark system, the coefficients can be changed to establish another relationship without perceptual change of content. For example, C1 and C2 are changed to C1 ′ and C2 ′, respectively, so as to form the reverse relationship, that is, C1 ′ <C2 ′. Record the new value including C1 ′ and C2 ′ as the alternative value Vi (1 <= i <= n). Repeat this step until all alternative values are found.
Repeat the above steps to select N watermark units. Ideally, the first N watermark units that contain the largest coefficients are selected so that the largest relationship can potentially be established within each watermark unit. In the referenced watermarking system, one relationship represents one bit of the watermark payload, so the watermark unit with the largest relationship has the highest possibility of embedding more bits for the watermark payload. be able to.

  In yet another example of a watermark system, the watermark payload bits are encoded as a relationship between pixel values or unique values for the two sets of DCT / wavelet coefficients. Typical examples of parameters include average luminance, average color histogram distribution, or energy in certain frequency subbands.

  One principle of the present invention is for pre-processed encoded content, generating an alternative value that includes a watermark signal. These alternative values will later be used to replace well-defined parts of the encoded content. Existing watermark systems can be applied to pre-processing (ie, step 1 and step 2) and actual insertion (step 3), but new watermark algorithms can be developed for the aforementioned scheme. it can.

  A simple and basic watermark detection method correlates the coefficients in the watermarked content with the alternative values of the WU to find an alternative value that best fits the current coefficient. In order to perform such a correlation, the alternative value needs to be decoded using a corresponding entropy encoder. Each of the alternative values of WU may include a watermark signal corresponding to the watermark payload information. By finding an alternative value that matches in all WUs, the watermark payload information can be extracted. Watermark detection is performed at multiple levels. In the first level, request the P, L and C elements of the WU. Let N be the number of WUs. For each WU, a coefficient value is obtained according to the overall coefficient index C. If the input content is encoded in a format different from the format used for baseband or watermark embedding, the content is first converted to the same encoding format as watermark embedding. The bits in the watermark payload row are detected from the relationship between the coefficients, the relationship among the coefficients, or the relationship between the pixel values or the parameter values of the coefficient values.

  FIG. 3 shows a flowchart of watermark detection according to the present invention. In 305, the index is initialized. At 310, an “N” watermark unit is accepted and received, and at 315, suspicious content is received. At 320, the indicator is tested to determine if all watermarks have been processed or detected. If the index is greater than the watermark number “N”, the process ends. If the index is smaller than the number of watermarks “N”, the process proceeds to 325 and a coefficient is obtained. At 330, the value of the bit is detected according to the relationship between the coefficients, the relationship among the coefficients. The index is updated at 335 and processing continues at 320.

  When a very weak relationship is detected from a WU, other elements V and V1, V2,..., Vn of that WU may be accessed to provide additional information for determining the relationship. Useful. The relationship is determined by correlating the current coefficients with the coefficients encoded with V, V1, V2,. The maximum correlation is the correlation that shows the best fit between the current coefficient and one of V, V1, V2,..., Vn. That is, the maximum correlation between the current coefficient and the coefficient encoded with Vi (1 ≦ i ≦ n) indicates a match. For suspicious content, the original content is required by further analysis and correlation.

  Another method using a WU to distribute copyrighted content is to use the WU to restore content that has been corrupted before playback. In such a case, the encoded content delivered to the playback / rendering device is explicitly corrupted either in the format / structure (invalid format) or in the content (lower content). For content whose format has been altered, the decoder cannot decrypt the content. When the tampering is applied to the content, the content is decrypted and played, but the tampered portion of the content has various visible artifacts such as noise, warnings, random patterns and the like.

  To generate content with an altered format, the L bit is swapped with the given watermark unit (P, L, V, V1, V2,..., Vn) starting with the encoded content P. Deliver with random values. Assuming that random values corrupt the format, we exclude random values that are valid entropy codes. In order to derive visual artifacts for content or low-level content, a valid alternative value is selected, which is not the original value V and all other alternative values V1, V2,..., Vn. , It replaces the current value of the encoded content. An example with a corrupted format and poor quality is a measure against a particular device or a category of devices used that fall under copyright infringement of content. Alternative values for corrupted format and low-level content are selected for replacement for a particular watermark payload that identifies the device or category of device.

  If the WU is known, the watermark can be deleted by simply restoring the original value V of each WU into the content. In order to overwrite the existing watermark on the encoded content, select an appropriate value from V1, V2,..., Vn of each WU according to the payload information to include the existing watermark of the encoded content Replace with value. Deletable watermarks are useful for some applications that support multiple generations of watermarks. An example of multiple generations of watermarks is the incorporation of farensic marks at each step of content post-processing. In order to avoid the accumulation of perceptual degradation potentially guided by multiple watermarks, it is desirable to delete some or all existing watermarks before new watermarks are incorporated. FIG. 4 shows an example of a watermark insertion device in the playback device. The watermark insertion device incorporates the watermark by replacing some values / coefficients of the encoded content received at the device with alternative values specified by the WU. The replaceable watermark is useful for switching the copy protection state of copyrighted content. For example, for a content unit having watermark information indicating “one copy”, it is desirable to change the watermark information from “one copy” to “cannot copy” after one copy. There are several ways to avoid potential collisions of multiple watermarks (eg, an interface between multiple watermarks). One way is to use a unique subband for each generation of watermarks. Another way is to select the WU at a different location from the previous watermark.

  It should be understood that the present invention can be implemented by hardware, software, firmware, application specific processors, or combinations thereof. Preferably, the present invention is implemented by a combination of hardware and software. Furthermore, the software can be preferably implemented as an application program stored in the program storage device. The application program is uploaded and executed by some appropriately structured machine. Preferably, the machine is implemented on a computer having hardware such as one or more central processing units (CPUs), random access memory (RAM), input / output interfaces (I / O), and the like. The various processes and functions disclosed herein can be part of microinstruction code or part of an application program (or a combination thereof), which is executed via an operating system. In addition, various peripheral devices such as additional data storage devices and printing devices can be connected to the computer platform.

Some of the system configuration requirements, the method steps illustrated at the same time, are preferably implemented in software, and the actual connection between the system configuration requirements (or method steps) depends on the method in which the invention is programmed. Please understand that it is not. The teachings provided herein can be contemplated by those skilled in the art with the same implementation or configuration as the present invention.
(Appendix 1)
A method of inserting a watermark in encoded content,
Receiving the encoded content;
Receiving watermark data that has been encrypted with a watermark key and preprocessed;
Directly replacing the number of bits starting at a position with one of the alternative values, the alternative value having an embedded watermark signal and a plurality of alternative values specified in the watermark data A method comprising: a step selected from:
(Appendix 2)
The method of claim 1, wherein the number of bits is specified in the watermark data.
(Appendix 3)
The method of claim 1, wherein the position is specified in the watermark data.
(Appendix 4)
A system for inserting watermarks in encoded content,
Means for receiving the encoded content;
Means for receiving pre-processed watermark data encrypted with a watermark key;
Means for directly replacing the number of bits starting at a position with one of the alternative values, the alternative value having an embedded watermark signal and a plurality of alternative values specified in the watermark data A system comprising: means selected from:
(Appendix 5)
The system according to claim 4, wherein the number of bits is specified in the watermark data.
(Appendix 6)
The system according to claim 4, wherein the position is specified in the watermark data.
(Appendix 7)
The system is a playback device that receives the encoded content and the watermark data, and the encoded content and the watermark data are stored as part of the encoded content. 5. The system according to appendix 4, wherein the system is stored as metadata and stored in a directory.
(Appendix 8)
A method of inserting a watermark in encoded content,
Receiving the encoded content;
Receiving watermark data that has been encrypted with a watermark key and preprocessed;
Receiving a series of bits including watermark payload information;
Performing one of the direct replacement of the number of bits starting at a position with one of the alternative values, and changing the number of bits starting at the position based on the bit value of the series of bits of the watermark payload information And wherein the alternative value comprises an embedded watermark signal and is selected from a plurality of alternative values specified in the watermark data. .
(Appendix 9)
A system for inserting watermarks in encoded content,
Means for receiving the encoded content;
Means for receiving pre-processed watermark data encrypted with a watermark key;
Means for receiving a series of bits including watermark payload information;
Performing one of the direct replacement of the number of bits starting at a position with one of the alternative values, and changing the number of bits starting at the position based on the bit value of the series of bits of the watermark payload information And the alternative value includes an embedded watermark signal and is selected from a plurality of alternative values specified in the watermark data. .
(Appendix 10)
A method of replacing watermarks in encoded content,
Receiving the encoded content;
Receiving watermark data that has been encrypted with a watermark key and preprocessed;
Replacing the number of bits starting at a position of the encoded content with a value, the value being specified in the watermark data, the position being specified in the watermark data, and the value being: An alternative value selected from a plurality of alternative values specified in the watermark unit, and the selected alternative value forms a watermark different from the replaced watermark; A method characterized by comprising:
(Appendix 11)
A system for replacing watermarks in encoded content,
Means for receiving the encoded content;
Means for receiving pre-processed watermark data encrypted with a watermark key;
Means for replacing the number of bits starting at a position of the encoded content with a value, the value being specified in the watermark data, the position being specified in the watermark data, the value being: Means for forming an alternative value selected from among a plurality of alternative values specified in the watermark unit, and the selected alternative value forms a watermark different from the replaced watermark; A system characterized by comprising:
(Appendix 12)
A method for detecting a watermark,
Receiving preprocessed watermark data; and
Receiving watermarked content; and
Detecting a plurality of coefficient values from the watermarked content;
From the coefficient value, the current coefficient value is correlated with a plurality of coefficient values encoded in the at least one watermark unit, and the bit value of the watermark detected by determining the most suitable match is obtained. And a step of detecting.
(Appendix 13)
The method of claim 12, wherein the bit value is detected from the plurality of coefficient values according to a relationship between the coefficient values and a relationship among the coefficient values.
(Appendix 14)
14. The method of claim 13, wherein the relationship is weak and correlates current coefficient values to determine a match from among the plurality of coefficients encoded in the watermark data.
(Appendix 15)
A system for detecting a watermark,
Means for receiving preprocessed watermark data;
Means for receiving watermarked content;
Means for detecting a plurality of coefficient values from the watermarked content;
From the coefficient value, the current coefficient value is correlated with a plurality of coefficient values encoded in the at least one watermark unit, and the bit value of the watermark detected by determining the most suitable match is obtained. And a detecting means.
(Appendix 16)
The system of claim 15, wherein the bit value is detected from the plurality of coefficient values according to a relationship between the coefficient values and a relationship among the coefficient values.
(Appendix 17)
The system according to claim 16, wherein the relationship is weak and a current coefficient value is correlated to determine a match from among the plurality of coefficients encoded in the watermark data.
(Appendix 18)
A method of generating a watermark unit, executed in a pre-processing device,
Selecting a position where a value in the encoded content is replaced by an alternative value;
Calculating a plurality of alternative values for each selected position, each of the alternative values including a watermark signal, having the same number of bits as the value replacing the alternative value; and The replacement comprises the steps of: not making a perceptual change to the encoded content and not having a format that does not conform to the encoded content.
(Appendix 19)
An apparatus for generating a watermark unit, which is pre-processing,
Means for selecting a position where the value in the encoded content is replaced by an alternative value;
Means for calculating a plurality of alternative values for each selected position, each of said alternative values including a watermark signal, having the same number of bits as said value replacing said alternative value; and The replacement is provided with means for preventing a perceptual change from the encoded content and not having a format that does not conform to the encoded content.
(Appendix 20)
The method of claim 18, wherein the alternative value is an alternative value that causes the least perceptual change.
(Appendix 21)
The apparatus of claim 19, wherein the alternative value is an alternative value that does not cause the most perceptual change.
(Appendix 22)
Means for storing the encoded content;
Means for storing an encrypted watermark unit.
(Appendix 23)
The apparatus according to claim 22, wherein the watermark unit is metadata of the encoded content.
(Appendix 24)
The apparatus according to claim 22, wherein the watermark unit is a steganographic data hidden in a syntax element or content.
(Appendix 25)
25. The apparatus according to appendix 24, wherein the watermark unit is controlled by a key.
(Appendix 26)
The apparatus according to appendix 22, wherein the watermark unit is stored as a separate file.
(Appendix 27)
The apparatus according to appendix 22, wherein the watermark unit is one of an optical disc, a tape, and a hard drive.
(Appendix 28)
Means for transmitting the encoded content;
An apparatus comprising: means for transmitting encrypted watermark data.
(Appendix 29)
29. The apparatus according to appendix 28, wherein the watermark data is metadata of the encoded content.
(Appendix 30)
29. The apparatus according to claim 28, wherein the watermark data is steganographic data hidden in a syntax element or content.
(Appendix 31)
The apparatus according to appendix 30, wherein the watermark data is controlled by a key.
(Appendix 32)
29. The apparatus according to appendix 28, wherein the watermark data is transmitted as a separate file multiplexed with the encoded content.
(Appendix 33)
29. The apparatus according to appendix 28, wherein the watermark data is encrypted and transmitted via a separate channel.

Claims (8)

A method of inserting a watermark into encoded content,
Randomly selecting values as alternative value candidates;
If the alternative value of the candidate follows the encoded content format, and if the alternative value of the candidate does not introduce a perceptual artifact in the encoded content when replaced with the original value , Recording the alternative value of the candidate against a watermark unit;
Accessing the watermark unit having a location and the alternative value relative to the original value in the content encoded at the location, derived by encoding the alternative value by entropy encoding. the number of coefficients, that is different from the number of coefficients derived by encoding by entropy encoding the original value, the steps of the access was,
And the replacement value and replacement Ru steps in the watermark unit the original values starting from said position,
Said method.   The method of claim 1, wherein the watermark unit is integrated into the encoded content.   The watermark unit is (a) metadata of the encoded content, (b) multiplexed with the encoded content, (c) a syntax element or a form of content within the encoded content The method of claim 2, wherein the method is any one of those hidden as steganographic data.   The method of claim 1, wherein the watermark unit is in the form of a separate file. A device for inserting a watermark into encoded content,
Means for randomly selecting values as alternative value candidates;
If the alternative value of the candidate follows the encoded content format, and if the alternative value of the candidate does not introduce a perceptual artifact in the encoded content when replaced with the original value , Means for recording an alternative value of the candidate to a watermark unit;
Means for accessing said watermark unit having a location and said alternative value relative to the original value in the content encoded at said location, derived by encoding said alternative value by entropy coding the number of coefficients, that is different from the number of coefficients derived by encoding by entropy encoding the original value, and means for the access and,
And the replacement value and replacement Ru means in said watermark unit to the original value to be initiated from the position,
Including the device.   The apparatus of claim 5, wherein the watermark unit is integrated within the encoded content.   The watermark unit is (a) metadata of the encoded content, (b) multiplexed with the encoded content, (c) a syntax element or a form of content within the encoded content 7. The apparatus of claim 6, wherein the apparatus is any one of those hidden as steganographic data.   The apparatus of claim 5, wherein the watermark unit is in the form of a separate file.

Images