US 6,993,153 B2Grant
Self-orienting watermarks
Issue Date:2006-01-31
•20 Claims
•7 Drawing Sheets
Abstract
A watermarking method converts a watermark message into a Frequency Shift Keying (FSK) signal and embeds the FSK signal in a host signal. The spectral properties of the FSK watermark signal facilitate its detection, even in applications where the watermarked signal is corrupted. Because of these properties, the FSK watermark signal can perform the dual function of identifying the watermark's presence and orientation in potentially corrupted media, and also conveying a hidden message in the host signal. Such a watermark may be referred to as a self-orienting watermark.
Metadata
Assignee
- Digimarc Corporation
Inventor
- Brett A. Bradley
Application Information
Application Number:US 10/669,310
Filing Date:2003-09-23
Priority Date:2000-02-10
Art Unit:2625
Classifications
IPC:
G06K9/00
Patent Drawings (7 sheets)
Description
Related Application Data
[0001] This application is a Continuation of Ser. No. 09/502,543 now U.S. Pat. No. 6,625,297 filed Feb. 10, 2000 which is hereby incorporated by reference.
Technical Field
[0002] The invention relates to digital watermarking.
Background of the Invention
[0003] Digital watermarking is a process for modifying a host signal or object to embed a machine-readable code into the host. The host may be modified such that the embedded code is imperceptible or nearly imperceptible to the ordinary observer upon viewing or playback, yet may be detected through an automated detection process. Most commonly, digital watermarking is applied to media such as images, audio signals, and video signals. However, it may also be applied to other types of media, including documents (e.g., through line, word or character shifting), software, multi-dimensional graphics models, and surface textures of objects.
[0004] Digital watermarking systems have two primary components: an embedding component that embeds the watermark in the host, and a reading component that detects and reads the embedded watermark. The embedding component embeds a watermark pattern by altering data samples of the host in the spatial, frequency, or other transform domains. The reading component analyzes target content to detect whether a watermark pattern is present. In applications where the watermark encodes information, the reader extracts this information from the detected watermark.
[0005] One challenge to the developers of watermark embedding and reading systems is to ensure that the watermark is detectable even if the watermarked media content is corrupted in some fashion. The watermark may be corrupted intentionally, so as to bypass its copy protection or anti-counterfeiting functions, or unintentionally through various transformations that result from routine manipulation of the content. In the case of watermarked images, such manipulation of the image may distort the watermark pattern embedded in the image.
[0006] The invention provides a watermarking method in which attributes of the watermark used to embed information also serve to orient the watermark in the reading process. One aspect of the invention is a self orienting watermark that carries a message and has attributes that provide an orientation of the watermark signal in a host signal.
[0007] Another aspect of the invention is a method of embedding a self orienting watermark in a host signal. This method converts a message into a watermark signal having an attribute that orients the watermark in the host signal, and applies the watermark signal to the host signal. In one implementation, the method converts the message to an FSK signal. The FSK signaling frequencies have spectral attributes that orient the watermark in the host signal.
[0008] Another aspect of the invention is a method of decoding a self orienting watermark in a host signal. This decoding method uses an attribute of the watermark to determine orientation of the watermark in a host signal. The attribute provides a dual functionality of determining a watermark's orientation and carrying a message. In one implementation, this attribute is an FSK signal whose signaling frequencies help identify the orientation of the watermark and also encode a message. After finding the watermark in the host signal, the method proceeds to read the message encoded into it.
[0009] Further features and advantages of the invention will be apparent from the following detailed description and accompanying drawings.
Brief Description of the Drawings
[0010] FIG. 1A illustrates an example of a binary signal converted to a square wave. FIG. 1B illustrates an example of the binary signal converted to a continuous phase FSK signal.
[0011] FIG. 2 is a plot illustrating the FFT magnitude of the FSK signal shown in FIG. 1B.
[0012] FIG. 3 is a diagram of a watermark embedder and detector system.
[0013] FIG. 4 is a diagram illustrating an example of a watermark embedder.
[0014] FIG. 5 is a diagram illustrating another example of a watermark embedder.
[0015] FIG. 6 is a flow diagram illustrating a process for determining the orientation of a watermark signal in a signal suspected of containing a watermark.
[0016] FIG. 7 is a flow diagram illustrating a more detailed implementation of the process depicted in FIG. 6.
[0017] FIG. 8 is a flow diagram illustrating a process for extracting a message from a watermark signal embedded in another signal.
[0018] FIG. 9 illustrates an example of a computer system that serves as an operating environment for software implementations of watermarking systems described below.
Detailed Description
1.0 Overview of Watermarking Method
[0019] The following sections describe a watermarking method that converts a watermark message into a self-orienting watermark signal and embeds the watermark signal in a host signal. The spectral properties of the watermark signal facilitate its detection, even in applications where the watermarked signal is corrupted. Because of these properties, the watermark signal can perform the dual function of identifying the watermark's presence and orientation in potentially corrupted media, and also conveying a hidden message in the host signal. Such a watermark may be referred to as a self-orienting watermark.
[0020] Like conventional watermarking systems, the self-orienting watermarking systems described below have an embedder that embeds the watermark in a host signal to create a watermarked signal, and a reader that detects the watermark in a potentially corrupted watermarked signal and reads the watermark message. The embedder converts the desired message into a FSK signal. It then identifies parts of the host signal to receive the watermark and alters host signal values in those parts with corresponding values from the FSK signal. Typically, the objective of the embedder is to encode the watermark to make it imperceptible during ordinary playback of the watermarked signal, yet recoverable by the reader despite intentional or unintentional corruption.
[0021] In many applications, the host signal is multi-dimensional. For example, the samples in a still image have spatial coordinates (e.g., x and y coordinates for a 2-D image), and one or more color values depending on the color space. The samples in an audio file have a discrete time value and an intensity value. Similarly, the samples in video have spatial coordinates, temporal coordinates (e.g., the frame or field), and one or more color values. The FSK signal may be inserted along one dimension, e.g., a row of luminance values of an image, or along multiple dimensions. In addition, each dimension may encode a version of the same message, or a different message. (Although 1- and 2-D signals are most commonly watermarked, 3- and more-dimension signals may also be watermarked, e.g., wire-frame or mesh computer models of 3-D objects.)
[0022] While the following description provides specific implementation details of an image watermarking method, the general approach may be applied to other watermarkable objects (including video and audio).
2.0 FSK Signaling Background
[0023] FSK signaling is a digital communications technique in which data is conveyed by shifting between distinct frequencies of transmission. To illustrate the concept, consider the example shown in FIGS. 1A-B . Suppose, for example, that one wishes to transmit some arbitrary sequence of zeros and ones. Conceptually, one can visualize the sequence as first being converted to a square wave, where the instantaneous amplitude of the square wave is represented by its corresponding binary value in the original sequence as shown in FIG. 1A. Following conversion to a square wave representation, an amplitude to frequency conversion is performed, where a lower frequency is transmitted when the square wave is in a trough and a higher frequency is sent when the square wave is cresting as shown in FIG. 1B. The result of the amplitude to frequency conversion is a typical FSK signal.
[0024] In this example, notice that when the lower frequency is transmitted the signal goes through exactly one cycle per bit. When the higher frequency is transmitted the signal goes through exactly two cycles.
[0025] This particular example is known in the literature as 2-FSK with continuous phase. See E.A. Lee, D. G. Messershmitt, Digital Communication, Second Edition, Chapter 6, 1994. The “2” comes from the fact that there are only two frequency states of the signal; generally M different frequencies can be used. The term “continuous phase” arises from the fact that there are no phase discontinuities between adjacent bits. There are frequency domain implications as well for continuous phase FSK as shown in FIG. 2. The peaks in the magnitude spectrum are distinct, and as such, can be used to identify the FSK signal when embedded in a host signal in watermarking applications.
3.0 A Watermark System
[0026] The following sections describe implementations of a watermark embedder, detector, and reader that operate on media signals (e.g., images, audio, etc.). The embedder encodes a message into a digital signal by modifying its sample values such that the message is imperceptible to the ordinary observer in output form. The detector captures a representation of the signal suspected of containing a watermark and then processes it to detect the watermark and determine its orientation. To extract the message, the reader uses the orientation to approximate the position of samples at encoding time and decodes the message.
[0027] FIG. 3 is a block diagram summarizing image processing operations involved in embedding and reading a watermark. There are three primary inputs to the embedding process: a host signal 100, the message 102, and a series of control parameters 104. The control parameters may include one or more keys. One key may be used to encrypt the message. Another key may be used to control the generation of a watermark carrier signal, a mapping of information bits in the message to positions in a watermark information signal, and an application of the watermark information signal to the host signal. Other parameters may include control bits added to the message.
[0028] The watermark embedding process 106 performs a watermarking function on the message to convert it to a watermark information signal. It then combines this signal with the host signal to create a watermarked signal 108.
[0029] The watermark detector 110 operates on a digitized signal suspected of containing a watermark. As depicted generally in FIG. 1 , the signal may undergo various transformations 112, such as conversion to and from an analog domain, copying, editing, compression/decompression, transmission etc. Using parameters 114 from the embedder (e.g., carrier signal properties, control bits, key(s)), it performs a series of correlation or other operations on the captured signal to detect the presence of a watermark and to determine its orientation. For image signals, the orientation may be expressed in the form of orientation parameters, such as translation, rotation, scale, differential scale (shear), etc. Using these parameters to approximate the orientation of the watermark signal, the reader 116 extracts the message from the suspect signal. Some implementations do not perform correlation, but instead, use some other detection process or proceed directly to extract the watermark signal.
3.1 Embedding
[0030] FIG. 2 is a block diagram illustrating an implementation of an exemplary embedder in more detail. The embedding process begins with the message 200. As noted above, the message is binary number suitable for conversion to a watermark signal. For additional security, it may be encrypted with an encryption key 202. In addition to the information conveyed in the message, the embedder may also add control bit values to the message to assist in verifying the accuracy of a read operation. These control bits, along with the bits representing the message, are input to an error correction coding process 204 designed to increase the likelihood that the message can be recovered accurately in the reader.
[0031] There are several alternative error correction coding schemes that may be employed. Some examples include BCH, convolution coding, and turbo codes. These forms of error correction coding are sometimes used in communication applications where data is encoded in a carrier signal that transfers the encoded data from one place to another. In the digital watermarking application discussed here, the raw bit data is encoded in a fundamental carrier signal.
[0032] In addition to the error correction coding schemes mentioned above, the embedder and reader may also use a Cyclic Redundancy Check (CRC) to facilitate detection of errors in the decoded message data.
[0033] The error correction coding function 204 produces a string of bits, termed raw bits 206, that are embedded into a watermark information signal. Using a carrier signal 208 and an assignment map 210, the illustrated embedder encodes the raw bits in a watermark information signal 212, 214. The carrier signal may be a random or pseudo-random signal. The assignment map specifies where to place the watermark information in the host signal. In some applications, the embedder may encode a different message in different locations of the signal.
[0034] While the precise functions and processing order may vary with the implementation, the embedding process proceeds generally as follows. The embedder modulates the carrier signal with the raw bit signal. It then FSK modulates the resulting carrier signal. Finally, it maps the FSK signal to a location or locations in the host signal. This process creates a watermark information signal. The processing order may be rearranged, and some processing stages may be omitted in some implementations. For instance, some implementations may apply FSK modulation to the raw bit signal without modulating the raw bits with a carrier signal. The carrier signal may be used to spread a raw bit over a pseudo-random signal. While advantageous in some applications, this spreading operation is not necessary.
[0035] Having summarized a general embedding framework, a number of points can be made. First, the embedder may perform a similar approach in any transform domain. For example, the FSK modulated signal may be mapped to samples in the spatial or temporal domain or some other transform domain.
[0036] Second, the specific mathematical relationship among the raw bits, the carrier, the FSK modulator, and the assignment map may vary with the implementation. For example, the message may be convolved with the carrier, multiplied with the carrier, added to the carrier, etc.
[0037] Third, the carrier signal may remain constant for a particular application, or it may vary from one message to another. For example, a secret key may be used to generate the carrier signal.
[0038] Fourth, the assignment map may map a raw bit (or its corresponding modulated signal) to a single location or many locations or orientations, in one or more transform domains. For example, the FSK signal could be applied to the rows and columns of image samples in the spatial domain.
[0039] Fifth, the assignment map may remain constant, or it may vary from one message to another. In addition, the carrier signal and map may vary depending on properties of the host signal. In sum, there are many possible design choices within the implementation framework described above.
[0040] Returning to FIG. 2 , the embedder makes a perceptual analysis 218 of the host signal 220 to identify portions of the signal that can withstand more watermark signal content without substantially impacting fidelity. For images, the perceptual analysis identifies portions where there is more image activity. In these areas, the sample values are changing more than other areas and have more signal strength. The output of the perceptual analysis is a perceptual mask 222 that represents signal activity. For example, the mask may be implemented as an array of multipliers, which selectively increase the signal strength of the watermark information signals in areas of greater signal activity. The embedder combines (224) the watermark information signal and the perceptual mask to yield the watermark signal 226. Finally, it combines (228) the host signal 220 and the watermark signal 226 to create the watermarked signal 230.
[0041] In one implementation where the watermark signal is inserted in the spatial domain of an image, the embedder adds the image samples in the watermark signal to the corresponding samples in the input image to create the watermarked image 230. In other implementations, the embedder may perform alternative functions to combine the watermark signal and the input image (e.g., multiplication). The net effect is that some image samples in the input image are adjusted upward, while others are adjusted downward. The extent of the adjustment is greater in areas of the image having greater signal activity.
3.2 Example Embedder Implementation
[0042] The following sections describe an implementation of the digital image watermark embedder depicted in FIG. 5. The embedder inserts a self-orienting watermark into the spatial domain of the host image. The watermark serves a dual function of conveying a message and identifying the watermark location in the image.
[0043] The embedder inserts watermark components in rows and columns of luminance samples of the host image at a pre-determined resolution (e.g., 100 dpi-300 dpi). The message payload size varies from one application to the next. Typically, the payload ranges from 2-128 bits.
3.2.1 Encoding the Message
[0044] The embedder converts binary message bits into a series of binary raw bits that it hides in the host image. As part of this process, a message encoder 300 appends certain known bits to the message bits 802. It performs an error detection process (e.g., parity, Cyclic Redundancy Check (CRC), etc.) to generate error detection bits and adds the error detection bits to the message. An error correction coding operation then generates raw bits from the combined known and message bit string.
[0045] For the error correction operation, the embedder employs convolution coding. Other alternatives include BCH and turbo coding.
3.2.2 Spread Spectrum Modulation
[0046] The embedder uses spread spectrum modulation as part of the process of creating a watermark signal from the raw bits. A spread spectrum modulator 304 spreads each raw bit into a number of “chips.” The embedder generates a pseudo random number that acts as the carrier signal of the message. To spread each raw bit, the modulator performs an exclusive OR (XOR) operation between the raw bit and each bit of a pseudo random binary number of a pre-determined length. Preferably, the pseudo random number should contain roughly the same number of zeros and ones. The spread spectrum modulator produces a binary sequence having a set of binary numbers corresponding to each raw bit.
3.2.3 FSK Modulation
[0047] Next, an FSK modulator 305 converts the spread spectrum signal into an FSK signal. In particular, the FSK modulator uses 2-FSK with continuous phase: a first frequency represents a zero; and a second frequency represents a one. The FSK modulated signal is applied to rows and columns of the host image. Each binary value in the input signal corresponds to a contiguous string of at least two samples in a row or column of the host image. Each of the two frequencies, therefore, is at most half the sampling rate of the image. For example, the higher frequency may be set at half the sampling rate, and the lower frequency may be half the higher frequency.
3.2.4 Mapping the Watermark Information Signal
[0048] The embedder maps the FSK modulated signal to locations in the host image. An assignment map 306 assigns the FSK modulated signal, or segments of it, to selected rows and columns of the host image. Depending on the message and image size, the embedder may map the same message to each row and column. In some applications, the embedder may map parts of a message, or different messages, to different rows or columns of the image. Also, it is possible to map the FSK signal in different directions other than the vertical and horizontal directions.
3.2.5 Computing the Watermark Information Signal
[0049] The embedder applies the watermark information signal to the host image by adding samples of the watermark to corresponding samples in the host image. Before adding the watermark information signal to the host, it converts the watermark information signals to delta values that alter corresponding samples in the host image so as to embed the watermark information (330).
[0050] At this stage, the embedder has produced an FSK modulated signal and mapped it into a two dimensional image space. Next, it assigns a delta to each sample of the watermark based on the value of the FSK signal (or signals) mapped to that location. In particular, for a mapped sample having a value of one, it adds to the corresponding luminance value, and for a mapped sample having a value of zero, it subtracts from the corresponding luminance value.
[0051] In an alternative implementation, the embedder may apply the watermark signal by multiplying it with the host image.
[0052] Optionally, a gain controller may then adjust the magnitude of each sample in the watermark information signal.
3.2.6 Gain Control and Perceptual Analysis
[0053] Though not necessary, it is often useful to control the gain of the watermark information signal. Through gain control, the embedder may increase the strength of the signal while reducing its perceptibility to ordinary observers. The embedder shown in FIG. 5 provides an example of a gain controller that takes into account the image and the watermark information signal to calculate an array of gain multipliers to be applied to the watermark information signal.
[0054] FIG. 5 depicts the gain controller used in the embedder. Note that the gain controller operates on the luminance data 308, the watermark signal, and a global gain input 310, which may be specified by the user. A perceptual analyzer component (312) of the gain controller performs a perceptual analysis on the luminance samples to identify areas that can tolerate a stronger watermark signal without substantially impacting visibility. In places where the naked eye is less likely to notice the watermark, the perceptual analyzer increases the strength of the watermark. Conversely, it decreases the watermark strength where the eye is more likely to notice the watermark.
[0055] The perceptual analyzer shown in FIG. 5 performs a series of filtering operations on the image block to compute an array of gain values. There are a variety of filters suitable for this task. These filters include an edge detector filter that identifies edges of objects in the image, a non-linear filter to map gain values into a desired range, and averaging or median filters to smooth the gain values. Each of these filters may be implemented as a series of one-dimensional filters (one operating on rows and the other on columns) or two-dimensional filters. The size of the filters (i.e. the number of samples processed to compute a value for a given location) may vary (e.g., 3 by 3, 5 by 5, etc.). The shape of the filters may vary as well (e.g., cross-shaped, square etc.). The perceptual analyzer process produces a detailed gain multiplier. The multiplier is a vector with elements corresponding to image samples.
[0056] The embedder may optionally compute another type of gain, called asymmetric gain (318). Asymmetric gain helps to increase the chances of an accurate read of the watermark message. This component of the gain controller analyzes the filtered luminance samples to determine whether they have values that are consistent with the watermark information signal. To illustrate the concept, consider a segment of the FSK signal representing a value of one. In the watermark information signal, this segment may correspond to a row of four luminance samples forming a wave with energy concentrated at the FSK frequency that represents a one. If the corresponding samples in the host signal already oscillate in a similar fashion, then the asymmetric gain may leave the watermark information signal unchanged. Conversely, if the corresponding samples do not oscillate in the same fashion, the asymmetric gain for selected samples may be set so that the resulting watermarked samples are more likely to produce the desired value in a read operation.
[0057] In summary, the gain controller shown in FIG. 5 has three sources of gain: the detailed gain from a perceptual analysis of the host image, the global gain provided as input, and the asymmetric gain from a comparison of the host image to the watermark information signal. The embedder multiplies the individual gain components together to get the composite gain.
3.2.7 Forming the Watermarked Signal
[0058] To compute the watermark signal, the embedder multiplies the delta values produced in block 330 by the composite gain. It then adds the samples of the watermark signal to corresponding samples of the host signal to produce the watermarked image.
3.3 Detecting an FSK Watermark
3.3.1 Establishing Orientation
[0059] FIG. 6 is a flow diagram illustrating a process for detecting a watermark and determining its orientation in a signal suspected of containing a self-orienting watermark. First, the detector transforms the image data 400 to another domain 402, (e.g., a spatial frequency domain, and then performs a series of correlation or other detection operations 404. The correlation operations match the watermark pattern with the target image data to detect the presence of the watermark and its orientation parameters 406.
[0060] FIG. 7 is a flow diagram illustrating a detector implementation in more detail. The detector transforms the image samples (410) to the color space in which the watermark was embedded (e.g., into luminance samples) (412). Optionally, it may perform various filtering operations to enhance the detection process. For example, one form of enhancement is to identify and remove signal content that would otherwise tend to obscure the watermark pattern and make it more difficult to compute its orientation. Since this detector determines the watermark's rotation angle and scale based on an FSK signal at known frequency ranges, it may improve the correlation process by removing signal content at other frequency ranges. As such, a filter may be used to highlight edges in the signal and then reduce or eliminate them (414). One type of filter suitable for this task is a multi-axis high pass filter (e.g., LaPlacian, Sobol, etc.).
[0061] Next, it prepares the image signal for a Fast Fourier Transform (FFT) by applying a window function (416). It then performs an FFT on the luminance signal to produce a Fourier magnitude signal (418). Optionally, it may filter the FFT magnitude array to boost peaks and suppress the fall-off region around these peaks.
[0062] To determine rotation and scale parameters of the watermark's orientation, the detector maps the signal to a log-polar coordinate space (422) and correlates the mapped signal with a detection pattern (424). One axis in the log-polar space represents a log of the scale parameter, and the other represents the rotation angle parameter. This mapping process is sometimes referred to as a Fourier Mellin transform. The detector correlates the resulting sample array in the log polar coordinate system with a log polar representation of a detection pattern. The detection pattern represents cosine waves at the FSK signaling frequencies. In the spatial frequency domain (e.g., FFT magnitude plot of the detection pattern), the detection pattern has energy focused at grid points located at the signaling frequencies. (This arrangement is further detailed in U.S. Pat. No. 5,862,260, and in application Ser. No. 09/452,023, the complete disclosures of which are incorporated herein by reference.)
[0063] When FSK signaling is applied to the rows and columns, the FFT magnitude of pure cosine waves at the signaling frequencies produces grid points along the vertical and horizontal axes in a two-dimensional frequency spectrum. If different signaling frequencies are used for the rows and columns, these grid points will fall at different distances from the origin. These grid points, therefore, may form a detection pattern that helps identify the rotation angle of the watermark in a suspect signal. Also, if an image has been rotated or scaled, the FFT of this image will have a different frequency spectrum than the original image. In particular, the peaks once located at the FSK signaling frequencies will be rotated and scaled. By aligning the peaks in the distorted image with the original peaks, the detector can re-align the image to its original orientation.
[0064] A variety of correlation methods may be used to find the rotation and scale parameters that optimize the correlation between the suspect signal and the detection pattern. This detector implementation uses a form of a generalized matching filter (GMF) (424). The GMF performs yet another FFT on the suspect signal and the pattern, multiplies the resulting signals (i.e. computes the dot product of the two FFT arrays), and then computes the inverse FFT of the product. The product comprises an array of correlation values in log-polar space. The detector may use interpolation to find the inter-sample location of the rotation and scale vector that provides the best correlation. It may use the same approach to find a set of rotation-scale vectors with the top correlation values (426).
[0065] At this stage, the detector has recovered rotation and scale parameters that estimate the orientation of the watermark in the suspect signal. Before proceeding, it is worth noting that there are several alternative approaches to estimating the rotation and scale parameters. Recall that the FFT magnitude of the FSK signal has peaks at the signaling frequencies as shown in FIG. 2. One way to determine the rotation is to step through a set of candidate rotation angles, apply the candidates to the image, and find the rotation angle that yields an FFT magnitude with the highest peak at the signaling frequencies. Since the image is two dimensional, the embedder can insert the FSK signal in the rows and columns of the image. Thus, this process may be applied separately to the rows and columns to find rotation angles that maximize the peaks in each dimension. Alternatively, a similar process may be applied to both rows and columns simultaneously. In this case, the approach is similar, except that the FFT magnitude is two-dimensional, and there are four peaks (two for the rows and two for the columns).
[0066] Once rotation is established, the detector derives the scale parameter from the location of the peaks. If the resolution of the image has been increased relative to its resolution at embedding, then the location of the peaks will shift toward the origin in the Fourier spectrum. Conversely, the location of the peaks will shift away from the origin if the resolution has decreased. If the watermark is embedded in both the rows and columns, a separate scale parameter may be established for each dimension.
[0067] As another alternative, the detector may employ projection techniques to ascertain orientation. In one such approach, the detector takes the absolute value of the FFT of each row of the watermarked image, and accumulates the result for all rows. If the watermarked image is correctly aligned, this process will produce two peaks exactly at the FSK signaling frequencies. If there is scaling, the location of the peaks changes. If the image is rotated, the result will appear like scaling combined with a loss in peak strength. The amount of rotation and scale can be derived from the position and amplitude of the peaks.
[0068] If the message content within the watermark is unknown, finding the origin of the watermark in the suspect signal presents a challenge. Generally, the implementer of the system can address this challenge by giving the watermark an attribute that enables the detector to derive it, even if the signal has been corrupted in some fashion. Just as the FSK frequencies represent an attribute that allows the detector to recover rotation and scale, the embedder may give the watermark another attribute that allows the detector to recover translation parameters that specify an origin or point of reference from which to orient the reader. After correcting for rotation and scale, the detector can then search for the attribute for recovering the translation parameters.
[0069] One such attribute is a sequence of phase offsets. Notice that in FIG. 1B , the value of the FSK signal at a bit transition is always “1.” Measured from bit to bit, the signal contains only integer cycles of a pure cosine, i.e. no phase offset. Instead of embedding with the same phase offset every row, the embedder may insert an offset that is row dependent. Knowing how the embedded phase offset varies with each row, the detector can establish a row of origination. The same procedure could be used to find the column of origination. The intersection of the two then defines the origin.
[0070] Another attribute is a sequence of FSK signaling frequencies. For example, the embedder may vary the FSK signaling frequencies over a sequence of two or more rows and columns. The detector can then identify these frequencies by computing the FFT magnitude of the rows and columns and identifying the peaks. Knowing the sequence of signaling frequencies, the detector can establish a row of origination. The same procedure can be used to find the column of origination. Again, the intersection of the row and column of origination defines the origin. Note that the detector may perform the process of identifying these peaks as part of the process of determining the rotation angle.
[0071] Note that if the embedder inserts an FSK watermark in each row (or column) at the same phase offset and signaling frequencies, artifacts will be noticeable. Thus, it is advantageous to vary the phase offset and/or signaling frequencies across rows (or columns) to improve image fidelity. Also, it is advantageous to use different signaling frequencies in the rows and columns.
[0072] Yet another attribute is a sequence of known bits appended to the watermark. The detector may then search for these known bits, after adjusting for rotation and scale. To search, the detector invokes a reader to extract a message from the rows and columns. It then looks for the known bits to identify the row and column of origination.
3.4 Reading the FSK Watermark
[0073] If a watermark is detected, the reader extracts the watermark information signal from the image data (optionally by first re-orienting the data based on the orientation parameters). FIG. 5 is flow diagram illustrating a process of extracting a message from re-oriented image data 500.
[0074] Once orientation is established, the detector invokes the reader on the rows and columns. For the rows, the reader scans the input image row of interest into two independent channels (502), each of which is band-pass filtered at one of the two possible FSK frequencies (504). Then, for a given bit location, the reader decides that the bit is a zero if there is more energy in the output channel of the lower frequency filter (506). The reader decides that the bit is a one if there is more energy in the higher frequency filter (506). An exemplary implementation embeds on the order of four pixels per bit at 100 dpi, or 40 bits per inch. In general, with more pixels per bit, the individual decisions on the bits will be more reliable. As is known from the assignee's prior art, redundant signaling would be used here as well.
[0075] The reader converts the bit value to a corresponding raw bit value and buffers the value for the associated raw bit (508). In particular, if the message has been spread spectrum modulated, then the reader performs an inverse of the modulation operation to recover a candidate value for a corresponding raw bit and buffers the candidate value. In this reading process, the reader uses the assignment map to map the extracted candidate value to its corresponding raw bit position.
[0076] Next, the reader compiles the candidate values for each raw bit to compute a final value for each raw bit position (510). It compiles the candidates for the raw bits extracted from each of the tows. For a given raw bit, if more candidates are a one, then the final value is set to a one (and vice versa if more candidates are a zero). Finally, it performs error correction decoding to reconstruct the original message (512).
[0077] To extend to reading in the other dimension, one may use a similar approach. One could either embed the same bit at identical locations in both directions, or embed directionally dependent information. In the former case, the reader can achieve a more accurate message recovery by combining candidates from both rows and columns. In the latter, potentially more information would be embedded.
4.0 Embedding Multiple Watermarks
[0078] The self-orienting watermark described above may be embedded along with other watermarks into a host signal. For example, an FSK watermark may be combined with a spatial domain watermark, or other type of watermark inserted in another transform domain (e.g., wavelet, Discrete Cosine Transform, Discrete Fourier Transform domains). In such multi-watermark schemes, the self-orienting watermark may be used to establish orientation of other watermarks in the host signal. Before reading another watermark, the detector can mitigate the impact of interference due to the self-orienting watermark. For an FSK watermark, for example, the detector could apply a band-stop filter at the FSK signaling frequencies. This filtering operation would mitigate the interference due to the FSK signal when attempting to read other watermark messages.
5.0 Applications
[0079] There are many applications for self-orienting watermarks. The watermarks may carry data, machine instructions, and/or links to other data or instructions. The link may be implemented as an address or reference to a database or other resource located on the same device as the detector or on a remote device (e.g., a computer on the Internet). Whether stored within the message, or linked by the message, the data and/or machine instructions may be used to authenticate the host signal, monitor the host signal (e.g., broadcast monitoring), identify its owner, control copying of the host signal, provide additional information related to the host signal, etc.
6.0 Operating Environment for Computer Implementations
[0080] FIG. 9 illustrates an example of a computer system that serves as an operating environment for software implementations of the watermarking systems described above. The embedder and detector implementations are implemented in C/C++ and are portable to many different computer systems. FIG. 9 generally depicts one such system.
[0081] The computer system shown in FIG. 9 includes a computer 1220, including a processing unit 1221, a system memory 1222, and a system bus 1223 that interconnects various system components including the system memory to the processing unit 1221.
[0082] The system bus may comprise any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using a bus architecture such as PCI, VESA, Microchannel (MCA), ISA and EISA, to name a few.
[0083] The system memory includes read only memory (ROM) 1224 and random access memory (RAM) 1225. A basic input/output system 1226 (BIOS), containing the basic routines that help to transfer information between elements within the computer 1220, such as during start-up, is stored in ROM 1224.
[0084] The computer 1220 further includes a hard disk drive 1227, a magnetic disk drive 1228, e.g., to read from or write to a removable disk 1229, and an optical disk drive 1230, e.g., for reading a CD-ROM or DVD disk 1231 or to read from or write to other optical media. The hard disk drive 1227, magnetic disk drive 1228, and optical disk drive 1230 are connected to the system bus 1223 by a hard disk drive interface 1232, a magnetic disk drive interface 1233, and an optical drive interface 1234, respectively. The drives and their associated computer-readable media provide nonvolatile storage of data, data structures, computer-executable instructions (program code such as dynamic link libraries, and executable files), etc. for the computer 1220.
[0085] Although the description of computer-readable media above refers to a hard disk, a removable magnetic disk and an optical disk, it can also include other types of media that are readable by a computer, such as magnetic cassettes, flash memory cards, digital video disks, and the like.
[0086] A number of program modules may be stored in the drives and RAM 1225, including an operating system 1235, one or more application programs 1236, other program modules 1237, and program data 1238.
[0087] A user may enter commands and information into the personal computer 1220 through a keyboard 1240 and pointing device, such as a mouse 1242. Other input devices may include a microphone, sound card, radio or television tuner, joystick, game pad, satellite dish, digital camera, scanner, or the like. A digital camera or scanner 43 may be used to capture the target image for the detection process described above. The camera and scanner are each connected to the computer via a standard interface 44. Currently, there are digital cameras designed to interface with a Universal Serial Bus (USB), Peripheral Component Interconnect (PCI), and parallel port interface. Two emerging standard peripheral interfaces for cameras include USB2 and 1394 (also known as firewire and iLink).
[0088] In addition to a camera or scanner, watermarked images or video may be provided from other sources, such as a packaged media devices (e.g., CD, DVD, flash memory, etc), streaming media from a network connection, television tuner, etc. Similarly, watermarked audio may be provided from packaged devices, streaming media, radio tuner, etc.
[0089] These and other input devices are often connected to the processing unit 1221 through a port interface 1246 that is coupled to the system bus, either directly or indirectly. Examples of such interfaces include a serial port, parallel port, game port or universal serial bus (USB).
[0090] A monitor 1247 or other type of display device is also connected to the system bus 1223 via an interface, such as a video adapter 1248. In addition to the monitor, personal computers typically include other peripheral output devices (not shown), such as speakers and printers.
[0091] The computer 1220 operates in a networked environment using logical connections to one or more remote computers, such as a remote computer 1249. The remote computer 1249 may be a server, a router, a peer device or other common network node, and typically includes many or all of the elements described relative to the computer 1220, although only a memory storage device 1250 has been illustrated in FIG. 9. The logical connections depicted in FIG. 9 include a local area network (LAN) 1251 and a wide area network (WAN) 1252. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.
[0092] When used in a LAN networking environment, the computer 1220 is connected to the local network 1251 through a network interface or adapter 1253. When used in a WAN networking environment, the personal computer 1220 typically includes a modem 1254 or other means for establishing communications over the wide area network 1252, such as the Internet. The modem 1254, which may be internal or external, is connected to the system bus 1223 via the serial port interface 1246.
[0093] In a networked environment, program modules depicted relative to the personal computer 1220, or portions of them, may be stored in the remote memory storage device. The processes detailed above can be implemented in a distributed fashion, and as parallel processes. It will be appreciated that the network connections shown are exemplary and that other means of establishing a communications link between the computers may be used.
7.0 Concluding Remarks
[0094] The watermarking technology detailed herein can be employed in numerous diverse applications. See, e.g., the applications for watermarking detailed in commonly-owned U.S. Pat. No. 5,862,260, and copending applications Ser. Nos. 09/292,569, 60/134,782, 09/343,104, 09/473,396, 09/476,686, and 60/141,763.
[0095] Having described and illustrated the principles of the invention with reference to a specific embodiment, it will be recognized that the principles thereof can be implemented in other, different, forms.
[0096] The particular combinations of elements and features in the above-detailed embodiments are exemplary only; the interchanging and substitution of these teachings with other teachings in this and the incorporated-by-reference patents/applications are also contemplated.
[0097] In view of the wide variety of embodiments to which the principles of the invention can be applied, it should be recognized that the detailed embodiment is illustrative only and should not be taken as limiting the scope of the invention. Rather, I claim as my invention all such embodiments as may come within the scope and spirit of the following claims, and equivalents thereto.
Claims
I claim:
1. A method of embedding a digital watermark in a host signal comprising:
converting a message into a digital watermark signal having an attribute that orients the watermark in the host signal, wherein said converting modulates the message using shift key modulation and the attribute is at least one frequency of the shift key modulated signal; and
applying the watermark signal to the host signal.
2. The method of claim 1 wherein a message is encoded by converting symbols of the message into signals at selected FSK signaling frequencies.
3. The method of claim 1 wherein said converting includes modulating with a carrier that varies with the host signal.
4. The method of claim 1 wherein the digital watermark signal varies based on an extent to which selected host signal samples have a property consistent with the digital watermark to be embedded at the selected host signal samples.
5. A computer readable medium on which is stored instructions for executing the method of claim 1.
6. A method of embedding a digital watermark in audio comprising:
converting a message into a digital watermark signal having an attribute that orients the watermark in the audio, the converting encoding the message in a carrier, including using shift key modulation to form a modulated signal, and the attribute is spectral attribute of the modulated signal; and
embedding the modulated signal in the audio by modifying the host according to the modulated signal.
7. The method of claim 6 wherein the modulated signal comprises a one dimensional signal that varies over a time dimension.
8. The method of claim 6 wherein the modulated signal is redundantly encoded in different parts of the audio.
9. The method of claim 6 wherein the watermark has two or more modulated signal components, each carrying a different message.
10. The method of claim 6 wherein the message is comprised of two or more symbols, and the symbols are converted to signals at a selected signaling frequency.
11. A method of embedding a digital watermark in a host signal comprising:
converting a message into a digital watermark signal having an attribute that orients the watermark in the host signal, wherein said converting modulates the message with shift key modulation and the attribute is a spectral property of the modulated signal; and
applying the watermark signal to the host signal.
12. The method of claim 11 wherein the spectral property facilitates detection of the scale of the watermark in the host signal.
13. The method of claim 11 wherein the modulated signal has two or more components, each with a phase offset that facilitates detection of the position of the watermark in the host signal.
14. The method of claim 11 wherein the modulated signal has two or more components, each with a selected signaling frequency, the components being arranged in the host signal so that the signaling frequencies facilitate detection of the position of the watermark in the host signal.
15. A method of decoding a digital watermark in a host signal, wherein the watermark comprises a modulated signal, and wherein the watermark includes a message that is encoded by modulating symbols onto a carrier signal, said method comprising:
using a relationship of spectral attributes of the watermark to determine orientation of the watermark in a host signal, the spectral attributes being used to determine orientation and to carry a message; and
decoding the watermark.
17. The method of claim 15 wherein the attribute is a signaling frequency.
18. The method of claim 17 wherein the signaling frequency facilitates detection of scale of the watermark in the host signal.
19. The method of claim 15 wherein the host signal is an audio signal.
20. The method of claim 15 wherein modulating symbols on the carrier comprises shift key modulation.
Patent Citations (436)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3493674(A) | 1970-02-01 | Houghton | Applicant |
| US3569619(A) | 1971-03-01 | Simjian | Applicant |
| US3576369(A) | 1971-04-01 | Wick et al. | Applicant |
| US3585290(A) | 1971-06-01 | Sanford | Applicant |
| US3655162(A) | 1972-04-01 | Yamamoto et al. | Applicant |
| US3703628(A) | 1972-11-01 | Philipson, Jr. | Applicant |
| US3809806(A) | 1974-05-01 | Walker et al. | Applicant |
| US3838444(A) | 1974-09-01 | Loughlin et al. | Applicant |
| US3845391(A) | 1974-10-01 | Crosby | Applicant |
| US3914877(A) | 1975-10-01 | Hines | Applicant |
| US3922074(A) | 1975-11-01 | Ikegami et al. | Applicant |
| US3971917(A) | 1976-07-01 | Maddox et al. | Applicant |
| US3977785(A) | 1976-08-01 | Harris | Applicant |
| US3982064(A) | 1976-09-01 | Barnaby | Applicant |
| US3984624(A) | 1976-10-01 | Waggener | Applicant |
| US4025851(A) | 1977-05-01 | Haselwood et al. | Applicant |
| US4038596(A) | 1977-07-01 | Lee | Applicant |
| US4081132(A) | 1978-03-01 | Pearce | Applicant |
| US4081831(A) | 1978-03-01 | Tang et al. | Applicant |
| US4184700(A) | 1980-01-01 | Greenaway | Applicant |
| US4186944(A) | 1980-02-01 | Pearce | Applicant |
| US4225967(A) | 1980-09-01 | Miwa et al. | Applicant |
| US4230990(A) | 1980-10-01 | Lert, Jr. et al. | Applicant |
| US4231113(A) | 1980-10-01 | Blasbalg | Applicant |
| US4238849(A) | 1980-12-01 | Gassmann | Applicant |
| US4252995(A) | 1981-02-01 | Schmidt et al. | Applicant |
| US4262329(A) | 1981-04-01 | Bright et al. | Applicant |
| US4296326(A) | 1981-10-01 | Haslop et al. | Applicant |
| US4297729(A) | 1981-10-01 | Steynor et al. | Applicant |
| US4313197(A) | 1982-01-01 | Maxemchuk | Applicant |
| US4367488(A) | 1983-01-01 | Leventer et al. | Applicant |
| US4379947(A) | 1983-04-01 | Warner | Applicant |
| US4380027(A) | 1983-04-01 | Leventer et al. | Applicant |
| US4389671(A) | 1983-06-01 | Posner et al. | Applicant |
| US4395600(A) | 1983-07-01 | Lundy et al. | Applicant |
| US4416001(A) | 1983-11-01 | Ackerman et al. | Applicant |
| US4420829(A) | 1983-12-01 | Carlson | Applicant |
| US4423415(A) | 1983-12-01 | Goldman | Applicant |
| US4425642(A) | 1984-01-01 | Moses et al. | Applicant |
| US4476468(A) | 1984-10-01 | Goldman | Applicant |
| US4528588(A) | 1985-07-01 | Lofberg | Applicant |
| US4532508(A) | 1985-07-01 | Ruell | Applicant |
| US4547804(A) | 1985-10-01 | Greenberg | Applicant |
| US4553261(A) | 1985-11-01 | Froessl | Applicant |
| US4590366(A) | 1986-05-01 | Rothfjell | Applicant |
| US4595950(A) | 1986-06-01 | Lofberg | Applicant |
| US4618257(A) | 1986-10-01 | Bayne et al. | Applicant |
| US4637051(A) | 1987-01-01 | Clark | Applicant |
| US4639779(A) | 1987-01-01 | Greenberg | Applicant |
| US4647974(A) | 1987-03-01 | Butler et al. | Applicant |
| US4654867(A) | 1987-03-01 | Labedz et al. | Applicant |
| US4660221(A) | 1987-04-01 | Dlugos | Applicant |
| US4663518(A) | 1987-05-01 | Borror et al. | Applicant |
| US4665431(A) | 1987-05-01 | Cooper | Applicant |
| US4672605(A) | 1987-06-01 | Hustig et al. | Applicant |
| US4675746(A) | 1987-06-01 | Tetrick et al. | Applicant |
| US4677435(A) | 1987-06-01 | Cause D'Agraives et al. | Applicant |
| US4682794(A) | 1987-07-01 | Margolin | Applicant |
| US4703476(A) | 1987-10-01 | Howard | Applicant |
| US4712103(A) | 1987-12-01 | Gotanda | Applicant |
| US4718106(A) | 1988-01-01 | Weinblatt | Applicant |
| US4723149(A) | 1988-02-01 | Harada | Applicant |
| US4739377(A) | 1988-04-01 | Allen | Applicant |
| US4750173(A) | 1988-06-01 | Bluthgen | Applicant |
| US4765656(A) | 1988-08-01 | Becker et al. | Applicant |
| US4775901(A) | 1988-10-01 | Nakano | Applicant |
| US4776013(A) | 1988-10-01 | Kafri et al. | Applicant |
| US4805020(A) | 1989-02-01 | Greenberg | Applicant |
| US4807031(A) | 1989-02-01 | Broughton et al. | Applicant |
| US4811357(A) | 1989-03-01 | Betts et al. | Applicant |
| US4811408(A) | 1989-03-01 | Goldman | Applicant |
| US4820912(A) | 1989-04-01 | Samyn | Applicant |
| US4835517(A) | 1989-05-01 | van der Gracht et al. | Applicant |
| US4855827(A) | 1989-08-01 | Best | Applicant |
| US4864618(A) | 1989-09-01 | Wright et al. | Applicant |
| US4866771(A) | 1989-09-01 | Bain | Applicant |
| US4874936(A) | 1989-10-01 | Chandler et al. | Applicant |
| US4876617(A) | 1989-10-01 | Best et al. | Applicant |
| US4879747(A) | 1989-11-01 | Leighton et al. | Applicant |
| US4884139(A) | 1989-11-01 | Pommier | Applicant |
| US4885632(A) | 1989-12-01 | Mabey et al. | Applicant |
| US4888798(A) | 1989-12-01 | Earnest | Applicant |
| US4903301(A) | 1990-02-01 | Kondo et al. | Applicant |
| US4908836(A) | 1990-03-01 | Rushforth et al. | Applicant |
| US4908873(A) | 1990-03-01 | Philibert et al. | Applicant |
| US4918484(A) | 1990-04-01 | Ujiie et al. | Applicant |
| US4920503(A) | 1990-04-01 | Cook | Applicant |
| US4921278(A) | 1990-05-01 | Shiang et al. | Applicant |
| US4939515(A) | 1990-07-01 | Adelson | Applicant |
| US4941150(A) | 1990-07-01 | Iwasaki | Applicant |
| US4943973(A) | 1990-07-01 | Werner | Applicant |
| US4943976(A) | 1990-07-01 | Ishigaki | Applicant |
| US4944036(A) | 1990-07-01 | Hyatt | Applicant |
| US4945412(A) | 1990-07-01 | Kramer | Applicant |
| US4947028(A) | 1990-08-01 | Gorog | Applicant |
| US4963998(A) | 1990-10-01 | Maufe | Applicant |
| US4965827(A) | 1990-10-01 | McDonald | Applicant |
| US4967273(A) | 1990-10-01 | Greenberg | Applicant |
| US4969041(A) | 1990-11-01 | O'Grady et al. | Applicant |
| US4972471(A) | 1990-11-01 | Gross et al. | Applicant |
| US4972475(A) | 1990-11-01 | Sant'Anselmo | Applicant |
| US4972476(A) | 1990-11-01 | Nathans | Applicant |
| US4977594(A) | 1990-12-01 | Shear | Applicant |
| US4979210(A) | 1990-12-01 | Nagata et al. | Applicant |
| US4996530(A) | 1991-02-01 | Hilton | Applicant |
| US5003590(A) | 1991-03-01 | Lechner et al. | Applicant |
| US5010405(A) | 1991-04-01 | Schreiber et al. | Applicant |
| US5023907(A) | 1991-06-01 | Johnson | Applicant |
| US5027401(A) | 1991-06-01 | Soltesz | Applicant |
| US5034982(A) | 1991-07-01 | Heninger et al. | Applicant |
| US5036513(A) | 1991-07-01 | Greenblatt | Applicant |
| US5040059(A) | 1991-08-01 | Leberl | Applicant |
| US5053956(A) | 1991-10-01 | Donald | Applicant |
| US5062666(A) | 1991-11-01 | Mowry et al. | Applicant |
| US5063446(A) | 1991-11-01 | Gibson | Applicant |
| US5073899(A) | 1991-12-01 | Collier et al. | Applicant |
| US5073925(A) | 1991-12-01 | Nagata et al. | Applicant |
| US5075773(A) | 1991-12-01 | Pullen et al. | Applicant |
| US5077608(A) | 1991-12-01 | Dubner | Applicant |
| US5077795(A) | 1991-12-01 | Rourke et al. | Applicant |
| US5079648(A) | 1992-01-01 | Maufe | Applicant |
| US5091966(A) | 1992-02-01 | Bloomberg et al. | Applicant |
| US5095196(A) | 1992-03-01 | Miyata | Applicant |
| US5103459(A) | 1992-04-01 | Gilhousen et al. | Applicant |
| US5113437(A) | 1992-05-01 | Best | Applicant |
| US5113445(A) | 1992-05-01 | Wang | Applicant |
| US5128525(A) | 1992-07-01 | Stearns et al. | Applicant |
| US5144660(A) | 1992-09-01 | Rose | Applicant |
| US5146457(A) | 1992-09-01 | Veldhuis et al. | Applicant |
| US5148498(A) | 1992-09-01 | Resnikoff et al. | Applicant |
| US5150409(A) | 1992-09-01 | Elsner | Applicant |
| US5161210(A) | 1992-11-01 | Druyvesteyn et al. | Applicant |
| US5166676(A) | 1992-11-01 | Milheiser | Applicant |
| US5168147(A) | 1992-12-01 | Bloomberg | Applicant |
| US5181786(A) | 1993-01-01 | Hujink | Applicant |
| US5185736(A) | 1993-02-01 | Tyrrell et al. | Applicant |
| US5199081(A) | 1993-03-01 | Saito et al. | Applicant |
| US5200822(A) | 1993-04-01 | Bronfin et al. | Applicant |
| US5212551(A) | 1993-05-01 | Conanan | Applicant |
| US5213337(A) | 1993-05-01 | Sherman | Applicant |
| US5216724(A) | 1993-06-01 | Suzuki et al. | Applicant |
| US5228056(A) | 1993-07-01 | Schilling | Applicant |
| US5235619(A) | 1993-08-01 | Beyers et al. | Applicant |
| US5243411(A) | 1993-09-01 | Shirochi et al. | Applicant |
| US5243423(A) | 1993-09-01 | DeJean et al. | Applicant |
| US5245165(A) | 1993-09-01 | Zhang | Applicant |
| US5245329(A) | 1993-09-01 | Gokcebay | Applicant |
| US5247364(A) | 1993-09-01 | Banker et al. | Applicant |
| US5253078(A) | 1993-10-01 | Balkanski et al. | Applicant |
| US5257119(A) | 1993-10-01 | Funada et al. | Applicant |
| US5259025(A) | 1993-11-01 | Monroe | Applicant |
| US5267334(A) | 1993-11-01 | Normille et al. | Applicant |
| US5280537(A) | 1994-01-01 | Sugiyama et al. | Applicant |
| US5288976(A) | 1994-02-01 | Citron | Applicant |
| US5291243(A) | 1994-03-01 | Heckman et al. | Applicant |
| US5293399(A) | 1994-03-01 | Hefti | Applicant |
| US5295203(A) | 1994-03-01 | Krause et al. | Applicant |
| US5299019(A) | 1994-03-01 | Pack et al. | Applicant |
| US5305400(A) | 1994-04-01 | Butera | Applicant |
| US5315098(A) | 1994-05-01 | Tow | Applicant |
| US5319453(A) | 1994-06-01 | Copriviza et al. | Applicant |
| US5319724(A) | 1994-06-01 | Blonstein et al. | Applicant |
| US5319735(A) | 1994-06-01 | Preuss et al. | Applicant |
| US5321470(A) | 1994-06-01 | Hasuo et al. | Applicant |
| US5325167(A) | 1994-06-01 | Melen | Applicant |
| US5327237(A) | 1994-07-01 | Gerdes et al. | Applicant |
| US5337361(A) | 1994-08-01 | Wang et al. | Applicant |
| US5337362(A) | 1994-08-01 | Gormish et al. | Applicant |
| US5349655(A) | 1994-09-01 | Mann | Applicant |
| US5351302(A) | 1994-09-01 | Leighton et al. | Applicant |
| US5371792(A) | 1994-12-01 | Asai et al. | Applicant |
| US5374976(A) | 1994-12-01 | Spannenburg | Applicant |
| US5379345(A) | 1995-01-01 | Greenberg | Applicant |
| US5387941(A) | 1995-02-01 | Montgomery et al. | Applicant |
| US5394274(A) | 1995-02-01 | Kahn | Applicant |
| US5396559(A) | 1995-03-01 | McGrew | Applicant |
| US5398283(A) | 1995-03-01 | Virga | Applicant |
| US5404160(A) | 1995-04-01 | Schober et al. | Applicant |
| US5404377(A) | 1995-04-01 | Moses | Applicant |
| US5408542(A) | 1995-04-01 | Callahan | Applicant |
| US5416307(A) | 1995-05-01 | Danek et al. | Applicant |
| US5418853(A) | 1995-05-01 | Kanota et al. | Applicant |
| US5422963(A) | 1995-06-01 | Chen et al. | Applicant |
| US5422995(A) | 1995-06-01 | Aoki et al. | Applicant |
| US5425100(A) | 1995-06-01 | Thomas et al. | Applicant |
| US5428606(A) | 1995-06-01 | Moskowitz | Applicant |
| US5428607(A) | 1995-06-01 | Hiller et al. | Applicant |
| US5428731(A) | 1995-06-01 | Powers | Applicant |
| US5432542(A) | 1995-07-01 | Thibadeau et al. | Applicant |
| US5432870(A) | 1995-07-01 | Schwartz | Applicant |
| US5446488(A) | 1995-08-01 | Vogel | Applicant |
| US5450122(A) | 1995-09-01 | Keene | Applicant |
| US5450490(A) | 1995-09-01 | Jensen et al. | Applicant |
| US5461426(A) | 1995-10-01 | Limberg et al. | Applicant |
| US5463209(A) | 1995-10-01 | Figh | Applicant |
| US5469222(A) | 1995-11-01 | Sprague | Applicant |
| US5469506(A) | 1995-11-01 | Berson et al. | Applicant |
| US5473631(A) | 1995-12-01 | Moses | Applicant |
| US5479168(A) | 1995-12-01 | Johnson et al. | Applicant |
| US5481294(A) | 1996-01-01 | Thomas et al. | Applicant |
| US5488664(A) | 1996-01-01 | Shamir | Applicant |
| US5493677(A) | 1996-02-01 | Bfalogh | Applicant |
| US5495581(A) | 1996-02-01 | Tsai | Applicant |
| US5496071(A) | 1996-03-01 | Walsh | Applicant |
| US5499294(A) | 1996-03-01 | Friedman | Applicant |
| US5502576(A) | 1996-03-01 | Ramsay et al. | Applicant |
| US5515081(A) | 1996-05-01 | Vasilik | Applicant |
| US5521722(A) | 1996-05-01 | Colvill et al. | Applicant |
| US5524933(A) | 1996-06-01 | Kunt et al. | Applicant |
| US5530751(A) | 1996-06-01 | Morris | Applicant |
| US5530759(A) | 1996-06-01 | Braudaway et al. | Applicant |
| US5530852(A) | 1996-06-01 | Meske, Jr. et al. | Applicant |
| US5532920(A) | 1996-07-01 | Hartrick et al. | Applicant |
| US5537223(A) | 1996-07-01 | Curry | Applicant |
| US5539471(A) | 1996-07-01 | Myhrvold et al. | Applicant |
| US5539735(A) | 1996-07-01 | Moskowitz | Applicant |
| US5541662(A) | 1996-07-01 | Adams et al. | Applicant |
| US5544255(A) | 1996-08-01 | Smithies et al. | Applicant |
| US5548646(A) | 1996-08-01 | Aziz et al. | Applicant |
| US5557333(A) | 1996-09-01 | Jungo et al. | Applicant |
| US5559559(A) | 1996-09-01 | Jungo et al. | Applicant |
| US5568179(A) | 1996-10-01 | Diehl et al. | Applicant |
| US5568550(A) | 1996-10-01 | Ur | Applicant |
| US5568570(A) | 1996-10-01 | Rabbani | Applicant |
| US5572010(A) | 1996-11-01 | Petrie | Applicant |
| US5572247(A) | 1996-11-01 | Montgomery | Applicant |
| US5576532(A) | 1996-11-01 | Hecht | Applicant |
| US5579124(A) | 1996-11-01 | Aijala et al. | Applicant |
| US5582103(A) | 1996-12-01 | Tanaka et al. | Applicant |
| US5587743(A) | 1996-12-01 | Montgomery | Applicant |
| US5590197(A) | 1996-12-01 | Chen et al. | Applicant |
| US5594226(A) | 1997-01-01 | Steger | Applicant |
| US5598526(A) | 1997-01-01 | Daniel et al. | Applicant |
| US5602920(A) | 1997-02-01 | Bestler et al. | Applicant |
| US5606609(A) | 1997-02-01 | Houser et al. | Applicant |
| US5611575(A) | 1997-03-01 | Petrie | Applicant |
| US5613004(A) | 1997-03-01 | Cooperman et al. | Applicant |
| US5613012(A) | 1997-03-01 | Hoffman et al. | Applicant |
| US5614940(A) | 1997-03-01 | Cobbley et al. | Applicant |
| US5617119(A) | 1997-04-01 | Briggs et al. | Applicant |
| US5617148(A) | 1997-04-01 | Montgomery | Applicant |
| US5629770(A) | 1997-05-01 | Brassil | Applicant |
| US5629980(A) | 1997-05-01 | Stefik et al. | Applicant |
| US5636292(A) | 1997-06-01 | Rhoads | Applicant |
| US5638443(A) | 1997-06-01 | Stefik | Applicant |
| US5638446(A) | 1997-06-01 | Rubin | Applicant |
| US5640193(A) | 1997-06-01 | Wellner | Applicant |
| US5646999(A) | 1997-07-01 | Saito | Applicant |
| US5652626(A) | 1997-07-01 | Kawakami et al. | Applicant |
| US5659164(A) | 1997-08-01 | Schmid | Applicant |
| US5661574(A) | 1997-08-01 | Kawana | Applicant |
| US5663766(A) | 1997-09-01 | Sizer, II | Applicant |
| US5664018(A) | 1997-09-01 | Leighton | Applicant |
| US5665951(A) | 1997-09-01 | Newman et al. | Applicant |
| US5666487(A) | 1997-09-01 | Goodman et al. | Applicant |
| US5668636(A) | 1997-09-01 | Beach et al. | Applicant |
| US5671282(A) | 1997-09-01 | Wolff et al. | Applicant |
| US5673316(A) | 1997-09-01 | Auerbach et al. | Applicant |
| US5687236(A) | 1997-11-01 | Moskowitz et al. | Applicant |
| US5710636(A) | 1998-01-01 | Curry | Applicant |
| US5719939(A) | 1998-02-01 | Tel | Applicant |
| US5721788(A) | 1998-02-01 | Powell et al. | Applicant |
| US5727092(A) | 1998-03-01 | Sandford, II et al. | Applicant |
| US5735547(A) | 1998-04-01 | Morelle et al. | Applicant |
| US5740244(A) | 1998-04-01 | Indeck et al. | Applicant |
| US5742845(A) | 1998-04-01 | Wagner | Applicant |
| US5745604(A) | 1998-04-01 | Rhoads | Applicant |
| US5761686(A) | 1998-06-01 | Bloomberg | Applicant |
| US5768426(A) | 1998-06-01 | Rhoads | Applicant |
| US5778102(A) | 1998-07-01 | Sandford, II et al. | Applicant |
| US5790693(A) | 1998-08-01 | Graves et al. | Applicant |
| US5790697(A) | 1998-08-01 | Munro et al. | Applicant |
| US5804803(A) | 1998-09-01 | Cragun et al. | Applicant |
| US5809139(A) | 1998-09-01 | Girod et al. | Applicant |
| US5809160(A) | 1998-09-01 | Powell et al. | Applicant |
| US5809317(A) | 1998-09-01 | Kogan et al. | Applicant |
| US5817205(A) | 1998-10-01 | Kaule | Applicant |
| US5818441(A) | 1998-10-01 | Throckmorton et al. | Applicant |
| US5819289(A) | 1998-10-01 | Sanford, II et al. | Applicant |
| US5825871(A) | 1998-10-01 | Mark | Applicant |
| US5825892(A) | 1998-10-01 | Braudaway et al. | Applicant |
| US5838458(A) | 1998-11-01 | Tsai | Applicant |
| US5841978(A) | 1998-11-01 | Rhoads | Applicant |
| US5848144(A) | 1998-12-01 | Ahrens | Applicant |
| US5848413(A) | 1998-12-01 | Wolff | Applicant |
| US5852673(A) | 1998-12-01 | Young | Applicant |
| US5857038(A) | 1999-01-01 | Owada et al. | Applicant |
| US5862218(A) | 1999-01-01 | Steinberg | Applicant |
| US5862260(A) | 1999-01-01 | Rhoads | Applicant |
| US5867586(A) | 1999-02-01 | Liang | Applicant |
| US5869819(A) | 1999-02-01 | Knowles et al. | Applicant |
| US5871615(A) | 1999-02-01 | Harris | Applicant |
| US5872589(A) | 1999-02-01 | Morales | Applicant |
| US5875249(A) | 1999-02-01 | Mintzer et al. | Applicant |
| US5893101(A) | 1999-04-01 | Balogh et al. | Applicant |
| US5898779(A) | 1999-04-01 | Squilla et al. | Applicant |
| US5900608(A) | 1999-05-01 | Iida | Applicant |
| US5901178(A) | 1999-05-01 | Lee et al. | Applicant |
| US5902353(A) | 1999-05-01 | Reber et al. | Applicant |
| US5903729(A) | 1999-05-01 | Reber et al. | Applicant |
| US5905248(A) | 1999-05-01 | Russell et al. | Applicant |
| US5905251(A) | 1999-05-01 | Knowles | Applicant |
| US5905800(A) | 1999-05-01 | Moskowitz et al. | Examiner |
| US5905810(A) | 1999-05-01 | Jones et al. | Applicant |
| US5913210(A) | 1999-06-01 | Call | Applicant |
| US5915027(A) | 1999-06-01 | Cox et al. | Applicant |
| US5930767(A) | 1999-07-01 | Reber et al. | Applicant |
| US5932863(A) | 1999-08-01 | Rathus et al. | Applicant |
| US5933798(A) | 1999-08-01 | Linnartz | Applicant |
| US5933829(A) | 1999-08-01 | Durst et al. | Applicant |
| US5938726(A) | 1999-08-01 | Reber et al. | Applicant |
| US5938727(A) | 1999-08-01 | Ikeda | Applicant |
| US5939695(A) | 1999-08-01 | Nelson | Applicant |
| US5940595(A) | 1999-08-01 | Reber et al. | Applicant |
| US5944608(A) | 1999-08-01 | Reed et al. | Applicant |
| US5949055(A) | 1999-09-01 | Fleet et al. | Applicant |
| US5950173(A) | 1999-09-01 | Perkowski | Applicant |
| US5963916(A) | 1999-10-01 | Kaplan | Applicant |
| US5971277(A) | 1999-10-01 | Cragun et al. | Applicant |
| US5974141(A) | 1999-10-01 | Saito | Applicant |
| US5974548(A) | 1999-10-01 | Adams | Applicant |
| US5978773(A) | 1999-11-01 | Hudetz et al. | Applicant |
| US5979757(A) | 1999-11-01 | Tracy et al. | Applicant |
| US5983218(A) | 1999-11-01 | Syeda-Mahmood | Applicant |
| US5991426(A) | 1999-11-01 | Cox et al. | Applicant |
| US6005501(A) | 1999-12-01 | Wolosewicz | Applicant |
| US6005605(A) | 1999-12-01 | Kostreski et al. | Applicant |
| US6008737(A) | 1999-12-01 | Deluca et al. | Applicant |
| US6024287(A) | 2000-02-01 | Takai et al. | Applicant |
| US6035177(A) | 2000-03-01 | Moses et al. | Applicant |
| US6052486(A) | 2000-04-01 | Knowlton et al. | Applicant |
| US6064764(A) | 2000-05-01 | Bhaskaran et al. | Applicant |
| US6122403(A) | 2000-09-01 | Rhoads | Applicant |
| US6166750(A) | 2000-12-01 | Negishi | Applicant |
| US6188787(B1) | 2001-02-01 | Ohmae et al. | Applicant |
| US6243480(B1) | 2001-06-01 | Zhao et al. | Applicant |
| US6252963(B1) | 2001-06-01 | Rhoads | Applicant |
| US6266430(B1) | 2001-07-01 | Rhoads et al. | Applicant |
| US6285776(B1) | 2001-09-01 | Rhoads | Applicant |
| US6301360(B1) | 2001-10-01 | Bocionek et al. | Applicant |
| US6311214(B1) | 2001-10-01 | Rhoads | Applicant |
| US6321648(B1) | 2001-11-01 | Berson et al. | Applicant |
| US6321981(B1) | 2001-11-01 | Ray et al. | Applicant |
| US6324574(B1) | 2001-11-01 | Gong | Applicant |
| US6338037(B1) | 2002-01-01 | Todd et al. | Applicant |
| US6343138(B1) | 2002-01-01 | Rhoads | Applicant |
| US6343204(B1) | 2002-01-01 | Yang | Applicant |
| US6345104(B1) | 2002-02-01 | Rhoads | Applicant |
| US6359985(B1) | 2002-03-01 | Koch et al. | Applicant |
| US6408082(B1) | 2002-06-01 | Rhoads et al. | Applicant |
| US6427020(B1) | 2002-07-01 | Rhoads | Applicant |
| US6438236(B1) | 2002-08-01 | Best et al. | Applicant |
| US6449377(B1) | 2002-09-01 | Rhoads | Applicant |
| US6470090(B2) | 2002-10-01 | Oami et al. | Examiner |
| US6505160(B1) | 2003-01-01 | Levy et al. | Applicant |
| US6512796(B1) | 2003-01-01 | Sherwood | Applicant |
| US6512837(B1) | 2003-01-01 | Ahmed | Applicant |
| US6522770(B1) | 2003-02-01 | Seder et al. | Applicant |
| US6522771(B2) | 2003-02-01 | Rhoads | Applicant |
| US6549638(B2) | 2003-04-01 | Davis et al. | Applicant |
| US6571144(B1) | 2003-05-01 | Moses et al. | Examiner |
| US6574350(B1) | 2003-06-01 | Rhoads et al. | Applicant |
| US6577746(B1) | 2003-06-01 | Evans et al. | Applicant |
| US6580819(B1) | 2003-06-01 | Rhoads | Applicant |
| US6625297(B1) | 2003-09-01 | Bradley | Examiner |
| US6650761(B1) | 2003-11-01 | Rodriguez et al. | Applicant |
| US6674886(B2) | 2004-01-01 | Davis et al. | Applicant |
| US6681028(B2) | 2004-01-01 | Rodriguez et al. | Applicant |
| US6683966(B1) | 2004-01-01 | Tian et al. | Applicant |
| US6694041(B1) | 2004-02-01 | Brunk | Applicant |
| US6700991(B1) | 2004-03-01 | Wu et al. | Examiner |
| US6714683(B1) | 2004-03-01 | Tian et al. | Applicant |
| US6724912(B1) | 2004-04-01 | Carr et al. | Applicant |
| US6757300(B1) | 2004-06-01 | Pages et al. | Applicant |
| US6757405(B1) | 2004-06-01 | Muratani et al. | Examiner |
| US6768807(B1) | 2004-07-01 | Muratani | Examiner |
| US2001/0017709(A1) | 2001-08-01 | Murakami et al. | Applicant |
| US2001/0022848(A1) | 2001-09-01 | Rhoads | Applicant |
| US2001/0024510(A1) | 2001-09-01 | Iwamura | Applicant |
| US2001/0026629(A1) | 2001-10-01 | Oki | Applicant |
| US2001/0030759(A1) | 2001-10-01 | Hayashi et al. | Applicant |
| US2001/0053299(A1) | 2001-12-01 | Matsunoshita et al. | Applicant |
| US2002/0001095(A1) | 2002-01-01 | Kawakami et al. | Applicant |
| US2002/0003891(A1) | 2002-01-01 | Hoshino | Applicant |
| US2002/0009208(A1) | 2002-01-01 | Alattar et al. | Applicant |
| US2002/0018228(A1) | 2002-02-01 | Torigoe | Applicant |
| US2002/0032864(A1) | 2002-03-01 | Rhoads et al. | Applicant |
| US2002/0051237(A1) | 2002-05-01 | Ohara | Applicant |
| CA2235002 | 1998-12-01 | Applicant | |
| DE3806411 | 1989-09-01 | Applicant | |
| DE19521969 | 1997-02-01 | Applicant | |
| EP366381 | 1989-10-01 | Applicant | |
| EP372601 | 1990-06-01 | Applicant | |
| EP411232 | 1991-02-01 | Applicant | |
| EP418964 | 1991-03-01 | Applicant | |
| EP441702 | 1991-08-01 | Applicant | |
| EP493091 | 1992-07-01 | Applicant | |
| EP58482 | 1992-08-01 | Applicant | |
| EP551016 | 1993-07-01 | Applicant | |
| EP581317 | 1994-02-01 | Applicant | |
| EP605208 | 1994-07-01 | Applicant | |
| EP649074 | 1995-04-01 | Applicant | |
| EP705025 | 1996-04-01 | Applicant | |
| EP711061 | 1996-05-01 | Applicant | |
| EP789480 | 1997-08-01 | Applicant | |
| EP872995 | 1998-10-01 | Applicant | |
| EP642060 | 1999-04-01 | Applicant | |
| EP1122939 | 2001-08-01 | Applicant | |
| GB2063018 | 1981-05-01 | Applicant | |
| GB2067871 | 1981-07-01 | Applicant | |
| GB2196167 | 1988-04-01 | Applicant | |
| GB2204984 | 1988-11-01 | Applicant | |
| JP4-248771 | 1992-02-01 | Applicant | |
| JP5/242217 | 1993-09-01 | Applicant | |
| JP8-30759 | 1996-02-01 | Applicant | |
| WO89/08915 | 1989-09-01 | Applicant | |
| WO93/25038 | 1993-12-01 | Applicant | |
| WO94/27228 | 1994-11-01 | Applicant | |
| WO95/04665 | 1995-02-01 | Applicant | |
| WO95/10813 | 1995-04-01 | Applicant | |
| WO95/10835 | 1995-04-01 | Applicant | |
| WO95/14289 | 1995-05-01 | Applicant | |
| WO95/20291 | 1995-07-01 | Applicant | |
| WO95/26494 | 1996-08-01 | Applicant | |
| WO96/27259 | 1996-09-01 | Applicant | |
| WO97/43736 | 1997-11-01 | Applicant | |
| WO98/14887 | 1998-04-01 | Applicant | |
| WO98/20642 | 1998-05-01 | Applicant | |
| WO98/24050 | 1998-06-01 | Applicant | |
| WO98/40823 | 1998-09-01 | Applicant | |
| WO98/49813 | 1998-11-01 | Applicant | |
| WO99/34277 | 1999-07-01 | Applicant | |
| WO99/36876 | 1999-07-01 | Applicant | |
| WO/44131 | 2000-07-01 | Applicant | |
| WO1/08405 | 2001-02-01 | Applicant | |
| WO1/80169 | 2001-10-01 | Applicant |
Non-Patent Literature (148)
- U.S. Appl. No. 60/000,442, filed Jun. 20, 1995, Hudetz.Applicant
- U.S. Appl. No. 60/071,983, filed Jan. 20, 1998, Levy.Applicant
- U.S. Appl. No. 60/082,228, filed Apr. 16, 1998, Rhoads.Applicant
- U.S. Appl. No. 60/114,725, filed Dec. 31, 1998, Levy.Applicant
- U.S. Appl. No. 60/116,641, filed Jan. 21, 1999, Cookson.Applicant
- U.S. Appl. No. 60/141,763, filed Jun. 30, 1999, Davis.Applicant
- U.S. Appl. No. 60/158,015, filed Oct. 6, 1999, Davis et al.Applicant
- U.S. Appl. No. 60/198,138, filed Apr. 17, 2000, Alattar.Applicant
- U.S. Appl. No. 09/342,971, filed Jun. 29, 1999, Rodriguez et al.Applicant
- U.S. Appl. No. 09/343,104, filed Jun. 29, 1999, Rodriguez et al.Applicant
- U.S. Appl. No. 09/465,418, filed Dec. 16, 1999, Rhoads et al.Applicant
- U.S. Appl. No. 09/476,686, filed Dec. 30, 1999, Rhoads et al.Applicant
- U.S. Appl. No. 09/679,261, filed Oct. 4, 2000, Davis et al.Applicant
- U.S. Appl. No. 09/562,517, filed May 1, 2000, Davis et al.Applicant
- U.S. Appl. No. 09/547,664, filed Apr. 12, 2000, Rhoads et al.Applicant
- U.S. Appl. No. 09/571,422, filed May 15, 2000, Rhoads et al.Applicant
- U.S. Appl. No. 09/631,409, filed Aug. 3, 2000, Brundage et al.Applicant
- U.S. Appl. No. 09/452,021, filed Nov. 30, 1999, Davis et al.Applicant
- U.S. Appl. No. 09/670,115, filed Sep. 26, 2000, Rhoads et al.Applicant
- U.S. Appl. No. 09/404,291, filed Sep. 23, 2001, Levy et al.Applicant
- U.S. Appl. No. 09/234,780, filed Jan. 20, 1999, Rhoads et al.Applicant
- U.S. Appl. No. 09/478,713, filed Jan. 6, 2000, Cookson.Applicant
- U.S. Appl. No. 09/574,726, filed May 18, 2000, Rhoads et al.Applicant
- U.S. Appl. No. 09/625,577, filed Jul. 25, 2000, Carr et al.Applicant
- U.S. Appl. No. 09/765,102, filed Jan. 17, 2001, Shar.Applicant
- “Access Control and COpyright Protection for Images, WorkPackage 8: Watermarking,” Jun. 30, 1995, 46 pages.Applicant
- “Access Control and COpyright Protection for Images, WorkPackage 3: Evaluation of Existing Systems,” Apr. 19, 1995, 68 pages.Applicant
- “Access Control and COpyright Protection for Images, WorkPackage 1: Access Control and Copyright Protection of Images Need Evaluation,” Jun., 1995, 21 pages.Applicant
- “Access Control and COpyright Protection for Images, Conditional Access and Copyright Protection Based on the Use of Trusted Third Parties,” 1995, 43 pages.Applicant
- Arachelian, “White Noise Storm,” Apr. 11, 1994, Internet reference, 13 pages.Applicant
- Arazi, et al., “Intuition, Perception, and Secure Communication,” IEEE Transactionson Systems, Man, and Cybernetics, vol. 19, No. 5, Sep./Oct. 1989, pp. 1016-1020.Applicant
- Arthur, “Digital Fingerprints Protect Artwork,” New Scientist, Nov. 12, 1994, p. 24.Applicant
- Audio Watermarking Architectures for Secure Digital Music Distribution, A Proposal to the SDMI Portable Devices Working Group by ARIS Technologies, Inc, Mar. 26, 1999, pp. 1-11.Applicant
- Audio Watermarking Architectures for Persistent Protection, Presentation to SDMI PDWG, Mar. 29, 1999, J. Winograd, Aris Technologies, pp 1-16.Applicant
- Audio Watermarking System to Screen Digital Audio Content for LCM Acceptance, A Proposal Submitted in Response to PDWG99050504-Transition CfP by ARIS Technologies, Inc., May 23, 1999, Document Version 1.0 , 15 pages.Applicant
- Aura, “Invisible Communication,” Helskinki University of Technology, Digital Systems Laboratory, Nov. 5, 1995, 13 pages.Applicant
- Bender, “Techniques for Data Hiding,” Proc. SPIE, Vo. 2420, Feb. 9, 1995, pp. 164-173.Applicant
- Bender et al., “Techniques for Data Hiding,” Draft Preprint, Private Correspondence dated Oct. 30, 1995.Applicant
- Bender et al., “Techniques for Data Hiding,” Massachusetts Institute of Technology, Media Laboratory, Jan. 1995, 10 pages.Applicant
- Bender, “Applications for Data Hiding,” IBM Systems Journal, vol. 39, No. 3-4, pp. 547-568, 2000.Applicant
- Boland et al., “Watgermarking Digital Images for Copyright Protection”, Fifth Int'l Conference on Image Processing and it's Application, Jul. 1995, pp. 326-330.Applicant
- Boneh, “Collusion-Secure Fingerprinting for Digital Data,” Department of Computer Science, Princeton University, 1995, 31 pages.Applicant
- Boney et al., “Digital Watermarks for Audio Signals,” Proceedings of Multimedia '96, 1996 IEEE, pp. 473-480.Applicant
- Boucqueau et al., Equitable Conditional Access and Copyright Protection for Image Based on Trusted Third Parties, Teleservices & Multimedia Communications, 2nd Int. Cost 237 Workshop, Second International Cost 237 Workshop, Nov., 1995; published 1996, pp. 229-243.Applicant
- Brassil et al., “Hiding Information in Document Images,” Nov., 1995, 7 pages.Applicant
- Brassil et al., Electronic Marking and Identification Techniques to Discourage Document Copying, Proceedings of INFOCOM '94 Conference on Computer, IEEE Commun. Soc Conference, Jun. 12-16, 1994, 1278-1287.Applicant
- Brown, “S-Tools for Windows, Version 1.00, COPYRGT. 1994 Andy Brown, What is Steganography,” Internet reference, Mar. 6, 1994, 6 pages.Applicant
- Bruckstein, A.M.; Richardson, T.J., A holographic transform domain image watermarking method, Circuits, Systems, and Signal Processing vol. 17, No. 3 p. 361-389, 1998. This paper includes an appendix containing an internal memo of Bell Labs, which according to the authors of the paper, was dated Sep. 1994.Applicant
- Bruvndonckx et al., Neural Network Post-Processing of Coded Images Using Perceptual Masking, 1994, 3 pages.Applicant
- Bruyndonckx et al., “Spatial Method for Copyright Labeling of Digital Images,” 1994, 6 pages.Applicant
- Burgett et al., “A Novel Method for Copyright Labeling Digitized Image Data,” requested by e-mail from author (unavailable/password protected on IGD WWW site); received Sep. 18, 1995, 12 pages.Applicant
- Caronni, “Assuring Ownership Rights for Digital Images,” Published in the Proceedings of ‘Reliable IT Systems,’ VIS '95, HH. Bruggemann and W. Gerhardt-Hackl (Ed.), Vieweg Publishing Company, Germany, 1995, Jun. 14, 1994, 10 pages.Applicant
- Caruso, “Digital Commerce, 2 plans for watermarks, which can bind proof of authorship to electronic works.” New York Times, Aug. 7, 1995, one page.Applicant
- Castro et al., “Registration of Translated and Rotated Images Using Finite Fourier Transforms,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-9, No. 5, Sep. 1987, pp. 700-703.Applicant
- Choudhury, et al., “Copyright Protection for Electronic Publishing over Computer Networks,” IEEE Network Magzine, Jun. 1994, 18 pages.Applicant
- Clarke, “Invisible Code Tags Electronic Images,” Electronic Engineering Times, Jun. 12, 1995, n. 852, p. 42.Applicant
- Cookson, Chris, General Principles of Music Uses on Portable Devices, presented to SDMI, Mar. 5, 1999.Applicant
- “Copyright Protection for Digital Images, Digital Fingerprinting from FBI,” Highwater FBI brochure, 1995, 4 pages.Applicant
- “The Copyright Can of Worms Opened Up By The New Electronic Media,” Computergram Internations, pCGN07170006, Jul. 17, 1995 and “The Copyright Can of Worms Opened Up By the New Electronic Media—2,” Computergram Internations, pCGN07210008, Jul. 21, 1995, 3 pages total.Applicant
- Cox et al., “Secure Spread Spectrum Watermarking for Multimedia,” NEC Research Institute Technical Report, Dec. 5, 1995, 33 pages.Applicant
- Cox, “A Secure, Robust Watermark for Multimedia,” First International Workshop, U.K., May 30, 1996, pp. 185-206.Applicant
- Cox et al., “A Secure Imperceptable Yet Perceptually Salient, Spread Spectrum Watermark for Multimedia,” IEEE, Southcon/96, Conference Record, pp. 192-197, 1996.Applicant
- “Cyphertech Systems: Introduces Digital Encoding Device to Prevent TV Piracy,” Hollywood Reporter, Oct. 20, 1993, p. 23.Applicant
- Dautzenberg, “Watermarking Images,” Department of Microelectronics and Electrical Engineering, Trinity College Dublin, 47 pages, Oct. 1994.Applicant
- Delaigle et al, “Digital Watermarking,” Proc. SPIE—Int. Soc. Opt. Eng., vol. 2659, pp. 99-110, 1996.Applicant
- Delaigle et al., “A Psychovisual Approach for Digital Picture Watermarking,” 1995, 20 pages. DICE Digital Watermark System, Q&A, Dec., 1995, 12 pages.Applicant
- Digimarc presentation at RSA Conference, approximately Jan. 17, 1996, 4 pages.Applicant
- Fimmerstad, “The Virtual Art Museum,” Ericsson Connexion, Dec., 1995, pp. 29-31.Applicant
- Fitzgerald, “Invisible Digital Copyright ID,” Editor & Publisher, Jun. 25, 1994, p. 62.Applicant
- “Foiling Card Forgers With Magnetic ‘Noise,’” Wall Street Journal, Feb. 8, 1994. Frequently Asked Questions About Digimarc Signature Technology, Aug. 1, 1995, http://www.digimarc/com, 9 pages.Applicant
- “Foiling Card Forgers With Magnetic ‘Noise,’” Wall Street Journal, Feb. 8, 1994.Applicant
- Frequently Asked Questions About Digimarc Signature Technology, Aug. 1, 1995, http://www.digimarc.com, 9 pages.Applicant
- Friedman, “The Trustworthy Digital Camera: Restoring Credibility to the Photographic Images,” IEEE Transactions on Consumer Electronics, vol. 39, No. 4, Nov., 1993, pp. 905-910.Applicant
- Gabor, et al., “Theory of Communication,” J. Inst. Elect. Eng. 93, 1946, pp. 429-441.Applicant
- Gruhl et al., “Information Hiding to Foil the Casual Counterfeiter,” Proc. 2d Information Hiding Workshop, LNCS vol. 1525, pp. 1-15 (Apr. 15, 1998).Applicant
- Hartung, “Digital Watermarking of MPEG-2 Coded Video in the Bitstream Domain,” 1997 IEEE, pp. 2621-2624.Applicant
- Hartung et al., Digital Watermarking of Raw and Compressed Video, Proc. SPIE 2952, Digital Compression Technologies and Systems for Video Communications, Oct., 1996, pp. 205-213.Applicant
- Hecht, “Embedded Data Glyph Technology for Hardcopy Digital Documents,” SPIE vol. 2171, Feb. 1994, pp. 341-352.Applicant
- “High Water FBI Limited Presentation Image Copyright Protection Software,” FBI Ltd brochure, Jul., 1995, 17 pages.Applicant
- “Holographic signatures for ditigal images,” The Seybold Report on Desktop Publishing, Aug. 1995, one page.Applicant
- Humphrey, “Stamping Out Crime,” Hollywood Reporter, Jan. 26, 1994, p. S48.Applicant
- Jain, “Image Coding Via a Nearest Neighbors Image Model,” IEEE Transactions on Communications, vol. COM-23, No. 3, Mar. 1975, pp. 318-331.Applicant
- Johnson, “Steganography,” Dec. 10, 1995, 32 pages.Applicant
- JPEG Goup's JPEG Software (release 4), ftp.csua.berekeley,edu/pub/cypherpunks/applications/jsteg/jpeg. announcement.gz.Applicant
- Kassam, Signal Detection in Non-Gaussian Noise, Dowden & Culver, 1988, pp. 1-96.Applicant
- Koch et al., “Digital Copyright Labeling: Providing Evidence of Misuse and Tracking Unauthorized Distribution of Copyrighted Materials,” Oasis Magazine, Dec. 1995, 3 pages.Applicant
- Koch et al., “Copyright Protection for Multimedia Data,” Fraunhofer Institute for Computer Graphics, Dec. 16, 1994, 15 pages.Applicant
- Koch et al., “Towards Robust and Hidden Image Copyright Labeling,” Proc. of 1995 IEEE Workshop on Nonlinear Signal and Image Processing, Jun. 20-22, 1995, 4 pages.Applicant
- Kurak et al., “A Cautionary Note On Image Downgrading,” 1992 IEEE, pp. 153-159.Applicant
- Levy, “AIPL's Proposal for SDMI: An Underlying Security System” (slide presentation), Mar. 29, 1999, 23 slides.Applicant
- Luc, “Analysis of Spread Spectrum System Parameters for Design of Hidden Transmission,” Radioengineering, vol. 4, No. 2, Jun. 1995, pp. 26-29.Applicant
- Machado, “Announcing Stego 1.0a2, The First Steganography Tool for the Macintosh,” Internet reference, Nov. 28, 1993, 3 pages.Applicant
- Macq, “Cryptology for Digital TV Broadcasting,” Proceedings of the IEEE, vol. 83, No. 6, Jun. 1995, pp. 944-957.Applicant
- Matthews, “When Seeing is Not Believing,” New Scientist, Oct. 16, 1993, pp. 13-15.Applicant
- Matsui et al., “Video-Steganography: How to Secretly Embed a Signature in a Picure,” IMA Intellectual Property Project Proceedings, Jan. 1994, vol. 1, Issue 1, pp. 187-205.Applicant
- Microsoft Response to CfP for Technology Solutions to Screen Digital Audio Content for LCM Acceptance, SDMI, PDWG Tokyo, May 23, 1999, 9 pages.Applicant
- Mintzer et al., “Safeguarding Digital Library Contents and Users: Digital Watermarking,” D-Lib Magazine, Dec. 1997, 12 pages.Applicant
- Mintzer et al., “Safeguarding Digital library Contents and Users” Digital Watermarking, D-Lib Magazine, Dec. 1997: ISSN 1082-9873.Applicant
- Mintzer et al., “Toward on-line, Worldwide Access to Vatican Library Materials,” IBM J. Res. Develop. vol. 40 No. 2, Mar., 1996, pp. 139-162.Applicant
- Moller, et al., “Rechnergestutzte Steganographie: Wie sie Funktioniert und warum folglich jede Reglementierung von Verschlusselung unsinnig ist,” DuD, Datenschutz und Datensicherung, Jun. 18, 1994 318-326.Applicant
- “NAB—Cyphertech Starts Anti-Piracy Broadcast Tests,” Newsbytes, NEW03230023, Mar. 23, 1994.Applicant
- Nakamura et al., “A Unified Coding Method of Image and Text Data Using Discrete Orthogonal Transform,” Systems and Computers in Japan, vol. 21, No. 3, 1990, pp. 87-92.Applicant
- Nakamura et al., “A Unified Coding Method of Dithered Image and Text Data Using Micropatterns,” Electronics and Communications in Japan, Part 1, vol. 72, No. 4, 1989, pp. 50-56.Applicant
- New Product Information, “FBI at AppleExpo” (Olympia, London), Nov., 1995, 2 pages.Applicant
- Ohnishi et al., Embedding a Seal into a Picture Under Orthogonal Wavelet Transform, Proceedings of Multimedia '96, 1996, IEEE, pp. 514-421.Applicant
- ORuanaidh et al, “Watermarking Digital Images for Copyright Protection,” http://www.kalman.mee.tcd.ie/people/jjr/eva.sub.—pap.html, Feb. 2, 1996, 8 pages. (Also published Aug., 1996, IEE Proceedings-Vision, Image and Signal Processing, vol. 143, No. 4, ppo. 250-256.).Applicant
- Pennebaker et al., JPEG Still Image Data Compression Standard, Chapter 3, “Aspects of the Human Visual System,” pp. 23-27, 1993, Van Nostrand Reinhold, New York.Applicant
- Pickholtz et al., “Theory of Spread-Spectrum Communications—A Tutorial,” Transactions on Communications, vol. COM-30, No. 5, May, 1982, pp. 855-884.Applicant
- Pitas et al., “Applying Signatures on Digital Images,” IEEE Workshop on Nonlinear Image and Signal Processing, Neos Marmaras, Greece, pp. 460-463, Jun., 1995.Applicant
- Port, “Halting Highway Robbery on the Internet,” Business Week, Oct. 17, 1994, p. 212.Applicant
- Response to CfP for Technlogy Solutions to Screen Digital Audio Content for LCM Acceptance, NTT Waveless Radio Consotium, May 23, 1999, 9 pages.Applicant
- Rindfrey, “Towards an Equitable System for Access Control and Copyright Protection in Braodcast Image Services: The Equicrypt Approach,” Intellectual Property Rights and New Technologies, Proc. of the Conference, R. Oldenbourg Verlag Wien Muchen 1995, 12 pages.Applicant
- Roberts, “Picture Coding Using Pseudorandom Noise,” IRE Trans. on Information Theory, vol. 8, No. 2, Feb., 1962, pp. 145-154.Applicant
- Sanford II et al., “The Data Embedding Method”, Proceedings of the SPIE vol. 2615, pp. 226-259, 1996.Applicant
- Sapwater et al., “Electronic Copyright Protection,” Photo>Electronic Imaging, vol. 37, No. 6, 1994, pp. 16-21. Schneier, “Digital Signatures, Cryptographic Algorithms Can Create Nonforgeable Signatures for Electronic Documents, Making Them Valid Legal Instruments” BYTE, Nov. 1993, pp. 309-312.Applicant
- Schreiber et al., “A Compatible High-Definition Television System Using the Noise-Margin Method of Hiding Enhancement Information,” SMPTE Journal, Dec. 1989, pp. 873-879.Applicant
- SDMI Example Use Scenarios (Non-Exhaustive), Version 1.2, Jun. 16, 1999.Applicant
- [email protected], “Hide and Seek v. 4.0,” Internet reference, Apr. 10, 1994, 3 pages.Applicant
- Short, “Steps Toward Unmasking Secure Communications,” International Journal of Bifurcation and Chaos, vol. 4, No. 4, 1994, pp. 959-977.Applicant
- Simmons, “Subliminal Channels; Past and Present,” ETT, vol. 5, No. 4, Jul.-Aug. 1994, pp. 45-59.Applicant
- Sheng et al., “Experiments on Pattern Recognition Using Invariant Fourier-Mellin Descriptors,” Journal of Optical Society of America, vol. 3, No. 6, Jun., 1986, pp. 771-776.Applicant
- Sklar, “A Structured Overview of Digital Communications—a Tutorial Review—Part I,” IEEE Communications Magazine, Aug., 1983, pp. 1-17.Applicant
- Sklar, “A Structured Overview of Digital Communications—a Tutorial Review—Part II,” IEEE Communications Magazine, Oct., 1983, pp. 6-21.Applicant
- “Steganography,” Intelluctual Property and the National Information Infrastructure The Report of the Working Group on Intellectual Property Rights, Sep. 1995, pp. 212-213.Applicant
- Szepanski, “A Signal Theoretic Method for Creating Forgery-Proof Documents for Automatic Verification,” Proceedings 1979 Carnahan Conference on Crime Countermeasures, May 16, 1979, pp. 101-109.Applicant
- Szepanski, “Additive Binary Data Transmission for Video Signals,” Papers Presented at Conf. Of Comm. Engineering Soc. Sep. 30-Oct. 3, 1980, Technical Reports vol. 74, pp. 342-352.Applicant
- Szepanski, “Additive Binary Data Transmission for Video Signals,” Conference of the Communications Engineering Society, 1980, NTG Technical Reports, vol. 74, pp. 343-351. (German text and English translation enclosed).Applicant
- Tanaka et al., “Embedding Secret Information Into a Dithered Multi-Level Image,” Proc. IEEE Military Comm. Conf., Sep. 1990, pp. 216-220.Applicant
- Tanaka, “Embedding the Attribute Information Into a Dithered Image,” Systems and Computers in Japan, vol. 21, No. 7, 1990, pp. 43-50.Applicant
- Tanaka et al., “A Visual Retrieval System with Private Information for Image Database,” Proceeding International Conference on DSP Applications and Technology, Oct. 1991, pp. 415-421.Applicant
- Tanaka et al., “New Integrated Coding Schemes for Computer-Aided Facsimile,” Proc. IEEE Int'l Conf. on Sys. Integration, Apr. 1990, pp. 275-281.Applicant
- Thomas, Keith, Screening Technology for Content from Compact Discs, May 24, 1999, 11 pages.Applicant
- Tirkel et al., “A Two-Dimensional Digital Watermark,” 1995, 6 pages.Applicant
- Tirkel et al., “Electronic Water Mark,” Dicta-93, Marquarie University, Sydney, Australia, Dec., 1993, pp. 666-672.Applicant
- Tirkel et al, “Electronic Water Mark,” DICTA-93, Macquarie University, Sydney, Australia, Dec., 1993, pp. 666-673.Applicant
- Toga et al., “Registration Revisited,” Journal of Neuroscience Methods, 48 (1993), pp. 1-13.Applicant
- van Schyndel et al., “Towards a Robust Digital Watermark,” ACCV '95, vol. 2, Dec., 1995, pp. 504-508.Applicant
- van Schyndel et al., “A Digital Watermark,” IEEE International Conference on Image Processing, Nov. 13-16, 1994, pp. 86-90.Applicant
- Vidal et al., “Non-Noticeable Information Embedding in Color Images: Marking and Detection”, IEEE 1999, pp. 293-297.Applicant
- Voyatzis et al., “Embedding Robust Watermarks By Chaotic Mixing”, Digital Signal Processing Proceedings, IEEE Jul. 1977, pp. 213-216, vol. 1.Applicant
- Wagner, “Fingerprinting,” 1983 IEEE, pp. 18-22.Applicant
- Walton, “Image Authentication for a Slippery New Age,” Dr. Dobb's Journal, Apr. 1995, pp. 18-26, 82-87.Applicant
- “Watermarking & Digital Signature: Protect Your Work!” Published on Internet 1996, http://Itswww.epfl.ch/.about.jordan/watermarking.html.Applicant
- Weber et al., “Correlative Image Registration,” Seminars in Nuclear Medicine, vol. XXIV, No. 4, Oct. 1994, pp. 311-323.Applicant
- Winograd, J.M., “Audio Watermarking Architecture for Secure Digital Music Distribution,” a Proposal to the SDMI Portable Devices Working Group, by Aris Technologies, Inc., Mar. 26, 1999.Applicant
- Wise, “The History of Copyright, Photographers' Rights Span Three Centuries,” Photo>Electronic Imaging, vol. 37, No. 6, 1994.Applicant
- Wolfgang et al, “A Watermark for Digital Images,” Computer Vision and Image Processing Laboratory, Purdue University, Sep. 1996, pp. 219-222.Applicant
- Zhao et al., “Embedding Robust Labels Into Images for Copyright Protection,” Proc. of the International Congress on Intellectual Property Rights for Specialized Information, Knowledge and New Technologies (Vienna, Austria) Aug. 21-25, 1995, 10 pages.Applicant