US 7,289,643 B2Grant
Method, apparatus and programs for generating and utilizing content signatures
Issue Date:2007-10-30
•28 Claims
•6 Drawing Sheets
Abstract
The present invention relates to deriving and utilizing content signatures. A content signature is a representation of a content item, which is derived from the content item itself. According to the invention, a method of generating a content signature for a signal is provided. The method includes the steps of: i) dividing the signal into at least one set; ii) transforming the set into a frequency-based domain; iii) determining features of the transformed set; and iv) grouping the features so as to form a content signature of the set.
Metadata
Assignee
- Digimarc Corporation
Inventors
- Hugh L. Brunk
- Kenneth L. Levy
Application Information
Application Number:US 10/027,783
Filing Date:2001-12-19
Priority Date:2000-12-21
Art Unit:2624
Classifications
IPC:
G06K9/00
Patent Drawings (6 sheets)
Description
Related Application Date
[0001] The present application claims the benefit of U.S. Provisional Application Nos. 60/257,822, filed Dec. 21, 2000, and 60/263,490, filed Jan. 22, 2001. These applications are herein incorporated by reference.
[0002] The subject matter of the present application is related to that disclosed in U.S. Pat. No. 5,862,260, and in the following U.S. patent applications: Ser. No. 09/503,881 (now U.S. Pat. No. 6,614,914), filed Feb. 14, 2000; Ser. No. 09/563,664 (now U.S. Pat. No. 6,505,160), filed May 2, 2000; Ser. No. 09/620,019, filed Jul. 20, 2000; and Ser. No. 09/661,900 (now U.S. Pat. No. 6,674,876), filed Sep. 14, 2000. Each of these patent documents is herein incorporated by reference.
Technical Field
[0003] The present invention relates generally to deriving identifying information from data. More particularly, the present invention relates to content signatures derived from data, and to applications utilizing such content signatures.
Background and Summary
[0004] Advances in software, computers and networking systems have created many new and useful ways to distribute, utilize and access content items (e.g., audio, visual, and/or video signals). Content items are more accessible than ever before. As a result, however, content owners and users have an increasing need to identify, track, manage, handle, link content or actions to, and/or protect their content items.
[0005] These types of needs may be satisfied, as disclosed in this application, by generating a signature of a content item (e.g., a “content signature”). A content signature represents a corresponding content item. Preferably, a content signature is derived (e.g., calculated, determined, identified, created, etc.) as a function of the content item itself. The content signature can be derived through a manipulation (e.g., a transformation, mathematical representation, hash, etc.) of the content data. The resulting content signature may be utilized to identify, track, manage, handle, protect the content, link to additional information and/or associated behavior, and etc. Content signatures are also known as “robust hashes” and “fingerprints,” and are used interchangeably throughout this disclosure.
[0006] Content signatures can be stored and used for identification of the content item. A content item is identified when a derived signature matches a predetermined content signature. A signature may be stored locally, or may be remotely stored. A content signature may even be utilized to index (or otherwise be linked to data in) a related database. In this manner, a content signature is utilized to access additional data, such as a content ID, licensing or registration information, other metadata, a desired action or behavior, and validating data. Other advantages of a content signature may include identifying attributes associated with the content item, linking to other data, enabling actions or specifying behavior (copy, transfer, share, view, etc.), protecting the data, etc.
[0007] A content signature also may be stored or otherwise attached with the content item itself, such as in a header (or footer) or frame headers of the content item. Evidence of content tampering can be identified with an attached signature. Such identification is made through re-deriving a content signature using the same technique as was used to derive the content signature stored in the header. The newly derived signature is compared with the stored signature. If the two signatures fail to match (or otherwise coincide), the content item can be deemed altered or otherwise tampered with. This functionality provides an enhanced security and verification tool.
[0008] A content signature may be used in connection with digital watermarking. Digital watermarking is a process for modifying physical or electronic media (e.g., data) to embed a machine-readable code into the media. The media may be modified such that the embedded code is imperceptible or nearly imperceptible to the user, yet may be detected through an automated detection process. Most commonly, digital watermarking is applied to media signals such as images, audio signals, and video signals. However, it may also be applied to other types of media objects, including documents (e.g., through line, word or character shifting), software, multi-dimensional graphics models, and surface textures of objects.
[0009] Digital watermarking systems typically have two primary components: an encoder that embeds the watermark in a host media signal, and a decoder that detects and reads the embedded watermark from a signal suspected of containing a watermark (a suspect signal). The encoder embeds a watermark by altering the host media signal. And the decoder analyzes a suspect signal to detect whether a watermark is present. In applications where the watermark encodes information, the reader extracts this information from the detected watermark.
[0010] Several particular watermarking techniques have been developed. The reader is presumed to be familiar with the literature in this field. Particular techniques for embedding and detecting imperceptible watermarks in media signals are detailed in the assignee's co-pending patent application Ser. No. 09/503,881 (now U.S. Pat. No. 6,614,914) and in U.S. Pat. No. 5,862,260, which are referenced above.
[0011] According to one aspect of our invention, the digital watermark may be used in conjunction with a content signature. The watermark can provide additional information, such as distributor and receiver information for tracking the content. The watermark data may contain a content signature and can be compared to the content signature at a later time to determine if the content is authentic. As discussed above regarding a frame header, a content signature can be compared to digital watermark data, and if the content signature and digital watermark data match (or otherwise coincide) the content is determined to be authentic. If different, however, the content is considered modified.
[0012] According to another aspect of the present invention, a digital watermark may be used to scale the content before deriving a content signature of the content. Content signatures are sensitive to scaling (e.g., magnification, scaling, rotation, distortion, etc.). A watermark can include a calibration and/or synchronization signal to realign the content to a base state. Or a technique can be used to determine a calibration and/or synchronization based upon the watermark data during the watermark detection process. This calibration signal (or technique) can be used to scale the content so it matches the scale of the content when the content signature was registered in a database or first determined, thus reducing errors in content signature extraction.
[0013] These and other features and advantages will become apparent with reference to the following detailed description and accompanying drawings.
Brief Description of the Drawings
[0014] FIG. 1 is a flow diagram of a content signature generating method.
[0015] FIG. 2 is a flow diagram of a content signature decoding method.
[0016] FIG. 3 is a diagram illustrating generation of a plurality of signatures to form a list of signatures.
[0017] FIG. 4 is a flow diagram illustrating a method to resolve a content ID of an unknown content item.
[0018] FIG. 5 illustrates an example of a trellis diagram.
[0019] FIG. 6 is a flow diagram illustrating a method of applying Trellis Coded Quantization to generate a signature.
[0020] FIG. 7 is a diagram illustrating correcting distortion in a media signal (e.g., the media signal representing an image, audio or video).
[0021] FIG. 8 is a diagram illustrating the use of a fingerprint, derived from a corrected media signal, to obtain metadata associated with the media signal.
Detailed Description
[0022] The following sections describe methods, apparatus, and/or programs for generating, identifying, handling, linking and utilizing content signatures. The terms “content signature,” “fingerprint,” “hash,” and “signature” are used interchangeably and broadly herein. For example, a signature may include a unique identifier (or a fingerprint) or other unique representation that is derived from a content item. Alternatively, there may be a plurality of unique signatures derived from the same content item. A signature may also correspond to a type of content (e.g., a signature identifying related content items). Consider an audio signal. An audio signal may be divided into segments (or sets), and each segment may include a signature. Also, changes in perceptually relevant features between sequential (or alternating) segments may also be used as a signature. A corresponding database may be structured to index a signature (or related data) via transitions of data segments based upon the perceptual features of the content.
[0023] As noted above, a content signature is preferably derived as a function of the content item itself. In this case, a signature of a content item is computed based on a specified signature algorithm. The signature may include a number derived from a signal (e.g., a content item) that serves as a statistically unique identifier of that signal. This means that there is a high probability that the signature was derived from the digital signal in question. One possible signature algorithm is a hash (e.g., an algorithm that converts a signal into a lower number of bits). The hash algorithm may be applied to a selected portion of a signal (e.g., the first 10 seconds, a video frame or a image block, etc.) to create a signal. The hash may be applied to discrete samples in this portion, or to attributes that are less sensitive to typical audio processing. Examples of less sensitive attributes include most significant bits of audio samples or a low pass filtered version of the portion. Examples of hashing algorithms include MD5, MD2, SHA, and SHA1.
[0024] A more dynamic signature deriving process is discussed with respect to FIG. 1 . With reference to FIG. 1 , an input signal is segmented in step 20. The signal may be an audio, video, or image signal, and may be divided into sets such as segments, frames, or blocks, respectively. Optionally, the sets may be further reduced into respective sub-sets. In step 22, the segmented signal is transformed into a frequency domain (e.g., a Fourier transform domain), or time-frequency domain. Applicable transformation techniques and related frequency-based analysis are discussed in Assignee's Ser. No. 09/661,900 patent application (now U.S. Pat. No. 6,674,876), referenced above. Of course other frequency transformation techniques may be used.
[0025] transformed set's relevant features (e.g., perceptual relevant features represented via edges; magnitude peaks, frequency characteristics, etc.) are identified per set in step 24. For example, a set's perceptual features, such as an object's edges in a frame or a transition of such edges between frames, are identified, analyzed or calculated. In the case of a video signal, perceptual edges may be identified, analyzed, and/or broken into a defining map (e.g., a representation of the edge, the edge location relevant to the segment's orientation, and/or the edge in relation to other perceptual edges.). In another example, frequency characteristics such as magnitude peaks having a predetermined magnitude, or a relatively significant magnitude, are used for such identifying markers. These identifying markers can be used to form the relevant signature.
[0026] Edges can also be used to calculate an object's center of mass, and the center of mass may be used as identifying information (e.g., signature components) for an object. For example, after thresholding edges of an object (e.g., identifying the edges), a centering algorithm may be used to locate an object's center of mass. A distance (e.g., up, down, right, left, etc.) may be calculated from the center of mass to each edge, or to a subset of edges, and such dimensions may be used as a signature for the object or for the frame. As an alternative, the largest object (or set of objects) may be selected for such center of mass analysis.
[0027] In another embodiment, a generalized Hough transform is used to convert content items such as video and audio signals into a signature. A continuous sequence of the signatures is generated via such a transform. The signature sequence can then be stored for future reference. The identification of the signature is through the transformation of the sequence of signatures. Trellis decoding and Viterbi decoding can be used in the database resolution of the signature.
[0028] In step 26, the set's relevant features (e.g., perceptual features, edges, largest magnitude peaks, center of mass, etc.) are grouped or otherwise identified, e.g., thorough a hash, mathematical relationship, orientation, positioning, or mapping to form a representation for the set. This representation is preferably used as a content signature for the set. This content signature may be used as a unique identifier for the set, an identifier for a subset of the content item, or as a signature for the entire content item. Of course, a signature need not be derived for every set (e.g., segment, frame, or block) of a content item. Instead, a signature may be derived for alternating sets or for every nth set, where n is an integer of one or more.
[0029] As shown in step 28, resulting signatures are stored. In one example, a set of signatures, which represents a sequence of segments, frames or blocks, is linked (and stored) together. For example, signatures representing sequential or alternating segments in an audio signal may be linked (and stored) together. This linking is advantageous when identifying a content item from a partial stream of signatures, or when the signatures representing the beginning of a content item are unknown or otherwise unavailable (e.g., when only the middle 20 seconds of an audio file are available). When perceptually relevant features are used to determine signatures, a linked list of such signatures may correspond to transitions in the perceptually relevant data between frames (e.g., in video). A hash may also be optionally used to represent such a linked list of signatures.
[0030] There are many possible variations for storing a signature or a linked list of signatures. The signature may be stored along with the content item in a file header (or footer) of the segment, or otherwise be associated with the segment. In this case, the signature is preferably recoverable as the file is transferred, stored, transformed, etc. In another embodiment, a segment signature is stored in a segment header (or footer). The segment header may also be mathematically modified (e.g., encrypted with a key, XORed with an ID, etc.) for additional security. The stored content signature can be modified by the content in that segment, or hash of content in that segment, so that it is not recoverable if some or all of content is modified, respectively. The mathematical modification helps to prevent tampering, and to allow recovery of the signature in order to make a signature comparison. Alternatively, the signatures may be stored in a database instead of, or in addition to, being stored with the content item. The database may be local, or may be remotely accessed through a network such as a LAN, WAN, wireless network or internet. When stored in a database, a signature may be linked or associated with additional data. Additional data may include identifying information for the content (e.g., author, title, label, serial numbers, etc.), security information (e.g., copy control), data specifying actions or behavior (e.g., providing a URL, licensing information or rights, etc.), context information, metadata, etc.
[0031] To illustrate one example, software executing on a user device (e.g., a computer, PVR, MP3 player, radio, etc.) computes a content signature for a content item (or segments within the content item) that is received or reviewed. The software helps to facilitate communication of the content signature (or signatures) to a database, where it is used to identify the related content item. In response, the database returns related information, or performs an action related to the signature. Such an action may include linking to another computer (e.g., a web site that returns information to the user device), transferring security or licensing information, verifying content and access, etc.
[0032] FIG. 2 is a flow diagram illustrating one possible method to identify a content item from a stream of signatures (e.g., a linked set of consecutive derived signatures for an audio signal). In step 32, Viterbi decoding (as discussed further below) is applied according to the information supplied in the stream of signatures to resolve the identify of the content item. The Viterbi decoding efficiently matches the stream to the corresponding content item. In this regard, the database can be thought of as a trellis structure of linked signatures or signature sequences. A Viterbi decoder can be used to match (e.g., corresponding to a minimum cost function) a stream with a corresponding signature in a database. Upon identifying the content item, the associated behavior or other information is indexed in the database (step 34). Preferably, the associated behavior or information is returned to the source of the signature stream (step 36).
[0033] FIGS. 3 and 4 are diagrams illustrating an embodiment of the present invention in which a plurality of content signatures is utilized to identify a content item. As illustrated in FIG. 3 , a content signature 42 is calculated or determined (e.g., derived) from content item 40. The signature 42 may be determined from a hash (e.g., a manipulation which represents the content item 40 as an item having fewer bits), a map of key perceptual features (magnitude peaks in a frequency-based domain, edges, center of mass, etc.), a mathematical representation, etc. The content 40 is manipulated 44, e.g., compressed, transformed, D/A converted, etc., to produce content' 46. A content signature 48 is determined from the manipulated content' 46. Of course, additional signatures may be determined from the content, each corresponding to a respective manipulation. These additional signatures may be determined after one manipulation from the original content 40, or the additional signatures may be determined after sequential manipulations. For example, content' 46 may be further manipulated, and a signature may be determined based on the content resulting from that manipulation. These signatures are then stored in a database. The database may be local, or may be remotely accessed through a network (LAN, WAN, wireless, internet, etc.). The signatures are preferably linked or otherwise associated in the database to facilitate database look-up as discussed below with respect to FIG. 4 .
[0034] FIG. 4 is a flow diagram illustrating a method to determine an identification of an unknown content item. In step 50, a signal set (e.g., image block, video frame, or audio segment) is input into a system, e.g., a general-purpose computer programmed to determine signatures of content items. A list of signatures is determined in step 52. Preferably, the signatures are determined in a corresponding fashion as discussed above with respect to FIG. 3 . For example, if five signatures for a content item, each corresponding to a respective manipulation (or a series of manipulations) of the content item, are determined and stored with respect to a subject content item, then the same five signatures are preferably determined in step 52. The list of signatures is matched to the corresponding signatures stored in the database. As an alternative embodiment, subsets or levels of signatures may be matched (e.g., only 2 of the five signatures are derived and then matched). The security and verification confidence increases as the number of signatures matched increases.
[0035] A set of perceptual features of a segment (or a set of segments) can also be used to create “fragile” signatures. The number of perceptual features included in the signature can determine its robustness. If the number is large, a hash could be used as the signature.
Digital Watermarks and Content Signatures
[0036] Content signatures may be used advantageously in connection with digital watermarks.
[0037] A digital watermark may be used in conjunction with a content signature. The watermark can provide additional information, such as distributor and receiver information for tracking the content. The watermark data may contain a content signature and can be compared to the content signature at a later time to determine if the content is authentic. A content signature also can be compared to digital watermark data, and if the content signature and digital watermark data match (or otherwise coincide) the content is determined to be authentic. If different, however, the content is considered modified.
[0038] A digital watermark may be used to scale the content before deriving a content signature of the content. Content signatures are sensitive to scaling (and/or rotation, distortion, etc.). A watermark can include a calibration and/or synchronization signal to realign the content to a base state. Or a technique can be used to determine a calibration and/or synchronization based upon the watermark data during the watermark detection process. This calibration signal (or technique) can be used to scale the content so it matches the scale of the content when the content signature was registered in a database or first determined, thus reducing errors in content signature extraction.
[0039] Indeed, a content signature can be used to identify a content item (as discussed above), and a watermark is used to supply additional information (owner ID, metadata, security information, copy control, etc). The following example is provided to further illustrate the interrelationship of content signatures and digital watermarks.
[0040] A new version of the Rolling Stones song “Angie” is ripped (e.g., transferred from one format or medium to another). A compliant ripper or a peer-to-peer client operating on a personal computer reads the watermark and calculates the signature of the content (e.g., “Angie”). To ensure that a signature may be rederived after a content item is routinely altered (e.g., rotated, scaled, transformed, etc.), a calibration signal can be used to realign (or retransform) the data before computing the signature. Realigning the content item according to the calibration signal helps to ensure that the content signature will be derived from the original data, and not from an altered original. The calibration signal can be included in header information, hidden in an unused channel or data area, embedded in a digital watermark, etc. The digital watermark and content signature are then sent to a central database. The central database determines from the digital watermark that the owner is, for example, Label X. The content signature is then forwarded to Label X's private database, or to data residing in the central database (depending upon Label X's preference), and this secondary database determines that the song is the new version of “Angie.” A compliant ripper or peer-to-peer client embeds the signature (i.e., a content ID) and content owner ID in frame headers in a fashion secure to modification and duplication, and optionally, along with desired ID3v2 tags.
[0041] To further protect a signature (e.g., stored in a header or digital watermark), a content owner could define a list of keys, which are used to scramble (or otherwise encrypt) the signature. The set of keys may optionally be based upon a unique ID associated with the owner. In this embodiment, a signature detector preferably knows the key, or gains access to the key through a so-called trusted third party. Preferably, it is optimal to have a signature key based upon content owner ID. Such a keying system simplifies database look-up and organization. Consider an example centered on audio files. Various record labels may wish to keep the meaning of a content ID private. Accordingly, if a signature is keyed with an owner ID, the central database only needs to identify the record label's content owner ID (e.g., an ID for BMG) and then it can forward all BMG songs to a BMG database for their response. In this case, the central database does not need all of the BMG content to forward audio files (or ID's) to BMG, and does not need to know the meaning of the content ID. Instead, the signature representing the owner is used to filter the request.
Content Signature Calculations
[0042] For images or video, a content signature can be based on a center of mass of an object or frame, as discussed above. An alterative method is to calculate an object's (or frame's) center of mass is to multiply each pixel's luminescence with its location from the lower left corner (or other predetermined position) of the frame, sum all pixels within the object or frame, and then divide by the average luminescence of the object or frame. The luminescence can be replaced by colors, and a center of mass can be calculated for every color, such as RGB or CMYK, or one color. The center of mass can be calculated after performing edge detection, such as high pass filtering. The frame can be made binary by comparing to a threshold, where a 1 represents a pixel greater than the threshold and a 0 represents a pixel less than the threshold. The threshold can be arbitrary or calculated from an average value of the frame color, luminescence, either before or after edge detection. The center of mass can produce a set of values by being calculated for segments of the frame, in images or video, or for frames over time in video.
[0043] Similarly, the average luminescence of a row or block of a frame can be used as the basic building block for a content signature. The average value of each row or block is put together to represent the signature. With video, there could be the calculation of rows and blocks over time added to the set of values representing the signature.
[0044] The center of mass can be used for object, when the objects are predefined, such as with MPEG. The center of mass for each object is sequentially combined into a content signature.
[0045] One way of identifying audio and video content—apart from digital watermarks—is fingerprinting technology. As discussed herein, such fingerprinting technology generally works by characterizing content by some process that usually—although not necessarily—yields a unique data string. Innumerable ways can be employed to generate the data string. What is important is (a) its relative uniqueness, and (2) its relatively small size. Thus a 1 Mbyte audio file may be distilled down to a 2 Kbyte identifier.
[0046] One technique of generating a fingerprint—seemingly not known in the art—is to select frames (video or MP3 segments, etc.) pseudorandomly, based on a known key, and then performing a hashing or other lossy transformation process on the frames thus selected.
Content Signature Applications
[0047] One longstanding application of such technology has been in monitoring play-out of radio advertising. Advertisements are “fingerprinted,” and the results stored in a database. Monitoring stations then process radio broadcasts looking for audio that has one of the fingerprints stored in the database. Upon finding a match, play-out of a given advertisement is confirmed.
[0048] Some fingerprinting technology may employ a “hash” function to yield the fingerprint. Others may take, e.g., the most significant bit of every 10th sample value to generate a fingerprint. Etc., etc. A problem arises, however, if the content is distorted. In such case, the corresponding fingerprint may be distorted too, wrongly failing to indicate a match.
[0049] In accordance with this aspect of the present invention, content is encoded with a steganographic reference signal by which such distortion can be identified and quantized. If the reference data in a radio broadcast indicates that the audio is temporally scaled (e.g., by tape stretch, or by psycho-acoustic broadcast compression technology), the amount of scaling can be determined. The resulting information can be used to compensate the audio before fingerprint analysis is performed. That is, the sensed distortion can be backed-out before the fingerprint is computed. Or the fingerprint analysis process can take the known temporal scaling into account when deriving the corresponding fingerprint. Likewise with distorted image and video. By such approaches, fingerprint technology is made a more useful technique.
[0050] (Pending application Ser. No. 09/452,023, filed Nov. 30, 1999, details such a reference signal (sometimes termed a “grid” signal, and its use in identifying and quantizing distortion. Pending application Ser. No 09/689,250 details various fingerprint techniques.)
[0051] In a variant system, a watermark payload—in addition to the steganographic reference signal—is encoded with the content. Thus, the hash (or other fingerprint) provides one identifier associated with the content, and the watermark provides another. Either can be used, e.g., to index related information (such as connected content). Or they can be used jointly, with the watermark payload effectively extending the ID conveyed by the hash (or vice versa).
[0052] In addition, the grid signal discussed above may consist of tiles, and these tiles can be used to calibrate content signatures that consist of a set of sub-fingerprints. For example, the tile of the grid can represent the border or block for each of the calculations of the sub-fingerprints, which are then combined into a content signature.
[0053] A technique similar to that detailed above can be used in aiding pattern recognition. Consider services that seek to identify image contents, e.g., internet porn filtering, finding a particular object depicted among thousands of frames of a motion picture, or watching for corporate trademarks in video media. (Cobion, of Kassel, Germany, offers some such services.) Pattern recognition can be greatly for-shortened if the orientation, scale, etc., of the image are known. Consider the Nike swoosh trademark. It is usually depicted in horizontal orientation. However, if an image incorporating the swoosh is rotated 30 degrees, its recognition is made more complex.
[0054] To redress this situation, the original image can be steganographically encoded with a grid (calibration) signal as detailed in the application Ser. No. 09/452,023. Prior to performing any pattern recognition on the image, the grid signal is located, and indicates that the image has been rotated 30 degrees. The image can then be counter-rotated before pattern recognition is attempted.
[0055] Fingerprint technology can be used in conjunction with digital watermark technology in a variety of additional ways. Consider the following.
[0056] One is to steganographically convey a digital object's fingerprint as part of a watermark payload. If the watermark-encoded fingerprint does not match the object's current fingerprint, it indicates the object has been altered.
[0057] A watermark can also be used to trigger extraction of an object's fingerprint (and associated action based on the fingerprint data). Thus, one bit of a watermark payload, may signal to a compliant device that it should undertake a fingerprint analysis of the object.
[0058] In other arrangements, the fingerprint detection is performed routinely, rather than triggered by a watermark. In such case, the watermark can specify an action that a compliant device should perform using the fingerprint data. (In cases where a watermark triggers extraction of the fingerprint, a further portion of the watermark can specify a further action.) For example, if the watermark bit has a “0” value, the device may respond by sending the fingerprint to a remote database; if the watermark bit has a “1” value, the fingerprint is stored locally.
[0059] Still further, frail (or so-called fragile) watermarks can be used in conjunction with fingerprint technology. A frail or fragile watermark is designed to be destroyed, or to degrade predictably, upon some form of signal processing. In the current fingerprinting environment, if a frail watermark is detected, then a fingerprint analysis is performed; else not. And/or, the results of a fingerprint analysis can be utilized in accordance with information conveyed by a frail watermark. (Frail watermarks are disclosed, e.g., in application Ser. Nos. 09/234,780, 09/433,104, 60/198,138, 09/616,462, 09/645,779, 60/232,163, 09/689,293, and 09/689,226.)
Content Signatures from Compressed Data
[0060] Content signatures can be readily employed with compressed or uncompressed data content. One inventive method determines the first n significant bits (where n is an integer, e.g., 64) of a compression signal and uses the n bits as (or to derive) a signature for that signal. This signature technique is particularly advantageous since, generally, image compression schemes code data by coding the most perceptually relevant features first, and then coding relevantly less significant features from there. Consider JPEG 2000 as an example. As will be appreciated by those skilled in that art, JPEG 2000 uses a wavelet type compression, where the image is hierarchically sub-divided into sub-bands, from low frequency perceptually relevant features, to higher frequency lesser perceptually relevant features. Using the low frequency information as a signature (or a signature including a hash of this information) creates a perceptually relevant signature.
[0061] The largest frequency components from a content item (e.g., a video signal) can use the compressed or uncompressed data to determine a signature. For example, in an MPEG compressed domain, large scaling factors (e.g., 3 or more of the largest magnitude peaks) are identified, and these factors are used as a content signature or to derive (e.g., a mapping or hash of the features) a content signature. As an optional feature, a content item is low pass filtered to smooth rough peaks in the frequency domain. As a result, the large signature peaks are not close neighbors.
[0062] Continuing this idea with time varying data, transitions in perceptually relevant data of frames of audio/video over time can be tracked to form a unique content signature. For example, in compressed video, a perceptually relevant hash of n frames can be used to form a signature of the content. In audio, the frames correspond to time segments, and the perceptually relevant data could be defined similarly, based on human auditory models, e.g., taking the largest frequency coefficients in a range of frequencies that are the most perceptually significant. Accordingly, the above inventive content signature techniques are applicable to compressed data, as well as uncompressed data.
Cue Signals and Content Signatures
[0063] Cue signals are an event in the content, which can signal the beginning of a content signature calculation. For example, a fade to black in video could be a cue to start calculating (e.g., deriving) the content signature, either for original entry into the database or for database lookup.
[0064] If the cue signal involves processing, where the processing is part of the content signature calculation, the system will be more efficient. For example, if the content signature is based upon frequency peaks, the cue signal could be a specific pattern in the frequency components. As such, when the cue signal is found, the content signature is partially calculated, especially if the content signature is calculated with content before the cue (which should be saved in memory while searching for the cue signal). Other cue signals may include, e.g., I-frames, synchronization signals, and digital watermarks.
[0065] In the broadcast monitoring application, where the presence and amount of content is measured, such as an advertisement on TV, timing accuracy (e.g., with a 1 sec.) is required. However, cue signals do not typically occur on such a regular interval (e.g., 1 sec.). As such, content signatures related to a cue signal can be used to identify the content, but the computation of the content to locate the cue signal elements are saved to determine timing within the identified content. For example, the cue signal may include the contrast of the center of the frame, and the contrast from frame to frame represents the timing of the waveform and is saved. The video is identified from several contrast blocks, after a specific cue, such as fade to black in the center. The timing is verified by comparing the pre-existing and future contrasts of the center frame to those stored in the database for the TV advertisement.
[0066] Content signatures are synchronized between extraction for entry into the database and for extraction for identifying the unknown content by using peaks of the waveform envelope. Even when there is an error calculating the envelope peak, if the same error occurs at both times of extraction, the content signatures match since they are both different by the same amount; thus, the correct content is identified.
List Decoding and Trellis Coded Quantization
[0067] The following discussion details another method, which uses Trellis Coded Quantization (TCQ), to derive a content signature from a content item. Whereas the following discussion uses an image for an example, it will be appreciated by one of ordinary skill in the art that the concepts detailed below can be readily applied to other content items, such as audio, video, etc. For this example, an image is segmented into blocks, and real numbers are associated with the blocks. In a more general application of this example, a set of real numbers is provided and a signature is derived from the set of real numbers.
Initial Signature Calculation
[0068] In step 60 of FIG. 6 , TCQ is employed to compute an N-bit hash of N real numbers, where N is an integer. The N real numbers may correspond to (or represent) an image, or may otherwise correspond to a data set. This method computes the hash using a Viterbi algorithm to calculate the shortest path through a trellis diagram associated with the N real numbers. A trellis diagram, a generalized example of which is shown in FIG. 5 , is used to map transition states (or a relationship) for related data. In this example, the relationship is for the real numbers. As will be appreciated by those of ordinary skill in the art, the Viterbi algorithm finds the best state sequence (with a minimum cost) through the trellis. The resulting shortest path is used as the signature. Further reference to Viterbi Decoding Algorithms and trellis diagrams may be had to “List Viterbi Decoding Algorithms with Applications,” IEEE Transactions on Communications, Vol. 42, No. 2/3/4, 1994, pages 313-322, hereby incorporated by reference.
[0069] One way to generate the N real numbers is to perform a wavelet decomposition of the image and to use the resulting coefficients of the lowest frequency sub-band. These coefficients are then used as the N real numbers for the Viterbi decoding (e.g., to generate a signature or hash).
[0070] One way to map a larger set of numbers M to an N bit hash, where M>N and M and N are integers, is to use trellis coded vector quantization, where the algorithm deals with sets of real numbers, rather than individual real numbers. The size and complexity for a resulting signature may be significantly reduced with such an arrangement.
[0071] In step 62 (FIG. 6 ), the initial signature (e.g., hash) is stored in a database. Preferably, the signature is associated with a content ID, which is associated with a desired behavior, information, or action. In this manner, a signature may be used to index or locate additional information or desired behavior.
Recalculating Signatures for Matching in the Database
[0072] In a general scenario, a content signature (e.g., hash) is recalculated from the content item as discussed above with respect to Trellis Coded Quantization.
[0073] In many cases, however, a content signal will acquire noise or other distortion as it is transferred, manipulated, stored, etc. To recalculate the distorted content signal's signature (e.g., calculate a signature to be used as a comparison with a previously calculated signature), the following steps may be taken. Generally, list decoding is utilized as a method to identify the correct signature (e.g., the undistorted signature). As will be appreciated by one of ordinary skill in the art, list decoding is a generalized form of Viterbi decoding, and in this application is used to find the most likely signatures for a distorted content item. List decoding generates X the most likely signatures for the content item, where X is an integer. To do so, a list decoding method finds the X shortest paths (e.g., signatures) through a related trellis diagram. The resulting X shortest paths are then used as potential signature candidates to find the original signature.
[0074] As an alternative embodiment, and before originally computing the signature (e.g., for storage in the database), a calibration watermark is embedded in the content item, and possibly with one or more bits of auxiliary data. A signature is then calculated which represents the content with the watermark signal. The calibration watermark assists in re-aligning the content after possible distortion when recomputing a signature from a distorted signal. The auxiliary data can also be used as an initial index into the database to reduce the complexity of the search for a matching a signature. Database lookup time is reduced with the use of auxiliary data.
[0075] In the event that a calibration watermark is included in the content, the signature is recomputed after re-aligning the content data with calibration watermark. Accordingly, a signature of the undistorted, original (including watermark) content can be derived.
Database Look-Up
[0076] Once a content signature (e.g., hash) is recalculated in one of the methods discussed above, a database query is executed to match recalculated signatures against stored signatures, as shown in step 64 (FIG. 6 ). This procedure, for example, may proceed according to known database querying methods.
[0077] In the event that list decoding generates X most likely signatures, the X signatures are used to query the database until a match is found. Auxiliary data, such as provided in a watermark, can be used to further refine the search. A user may be presented with all possible matches in the event that two or more of the X signatures match signatures in the database.
[0078] A progressive signature may also be used to improve database efficiency. For example, a progressive signature may include a truncated or smaller hash, which represents a smaller data set or only a few (out of many) segments, blocks or frames. The progressive hash may be used to find a plurality of potential matches in the database. A more complete hash can then be used to narrow the field from the plurality of potential matches. As a variation of this progressive signature matching technique, soft matches (e.g., not exact, but close matches) are used at one or more points along the search. Accordingly, database efficiency is increased.
[0079] Database lookup for content signatures can use a database configuration based upon randomly addressable memory (RAM). In this configuration, the database can be pre-organized by neighborhoods of related content signatures to speed detection. In addition, the database can be searched in conventional methods, such as binary tree methods.
[0080] Given that the fingerprint is of fixed size, it represents a fixed number space. For example, a 32-bit fingerprint has 4 billion potential values. In addition, the data entered in the database can be formatted to be a fixed size. Thus, any database entry can be found by multiplying the fingerprint by the size of the database entry size, thus speeding access to the database.
Content Addressable Memory
[0081] Another inventive alternative uses a database based on content addressable memory (CAM) as opposed to RAM. CAM devices can be used in network equipment, particularly routers and switches, computer systems and other devices that require content searching.
[0082] Operation of a CAM device is unlike that of a RAM device. For RAM, a controller provides an address, and the address is used to access a particular memory location within the RAM memory array. The content stored in the addressed memory location is then retrieved from the memory array. A CAM device, on the other hand, is interrogated by desired content. Indeed, in a CAM device, key data corresponding to the desired content is generated and used to search the memory locations of the entire CAM memory array. When the content stored in the CAM memory array does not match the key data, the CAM device returns a “no match” indication. When the content stored in the CAM memory array matches the key data, the CAM device outputs information associated with the content. Further reference to CAM technology can be made to U.S. Pat. Nos. 5,926,620 and 6,240,003, which are each incorporated herein by reference.
[0083] CAM is also capable of performing parallel comparisons between input content of a known size and a content table completely stored in memory, and when it finds a match it provides the desired associated output. CAM is currently used, e.g., for Internet routing. For example, an IP address of 32 bits can be compared in parallel with all entries in a corresponding 4-gigabit table, and from the matching location the output port is identified or linked to directly. CAM is also used in neural networks due to the similarity in structure. Interestingly, it is similar to the way our brain functions, where neurons perform processing and retain the memory—as opposed to Van Neumann computer architecture, which has a CPU, and separate memory that feeds data to the CPU for processing.
[0084] CAM can also be used in identifying fingerprints with metadata.
[0085] For file based fingerprinting, where one fingerprint uniquely identifies the content, the resulting content fingerprint is of a known size. CAM can be used to search a complete fingerprint space as is done with routing. When a match is found, the system can provide a web link or address for additional information/metadata. Traditionally CAM links to a port, but it can also link to memory with a database entry, such as a web address.
[0086] CAM is also useful for a stream-based fingerprint, which includes a group of sub-fingerprints. CAM can be used to look up the group of sub-fingerprints as one content signature as described above.
[0087] Alternatively, each sub-fingerprint can be analyzed with CAM, and after looking up several sub-fingerprints one piece of content will be identified, thus providing the content signature. From that content signature, the correct action or web link can quickly be found with CAM or traditional RAM based databases.
[0088] More specifically, the CAM can include the set of sub-fingerprints with the associated data being the files that include those sub-fingerprints. After a match is made in CAM with an input sub-fingerprint, the complete set of sub-fingerprints for each potential file can be compared to the set of input fingerprints using traditional processing methods based upon hamming errors. If a match is made, the file is identified. If not, the next sub-fingerprint is used in the above process since the first sub-fingerprint must have had an error. Once the correct file is identified, the correct action or web link can quickly be found with CAM or traditional RAM-based databases, using the unique content identification, possibly a number or content name.
Varying Content
[0089] Some content items may be represented as a sequence of N bit signatures, such as time varying audio and video content. A respective N bit signature may correspond to a particular audio segment, or video frame, such as an I frame. A database may be structured to accommodate such a structure or sequence.
[0090] In one embodiment, a calibration signal or some other frame of reference (e.g., timing, I frames, watermark counter, auxiliary data, header information, etc.) may be used to synchronize the start of the sequence and reduce the complexity of the database. For example, an audio signal may be divided into segments, and a signature (or a plurality of signatures) may be produced for such segments. The corresponding signatures in the database may be stored or aligned according to time segments, or may be stored as a linked list of signatures.
[0091] As an alternative, a convolution operation is used to match an un-synchronized sequence of hashes with the sequences of hashes in the database, such as when a synchronization signal is not available or does not work completely. In particular, database efficiency may be improved by a convolution operation such as a Fast Fourier Transform (FFT), where the convolution essentially becomes a multiplication operation. For example, a 1-bit hash may be taken for each segment in a sequence. Then to correlate the signatures, an inverse FFT is taken of the 1-bit hashes. The magnitude peaks associated with the signatures (and transform) are analyzed. Stored signatures are then searched for potential matches. The field is further narrowed by taking progressively larger signatures (e.g., 4-bit hashes, 8-bit hashes, etc.).
[0092] As a further alternative, a convolution plus a progress hash is employed to improve efficiency. For example, a first sequence of 1-bit hashes is compared against stored signatures. The matches are grouped as a potential match sub-set. Then a sequence of 2-bit hashes is taken and compared against the second sub-set—further narrowing the potential match field. The process repeats until a match is found.
Dual Fingerprint Approach
[0093] An efficiently calculated content signature can be used to narrow the search to a group of content. Then, a more accurate and computationally intense content signature can be calculated on minimal content to locate the correct content from the group. This second more complex content signature extraction can be different than the first simple extraction, or it can be based upon further processing of the content used in the first, but simple, content signature. For example, the first content signature may include peaks of the envelope, and the second content signature comprises the relative amplitude of each Fourier component as compared to the previous component, where a 1 is created when the current component is greater than the previous and a 0 is created when the current component is less than or equal to the previous component As another example, the first content signature may include the three largest Fourier peaks, and the second content signature may include the relative amplitude of each Fourier component, as described in the previous example.
Concluding Remarks
[0094] Having described and illustrated the principles of the technology with reference to specific implementations, it will be recognized that the technology can be implemented in many other, different, forms. To provide a comprehensive disclosure without unduly lengthening the specification, applicants incorporate by reference the patents and patent applications referenced above.
[0095] It should be appreciated that the above section headings are not intended to limit the present invention, and are merely provided for the reader's convenience. Of course, subject matter disclosed under one section heading can be readily combined with subject matter under other headings.
[0096] The methods, processes, and systems described above may be implemented in hardware, software or a combination of hardware and software. For example, the transformation and signature deriving processes may be implemented in a programmable computer running executable software or a special purpose digital circuit. Similarly, the signature deriving and matching process and/or database functionality may be implemented in software, electronic circuits, firmware, hardware, or combinations of software, firmware and hardware. The methods and processes described above may be implemented in programs executed from a system's memory (a computer readable medium, such as an electronic, optical, magnetic-optical, or magnetic storage device).
[0097] 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.
Claims
What is claimed is:
1. A method of linking an image or video to metadata contained in a network resource, said method comprising:
receiving data corresponding to an image or video;
correcting or adjusting for a geometric orientation of the data; and then
calculating a fingerprint or signature as an identifier from the corrected or adjusted for data;
providing at least a sub-set of the fingerprint or signature to a network resource to identify metadata associated with the image or video, wherein the metadata is associated with—but separate from—the fingerprint or signature and the data; and
receiving from the network resource at least some of the metadata associated with the image or video.
2. The method of claim 1, wherein the metadata comprises at least one of a URL, image, audio or video.
3. The method of claim 1, wherein correcting or adjusting for a geometric orientation of the data comprises at least one of scaling, rotating or translating.
4. A method of linking an image to metadata contained in a network resource, said method comprising:
receiving image or video data;
correcting or adjusting for a geometric orientation of the image or video data;
interrogating a network resource through use of a fingerprint or signature derived or determined from inherent attributes of image or video data to identify metadata associated with the image or video data, wherein the metadata is associated with—but separate from—the fingerprint or signature and the image or video data; and
providing identified metadata.
5. The method of claim 4, wherein changing a geometric orientation of the data comprises at least one of scaling, rotating or translating.
6. The method of claim 4, wherein the identified metadata comprises at least one item from a group comprising: a URL, image, audio and video.
7. The method of claim 4 wherein the image or video data comprises an orientation component steganographically embedded therein, and wherein said correcting or adjusting for utilizes the orientation component.
8. The method of claim 4 wherein the inherent attributes of the changed image data comprise a plural-bit identifier.
9. The method of claim 8 wherein the plural-bit identifier is derived from the image data as at least one of a fingerprint, hash or signature.
10. A method of linking an image or video to metadata contained in a network resource comprising:
receiving image or video data from a wireless device;
correcting for distortion in the received image or video data; and then
comparing a fingerprint or signature representing inherent characteristics of the corrected image or video data to a plurality of records, wherein each record includes at least image or video characteristics;
upon a successful match with a record, identifying metadata associated with—but separate from—the fingerprint or signature and at least one of:i) the record or ii) image or video data; and
providing identified metadata to the wireless device.
11. The method of claim 10, wherein the identified metadata comprises at least one of a URL, image, audio or video.
12. The method of claim 10, wherein the wireless device comprises a wireless telephone.
13. A method of linking an image or video to metadata contained in a network resource, said method comprising:
receiving data corresponding to an image or video;
correcting or adjusting for a geometric orientation of the data, wherein the image or video comprises an orientation component steganographically embedded therein, and wherein said correcting or adjusting for utilizes the orientation component;
calculating a fingerprint or signature identifier from the data;
providing at least a sub-set of the identifier to a network resource to identify metadata associated with the image or video; and
receiving from the network resource at least some of the metadata associated with the image or video.
14. A method of linking media to metadata contained in a network resource, said method comprising:
obtaining data corresponding to a media signal;
correcting for or realigning a geometric or alignment characteristic of the data representing the media signal; and then
deriving a fingerprint or signature from the corrected for or realigned data representing the media signal;
interrogating a network resource with at least a sub-set of the fingerprint or signature to identify metadata associated with the media signal; and
providing at least some of the identified metadata associated with the media signal.
15. The method of claim 14 wherein the media signal comprises an orientation component steganographically embedded therein, and wherein said correcting for or realigning utilizes the orientation component.
16. The method of claim 14, wherein the metadata comprises at least one of a URL, image, audio or video.
17. A method of linking media to metadata contained in a network resource, said method comprising:
obtaining media;
realigning or adjusting for a geometric orientation or alignment characteristic of the media; and then
providing a fingerprint or signature derived or determined from inherent attributes of the media to a network resource to identify metadata associated with the media; and
providing or receiving identified metadata.
18. The method of claim 17 wherein the media comprises an orientation component steganographically embedded therein, and wherein said realigning or adjusting for utilizes the orientation component.
19. The method of claim 17, wherein the metadata comprises at least one item from a group comprising: a URL, image, audio and video.
20. The method of claim 17 wherein the inherent attributes of the changed media comprise a plural-bit identifier.
21. The method of claim 20 wherein the plural-bit identifier is derived from the image data as at least one of a fingerprint hash or signature.
22. The method of claim 17 wherein the media comprises at least one of an image, video or audio
23. A method of linking media to metadata contained in a network resource, said method comprising:
obtaining media;
connecting for distortion in the media; and then
providing a fingerprint or signature attributes calculated or derived from the corrected media to a network resource to identify metadata associated with the media; and
providing or receiving identified metadata.
24. The method of claim 22 wherein the media comprises a steganographic orientation component, and said connecting utilizes the steganographic orientation component.
25. The method of claim 22 wherein the attributes comprise at least one of a hash, fingerprint or signature.
26. The method of claim 22 wherein the attributes comprise a plural-bit identifier.
27. The method of claim 25 wherein the plural-bit identifier is derived or calculated from the media as a fingerprint, hash or signature.
28. The method of claim 23 wherein the media comprises at least one of an image, video or audio.
Patent Citations (274)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3810156(A) | 1974-05-01 | Goldman | Applicant |
| US3919479(A) | 1975-11-01 | Moon et al. | Applicant |
| US4071698(A) | 1978-01-01 | Barger, Jr. et al. | Applicant |
| US4230990(A) | 1980-10-01 | Lert, Jr. et al. | Applicant |
| US4284846(A) | 1981-08-01 | Marley | Applicant |
| US4432096(A) | 1984-02-01 | Bunge | Applicant |
| US4450531(A) | 1984-05-01 | Kenyon et al. | Applicant |
| US4495526(A) | 1985-01-01 | Baranoff-Rossine | Applicant |
| US4499601(A) | 1985-02-01 | Matthews | Applicant |
| US4511917(A) | 1985-04-01 | Kohler et al. | Applicant |
| US4547804(A) | 1985-10-01 | Greenberg | Applicant |
| US4677466(A) | 1987-06-01 | Lert, Jr. et al. | Applicant |
| US4682370(A) | 1987-07-01 | Matthews | Applicant |
| US4697209(A) | 1987-09-01 | Kiewit et al. | Applicant |
| US4739398(A) | 1988-04-01 | Thomas | Applicant |
| US4776017(A) | 1988-10-01 | Fujimoto | Applicant |
| US4807031(A) | 1989-02-01 | Broughton et al. | Applicant |
| US4843562(A) | 1989-06-01 | Kenyon et al. | Applicant |
| US4858000(A) | 1989-08-01 | Lu | Applicant |
| US4945412(A) | 1990-07-01 | Kramer | Applicant |
| US4972471(A) | 1990-11-01 | Gross | Applicant |
| US4994831(A) | 1991-02-01 | Marandi | Applicant |
| US5019899(A) | 1991-05-01 | Boles et al. | Applicant |
| US5031228(A) | 1991-07-01 | Lu | Applicant |
| US5276629(A) | 1994-01-01 | Reynolds | Applicant |
| US5303393(A) | 1994-04-01 | Noreen et al. | Applicant |
| US5319735(A) | 1994-06-01 | Preuss et al. | Applicant |
| US5400261(A) | 1995-03-01 | Reynolds | Applicant |
| US5436653(A) | 1995-07-01 | Ellis et al. | Applicant |
| US5437050(A) | 1995-07-01 | Lamb et al. | Applicant |
| US5481294(A) | 1996-01-01 | Thomas et al. | Applicant |
| US5486686(A) | 1996-01-01 | Zdybel, Jr. et al. | Applicant |
| US5504518(A) | 1996-04-01 | Ellis et al. | Applicant |
| US5539635(A) | 1996-07-01 | Larson, Jr. | Applicant |
| US5564073(A) | 1996-10-01 | Takahisa | Applicant |
| US5572246(A) | 1996-11-01 | Ellis et al. | Applicant |
| US5572653(A) | 1996-11-01 | DeTemple et al. | Applicant |
| US5574519(A) | 1996-11-01 | Manico et al. | Applicant |
| US5574962(A) | 1996-11-01 | Fardeau et al. | Applicant |
| US5577249(A) | 1996-11-01 | Califano | Applicant |
| US5577266(A) | 1996-11-01 | Takahisa et al. | Applicant |
| US5579124(A) | 1996-11-01 | Aijala et al. | Applicant |
| US5581658(A) | 1996-12-01 | O'Hagan et al. | Applicant |
| US5581800(A) | 1996-12-01 | Fardeau et al. | Applicant |
| US5584070(A) | 1996-12-01 | Harris et al. | Applicant |
| US5612729(A) | 1997-03-01 | Ellis et al. | Applicant |
| US5613004(A) | 1997-03-01 | Cooperman et al. | Applicant |
| US5621454(A) | 1997-04-01 | Ellis et al. | Applicant |
| US5640193(A) | 1997-06-01 | Wellner | Applicant |
| US5646997(A) | 1997-07-01 | Barton | Applicant |
| US5652626(A) | 1997-07-01 | Kawakami et al. | Applicant |
| US5659726(A) | 1997-08-01 | Sandford, II et al. | Applicant |
| US5661787(A) | 1997-08-01 | Pocock | Applicant |
| US5663766(A) | 1997-09-01 | Sizer, II | Applicant |
| US5671267(A) | 1997-09-01 | August et al. | Applicant |
| US5687236(A) | 1997-11-01 | Moskowitz | Applicant |
| US5708478(A) | 1998-01-01 | Tognazzini | Applicant |
| US5710834(A) | 1998-01-01 | Rhoads | Applicant |
| US5721788(A) | 1998-02-01 | Powell et al. | Applicant |
| US5737025(A) | 1998-04-01 | Dougherty et al. | Applicant |
| US5740244(A) | 1998-04-01 | Indeck | Applicant |
| US5751854(A) | 1998-05-01 | Saitoh et al. | Applicant |
| US5761606(A) | 1998-06-01 | Wolzien | Applicant |
| US5765152(A) | 1998-06-01 | Erickson | Applicant |
| US5765176(A) | 1998-06-01 | Bloomberg | Applicant |
| US5774452(A) | 1998-06-01 | Wolosewicz | Applicant |
| US5778192(A) | 1998-07-01 | Shuster et al. | Applicant |
| US5781914(A) | 1998-07-01 | Stork et al. | Applicant |
| US5799092(A) | 1998-08-01 | Kristol et al. | Applicant |
| US5832119(A) | 1998-11-01 | Rhoads | Applicant |
| US5835639(A) | 1998-11-01 | Honsinger et al. | Applicant |
| US5841978(A) | 1998-11-01 | Rhoads | Applicant |
| US5842162(A) | 1998-11-01 | Fineberg | Applicant |
| US5859920(A) | 1999-01-01 | Daly et al. | Applicant |
| US5862260(A) | 1999-01-01 | Rhoads | Applicant |
| US5889868(A) | 1999-03-01 | Moskowitz et al. | Applicant |
| US5892900(A) | 1999-04-01 | Ginter et al. | Applicant |
| US5893095(A) | 1999-04-01 | Jain et al. | Applicant |
| US5901224(A) | 1999-05-01 | Hecht | Applicant |
| US5902353(A) | 1999-05-01 | Reber et al. | Applicant |
| US5903892(A) | 1999-05-01 | Hoffert et al. | Applicant |
| US5905248(A) | 1999-05-01 | Russell et al. | Applicant |
| US5905800(A) | 1999-05-01 | Moskowitz et al. | Applicant |
| US5918223(A) | 1999-06-01 | Blum et al. | Applicant |
| US5930369(A) | 1999-07-01 | Cox et al. | Examiner |
| US5932863(A) | 1999-08-01 | Rathus | Applicant |
| US5938727(A) | 1999-08-01 | Ikeda | Applicant |
| US5943422(A) | 1999-08-01 | Van Wie et al. | Applicant |
| US5949055(A) | 1999-09-01 | Fleet et al. | Applicant |
| US5978791(A) | 1999-11-01 | Farber et al. | Applicant |
| US5982956(A) | 1999-11-01 | Lahmi | Applicant |
| US5983176(A) | 1999-11-01 | Hoffert et al. | Applicant |
| US5986651(A) | 1999-11-01 | Reber et al. | Applicant |
| US5986692(A) | 1999-11-01 | Logan et al. | Applicant |
| US5991500(A) | 1999-11-01 | Kanota et al. | Applicant |
| US5991737(A) | 1999-11-01 | Chen | Applicant |
| US5995105(A) | 1999-11-01 | Reber et al. | Applicant |
| US6028960(A) | 2000-02-01 | Graf et al. | Applicant |
| US6031914(A) | 2000-02-01 | Tewfik et al. | Applicant |
| US6081629(A) | 2000-06-01 | Browning | Applicant |
| US6081827(A) | 2000-06-01 | Reber et al. | Applicant |
| US6081830(A) | 2000-06-01 | Schindler | Applicant |
| US6084528(A) | 2000-07-01 | Beach et al. | Applicant |
| US6088455(A) | 2000-07-01 | Logan et al. | Applicant |
| US6121530(A) | 2000-09-01 | Sonoda | Applicant |
| US6122403(A) | 2000-09-01 | Rhoads | Applicant |
| US6138151(A) | 2000-10-01 | Reber et al. | Applicant |
| US6157721(A) | 2000-12-01 | Shear et al. | Applicant |
| US6164534(A) | 2000-12-01 | Rathus et al. | Applicant |
| US6169541(B1) | 2001-01-01 | Smith | Applicant |
| US6181817(B1) | 2001-01-01 | Zabih | Applicant |
| US6185316(B1) | 2001-02-01 | Buffam | Applicant |
| US6199048(B1) | 2001-03-01 | Hudetz et al. | Applicant |
| US6201879(B1) | 2001-03-01 | Bender et al. | Applicant |
| US6219787(B1) | 2001-04-01 | Brewer | Applicant |
| US6282362(B1) | 2001-08-01 | Murphy et al. | Applicant |
| US6286036(B1) | 2001-09-01 | Rhoads | Applicant |
| US6304523(B1) | 2001-10-01 | Jones et al. | Applicant |
| US6311214(B1) | 2001-10-01 | Rhoads | Applicant |
| US6314192(B1) | 2001-11-01 | Chen et al. | Applicant |
| US6314457(B1) | 2001-11-01 | Schena et al. | Applicant |
| US6317881(B1) | 2001-11-01 | Shah-Nazaroff et al. | Applicant |
| US6321992(B1) | 2001-11-01 | Knowles et al. | Applicant |
| US6324573(B1) | 2001-11-01 | Rhoads | Applicant |
| US6345104(B1) | 2002-02-01 | Rhoads | Applicant |
| US6386453(B1) | 2002-05-01 | Russell et al. | Applicant |
| US6389055(B1) | 2002-05-01 | August et al. | Applicant |
| US6401206(B1) | 2002-06-01 | Khan et al. | Applicant |
| US6408331(B1) | 2002-06-01 | Rhoads | Applicant |
| US6411392(B1) | 2002-06-01 | Bender et al. | Applicant |
| US6411725(B1) | 2002-06-01 | Rhoads | Applicant |
| US6415280(B1) | 2002-07-01 | Farber et al. | Applicant |
| US6425081(B1) | 2002-07-01 | Iwamura | Examiner |
| US6433946(B2) | 2002-08-01 | Ogino | Applicant |
| US6434561(B1) | 2002-08-01 | Durst, Jr. et al. | Applicant |
| US6439465(B1) | 2002-08-01 | Bloomberg | Applicant |
| US6466670(B1) | 2002-10-01 | Tsuria et al. | Applicant |
| US6496802(B1) | 2002-12-01 | van Zoest et al. | Applicant |
| US6505160(B1) | 2003-01-01 | Levy | Applicant |
| US6522769(B1) | 2003-02-01 | Rhoads et al. | Applicant |
| US6523175(B1) | 2003-02-01 | Chan | Applicant |
| US6526449(B1) | 2003-02-01 | Philyaw et al. | Applicant |
| US6542927(B2) | 2003-04-01 | Rhoads | Applicant |
| US6542933(B1) | 2003-04-01 | Durst, Jr. et al. | Applicant |
| US6553129(B1) | 2003-04-01 | Rhoads | Applicant |
| US6574594(B2) | 2003-06-01 | Pitman et al. | Applicant |
| US6577746(B1) | 2003-06-01 | Evans et al. | Applicant |
| US6611524(B2) | 2003-08-01 | Devanagondi et al. | Examiner |
| US6611607(B1) | 2003-08-01 | Davis et al. | Applicant |
| US6614914(B1) | 2003-09-01 | Rhoads | Applicant |
| US6658568(B1) | 2003-12-01 | Ginter et al. | Applicant |
| US6674876(B1) | 2004-01-01 | Hannigan et al. | Applicant |
| US6674993(B1) | 2004-01-01 | Tarbouriech | Applicant |
| US6681028(B2) | 2004-01-01 | Rodriguez et al. | Applicant |
| US6748360(B2) | 2004-06-01 | Pitman et al. | Applicant |
| US6748533(B1) | 2004-06-01 | Wu | Applicant |
| US6768980(B1) | 2004-07-01 | Meyer et al. | Applicant |
| US6771885(B1) | 2004-08-01 | Agnihotri | Applicant |
| US6772124(B2) | 2004-08-01 | Hoffberg et al. | Applicant |
| US6785421(B1) | 2004-08-01 | Gindele et al. | Examiner |
| US6807534(B1) | 2004-10-01 | Erickson | Applicant |
| US6834308(B1) | 2004-12-01 | Ikezoye et al. | Applicant |
| US6850252(B1) | 2005-02-01 | Hofberg | Applicant |
| US6856977(B1) | 2005-02-01 | Adelsbach | Applicant |
| US6870547(B1) | 2005-03-01 | Crosby et al. | Examiner |
| US6931451(B1) | 2005-08-01 | Logan et al. | Applicant |
| US6941275(B1) | 2005-09-01 | Swierczek | Applicant |
| US6968337(B2) | 2005-11-01 | Wold | Applicant |
| US6973669(B2) | 2005-12-01 | Daniels | Applicant |
| US6987862(B2) | 2006-01-01 | Rhoads | Applicant |
| US6990453(B2) | 2006-01-01 | Wang | Applicant |
| US7010144(B1) | 2006-03-01 | Davis et al. | Applicant |
| US7047413(B2) | 2006-05-01 | Yacobi et al. | Applicant |
| US7050603(B2) | 2006-05-01 | Rhoads et al. | Applicant |
| US7058697(B2) | 2006-06-01 | Rhoads | Applicant |
| US7116781(B2) | 2006-10-01 | Rhoads | Applicant |
| US7127744(B2) | 2006-10-01 | Levy | Applicant |
| US2001/0007130(A1) | 2001-07-01 | Takaragi | Applicant |
| US2001/0011233(A1) | 2001-08-01 | Narayanaswami | Applicant |
| US2001/0019611(A1) | 2001-09-01 | Hilton | Applicant |
| US2001/0026618(A1) | 2001-10-01 | Van Wie et al. | Applicant |
| US2001/0026629(A1) | 2001-10-01 | Oki | Applicant |
| US2001/0031066(A1) | 2001-10-01 | Meyer et al. | Applicant |
| US2001/0044824(A1) | 2001-11-01 | Hunter et al. | Applicant |
| US2001/0055391(A1) | 2001-12-01 | Jacobs | Applicant |
| US2002/0012444(A1) | 2002-01-01 | Nishikawa et al. | Examiner |
| US2002/0021805(A1) | 2002-02-01 | Schumann et al. | Applicant |
| US2002/0021822(A1) | 2002-02-01 | Maeno | Applicant |
| US2002/0023020(A1) | 2002-02-01 | Kenyon et al. | Applicant |
| US2002/0023148(A1) | 2002-02-01 | Ritz et al. | Applicant |
| US2002/0023218(A1) | 2002-02-01 | Lawandy et al. | Applicant |
| US2002/0028000(A1) | 2002-03-01 | Conwell et al. | Applicant |
| US2002/0032698(A1) | 2002-03-01 | Cox | Applicant |
| US2002/0032864(A1) | 2002-03-01 | Rhoads | Applicant |
| US2002/0037083(A1) | 2002-03-01 | Weare et al. | Applicant |
| US2002/0040433(A1) | 2002-04-01 | Kondo | Applicant |
| US2002/0044659(A1) | 2002-04-01 | Ohta | Applicant |
| US2002/0048224(A1) | 2002-04-01 | Dygert | Applicant |
| US2002/0052885(A1) | 2002-05-01 | Levy | Applicant |
| US2002/0059208(A1) | 2002-05-01 | Abe | Applicant |
| US2002/0059580(A1) | 2002-05-01 | Kalker | Applicant |
| US2002/0068987(A1) | 2002-06-01 | Hars | Applicant |
| US2002/0069107(A1) | 2002-06-01 | Werner | Applicant |
| US2002/0069370(A1) | 2002-06-01 | Mack | Applicant |
| US2002/0072982(A1) | 2002-06-01 | Van de Sluis | Applicant |
| US2002/0072989(A1) | 2002-06-01 | Van de Sluis | Applicant |
| US2002/0075298(A1) | 2002-06-01 | Schena et al. | Applicant |
| US2002/0082731(A1) | 2002-06-01 | Pitman et al. | Applicant |
| US2002/0083123(A1) | 2002-06-01 | Freedman et al. | Applicant |
| US2002/0087885(A1) | 2002-07-01 | Peled | Applicant |
| US2002/0088336(A1) | 2002-07-01 | Stahl | Applicant |
| US2002/0099555(A1) | 2002-07-01 | Pitman et al. | Applicant |
| US2002/0102966(A1) | 2002-08-01 | Lev et al. | Applicant |
| US2002/0118864(A1) | 2002-08-01 | Kondo et al. | Applicant |
| US2002/0126872(A1) | 2002-09-01 | Brunk | Applicant |
| US2002/0133499(A1) | 2002-09-01 | Ward et al. | Applicant |
| US2002/0138744(A1) | 2002-09-01 | Schleicher et al. | Applicant |
| US2002/0150165(A1) | 2002-10-01 | Huizer | Applicant |
| US2002/0152388(A1) | 2002-10-01 | Linnartz et al. | Applicant |
| US2002/0153661(A1) | 2002-10-01 | Brooks et al. | Applicant |
| US2002/0161741(A1) | 2002-10-01 | Wang et al. | Applicant |
| US2002/0168082(A1) | 2002-11-01 | Razdan | Applicant |
| US2002/0174431(A1) | 2002-11-01 | Bowman et al. | Applicant |
| US2002/0178410(A1) | 2002-11-01 | Haitsma et al. | Applicant |
| US2002/0184505(A1) | 2002-12-01 | Mihcak et al. | Applicant |
| US2003/0018709(A1) | 2003-01-01 | Schrempp et al. | Applicant |
| US2003/0028796(A1) | 2003-02-01 | Roberts et al. | Applicant |
| US2003/0033321(A1) | 2003-02-01 | Schrempp et al. | Applicant |
| US2003/0037010(A1) | 2003-02-01 | Schmelzer et al. | Applicant |
| US2003/0051252(A1) | 2003-03-01 | Miyaoku | Applicant |
| US2003/0101162(A1) | 2003-05-01 | Thompson et al. | Applicant |
| US2003/0120679(A1) | 2003-06-01 | Kriechbaum et al. | Applicant |
| US2003/0135623(A1) | 2003-07-01 | Schrempp et al. | Applicant |
| US2003/0167173(A1) | 2003-09-01 | Levy et al. | Applicant |
| US2003/0174861(A1) | 2003-09-01 | Levy et al. | Applicant |
| US2003/0197054(A1) | 2003-10-01 | Eunson | Applicant |
| US2004/0049540(A1) | 2004-03-01 | Wood | Applicant |
| US2004/0145661(A1) | 2004-07-01 | Murakami et al. | Applicant |
| US2004/0163106(A1) | 2004-08-01 | Schrempp et al. | Applicant |
| US2004/0169892(A1) | 2004-09-01 | Yoda | Applicant |
| US2004/0201676(A1) | 2004-10-01 | Needham | Applicant |
| US2004/0223626(A1) | 2004-11-01 | Honsinger et al. | Applicant |
| US2005/0043018(A1) | 2005-02-01 | Kawamoto | Applicant |
| US2005/0044189(A1) | 2005-02-01 | Ikezoye et al. | Applicant |
| US2005/0058319(A1) | 2005-03-01 | Rhoads et al. | Applicant |
| US2005/0108242(A1) | 2005-05-01 | Kalker et al. | Applicant |
| US2005/0144455(A1) | 2005-06-01 | Haitsma | Applicant |
| US2005/0229107(A1) | 2005-10-01 | Hull et al. | Applicant |
| US2005/0267817(A1) | 2005-12-01 | Barton et al. | Applicant |
| EP161512 | 1985-11-01 | Applicant | |
| EP493091 | 1992-07-01 | Applicant | |
| EP493091 | 1992-07-01 | Applicant | |
| EP953938 | 1999-11-01 | Applicant | |
| EP953938(A2) | 1999-11-01 | Applicant | |
| EP967803 | 1999-12-01 | Applicant | |
| EP1173001 | 2002-01-01 | Applicant | |
| EP1199878 | 2002-04-01 | Applicant | |
| JP11265396 | 1999-09-01 | Applicant | |
| WO98/03923 | 1998-01-01 | Applicant | |
| WO99/35809 | 1999-07-01 | Applicant | |
| WO/58940 | 2000-10-01 | Applicant | |
| WO1/15021 | 2001-03-01 | Applicant | |
| WO1/20483 | 2001-03-01 | Applicant | |
| WO1/20609 | 2001-03-01 | Applicant | |
| WO1/62004 | 2001-08-01 | Applicant | |
| WO172030 | 2001-09-01 | Applicant | |
| WO1/71517 | 2001-09-01 | Applicant | |
| WO172030 | 2001-09-01 | Applicant | |
| WO175794 | 2001-10-01 | Applicant | |
| WO1/75629 | 2001-10-01 | Applicant | |
| WO2/11123 | 2002-02-01 | Applicant | |
| WO219589 | 2002-03-01 | Applicant | |
| WO2/27600 | 2002-04-01 | Applicant | |
| WO2082271 | 2002-10-01 | Applicant |
Non-Patent Literature (24)
- U.S. Appl. No. 60/257,822, filed Dec. 21, 2000, Aggson et al.Applicant
- U.S. Appl. No. 60/263,490, filed Jan. 22, 2001, Brunk et al.Applicant
- U.S. Appl. No. 60/232,618, filed Sep. 14, 2000, Cox.Applicant
- Ghias et al, Query by Humming: Musical Information Retrieval In An Audio Database. In ACM Multimedia, pp. 231-236, Nov., 1995.Applicant
- Kageyama et al, Melody Retrieval with Humming, Proceedings of Int. Computer Music Conference (ICMC), 1993.Applicant
- Muscle Fish press release, Muscle Fish's Audio Search Technology to be Encapsulated into Informix Datablade Module, Jul. 10, 1996.Applicant
- Wold et al, Content-Based Classification, Search, and Retrieval of Audio, IEEE Multimedia Magazine, Fall, 1996.Applicant
- U.S. Appl. No. 60/175,159, filed Jan. 7, 2000, Derose et al.Applicant
- U.S. Appl. No. 60/178,028, filed Jan. 26, 2000, Meyer et al.Applicant
- PCT/US01/50238 Notification of Transmittal of the International Search Report or the Declaration and International Search Report dated May 31, 2002.Applicant
- PCT/US01/50238 Written Opinion dated Feb. 13, 2003.Applicant
- Lin, et al., “Generating Robust Digital Signature for Image/Video Authentication,” Proc. Multimedia and Security workshop at ACM Multimedia '98, Sep. 1, 1998, pp. 49-54.Applicant
- Cox et al., “Secure Spread Spectrum Watermarking for Images, Audio and Video,” 1996 IEEE, pp. 243-246.Applicant
- Kawaguchi et al., “Principles and Applications of BPCS-Steganography,” Proc. SPIE vol. 3528: Multimedia Systems and Applications, Nov. 2-4, 1998, pp. 464-473.Applicant
- Koch et al., “Copyright Protection for multimedia Data,” Fraunhofer Institute for Computer Graphics, Dec. 16, 1994, 15 pages. “Access Control and COpyright Protection for Images, WorkPackage 8: Watermarking,” Jun. 30, 1995, 46 pages.Applicant
- Komatsu et al., “Authentication System Using Concealed Image in Telematics,” Memoirs of the School of Science & Engineering, Waseda Univ., No. 52, 1988, pp. 45-60.Applicant
- Matsui et al., “Video-Steganography: How to Secretly Embed a Signature in a Picture,” IMA Intellectual Property Project Proceedings, Jan. 1994, vol. 1, Issue 1, pp. 187-205.Applicant
- O'Ruanaidh, “Rotation, Scale and Translation Invariant Digital Image Watermarking,” Signal Processing, pp. 2-15, May 1, 1998.Applicant
- O'Runanaidh, “Rotation, Scale and Translation Invariant Digital Image Watermarking,” 1997 IEEE, pp. 536-539.Applicant
- Sheng, “Experiments on Pattern Recognition Using Invariant Fourier-Mellin Descriptors,” Journal of Optical Society of America, vol. 3, No. 6, pp. 771-776, 1986.Applicant
- Szepanski, “A Signal Theoretic Method For Creating Forgery-Proof Documents For Automatic Verification”, 1979 Carnahan Conference on Crime Countermeasures, University of Kentucky, Lexington, Kentucky, May 16-18, 1979.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., Embedding Secret Information Into a Dithered Multi-Level Image, 1990 IEEE, pp. 216-220.Applicant
- van Schyndel et al., “A Digital Watermark,” IEEE International Conference on Image Processing, Nov. 13, 1994 pp. 86-90.Applicant