Publication number | US20010016052 A1 |

Publication type | Application |

Application number | US 09/817,422 |

Publication date | Aug 23, 2001 |

Filing date | Mar 26, 2001 |

Priority date | Jun 26, 1998 |

Also published as | CA2336099A1, EP1108288A1, EP1108288A4, US6263087, US6438252, WO2000001076A1, WO2000001076A8 |

Publication number | 09817422, 817422, US 2001/0016052 A1, US 2001/016052 A1, US 20010016052 A1, US 20010016052A1, US 2001016052 A1, US 2001016052A1, US-A1-20010016052, US-A1-2001016052, US2001/0016052A1, US2001/016052A1, US20010016052 A1, US20010016052A1, US2001016052 A1, US2001016052A1 |

Inventors | Matthew Miller |

Original Assignee | Nec Research Institute, Inc. |

Export Citation | BiBTeX, EndNote, RefMan |

Referenced by (13), Classifications (21), Legal Events (6) | |

External Links: USPTO, USPTO Assignment, Espacenet | |

US 20010016052 A1

Abstract

A message in the form of a sequence of bits is encoded into relatively short, non-binary signals. The message (or vector) is divided into two halves. The encoder first determines an encoding of the message into a vector half the length of the eventual encoded vector. The half-length vector forms the first half of the encoded, and is negated to form the second half of the encoded vector. An identical synchronization signal is added to both halves of the encoded vector. The synchronization signal is used to compensate for the possibility that the received vector (or message) is cyclically rotated from the original vector. During decoding, the decoder first obtains the synchronization signal by adding the two halves of the vector together, canceling the encoded message. The synchronization signal is used to find the original cyclical shift of the vector. The decoder obtains the half-length encoded message vector by taking the difference between the two halves of the aligned full-length encoded vector. After decoding the vector into a bit sequence, the encoder re-encodes that bit sequence and compares the resulting vector with the original vector to determine whether the original vector truly encoded a message or was simply a noise signal.

Claims(68)

a) expanding the sequence of bits to obtain an expanded sequence of bits;

b) modulating the expanded sequence of bits to obtain a modulated vector;

c) appending the negation of the modulated vector to the modulated vector to obtain a double-length modulated vector, and

d) adding a synchronization signal to both the modulated vector and the negation of the modulated vector of the double-length modulated vector to obtain an encoded vector.

claim 1

claim 1

claim 3

claim 4

claim 4

claim 1

claim 7

claim 7

claim 1

claim 10

claim 10

a) averaging the first half of the received vector with the second half of the received vector to obtain a received synchronization vector;

b) determining an amount by which the received synchronization vector must be shifted to obtain the best match with a reference synchronization vector;

c) shifting the received vector by the determined amount to obtain an aligned received vector, and

d) demodulating the aligned received vector to obtain the sequence of bits.

claim 13

claim 13

claim 13

claim 13

claim 13

claim 18

claim 18

claim 20

claim 20

claim 18

claim 23

claim 24

claim 23

claim 18

a) decoding a received vector to obtain a received message;

b) encoding the received message to obtain an encoded vector, and

c) comparing the received vector with the encoded vector to determine whether the received vector encodes a message.

claim 28

claim 28

claim 30

claim 30

claim 30

claim 30

claim 30

claim 35

claim 35

claim 37

claim 37

claim 35

claim 40

claim 41

claim 42

claim 40

claim 35

claim 45

claim 28

claim 47

claim 47

claim 49

claim 50

claim 47

claim 52

claim 47

claim 54

claim 54

claim 28

claim 28

claim 58

claim 28

claim 60

claim 28

claim 62

a) modulating the sequence of bits to obtain a modulated vector;

b) appending the negation of the modulated vector to the modulated vector to obtain a double-length modulated vector, and

c) adding a synchronization signal to both the modulated vector and the negation of the modulated vector of the double-length modulated vector to obtain an encoded vector.

claim 64

claim 64

claim 66

claim 66

Description

[0001] The present invention relates to digital watermarking of data including image, video and multimedia data. Specifically, the invention relates to a method for encoding messages into relatively short, non-binary signals. It further relates to a method for decoding the messages from signals while simultaneously distinguishing signals that include encoded messages from signals that are simply noise. It is intended for application in storing information into media watermarks, but it also has application in other areas.

[0002] U.S. patent application Ser. No. 08/534,894, filed Sep. 28, 1995, entitled “Secure Spread Spectrum Watermarking in Multimedia Data”, and U.S. patent application Ser. No. 08/746,022, filed Nov. 5, 1996, entitled “Digital Watermarking”, which are both incorporated herein by reference, describe methods of hiding and detecting relatively short, possibly non-binary vectors, or “watermarks”, in various kinds of media, such as images, audio sequences, and video clips. Such methods are also described in article by Cox et al. entitled “Secure Spread Spectrum Watermarking for Images, Audio and Video” in Proc. IEEE Int. Conf. On Image Proc, ICIP '96, Lausanne, 1996, vol. III, pp. 243-246. The detection methods described in those inventions and in the Cox et al. article are capable of testing for the presence or absence of only one such hidden vector or watermark at a time. In applications where a given portion of media contains more than one hidden vector, each encoding a different message, the detector must sequentially test for each possible vector and identify the one that is most likely. This is feasible for small numbers of possible messages, but becomes too costly when the number of messages becomes large.

[0003] If the data hiding methods referred to above are to be used for messages of more than a small number of bits, such as 4, then methods must be devised for a) encoding bit sequences into vectors suitable for data hiding, b) decoding vectors that are extracted from portions of media, and c) determining whether such extracted vectors represent true hidden data or are merely noise signals. These problems are analogous to those found in transmitting data across noisy channels, where the vectors that are hidden in images are analogous to the modulated signals sent across the channels. Because of this analogy, the terms “vector” and “signal” will be used interchangeably.

[0004] Standard methods of transmitting binary messages across possibly noisy channels involve two basic steps at the transmitter. First, the message is encoded with an error-correction code. This increases the number of bits in the message, introducing a pattern of redundancy that can be exploited at the receiver to correct errors resulting from noise in the channel. Second, the expanded message is modulated into a signal with physical characteristics suitable for transmission over the channel, by, for example, modulating the amplitude of a carrier signal (AM), modulating the frequency of a carrier signal (FM), or spread-spectrum coding. While standard error-correction codes are directly suitable for the coding of messages for the watermarking methods referred to above, the standard methods of modulation are not so well suited. Since they encode bits sequentially, they have difficulty encoding more than a small number of bits into the relatively short vectors used in electronic watermarks. For example, consider coding 32 bits into a watermark vector of length 64. Each bit would be coded with only two samples, which is not enough to reliably carry information using AM, FM, or spread-spectrum techniques.

[0005] An alternative method of converting the error-correction-encoded bits into a vector suitable for a watermark is to treat each bit as a separate channel in a multi-channel communications system. In such a system, each channel is assigned a separate carrier or spread-spectrum signal, and the modulated messages for all the channels are added together into a single signal. At the receiver, separate correlations are performed for each of the channels, and the correlations are compared against a threshold, to obtain each of the transmitted messages in parallel.

[0006] The multi-channel approach can be applied to watermarking by assigning a separate “reference signal” to each bit. These reference signals are designed to have low correlation with one another. The watermark is constructed by either adding or subtracting each reference signal according to whether the corresponding bit is 1 or 0, respectively. Alternatively, the watermark might be constructed by either adding or not adding each reference signal according to whether the corresponding bit is 1 or 0, respectively. Watermarks are decoded by computing their correlations with the reference signals, and comparing the correlations with a pair of thresholds to determine whether the corresponding bits are 1 or 0. Approaches of this type have been applied to watermarking in, for example, the following publications: Swanson, et al., entitled “Robust Data Hiding for Images” in Proc. IEEE Digital Signal Processing Workshop, Loen, Norway, Sept., 1996; Hartung, et al., entitled “Digital Watermarking of Raw and Compressed Video” in Digital Compression Technologies and Systems for Video Communications, Oct. 1996; and Smith, et al., entitled “Modulation and Information Hiding in Images” in Proc. Int. Workshop on Information Hiding, May 1996.

[0007] A principal problem with these approaches is that they are limited to only one type of detection region for the possible watermarks. In the prior art, the region of watermark space that is decoded to a given bit sequence results in detection regions that are all planes, intersecting at right angles. Such a rectangular detection region is appropriate for many data transmission systems, but for some systems, other shapes of detection regions are desirable. This is particularly true of watermarking.

[0008] The present invention solves the problem of hiding messages of 8 or more bits into media. The invention provides a method of encoding a message, described as a sequence of a given number, B, of bits, into a vector suitable for hiding in media by means of the data hiding methods referred to above. This encoding method is a procedure by which one of 2^{B }possible vectors is generated. The invention further provides a method of decoding a given, possibly distorted, vector into the sequence of B bits that is most likely encoded by the bit sequence. Finally, the invention also provides a method for quickly deciding whether a given vector is one of the 2^{B }vectors that can be generated by the encoding process, or whether the vector is simply a noise signal. This last feature of the invention is important in deciding whether or not a given piece of media contains hidden information at all.

[0009] The detection regions (described below) employed in the detection of hidden data can be fairly arbitrary when practicing the present invention.

[0010] While the present invention solves the problem of hiding messages in media, it has application in other areas as well. In particular, the invention is suitable for use in any application where rectilinear detection regions are sub-optimal.

[0011] A primary object of the invention is a decoder which, after decoding a vector into a bit sequence, re-encodes that bit sequence and compares the resulting vector with the original vector to determine whether the original vector truly encoded a message or was simply a noise signal. A principal advantage of this approach is that it allows any type of comparison test to be performed, resulting in any shape of detection region. By proper design of the comparison test, an optimal detection region can be created.

[0012] A second object of the invention is a method of adding and using a synchronization signal to the encoded vector without disturbing the detectability of the encoded message. The synchronization signal is used to compensate for the possibility that the received vector is cyclically rotated from the original. The method splits the vector into two halves. During encoding, the encoder first determines an encoding of the message into a vector half the length of the eventual encoded vector. This half-length vector forms the first half of the encoded vector, and is negated to form the second half of the encoded vector. Then the encoder adds an identical synchronization signal to both halves of the encoded vector. During decoding, the decoder first obtains the synchronization signal by adding the two halves of the vector together, canceling the encoded message. The synchronization signal is used to find the original cyclical shift of the vector. Then the decoder obtains the half-length encoded message vector by taking the difference between the two halves of the aligned, full-length encoded vector.

[0013] Further objects of the invention will become more clearly apparent when the following description is read in conjunction with the accompanying drawing.

[0014]FIG. 1 shows detection regions for four possible two-bit messages that are created by prior-art methods of detecting signals.

[0015]FIG. 2 shows set of detection regions that are more desirable than those of FIG. 1, and that are possible when using the present invention.

[0016]FIG. 3 shows an alternative set of detection regions that are more desirable than those of FIG. 1, and that are possible when using the present invention.

[0017]FIG. 4 is a data flow diagram for a preferred method of encoding a message into a signal according to the present invention.

[0018]FIG. 5 is a data flow diagram for a preferred method of decoding a message according to the present invention.

[0019] Referring now to the figures and to FIG. 1 in particular, there is shown detection regions created by separate thresholding of the correlations between separate, orthogonal reference signals and a received signal, as is the case in many prior-art systems. The figure shows a slice of high-dimensional space in which every vector corresponds to a possible received signal. The X- and Y-axes (**101**,**102**) represent two orthogonal reference signals used to encode two bits. If it is assumed that the transmitter sends each bit using a predetermined amplitude of the reference signals, then it is possible to identify four possible combined signals that might be sent, depending on whether the message is 00, 01, 10, or 11. These four vectors are represented, respectively, by the four dots in the figure (**103**,**104**,**105** and **106**). The received vector is decoded by computing its correlation with each of the two reference signals. If the correlation with the low-order bit reference signal, i.e. the X axis **101**, is above a threshold **107**, then the low-order bit is 1. If it is below a threshold (**108**), then the low-order bit is 0. If it is between the thresholds **107** and **108**, then the low-order bit cannot be determined and the received signal is assumed to be noise. Likewise, the correlation with the high-order bit reference signal, i.e. the Y-axis (**102**), is compared against two thresholds **109** and **110**, to determine whether the high-order bit is 1, 0, or indeterminate. The resulting four detection regions are shown in gray (**111**,**112**,**113** and **114**).

[0020] The detection regions of FIG. 1 are suitable for systems that satisfy two criteria: a) the dimensionality of the space is significantly larger than the number of bits in the messages, and b) the distribution of noise vectors that might be added to a watermark vector is rotationally symmetric around that vector. In such a system, the noise vectors are expected to be orthogonal to all the reference signals, so they will not change the correlations between the resulting, received signals and the reference signals. However, in watermarking with relatively short vectors, neither of these criteria applies. As a result, detection regions of different shapes are more suitable.

[0021] Consider, first, systems in which the number of bits is close to or equal to the dimensionality of the space (i.e. the number of elements in the watermark vector). In such cases, noise vectors cannot be expected to have low correlations with all the reference signals. This means that a given noise vector will be likely to change the correlation between the received vector and at least one of the reference signals, and the change in correlation will often be enough to cross the threshold for the corresponding bit. A preferable set of detection regions for such a system is shown in FIG. 2. Here, there is a separate detection threshold (**201**,**202**,**203** and **204**) for each of the four possible messages. A noise vector added to a given combined signal is likely to be orthogonal to that one combined signal, and, hence, unlikely to change the correlation between the received signal and the combined signal. Thus, it is unlikely to cross the threshold for that message.

[0022] Next, consider systems in which the distribution of noise vectors is not rotationally symmetric. The distribution of noise vectors applied to watermarks in images and other media can be highly asymmetric, and the best detection region to use for a single watermark is a hyperboloid. It follows that the best set of detection regions to use for a set of different possible watermarks is a set of different hyperboloids. Such detection regions are shown in FIG. 3.

[0023] Using the present invention, it is possible to obtain the detection regions shown in FIGS. 2 and 3, as well as other detection regions not specifically described here.

[0024]FIG. 4 is a data flow diagram of a preferred method of encoding a message into a signal according to the present invention. A message comprising a given number, B, of bits is provided to the encoder **401**. The first step is to append a constant bit to the message **402**. This bit always has a constant value, for example 1, and will be used during decoding to correct for errors that might flip all of the bits. The resulting, B+1 bit message is expanded by means of an error-correction encoder **403**, which adds a number, P, of redundant parity bits. In the preferred embodiment, this expansion is performed by a Hamming code, but other codes, such as BCH, Reed-Solomon, or Convolutional codes, can also be used. The P+B+1 bits that are output from the error-correcting encoder are then sent to modulator **404**. The modulator constructs a vector V′, of length 2L, by the following procedure:

[0025] 1. Convert the P+B+1 bits into a column vector, D, of length P+B+1 in which each element is either a 1 or a −1 according to whether the corresponding bit is a 1 or a 0.

[0026] 2. Multiply D by a “modulation matrix”, M, of size L rows by P+B+1 columns, to obtain a length L column vector, V. The exact design of M is generally arbitrary, except that its columns should have low correlation with one another. In the preferred implementation, the columns of M are chosen to have zero correlation with one another.

[0027] 3. Create a length 2L column vector, V′, by appending the negation of V onto the end of V. That is

[0028] Finally, a synchronization signal **405**, is added **406** to V′ to obtain the final, encoded vector **407**. The synchronization signal **405** is a column vector, S′, of the form

[0029] where S is a column vector of length L that has good auto-correlation properties.

[0030] In alternative implementations, either one or both of the steps of appending a constant bit **402** and expanding the message by use of an error-correction encoder **403** may be eliminated. In such case, the length of the column vector, D, and the size of the modulation matrix, M, must be changed accordingly.

[0031] The output of the encoding process of FIG. 4 is an encoded vector that can be hidden in media using any of a variety of data hiding techniques. When the hidden data is to be detected, the data hiding technique first applies a procedure to extract a vector from the media. Then, rather than applying the test of the data hiding technique for the presence of a given watermark, the extracted vector is passed to the decoder of the present invention, as described below.

[0032]FIG. 5 is a data flow diagram of a preferred method of decoding vectors according to the present invention. A vector, R, is provided to decoder **501**. This vector might be an output of the above-described encoder plus some noise resulting from a data-hiding process and/or other degradations, or the vector might be purely random. The function of the decoder is to determine whether R contains an encoded message, and, if so, to decode that message into a sequence of bits. In the figure, the first sequence of steps **503**,**504**,**505** and **506** is concerned with identifying the most likely message that might have been encoded in R. The remaining steps **507** and **508** are concerned with determining whether R actually contains that encoded message.

[0033] The first step in decoding the input vector is to align R with a synchronization signal **502**. This is performed by the synchronizer **503**. This step is required because the data hiding process that was used might result in extracted vectors that are cyclically shifted from their original, embedded form. Synchronization is performed by the following steps:

[0034] 1. Assuming that R is an encoded message plus some noise, obtain a version of the half-length synchronization signal, S, by dividing R into two halves and averaging the halves together. Thus, we assume that

[0035] cyclically shifted by an unknown amount, where N=[N_{0} ^{T},N_{1} ^{T}]^{T }is a random noise vector. The vectors S′ and V′ are as defined above. By splitting R into two halves and averaging both halves, we obtain

*S* _{R}=(*S+V+N* _{0} *+S−V+N* _{1})/2=(2*S+N* _{0} *+N* _{1})/2*≅S *

[0036] cyclically shifted by an unknown amount.

[0037] 2. Find the cyclical rotation of S_{R }that has the highest correlation with S. Cyclically rotate R by the same amount to obtain the aligned version, R_{A}.

[0038] If R is an encoded message plus some noise, then the result of synchronization, R_{A}, is either aligned with the original, encoded message, or it is cyclically shifted by L. Thus, we have either

[0039] The next step is to demodulate the synchronized signal (**504**) to obtain P+B+1 bits. Demodulation is performed by the following steps:

[0040] 1. Obtain a version of the half-length modulated P+B+1 bits, V, by dividing R_{A }into two halves and averaging the first half with the negation of the second half. Thus, if R_{A }is an encoded message, we have either

*V* _{R}=(*S+V+N* _{0} *−S+V−N* _{1})/2=(2*V+N* _{0} *−N* _{1})/2≅*V *

[0041] or

*V* _{R}=(*S−V+N* _{0} *−S−V−N* _{1})/2=(−2*V+N* _{0} *−N* _{1})/2*≅−V *

[0042] depending on whether R_{A }is cyclically shifted by L.

[0043] 2. Multiply V_{R }by the inverse of M and threshold the result on 0 to obtain P+B+1 bits. Thus, wherever the result of this multiplication is greater than 0, we assign 1 to the corresponding bit. Wherever it is less than 0, we assign 0 to the corresponding bit.

[0044] If R_{A }is an encoded message plus some noise, then the results of demodulation will be a reconstruction of the original P+B+1 bits, with some possible errors. The noise might cause some number of bits to be flipped. The possible cyclical shift by L might cause all the bits to be flipped.

[0045] The P+B+1 demodulated bits are then sent as input to the error-correction decoder **505**. The decoder decodes the demodulated bits into B+1 bits. In the preferred embodiment, a Hamming decoder is used, but other error-correction decoders, such as BCH, Reed-Solomon or Convolutional decoders, might be used. However, if the encoder did not perform an error correction encoding step, then the error correction decoding step **505** is eliminated.

[0046] The final step in determining the most likely message encoded in R is to decide whether all the bits should be flipped to correct for the possibility that R_{A }is cyclically shifted by L, which results in R_{A }having the wrong sign. This step is performed by the sign corrector **506**, which checks whether the constant bit added by the encoder was decoded as having the correct, constant value. For example, if the encoder always sets the constant bit to 1, but the bit has been decoded as 0, then all the bits must be flipped. The sign corrector **506** strips the constant bit after performing the correction. The output of the sign corrector **506** is the decoded message bits that are output from the decoder **510**. However, if the encoder did append a constant bit to the message, then the sign correction step **506** is eliminated.

[0047] To decide whether R contains an encoded message, the output of sign corrector **506** is sent to re-encoder **507**. Re-encoder **507** reproduces the encoding process of FIG. 4 in its entirety. The output of the re-encoder is the vector that would be used to encode the bits that are most likely encoded in R. This vector is then sent to comparator **508**, which compares the vector with R using a test that results in the desired shape of detection region. In the preferred embodiment, the test is the hyperbolic test shown in FIG. 3. However, a wide variety of other tests are possible, including, but not limited to, thresholding on correlation (as shown in FIG. 2), on normalized correlation, or on correlation coefficient. The output of the comparator **509** is one bit indicating whether or not the decoded message **510** should be considered a true message or just the result of a noise signal.

[0048] While there has been described and illustrated preferred methods of encoding messages into and decoding messages from signals, it will be apparent to those skilled in the art that variations and modifications are possible without deviating from the broad teachings and spirit of the present invention which shall be limited solely by the scope of the claims appended hereto.

Referenced by

Citing Patent | Filing date | Publication date | Applicant | Title |
---|---|---|---|---|

US7356159 * | Jan 15, 2004 | Apr 8, 2008 | Victor Company Of Japan, Ltd. | Recording and reproduction apparatus, recording and reproduction method, recording and reproduction program for imperceptible information to be embedded in digital image data |

US7373513 * | Mar 16, 2001 | May 13, 2008 | Digimarc Corporation | Transmarking of multimedia signals |

US7454035 | Feb 24, 2006 | Nov 18, 2008 | Digimarc Corporation | Digital watermarking systems and methods |

US7532740 | Mar 27, 2007 | May 12, 2009 | Digimarc Corporation | Method and apparatus for embedding auxiliary information within original data |

US7587063 * | Feb 16, 2006 | Sep 8, 2009 | Academia Sinica | Asymmetric subspace watermarking |

US7958359 | Apr 30, 2001 | Jun 7, 2011 | Digimarc Corporation | Access control systems |

US8891814 * | Jun 7, 2012 | Nov 18, 2014 | International Business Machines Corporation | Systems and methods for metadata embedding in streaming medical data |

US8959352 * | May 13, 2008 | Feb 17, 2015 | Digimarc Corporation | Transmarking of multimedia signals |

US20010044899 * | Mar 16, 2001 | Nov 22, 2001 | Levy Kenneth L. | Transmarking of multimedia signals |

US20040146180 * | Jan 15, 2004 | Jul 29, 2004 | Victor Company Of Japan, Ltd. | Recording and reproduction apparatus, recording and reproduction method, recording and reproduction program for imperceptible information to be embedded in digital image data |

US20050008190 * | May 11, 2004 | Jan 13, 2005 | Levy Kenneth L. | Digital watermarking systems and methods |

US20080279536 * | May 13, 2008 | Nov 13, 2008 | Levy Kenneth L | Transmarking of multimedia signals |

US20120281894 * | Jun 7, 2012 | Nov 8, 2012 | International Business Machines Corporation | Systems and Methods for Metadata Embedding in Streaming Medical Data |

Classifications

U.S. Classification | 382/100 |

International Classification | G06K9/00, H04L9/00, H03M13/19, H03M13/23, H04N1/387, H04L7/00, G06T1/00, H04N1/32, H03M13/15, H03M13/00, H04L25/34, H04K1/00, H04B14/04, G06F1/00 |

Cooperative Classification | H03M13/152, H03M13/19, H03M13/1515, H04L7/042, H03M13/23 |

European Classification | H04L7/04B1 |

Legal Events

Date | Code | Event | Description |
---|---|---|---|

Jan 29, 2003 | AS | Assignment | |

Feb 21, 2006 | FPAY | Fee payment | Year of fee payment: 4 |

Feb 22, 2010 | FPAY | Fee payment | Year of fee payment: 8 |

Mar 28, 2014 | REMI | Maintenance fee reminder mailed | |

Aug 20, 2014 | LAPS | Lapse for failure to pay maintenance fees | |

Oct 7, 2014 | FP | Expired due to failure to pay maintenance fee | Effective date: 20140820 |

Rotate