Media monitoring, management and information system

Information

  • Patent Grant
  • 8806517
  • Patent Number
    8,806,517
  • Date Filed
    Monday, May 10, 2010
    14 years ago
  • Date Issued
    Tuesday, August 12, 2014
    10 years ago
Abstract
Systems and methods are provided for monitoring transmissions of media content (such as audio and audiovisual content) in order to obtain independent and objective data regarding the use of specific media content recordings or works within the transmissions. Processing and reporting of such data is provided in various ways to serve a variety of business needs. Methods for employing content identification technology to efficiently and automatically obtain reliable, accurate, and precise monitoring data are also disclosed. Various information products and services based on such monitoring systems are proposed.
Description
BACKGROUND OF THE INVENTION

The present invention relates generally to systems for monitoring transmissions of media content (such as audio and audiovisual content) in order to obtain independent and objective data regarding the use of specific media content recordings or works within said transmissions. The invention also relates to the processing and reporting of such data in various ways to serve a variety of business needs. More particularly, the invention relates to methods for employing content identification technology to efficiently and automatically obtain reliable, accurate, and precise monitoring data. The invention further relates to methods for producing information products and services based on such monitoring systems.


It is often desired to perform monitoring to obtain information regarding the use of (or the failure to use) particular media content (such as live or prerecorded music, radio and television programming, and advertising) within various types of transmissions (such as radio and television broadcasts, Internet downloads and streams, and public address systems). The commercial reasons for desiring such information are many and varied, including: providing proof-of-performance for paid advertisements, determining compliance with syndication licenses, identifying uses of copyrighted sound recordings within other programming, administration of the performing rights associated with copyrighted musical compositions, determining the audience size of broadcasts, identifying retransmissions of network or syndicated content, identifying corrupted or partial transmission of advertisements or programming, identifying unauthorized transmissions of copyrighted works, and identifying uses of promotional content and public service announcements.


In such monitoring, it may be desirable to obtain a variety of pieces of information regarding the use of the media content, including identification of the exact time, date, location of reception, duration, quality, origin, and method of transmission of the content. In addition, it is advantageous to perform such monitoring automatically without significant intervention from human operators.


There are a number of prior art broadcast monitoring systems, which may generally be classified in two groups: passive and active systems. In passive systems, where no additional signals are added to the broadcast programs, measurements of individualizing innate characteristics of the broadcast signals are used to identify a particular segment. These characteristics are sometimes referred to as “fingerprints” in analogy with human fingerprints that are used to identify individuals. Some examples of fingerprints include spectral variations of the broadcast signals, statistical moments, predefined patterns, such as key words, or predefined signal shapes, etc. Descriptions of passive monitoring and identification systems may be found in U.S. Pat. Nos. 3,919,479; 4,230,990; 4,677,466; 4,697,209; 4,843,562; 5,210,831; 5,436,653; 5,481,294; 5,504,518 and 5,581,658. Such fingerprinting techniques have the disadvantage of requiring complicated search algorithms for comparing the fingerprints that are extracted from broadcast segments to a large database of previously stored fingerprints. In addition, they require a sizeable database of stored fingerprints which only grows in size and complexity as the monitoring service is expanded to include newly produced content.


Active systems modify broadcast signals by introducing (e.g., via “embedding”) additional data-carrying signals into the broadcast in a way that does not interfere with normal viewing and/or listening of the broadcast content. However, such additional signals can be detected and decoded (i.e. “extracted”) by an appropriately designed device. Active systems may be classified into two categories, usually known as ‘out-of-band’ and ‘in-band’ systems.


In out-of-band systems, the additional information does not reside within the frequency, time or spatial content of the broadcast signal. For example, some video monitoring signals use the vertical blanking intervals of a video signal to insert identification codes. Other systems use a carrier signal outside the frequency spectrum of audio signals for carrying the identification information. Examples of such systems are described in U.S. Pat. Nos. 4,686,707; 4,967,273 and 5,425,100. The primary disadvantage of such systems is their vulnerability to format conversion and filtering of the broadcast signals during distribution of the content. For example, data inserted in the vertical blanking intervals (VBI) of an NTSC format video signal may be lost if the video signal is converted from NTSC to MPEG format. Likewise, additional data signals inserted in the audio spectrum outside the range of human hearing may be removed by bandpass filtering of the encoded audio signals.


In contrast, the additional information in an ‘in-band’ system is inserted within the visible portion of video and/or audible portion of audio content, which is more likely to be preserved during any further duplication, distribution, processing, or broadcast of the content. This type of embedding of auxiliary signals into humanly-perceivable media content is often called “watermarking.” Some examples of such watermarking systems include embedding auxiliary information into television broadcasts by changing the luminescence of adjacent horizontal lines of video in opposite directions. In a typical viewing situation, the human visual system would ‘average’ adjacent horizontal lines and not notice the deviations from the original. Other systems modulate the auxiliary identification information with an independently generated carrier signal using well-known modulation techniques such as AM, FM, PM or spread-spectrum, and then introduce the modulated signal as low level noise into the broadcast segment. Examples of such systems can be found in U.S. Pat. Nos. 3,842,196; 3,885,217; 4,686,707; 4,945,412; 4,969,041; 5,200,822; 5,379,345; 5,404,377; 5,404,160; 5,408,258; 5,425,100; 5,450,490; 5,579,124; 5,581,800 and 6,404,898. These systems can generally be made resilient to a wider variety of transmission channel impairments than their out-of-band counterparts. Extraction of reliable identification information under more severe channel impairments, however, usually necessitates increasing the strength of the embedded watermark. This, in turn, compromises visual and/or audio quality of the broadcast segment. In addition, these systems usually fail to withstand combinations of such unintentional impairments or intentional attacks. A short list of typical transmission channel impairments which may be present in an audio-visual transmission channel include: lossy compression (e.g. MPEG), linear time compression/expansion, pitch-invariant time compression/expansion, Gaussian and non-Gaussian noise, equalization, voice over, change in resolution, change in bit depth, filtering, digital-to-analog and analog-to-digital conversions, interpolation, cropping, rotation, geometrical distortions, dynamic range compression, etc.


While a number of broadcast monitoring systems that have been deployed commercially employ image or video-based watermark technology, there are certain advantages in using audio watermarks for monitoring. For example, it may be less computationally-expensive to process audio information because of its relatively slow data rate (compared to typical video data rates). Of course, the processing requirements strongly depend on the particular technology in use. It is also possible to monitor both audio and audiovisual content through the use of audio watermarking, whereas image or video-based watermarking fails to address the monitoring of exclusively audio content.


SUMMARY OF THE INVENTION

It is a principal object of this invention to provide reliable and comprehensive monitoring methods that overcome various deficiencies of the prior art systems. It is another object of the present invention to provide improved monitoring data through the use of redundant receivers and combined analysis of multiple copies of the same transmitted content. It is also an object of this invention to improve the accuracy or effectiveness of monitoring by measuring the quality of the received transmission or the transmission channel by measuring received transmission channel characteristics such as Signal-to-Noise-Ratio (SNR) or dropped packet rate. It is another object of this invention to differentiate between multiple points of origin of a composite transmission, such as the local, regional and national broadcast segments of a given networked television broadcast or an interstitially inserted advertisement in an Internet stream. It is a further object of the present invention to monitor the use of content in the presence of multiple transmission channel impairments. It should be noted that the term “transmission” as used herein will be understood to encompass, but not be limited to, broadcast programming, including satellite, network and cable television and radio programs, Internet broadcast programs, or any other type of program that is transmitted for reception by an audience. All or parts of such programming segments may reside on tangible storage media such as optical, magnetic, and electronic storage media for the purposes of storage, playback or distribution.


In accordance with the invention, a method is provided for monitoring broadcast multi-media content. Multimedia source content is received, and identification information related to the source content is generated. An audio component of the multimedia source content is imperceptibly and repeatedly embedded with the identification information. A detectability metric is produced by assessing the success of the embedding. The detectability metric is transferred to a central repository together with the identification information. The embedded multimedia content is transmitted through one or more broadcast networks, and received at a receiver. The received multimedia content is processed to extract identification information related to the multimedia content. It is noted that as used herein, the term “imperceptibly” includes “substantially imperceptibly”, as it is conceivable that a person with a trained ear or an unusually acute aural sense may be able to perceive some distinction between the audio component prior to and after the identification information is embedded therein.


In an illustrated embodiment, extraction of embedded information is conducted in the presence of multiple transmission channel impairments. The embedding can be repeated in either or both of the temporal domain and frequency domains. Where the repetition is done in the frequency domain, it can occur at different frequencies.


Extraction of multiple copies of embedded information can be used to improve the reliability of multimedia monitoring. For example, extraction of multiple copies of embedded information can be used in accordance with the invention to estimate the duration of multimedia content embedded with identification information.


In one disclosed embodiment, the multiple copies are extracted from the multimedia content received over a single transmission channel. Alternatively, the multiple copies can be extracted from the multimedia content received from a plurality of transmission channels. The multiple copies can, for example, be extracted using a redundant network of receivers. The redundant receivers can be deployed in separate geographical locations.


At least one transmission channel for the embedded multimedia content can be a terrestrial broadcast channel. Alternatively, at least one transmission channel can be an Internet broadcast channel.


The spacing of the extracted copies of embedded information can be used to estimate the boundaries of back-to-back encoded multimedia clips. Moreover, the effectiveness of monitoring can be enhanced by measuring received transmission channel characteristics such as Signal-to-Noise-Ratio (SNR) or dropped packet rate. This technique can provide a measure of the quality of at least one of a received transmission or a transmission channel.


The detectability metric can be used at the monitoring sites to improve the reliability of detection reports. Further, the detectability metric and measured transmission channel characteristics (such as Signal-to-Noise-Ratio (SNR) or dropped packet rate) can be used at the monitoring sites to improve the reliability of multimedia monitoring. It is also disclosed that the identification information may be re-embedded with a modified embedding strength based on the detectability metric.


The type and extent of impairments present in the transmission channel can be identified based on the quality of extracted information from the embedded multimedia content.


The present disclosure also teaches that multiple points of origin of a composite transmission, such as the local, regional and national broadcast segments of a given networked television broadcast or an interstitially inserted advertisement in an Internet stream, are differentiated.


Prior to the transmission of multimedia content, the multimedia content can be examined for the presence of a valid watermark. For example, the validity of an embedded watermark can be ascertained by verifying the embedded identification information against corresponding information residing in a database.


A system is also disclosed for monitoring broadcast multi-media content. Receiving means are provided for receiving multimedia source content. Identification information generating means are used to generate identification information related to the source content. Embedding means imperceptibly and repeatedly embed the audio component of the multimedia source content with the identification information. Watermark assessment means produce a detectability metric by assessing the success of the embedding. Transfer means transfer the delectability metric together with the identification information to a central repository. Transmission means transmit the embedded multimedia content through one or more broadcast networks. Reception means receive the broadcast multimedia content. Processing means process the received multimedia content to extract identification information related to the multimedia content.


These and additional features and advantages of the present invention, such as its novel system architecture, set of services offered, system control and maintenance features, which result in exceptional performance characteristics, will become more readily clear from the following detailed description of the media monitoring, management and information system, together with the accompanying drawings.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates a general monitoring network connectivity framework;



FIG. 2 is detailed block diagram of a preferred embodiment of the monitoring system;



FIG. 3 is a step by step description of an encoding process in accordance with the invention;



FIG. 4 is a step by step description of an extraction process in accordance with the invention;



FIG. 5 illustrates a first alternate embodiment of the system of FIG. 2;



FIG. 6 illustrates a second alternate embodiment of the system of FIG. 2;



FIG. 7 illustrates a third alternate embodiment of the system of FIG. 2;



FIG. 8 is a step-by-step description of a fail-safe verification process; and



FIG. 9 is block diagram illustrating a real-time embedding process.





DETAILED DESCRIPTION OF THE INVENTION


FIG. 1 is a high-level diagram of a monitoring system for detecting encoded information carried in a data signal. The source content 10 may comprise, for example, TV and radio commercials, programs, movie and program promos, music which is produced for broadcast, etc. All or parts of such source content 10 may reside on storage devices such as magnetic tapes, hard drives, optical storage or electronic memory devices. Alternatively, the source content 10 may be the soundtrack of a motion picture that is stored on the same medium or separate from the motion picture, e.g., as a digital or analog signal using any of a variety of well-known optical or magnetic techniques. In such cases, means must be provided to extract the associated audio in a computer-readable form for subsequent watermark embedding. It is further possible to directly access the audio signal from the production source without the need for intermediate storage. Such scenarios include direct (acoustical) coupling from the sound source, such as in live musical concerts or theatrical events, or during the studio production via digital and/or streaming networks and apparatus. Delivery means for such source content 10 also includes, but is not limited to, telephone lines, high-speed and/or wireless networks or a simple physical storage medium, as depicted in FIG. 1.


The source signal is digitized, if necessary, and sent to an encoding station 12 for embedding. In FIG. 1, this encoding station 12 is depicted to contain a Personal Computer (PC) as its processing unit. However, the PC may be readily replaced by any other processor capable of carrying out complex mathematical operations. Examples of such processors include, but are not limited to, the following: digital signal processors (DSP's), electronic circuits containing ASIC and FPGA devices, laptop and handheld electronic devices such as Personal Digital Assistants (PDA's) and mobile phones. Clearly, for the purposes of embedding watermarks into source content 10, a software solution may be more economically feasible, but it may be necessary to utilize a hardware implementation in, for example, time-critical audio-visual applications where synchronization between audio and video is required. It is further possible to place an embedding engine directly inside of a sound capturing device such as a movie camera, audio recording device and/or studio sound equipment, thus eliminating the need for a PC embedding device. In such cases, hardware or firmware modifications to the conventional sound capture/processing apparatus will be necessary.


The particular embedding techniques used in the monitoring system can be described under the general terminologies “Feature Modulation” and “Replica Modulation.” These techniques, which are one of the differentiating factors of the present invention, transform part of the source signal, i.e. the replica or the feature, into a carrier of multi-bit auxiliary information that is subsequently added to the broadcast signal using psycho-acoustical masking considerations. The source signal embedded this way does not contain audible artifacts that can be discerned by ordinary or even highly trained human listeners; yet, the embedded information can be successfully extracted with accuracy rates of close to 100%, even in the presence of extreme intentional and unintentional transmission channel impairments and attacks. Using these algorithms, watermarks are inserted simultaneously and redundantly in separate frequency bands in order to withstand different types of distortion, such as noise addition, time scaling, reverberation etc. Because these watermarks reside in separate frequency bands, their audible artifacts are not cumulative; i.e. if the watermark in each band is transparent to the listener, then combining these bands together will not produce audible artifacts. This feat is accomplished through numerous subjective tests and is consistent with the well-known feature of the human auditory system in which different spectral bands are detected with different receptors (hair cells inside cochlea). The exceptional robustness of the watermark is further complimented by several levels of error correction techniques. The details of the embedding algorithms are disclosed in commonly owned U.S. Pat. Nos. 5,940,135; 6,175,627; and 6,427,012. Another feature of the embedding technique in the system of the present invention is its security against intentional attacks that attempt to remove or obliterate the embedded watermark; the detailed disclosure of this feature is given in commonly owned U.S. Pat. No. 6,145,081.


During the embedding process, a multi-bit ID field is encoded in the source content 10 and, as shown in FIG. 1, the ‘metadata’ associated with the encoded content is transferred to the Control Center 18 upon each successful embedding. This metadata may comprise a full description of the owner and content, date and time stamps, etc. that are used to facilitate the identification and tracking of broadcast signals once the embedded content is received by the monitoring stations 16. It is also possible for the embedded watermark to carry all the pertinent information required for tracking and identification of the broadcast segment. However this would require a large watermark payload capacity which necessitates either longer embedded segments or a lower expected detection reliability. For example, a 3-minute music track may be a suitable candidate for this type of embedding but a 20-second commercial may not qualify due to its short duration. The connection between the encoding stations 12 and the Control Center 18 may be any high-speed or low-speed network connection such as telephone lines or cable networks. This transfer of information may also take place either immediately after encoding or after a delay. To illustrate this point by way of example only, and not by way of limitation, one may consider saving the metadata for one or more encodings onto a storage medium, such as a magnetic or optical disk, and subsequently sending the metadata to the Control Center 18 via email or postal delivery at a later time.


The embedded content is then sent to the broadcast network 14 for distribution to the general public and/or paying customers. In FIG. 1, a satellite broadcast example is depicted. It will be appreciated by those skilled in the art that other means of signal distribution can readily replace and/or compliment the terrestrial broadcast model. Such distribution channels include, but are not limited to, cable television distribution networks, telephone-lines, DSL and broadband networks that power the Internet and local storage devices and server farms.


At the reception sites, monitoring stations 16 continually monitor the airwaves in search of encoded content. These monitoring stations 16 may be spread throughout different geographical locations within the United States or throughout the world, monitoring a variety of AM and FM radio stations as well as Cable and Network television broadcasts. Other broadcast systems such as short-wave radio, satellite radio, local cable and Internet systems may also be monitored by including the appropriate receivers/decoders at the monitoring sites. These sites are chosen to allow simultaneous monitoring of a large number of radio and TV broadcast signals with good quality of reception. This is accomplished by using computer simulations of RF propagation in conjunction with databases of ‘digital terrain’ and FCC approved antenna locations, heights and broadcast powers, for finding optimum locations for the monitoring antennas. Such elaborate analysis is not required for other broadcast systems such as digital satellite broadcasts, web ‘streaming’ broadcasts, and local cable TV networks, where access convenience and cost are among major factors.


The Control Center 18 is an integral part of the overall monitoring system, interacting with both the embedding and detection branches. Generating detection and data reports 20, issuing embedding and distribution authorizations and discerning false detection alarms are among tasks performed at the Control Center 18. The connectivity of the Control Center 18 to the outside world is established through a variety of low- and high-speed network connections as well as operator interaction. Data and commands may also be carried via tangible storage media such as optical and magnetic disks. These and other functionalities of the Control Center 18 will be described shortly herein.



FIG. 2 is a block diagram of a preferred embodiment of the present invention. Two dashed-line rectangles contain two major components of the system: Control Center (CC) 18 and Monitoring Site 22, which is sometimes also referred to as EAR (Event Airplay Receiver). There are many EARs that are connected to the Control Center 18 using a circuit-oriented TCP/IP Wide Area Network (e.g., virtual circuits over a frame relay cloud). This connectivity may also be realized with a variety of other topologies and techniques such as using Virtual Private Networks (VPNs) or point-to-point connections. Data communication between EARs and the Control Center 18 is done through secure protocols to ensure integrity of all reports and prevent unauthorized access. Preferably, the individual EARs are situated on the premises of independent contractors and out of the control of broadcasters, to further reduce any possibility of signal tampering. The system of FIG. 2 is capable of monitoring broadcast signals at the national, regional and/or local distribution levels. This way, the monitoring system can tap onto broadcast signals in the same way as ordinary listeners/viewers, and can detect whatever goes to the ordinary public, including broadcast interruptions, cropping of the clips, voice-overs, etc.



FIG. 2 includes a number of related blocks that enable encoding of the audio source material in accordance with the steps outlined in FIG. 3. In step 1, Customer Request Processing 50, customer requests are processed which typically include customer identification documents, type of embedder required, reasons for embedding, etc. This communication may take place through sales personnel, but an automatic system for processing customer requests is preferable. In step 2, Embedder ID Generation 52, an identification code is generated which uniquely identifies the customer and the matching embedder. This Embedder ID code, which becomes part of the embedded watermark, can be used during detection to automatically identify the customer as well as the matching embedder. In step 3, Embedder Authorization 54, embedder authorization is issued to the customer. Referring to FIG. 2, steps 1 through 3 are all done in the box labeled Embedder Distribution 24. Other variations of the embedder authorization process are also possible. For example, if the embedders are in the form of software modules, they may not be authorized to operate immediately upon installation. In this case, certain key parameters of the platform (e.g. serial numbers of key hardware components) must be read and communicated to the embedder distribution module 24 before embedding authorization is issued for that particular platform. This way, proliferation of embedders and generation of duplicate codes for multiple audio pieces are prevented.


In step 4, Self-assigned Code Generation 56, a “self-assigned” code is automatically generated by the embedder, without user intervention or notification, identifying the particular audio content. In step 5, Watermark Embedding 58, the actual embedding of the watermark takes place and upon successful completion, in step 6, Embedder Log Generation and Transfer to Database 60, the Embedder ID, the self-assigned code and other embedder data are combined to form what is known as an “embedder log”, which is transferred to the database 38 which resides within the Control Center 18. It is important to note that the embedder log contains embedder generated data, such as description of the audio content in terms of duration, sampling rate, number of channels, energy profile, etc., and user entered data describing the audio or audio visual watermarked content, i.e., title, owner, industry codes etc. Referring to FIG. 2, steps 4 through 6 are performed in the box labeled Embedding 26. In step 7, Verification 62, which may occur at a much later time, the embedded content is checked for the presence of a valid watermark before being distributed for broadcast in step 8, Distribution and Broadcast 64. In FIG. 2, the Verification 44, Audio Distribution 46 and Broadcasting 48 modules are used to carry out the procedures outlined in steps 7 and 8 above.



FIG. 4 illustrates the steps required for the detection of embedded content in accordance with the preferred embodiment of FIG. 2. In step 1, Signal Reception 66, broadcast signals are received by the EARs; each monitoring site 22 is used to monitor multiple broadcasts, typically between 8 and 80 stations. Appropriate receivers are used to extract audio streams from different types of broadcast signals. For example, AM and FM receivers are utilized to receive AM and FM radio broadcasts, respectively. However, for receiving an audio signal from a TV broadcast, or an analog local cable, it suffices to simply use an FM receiver tuned to the audio carrier of TV broadcasts. In step 2, Watermark Extraction 68, the audio outputs of the receivers are examined by the extractor 28 module of FIG. 2 in order to determine whether or not they contain an embedded watermark. Since it is possible for the same content to contain different types (i.e., layers) of watermarks, the extractor 28 should be equipped to search for and report the data contained within the detected watermarks as well as the type of detected watermark. It is noted that different types of watermarks may be embedded in different content such as music, commercials, and programs. It is also possible to embed different types of watermarks in the same content, but for different purposes such as identifying the content, source, distribution path, or for copy control, etc.


In step 3, Audio Logging and Transfer 70, of FIG. 4, audio output from the receiver is compressed, using any one of the well-known audio compression techniques in the art, and saved in chunks of predefined duration with a date/time stamp. This step is performed in the Audio Log 30 module at the monitoring site 22. The stored audio logs may be retrieved by the Control Center 18 on a regular basis or in response to commands issued by the Control Center 18. The main purpose of the audio logs is to resolve disputes over discrepancies between broadcast monitoring reports and broadcaster logs. In principle, the audio logs may also be used to resolve disputes when the system erroneously detects a watermark in an un-encoded audio clip, i.e., a false detection. However, these cases are much less likely, because well-designed watermarks in the present system have very low probability of false detections. Besides dispute resolution, audio logs are useful for troubleshooting in the case of outages occurring in the broadcast system or the monitoring sites 22. Similarly, audio logs can be used to further analyze anomalous detection results, for example, detections that are short, fragmented, time-compressed, etc. While the stored audio logs are compressed in order to save storage space and transmission bandwidth, it is entirely possible to produce audio logs that are of the original broadcast quality by using less aggressive or even lossless audio compression techniques. Compression factors, and thus the audio log quality, may be changed at different monitoring sites 22 via simple commands from the Control Center 18.


As noted earlier, the same code is embedded simultaneously in multiple frequency bands and repeated many times throughout the audio clip. As a result, there are numerous watermark detections from the same audio clip. In step 4, aggregation 72 of FIG. 4, these detections are organized and combined together by the Aggregator 32 module of FIG. 2. This module is responsible for identifying all watermarks that belong to the same clip, i.e., all watermarks with identical values, and combining them together. In doing so, the preprocessor 34 may also analyze the spacing between neighboring watermarks; if the watermarks belong to the same clip they have a predefined spacing, also known as the heartbeat of the watermark. This analysis is helpful when the same clip is broadcast in a back-to-back fashion; in such cases there is a high likelihood of discontinuity in the heartbeat, which can be used for separating the neighboring clips. An aggregated string of watermarks contains the detected (common) code, start time of the first detected watermark in the string, and end time of the last detected watermark in the string. In the case of delay sensitive applications, the aggregator 32 may immediately report the first detection of a watermark in a new audio clip. It should be noted that digital equipment at the monitoring sites 22 can measure time precisely using their internal crystal based clocks. However, these clocks have precision tolerances, and drift in time. In order to compensate for the clock drift, they are periodically synchronized to a common (atomic) clock over communication lines from the Control Center 18, through a Site Control module 36.


In step 5, Transfer to Control Center 74 of FIG. 4, the aggregator module 32 sends the detection results as well as the ID of the receiver and the broadcast station frequency to the Control Center 18. This information is instrumental in identifying the source of broadcast that carries the extracted codes. The transfer of information to the Control Center 18 occurs in real-time in most cases, and a copy of the detection logs is stored locally for future reference. While FIG. 2 indicates separate links for the aggregator-to-preprocessor and the Site Control-to-Command Center modules, it is entirely possible to utilize a single link for both communication paths.


In step 6, Preprocessing 76 of FIG. 4, aggregated watermark detections, called ‘arrivals’, are preprocessed by the preprocessor module 34 of FIG. 2. The main task here is to convert the arrivals from multiple aggregators into ‘events’ by using the information contained in the database 38. The preprocessor module 34 may be called to task at several other occasions, as well. For example, in cases where multiple receivers are tuned to the same broadcast station, all arrivals are converted into a single event by the preprocessor module 34. In some cases, the aggregator 32 may not have been able to merge disjoint watermarks, either because of large gaps between the detections or due to processing delays; the preprocessor module 34 can use the information contained in the database 38 to merge those arrivals. In other cases, the same clip may be consecutively broadcast two or more times in such a way that it is erroneously identified as one long clip. In such cases, the preprocessor module 34, receiving an arrival with longer than expected duration, may perform ‘reverse aggregation’ and split a single arrival into two or more events. The preprocessor module 34 also contains several algorithms specific to each type of content. Therefore, the arrivals can be processed differently depending on the a priori information stored in the database 38 about the content and detection information.


In step 7, Embedder Log Association 78 of FIG. 4, all events generated by the preprocessor module 34 are transferred to the database 38 where they are associated with the matching embedder logs. Successful matches are saved in a report folder for future report generation. While a large majority of the matches are successful, there are a few instances where proper matching and identification of the events may not occur. For example, in some cases Embedder IDs may not match any of the issued Embedder IDs in the database 38. These events are stored in a ‘false detections’ folder for the purpose of statistical analysis. In other cases, the Embedder ID may be recognized, but the self-assigned code may not match anything in the embedder logs. These events are saved in an ‘orphans’ folder and are re-tested at a later time (e.g., when new embedder log files are uploaded). Finally, if all attempts in recognizing an orphan detection fail, technical support personnel may contact registered users to resolve inconsistencies.


In step 8, Report Generation 80, of FIG. 4, customer reports are generated using the appropriate folders in the database. Reports may be generated upon customer request, or at predefined periodic intervals. FIG. 2 indicates that reports are delivered through the Control Center's web portal 40, but it is certainly possible to deliver them by other means, such as e-mail, hard copy, etc. The Command Center 42 governs who has the rights to obtain reports as well as the format and the type of data in the reports. The report generation step 80 also includes formatting and customizing the final report according to the customer specifications. This allows seamless integration of the detection reports into the customer's workflow. Formatting and integration of the final report may be done internally at the Control Center 18 or performed through third party ‘middleware’ development (not shown in FIG. 2).


Alternative Architectures


According to a preferred embodiment of the present invention, components in FIG. 2 not contained within the dashed boxes are outside the physical control of the Control Center 18. For example, watermark embedding 26 is done outside of the Control Center 18, typically at customer premises. This is done in order to avoid transfer of audio content from the customer to Control Center 18 and back. Aside from confidentiality concerns over transport of pre-broadcast material to remote locations, the architecture of FIG. 2 avoids any possible delays in the production process due to network and workflow congestion at the Control Center 18. This architecture further simplifies the collection and storage of metadata associated with particular contents. Additionally, some cost savings are realized by avoiding the need for a high-speed connection between the customers and the Control Center 18.


There are also several disadvantages with the embedding architecture of FIG. 2. Particularly, more sophisticated embedder designs are required to maintain proper operation on different computer platforms such as PC, Macintosh, Unix and Linux at customer sites. It also becomes necessary to keep track of the status and the number of distributed embedders. Significant software and/or hardware development efforts must also be undertaken to ensure user-friendliness of the embedding tools in order to avoid embedding mistakes such as a mix-up between original and embedded files, improper embedder installation, wrong selection of embedder options, and embedding the same content multiple times. This also places more demand on customer service efforts for delivering periodic software/hardware upgrades and assisting customers. Complications may also arise if the network connection between the customer and the Control Center 18 is severed and the embedded content is aired without proper transfer of metadata to the Control Center 18. In such cases, the monitoring sites 22 may produce orphan detections that are not readily identifiable. Distributing of the embedding software to the customers may also open the possibility for unauthorized usages of embedding technology and reverse engineering.


In the alternate embodiment of FIG. 5, the above and other disadvantages of the system are overcome by moving the embedding operation entirely into the Control Center 18. In the embodiment of FIG. 5 only one customer 82 is shown, but it is understood that the same architecture allows interaction with multiple customers. According to this architecture, verification and embedding operations are all done in one step, in the Embedding/Verification module 84 of FIG. 5, at the Control Center 18. The customers, however, may decide to optionally verify their content before distribution in order to avoid distribution of un-encoded material. In FIG. 5, this optional verification 86 is shown as a box with dot-dashed borders. Although it is entirely possible to utilize a portable storage medium for the transport of data between the customers 82 and the Control Center 18, the alternate embodiment of FIG. 5 indicates a high-speed connection 88 for data transfer purposes. It also requires additional storage 88 and/or buffering of incoming audio as well as the encoded content at the Control Center 18. Security concerns may also necessitate encryption of the stored audio data and presence of secure internal and external connections. Other concerns regarding the embodiment of FIG. 5 include the amount of work required to generate, enter and collect the related metadata for each and every content by the personnel at the Control Center 18. Improvements in workflow efficiency may be possible by requiring all customers to adhere to a standard information-sharing format and/or directly accessing existing databases at customer sites in order to automatically download portions of the metadata.



FIG. 6 illustrates another alternate embodiment of the present invention, overcoming some of the workflow, security and cost issues associated with the embodiments of FIG. 2 and FIG. 5. According to the architecture of FIG. 6, customers 82 directly send their audio and/or audio-visual content to the distribution center 92 where embedding 26 and verification 44 of content takes place. This architecture avoids the cost and security concerns of a high-speed data connection between individual customers 82 and the Control Center 18. In addition, most of the metadata-related work will be shifted to the distribution center 92 where similar tasks are usually performed for distribution and billing purposes regardless of whether or not watermark insertion is taking place.



FIG. 7 shows yet another embodiment of the present invention. It was previously disclosed in FIGS. 2, 5 and 6 that each monitoring site contains an aggregator module 32. In FIG. 7, this module has been moved into the Control Center 18 to form a combined preprocessor and aggregator module 94. This way, detections from the extractor 28 are directly sent to the preprocessor and aggregator unit 94 at the Control Center 18 where sophisticated aggregation computations are performed using all available resources at the Control Center 18. In addition, fewer control commands are required to regulate the operation of each monitoring site 22. From an economics point of view, it is also advantageous to simplify the design of monitoring sites 22 by eliminating as many components as possible in order to help proliferation and maintenance of the sites, granted that the cost of transferring more detection data may not become prohibitive.


While different embodiments for the embedding, delivery and monitoring of audio content have been disclosed, it should be appreciated that various combinations of the above architectures may be used to effect suitable embedding and monitoring of different types of audio-visual content. For example, while one architecture may be used to deliver production (non-feature) music, another architecture may be used for feature music and yet another architecture may be used for TV or radio advertisements and promotions. Furthermore, while some monitoring sites may contain several sophisticated processing and storage components, others, being located in less accessible locations, for example, may contain only a few components that convey the data for further processing to the Control Center. The complexity of a monitoring site facility may also be influenced by the number and the type of channels being monitored.


Additional Features


As previously disclosed, the Site Control module 36 is used to pass commands and extract status reports from the monitoring sites 22. They are also instrumental in providing accurate timing information for aggregators and extractors and handling requests for on-demand uploading of the audio logs. However, there are many more important functions and features achieved through the communication link between the Site Control 36 and the Control Center 18. One of features is the capability to upgrade various software components that reside within the monitoring site 22. This may include a full replacement of previous software modules or just selection and/or modification of configurable parameters. For example, the monitoring site 22 may be remotely configured to detect additional types of watermarks, e.g., additional watermark layers, or to modify the parameters that are used in detection of a particular watermark layer. It is also possible to remotely switch to spare receivers in case of receiver failures, increase or decrease the number of stations being monitored, adjust certain parameters such as carrier frequency, modulation type, volume, RF attenuation, etc. Similarly, ‘first packet reporting’, described earlier, may be enabled or disabled in the aggregator.


The Site Control module 36 is also responsible for monitoring the overall status of the monitoring site 22 and communicating the alarm signals to the Control Center 18. These alarm signals are generated by different mechanisms, indicating the status of software, environmental and communication subsystems. For example, temperature and humidity within the monitoring sites 22 are constantly monitored and alarms are generated if they go beyond certain thresholds. Status of internal communications within the monitoring site is also periodically checked for outages and anomalies. Uninterruptible Power Supply (UPS) units may also generate alarms in order to initiate a graceful shutdown of the site. Several other alarms are also generated to assess the quality of the received audio signals. For example, at each monitoring site 22, the RF power of the incoming broadcast signal is continually measured to ensure that it is within acceptable bounds. Similarly audio levels are monitored to make certain they are within a predefined range of values. These measurements provide valuable information regarding the quality of the audio signal which may be used to predict watermark detection reliability.


Signal-to-Noise-Ratio


A standard measure of signal quality is Signal-to-Noise-Ratio (SNR). Monitoring sites 22 are capable of measuring the SNR for all incoming audio signals at the signal reception sites. One method of monitoring SNR is to compare the long-term average of audio signal power with the short-term minimum audio power. Long-term average represents a measure of signal plus noise power. Short-term power calculations, measured over several tens of milliseconds, typically represent intervals where there is no signal present, thus comprising of only noise power. So, SNR can be simply calculated from the following equation:

SNR=(Long term power−minimum short term power)/(minimum short term power)


The above technique for calculating SNR was given by way of example and not by way of limitation. Other SNR calculation techniques may be utilized where appropriate. For example, a different method may be applied if a pilot signal used for demodulation is included in the broadcast. This is the case for FM radio and TV broadcasts, where pilot signals are inserted at 19 KHz and 15.75 KHz, respectively. In such broadcasting techniques, the natural audio components around the pilot frequency are removed prior to broadcast. Accordingly, any signal that is detected in the received audio in the vicinity of the pilot signal can be safely attributed to channel noise. In this case, the method of estimating the SNR is based on comparing the signal power in the vicinity of the pilots with the overall power level of received audio.


Using the calculated SNR values, it is possible to continually monitor and log the quality of different audio stations. Alarms generated based on SNR anomalies, in addition to other alarms generated due to, for example, variations in mean signal RF and volume levels, may be used to prompt the Control Center personnel to take appropriate actions. These alarms could be the result of monitoring site equipment failures, broadcast interruptions or poor quality of broadcast signals. In the monitoring system of the present invention, all monitored broadcast channels are periodically assessed in a process known as “channel grooming.” The results can be used to predict and improve the watermark detection success rates. In addition, the channel quality information for each geographical location may be shared with the customers and broadcasters. Broadcasters may use this information, for example, to boost their transmission power at certain locations and/or during certain time periods.


Watermark Verification


Embedded audio watermarks in the present invention are substantially inaudible; it is virtually impossible to discern whether or not an audio clip contains a watermark by just listening to it. It is thus essential to systematically verify the presence of a watermark before embedding and before distributing the content for broadcast. As described previously in relation to various embodiments of the present monitoring system, verification may be performed at different points in the encoding chain. For example, it is important to determine whether or not an audio segment already contains a watermark before attempting to re-embed the content. This task can be accomplished with an “integrated extractor” as part of the embedding engine. This way, embedding may be aborted or interrupted if a watermark is detected. In a basic configuration, it suffices to signal the presence or absence of a watermark by an appropriate display or a flag while identifying the clip by just listening to the content. In more sophisticated applications, however, such as automatic inventory of audio clips, it is necessary to convey the metadata related to the watermark back to the Control Center 18. The database inquiries can also clarify the status of a watermark. Some of the detected watermarks may be attributed to test trials conducted at the customer sites or simple mislabeling of the content. In such cases, the Control Center 18 has either no information about the detected watermark or it correctly identifies the customer as the rightful owner of the audio segment.


Other detections may be due to presence of additional watermarks within the content. As previously disclosed, several watermark layers may be inserted into the same audio content for different purposes. By reporting all detections to the Control Center 18, one can track all embedded content, even those embedded previously by a different content owner. This way, for example, the rightful owner of a music piece would be able to collect royalties if his/her music were used in a TV commercial. Detection of different watermark layers is possible at other points within the disclosed monitoring system, as well. For example, as will be described shortly, it may be done at the Verification stage that follows embedding, or it may be done at the monitoring sites after receiving the broadcast signal. This is possible since embedding of one watermark layer over another does not usually obliterate either layer. However, one or more of the layers may be weakened. Furthermore, in the presence of transmission channel noise accompanying broadcast signals, it may be more difficult to reliably detect the presence of older watermarks at the monitoring sites. In such cases, the information residing at the database can be used to verify the existence of all watermarks.


It is also important to verify the presence of a valid watermark before the audio segment is distributed for broadcast. This is done by the block labeled ‘Verification’ 44 in FIG. 2. The functionality of the verifier is very similar to the integrated extractor, described above, as it searches through the audio segment to detect and report the presence of all embedded watermarks. In a stand-alone configuration, the presence or absence of a watermark may be signaled using an appropriate display or a flag. In a verification scheme with connectivity, the detected watermarks are reported back to the Control Center 18 and checked for validity.


The presence of additional watermarks may also be reported and logged. The connectivity between the database and the verifier may also be used to implement a fail-safe verification technique. This procedure is described in FIG. 8. The process starts in step 1, Content Acquisition 100, by acquiring the audio content prior to distribution for broadcast. In case of an audio-visual content, the audio portion must be separated from the visual content and the signals. If the audio is in analog form, it must be converted into digital form. In step 2, Watermark Detection 102, the content is checked for the presence of watermark. In step 3 (104), a decision is made based upon whether or not a watermark was detected in step 2. If embedded watermarks are not detected, a ‘Denial Notification’ 106 is issued. This notification could be in the form of a beep or a visual alert, or could include physical interference with the shipping procedure. Some examples of this physical interaction will be given shortly. If embedded watermarks are detected, in step 4, Check Control Center 108, watermark information is communicated back to the Control Center 18 and checked for validity. In step 5 (110), a decision is made to issue a ‘Denial Notification’ 106 for invalid watermarks or an “Approval Notification’ 112 for valid watermarks. A detected watermark may be declared invalid, for example, if no matching metadata is found at the database, i.e., an orphan watermark, or if the watermark has expired or does not contain the proper embedder ID, etc.


Obviously, successful operation of the above system requires timely uploads of the embedder logs upon successful embedding of the content. An approval notice could be in the form a beep or visual cue as well as more sophisticated physical interaction with the workflow. For example, the verification system could be set up so that once an approval notice is issued, the audio filename is changed to conform to the shipping workflow specification. Alternatively or additionally, an approval label may be printed and placed to the disk or the tape that is used for the transportation of content. The complexity and reliability of the verification process strongly depends on workflow procedures and resources available at the verification sites. While in some instances, such as the system described in FIG. 6, the above fail-safe verification system may be an invaluable resource, in other architectures, such as the system of FIG. 2, it may not be economically feasible.


Optimized Detection and Reporting


One of the features of the disclosed monitoring system is that it allows transfer of a variety of information to the Control Center 18 upon successful completion of embedding. This includes embedder- and watermark-related ID information as well as other parameters, generally referred to as “detectability metric.” Since the robustness of an embedded watermark is related to the characteristics of the particular audio segment, a set of embedded watermarks may exhibit different degrees of resiliency to channel distortions if embedded within different audio segments. Detectability metric, conveyed to the Control Center 18 after embedding of each segment, indicates how well the embedding process succeeded in encoding the content and predicts how reliably the embedded watermarks can be detected after undergoing various amounts of distortion and noise during broadcast and reception. This information may be provided to the users of the system, which in turn, may decide to increase the embedding strength to improve detection probability. Alternatively or additionally, the detectability metric may be used to diagnose why a certain embedded content may not have been detected at the monitoring sites. It will be later described how the detectability metric and SNR measurements can be combined to improve detection probability.


Among other information relayed to the Control Center 18, after embedding is the exact duration of the embedded segment. This way, upon extraction of watermarks it is possible to detect if the original clip has been shortened for broadcast. Note that some audio clips begin and/or end with silence, typically as a means for separation between clips, but sometimes due to presence of video without audio. During embedding, the initial silence interval is automatically detected and skipped; embedding starts only when audio signals are present. This feature is particularly helpful in detection of short clips, where loosing the initial portion of the first embedded watermark may affect overall detectability. The duration information for such clips can be more precisely determined by combining the information obtained from watermark detection with duration information contained in the database.


User selectable parameters such as watermark strength, dither algorithm, psycho-acoustic model for adjustment of watermark strength, etc. allow user control over transparency and/or detectability of the watermark. These parameters are included in the metadata and subsequently transferred to the database 38 and stored as the embedder log. The embedder log information can be used to optimize the reporting process. For example, if weak watermarks are being processed, only channels with good signal quality may be reported and if strong watermarks are being processed, marginal channels may be included as well.


Dynamic Decoding


Knowledge of watermark quality, prior to detection, coupled with knowledge of channel quality parameters, for example, the SNR value, the Bit Error Rate (BER), etc., can be used to implement a ‘dynamic decoding’ technique. There are several levels of error correction and packet detection strategies used during extraction of watermarks in the disclosed monitoring system. At one level, well-known error correction codes, for example Reed-Solomon and BCH codes, are used to detect erroneous watermark bits and subsequently correct them. Error correction capabilities may be further improved by probabilistically assigning 0 and 1 values to the extracted bits. This technique is also known as soft-decision decoding. Still, at a different decoding level, once a single watermark packet is successfully detected, forensic techniques are used to predict the presence or absence of future and past watermark packets. In addition, since watermarks in the present system are redundantly encoded, averaging techniques may be utilized to improve the detection probability.


In an error-free communications channel, where perfect embedding, transmission and reception of watermarks are carried out, such error correction and detection techniques are not needed. In all other cases, however, depending on the amount of noise in the channel, some or all of the above may become necessary. In such cases, certain parameters and thresholds must be selected to effect maximum detection while minimizing the probability of false watermark detections. Examples of these parameters include, but are not limited to, the following: maximum number of errors to be corrected by the Reed-Solomon decoder, number and threshold of probabilistic levels assigned to “soft” bits, minimum number of packets that needs to be collected for implementing averaging techniques, thresholds for forensic detection, etc. These parameters may further be dynamically optimized according to the quality of the particular transmission/embedding channel. The dynamic decoding technique, in its simplest form, entails having different sets of decoding parameters for differing channel qualities, i.e., for different SNR values. More sophisticated systems involve decoding of at least one watermark packet, searching the database to obtain the detectability metric for that segment and setting more or less aggressive decoding parameters based on channel quality-detectability combination. By way of example only, and not by way of limitation, decoder settings versus different channel quality and detectability levels are displayed in the following TABLE:














Watermark Detectability
Channel Quality
Decoder Setting







Good
Good
Setting 1


Good
Bad
Setting 2


Bad
Good
Setting 3


Bad
Bad
Setting 4









While only two levels of detectability and channel quality are shown in the TABLE above (either good or bad), it is appreciated that these parameters may be classified using more than two levels, in which case, more decoder settings may be necessary.


Real-Time vs. File Mode Embedding


As previously mentioned, the embedder may be implemented using software, hardware or a combination of both components. In addition, embedders may be used at different locations within the distribution chain, as described in FIG. 2, FIG. 5 and FIG. 6. Depending on the application, location, available resources and workflow, embedding may be done in real-time or file mode. In a file-mode implementation, audio watermarks are embedded into audio files without much consideration for delay or synchronization issues. Embedding can be done one file at a time, or on a series of files in what is called “batch processing.”


Real-time applications include embedding of live or streaming events, and applications where embedding is done during the transfer of content from one storage medium to another. The latter includes tape-to-tape, server-to-tape, server-to-disk, tape-to-disk and other transfers of recorded audio or audio-visual information. The challenging task of a real-time encoder is to embed the audio watermark while maintaining synchronization between the audio and video portions of the input signal. FIG. 9 shows a block diagram of an exemplary real-time encoding system for an analog audio-visual input signal. In accordance with this figure, after multimedia components are separated in Audio-Video Separator 120, the analog audio signal is digitized in the A/D Converter 122, embedded in Audio Watermark Embedder 124, and converted back into analog form, in D/A Converter 126, while the video portion remains idle in the video delay block 128. Next, the embedded audio is combined with the corresponding video signal in Audio-Video Combiner 130 and is made available for further processing and/or transmission. The video delay block 128, shown in FIG. 9, accommodates fixed pipeline delays in the system and ensures proper audio-video synchronization. These delays may be due to internal and/or external loading and transfer of audio data; typically a video delay buffer of a few video frames is sufficient. The real-time watermarking engine depicted in FIG. 9 needs to process the incoming audio signal at a fast enough rate to maintain synchronization with the corresponding video frames. In NTSC-encoded video, frames are separated by approximately 33 milliseconds; it is desired to maintain synchronization to within a fraction, for example, one-tenth, of one frame duration. It is possible, with today's microprocessor capabilities, to implement such an engine using entirely software modules. However, if more embedding features and/or processing steps are added, real-time embedding using an all- or part-hardware implementation may be preferable.


Other variations of the system of FIG. 9 are certainly possible. For example, in an all-digital system, A/D and D/A conversions are not necessary yet it may become necessary to process compressed input signals. In such systems, the input audio and/or video signals must be decompressed, embedded with audio watermark and then converted back to their original compressed format. In other exemplary systems where audio and video portions of the input signal are completely separate from each other, audio-video separation 120 and combination 130 modules, depicted in FIG. 9, become irrelevant. Still, in other systems, metadata streams containing information such as time code, are included in the audio and video signals. In such systems, not only audio, video and metadata streams need to be separated, but also synchronization must be maintained among multiple streams. Finally, batch processing can also be made possible in a real-time embedding system by providing an embedding list of time instances when a new clip begins and ends.


Local, Regional and National Monitoring


Given the vast geographical coverage of the disclosed monitoring system, it is possible to provide monitoring capability at local, regional and national levels. This feature is particularly useful for monitoring radio and TV commercials where local media distributors may (or may not) replace the national advertisements with local ads. Since such replacements are not done on a regularly scheduled basis, it is important for the content owners to precisely know when, where and how many times their program segment was broadcast. Using the present invention's satellite, cable and Internet monitoring capabilities, it is possible to provide such detailed reports to the customers. The detection results are collected at the Control Center 18 and processed in order to generate the pertinent information for each advertiser.


Redundant Monitoring


The monitoring capabilities of the present invention may be further enhanced by taking advantage of a redundant network of receivers. Redundant monitoring is accomplished in several ways. Multiple receivers may be able to monitor the same station because of geographical coverage overlap between monitoring sites. In addition, the same content may be monitored simultaneously through different types of channels such as over-the-air, local and national cable broadcast channels. It is also possible to intentionally tune multiple receivers, of the same channel type, to the same station in order to improve reliability of detection and/or for troubleshooting purposes. Redundant monitoring can be used to improve the accuracy of timing information generated for detected clips. Such information may be used, for example, to tie a commercial to a particular show.


Channel Quality Assessment


As noted above, the quality of received RF signals, volume levels, and other signal parameters can be monitored at the monitoring sites. In addition, SNR values corresponding to individual channels can be continually calculated for the incoming signals throughout the monitoring system. The above parameters can be evaluated regardless of the presence or absence of watermarked content. It is additionally possible to use the detected watermarks for channel quality assessment. For example, it is possible to determine whether or not the broadcast content has undergone time compression by measuring the duration of detected watermarks. Time compression artifacts may arise due to ordinary processing of content via substandard equipment or could be the result of intentional processing by an unscrupulous broadcaster in order to make room for additional advertisements. Nevertheless, it is important for the customer to be aware of such possible channel impairments. Similarly, it is possible to measure wow and flutter, typically associated with analog tape players, and the amount of noise in the broadcast channel (e.g., by measuring bit-error-rate). Analyzing the quality of detected watermarks in the frequency domain and assessing the extent and type of damage to watermarks in each frequency band can also shed light on possible frequency domain impairments such as bandpass filtering and compression. The information regarding channel quality can be provided to the interested customers as well as broadcasters. They can also provide a measure of confidence about detection rates on particular channels.


Network Identification


One of the watermark layers deployed in the present monitoring system is utilized by the Radio and Television Networks to identify and monitor the times and programs where a network affiliated local station is carrying the network's broadcast signal. This information may be important to the networks in order to measure and verify compliance. In the case where content is distributed to the network as local or regional stations, this capability allows for differentiating the different sources. Real-time embedders may be deployed in the network facilities to ensure all content is watermarked.


International Deployment


The Broadcast Monitoring Network may also be expanded internationally, allowing content encoded in one country to be detected at the country of origin or in any other country where monitoring devices are available. For the purpose of maintaining compatibility, a set of design constraints is defined for the various subsystem blocks. These constraints may be classified in two categories, where the first category contains the physical and logical layers of the system and the second has more to do with the metadata and detection data exchange. These constraints include, and are not limited to, the definition of certain core rules that govern the underlying watermarking technology and how it is applied in the broadcast monitoring system, the minimum set of data fields that insure proper dialog between systems in the different countries.


Content Tracing


The broadcast monitoring may also reveal the unauthorized airing of certain content, in cases where the content is earmarked for preview only or before official releases. A set of rules around the metadata of such content will allow for the tracing of the aired copy.


Other Applications


Monitoring and data collection capabilities of the present invention can be utilized in other ways, as well. One such application relies on the fact that most people may not pay particular attention to radio and TV commercials at the exact moment of their broadcast. Yet, at some later time, when they are in search of a particular service or product, they may become interested in special promotions and discounts. The advantage of the disclosed monitoring system is that it retains the exact knowledge of time and geographical location of certain broadcast commercials. It also has the capability of replaying those commercials by directly accessing the stored audio logs. In addition, if certain information about the content, for example, a contact phone number or an Internet link, is included in the embedder log for each content, the Control Center database 38 is further capable of providing such contact information to an interested consumer. These features of the present monitoring system make it a suitable candidate for becoming a secondary source of direct advertisement for targeted audiences based on geographical location. As an example, someone that is interested in buying a car may use the present system to obtain a list of all auto-related advertisements, promotions or discounts that have aired in a particular region in the span of a few days. In addition, the present system can provide a replay/reprint capability of commercials for the interested consumer. In effect, this system becomes a repository of aired commercials that are readily available for re-utilization.


There are many possibilities on how to access this system. Connectivity to the system may be realized through a variety of means, some of which include an Internet connection, a cell phone, a PDA with connectivity, a TV with connectivity, a car radio with cell phone connectivity, a GPS car navigation system with connectivity, etc. Implementation of this system requires expansion of the system resources in order to cope with increased access and processing demands. It also requires a large base of embedded broadcast content in order to provide sufficient diversity in the database of stored advertisements.


Based on the port of entry and capabilities of devices available to the consumer, the commercials may be replayed in full or referenced in an abbreviated manner (e.g., www address, phone number, etc.). The user interface can also have sorting and searching capabilities and may even automatically alert the user if a commercial is played that meets a pre-selected criterion tailored to the user's liking. Other possibilities include printing out the commercial in text form (via for example, conversion of the audio log segments to text form via voice-to-text software), automatically dialing a phone number, mapping the location of the advertiser on a GPS navigation system, or even buying the product.


One advantage of the above system is that commercials need to only air in one medium (for example, on the local AM station) yet, they can be made available to a wide range of audiences that access the system's repository. Further extensions can involve inclusion of print media commercials into the system; metadata for all local print media may be routed to the local monitoring station or directly to the Control Center.


As is evident from the foregoing description, certain other aspects of the invention are not limited to the particular details of the embodiments illustrated, and it is therefore contemplated that other modifications and applications will occur to those skilled in the art.

Claims
  • 1. A method, comprising: receiving, at a monitoring site, a content comprising identification information that is imperceptibly and repeatedly embedded therein;processing the received content to extract multiple instances of the identification information having identical values; andestimating a temporal extent of the content in accordance with the multiple instances of the identification information having identical values, wherein estimating the temporal extent of the content comprises determining a spacing between at least two instances of the multiple instances of the identification information having identical values to ascertain whether the at least two of the multiple instances of the identification information belong to the same content clip.
  • 2. The method of claim 1, wherein the identification information comprises an embedder identification code and/or a self-assigned code.
  • 3. The method of claim 1, further comprising: accessing a database, the database comprising embedder log information associated with a plurality of contents;searching the database for embedder log information that matches with the identification information extracted from the content; andif the identification information fully matches the embedder log information associated with at least one of the plurality of contents, storing at least a portion of the embedder log information that produced a match and the estimated extent of the content for report generation.
  • 4. The method of claim 3, wherein: if the identification information partially matches the embedder log information associated with at least one of the plurality of contents, storing at least a portion of the identification information for further processing.
  • 5. The method of claim 4, further comprising: receiving additional embedder log information, and wherein the further processing comprises searching the stored identification information to obtain a match with the additional embedder log information.
  • 6. The method of claim 3, wherein: if the identification information does not fully or partially match the embedder log information, storing at least a portion of the identification information for further processing.
  • 7. The method of claim 6, further comprising: receiving additional embedder log information, and wherein the further processing comprises searching the stored identification information to obtain a match with the additional embedder log information.
  • 8. The method of claim 3, wherein the accessing, the searching, and the storing are carried out at the monitoring site and/or a control center.
  • 9. The method of claim 3, wherein the database further comprises metadata associated with each of the plurality of contents, the metadata comprising: an original duration of each content,a type of each content,a title of each content,an owner of each content, and/oran industry code associated with each content.
  • 10. The method of claim 1, wherein the content comprises two or more different embedded identification information; andthe processing comprises extracting multiple instances of the two or more different embedded identification information and determining a distribution path of the content in accordance with at least one of the extracted identification information.
  • 11. The method of claim 10, wherein the two or more different embedded identification information are carried within two or more watermark layers.
  • 12. The method of claim 10, wherein at least one of the two or more different embedded identification information identifies a transmission channel selected from a group of transmission channels consisting of: a broadcast network,a broadcast stream, andan internet stream.
  • 13. The method of claim 10, wherein at least one of the two or more different embedded identification information identifies an entity associated with the content selected from a group of entities consisting of: a broadcaster, anda broadcast affiliate.
  • 14. The method of claim 10, wherein at least one of the two or more different embedded identification information identifies a content type selected from a group of content types consisting of: a prerecorded music,a live music,a radio program material,a television program material, anda broadcast advertisement.
  • 15. The method of claim 10, wherein determining the distribution path comprises differentiating portions of the content that originated from a network broadcast from portions of the content that did not originate from the network broadcast.
  • 16. The method of claim 10, wherein determining the distribution path comprises identifying time periods during which a network affiliated local station carries a network broadcast program.
  • 17. The method of claim 10, wherein determining the distribution path comprises identifying an inclusion of a network advertisement in a local broadcast.
  • 18. The method of claim 10, wherein at least one of the two or more different embedded identification information is used to identify whether the received content has been broadcast in whole, in part, and/or a multiple number of times.
  • 19. The method of claim 18, wherein the identification is carried out in accordance with metadata stored at a database.
  • 20. The method of claim 1, wherein the identification information is embedded in an audio portion the content.
  • 21. The method of claim 1, wherein the identification information is embedded in a temporal and/or a frequency domain.
  • 22. The method of claim 1, wherein the identification information is used to estimate a date, a time, a location of reception, a duration, a quality, an origin and/or a method of transmission of the content.
  • 23. The method of claim 1, wherein the monitoring site receives the content from one or more transmission channels.
  • 24. The method of claim 23, wherein the one or more transmission channels comprise a broadcast terrestrial channel, an Internet channel, a broadcast cable channel or a broadcast satellite channel.
  • 25. The method of claim 1, wherein estimating the temporal extent of the content comprises estimating a start-time, an end-time and/or a duration associated with the content.
  • 26. A device, comprising: a processor; anda memory including program code, wherein the program code, when executed by the processor, configures the device to:receive a content comprising identification information that is imperceptibly and repeatedly embedded therein;process the received content to extract multiple instances of the embedded identification information having identical values; andestimate a temporal extent of the content in accordance with the multiple instances of the embedded information having identical values, wherein estimation of the temporal extent of the content comprises determining a spacing between at least two instances of the multiple instances of the identification information having identical values to ascertain whether the at least two of the multiple instances of the identification information belong to the same content clip.
  • 27. A computer program, embodied on a non-transitory computer-readable medium, comprising: computer code for receiving a content comprising identification information that is imperceptibly and repeatedly embedded therein;computer code for processing the received content to extract multiple instances of the embedded identification information having identical values; andcomputer code for estimating a temporal extent of the content in accordance with the multiple instances of the embedded information having identical values, wherein estimating the temporal extent of the content comprises determining a spacing between at least two instances of the multiple instances of the identification information having identical values to ascertain whether the at least two of the multiple instances of the identification information belong to the same content clip.
  • 28. The method of claim 1, wherein estimating the temporal extent of the content comprises comparing a spacing between at least two instances of the multiple instances of the identification information having identical values to a pre-defined spacing to determine one of the following: that the at least two of the multiple instances of the identification information having identical values belong to the same content clip, orthat the at least two of the multiple instances of the identification information having identical values belong to different content clips that are received in a back-to-back fashion.
Parent Case Info

This application is a continuation of U.S. patent application Ser. No. 10/681,953 filed on Oct. 8, 2003, which claims priority from provisional application No. 60/418,597 filed on Oct. 15, 2002, the entire contents of which is hereby incorporated by reference.

US Referenced Citations (537)
Number Name Date Kind
3406344 Hopper Oct 1968 A
3842196 Loughlin Oct 1974 A
3885217 Cintron May 1975 A
3894190 Gassmann Jul 1975 A
3919479 Moon et al. Nov 1975 A
3973206 Haselwood et al. Aug 1976 A
4048562 Haselwood et al. Sep 1977 A
4176379 Wessler et al. Nov 1979 A
4199788 Tsujimura Apr 1980 A
4225967 Miwa et al. Sep 1980 A
4230990 Lert et al. Oct 1980 A
4281217 Dolby Jul 1981 A
4295128 Hashemian et al. Oct 1981 A
4425578 Haselwood et al. Jan 1984 A
4454610 Sziklai Jun 1984 A
4464656 Nakamura Aug 1984 A
4497060 Yang Jan 1985 A
4512013 Nash et al. Apr 1985 A
4547804 Greenberg Oct 1985 A
4564862 Cohen Jan 1986 A
4593904 Graves Jun 1986 A
4639779 Greenberg Jan 1987 A
4669089 Gahagan et al. May 1987 A
4677466 Lert et al. Jun 1987 A
4686707 Iwasaki et al. Aug 1987 A
4703476 Howard Oct 1987 A
4706282 Knowd Nov 1987 A
4723302 Fulmer et al. Feb 1988 A
4729398 Benson et al. Mar 1988 A
4739398 Thomas et al. Apr 1988 A
4750173 Bluthgen Jun 1988 A
4755871 Morales-Garza et al. Jul 1988 A
4755884 Efron et al. Jul 1988 A
4764608 Masuzawa et al. Aug 1988 A
4764808 Solar Aug 1988 A
4789863 Bush Dec 1988 A
4805020 Greenberg Feb 1989 A
4807013 Manocha Feb 1989 A
4807031 Broughton et al. Feb 1989 A
4840602 Rose Jun 1989 A
4843562 Kenyon et al. Jun 1989 A
4876617 Best et al. Oct 1989 A
4876736 Kiewit Oct 1989 A
4930011 Kiewit May 1990 A
4931871 Kramer Jun 1990 A
4937807 Weitz et al. Jun 1990 A
4939515 Adelson Jul 1990 A
4943963 Waechter et al. Jul 1990 A
4945412 Kramer Jul 1990 A
4967273 Greenberg Oct 1990 A
4969041 O'Grady et al. Nov 1990 A
4972471 Gross et al. Nov 1990 A
4972503 Zurlinden Nov 1990 A
4979210 Nagata et al. Dec 1990 A
5057915 Von Kohorn Oct 1991 A
5073925 Nagata et al. Dec 1991 A
5080479 Rosenberg Jan 1992 A
5113437 Best et al. May 1992 A
5116437 Yamamoto et al. May 1992 A
5161251 Mankovitz Nov 1992 A
5191615 Aldava et al. Mar 1993 A
5200822 Bronfin et al. Apr 1993 A
5210820 Kenyon May 1993 A
5210831 Emma et al. May 1993 A
5213337 Sherman May 1993 A
5214792 Alwadish May 1993 A
5237611 Rasmussen et al. Aug 1993 A
5251041 Young et al. Oct 1993 A
5270480 Hikawa Dec 1993 A
5294962 Sato et al. Mar 1994 A
5294982 Salomon et al. Mar 1994 A
5319453 Copriviza et al. Jun 1994 A
5319735 Preuss et al. Jun 1994 A
5351304 Yamamoto Sep 1994 A
5379345 Greenberg Jan 1995 A
5402488 Karlock Mar 1995 A
5404160 Schober et al. Apr 1995 A
5404377 Moses Apr 1995 A
5408258 Kolessar Apr 1995 A
5414729 Fenton May 1995 A
5424785 Orphan Jun 1995 A
5425100 Thomas et al. Jun 1995 A
5432799 Shimpuku et al. Jul 1995 A
5436863 Ellis et al. Jul 1995 A
5450490 Jensen et al. Sep 1995 A
5452901 Nakada et al. Sep 1995 A
5473631 Moses Dec 1995 A
5481294 Thomas et al. Jan 1996 A
5497372 Nankoh et al. Mar 1996 A
5502576 Ramsay et al. Mar 1996 A
5504518 Ellis et al. Apr 1996 A
5508754 Orphan Apr 1996 A
5519454 Willis May 1996 A
5526427 Thomas et al. Jun 1996 A
5537484 Kobayashi Jul 1996 A
5579124 Aijala et al. Nov 1996 A
5581658 O'Hagan et al. Dec 1996 A
5581800 Fardeau et al. Dec 1996 A
5592553 Guski et al. Jan 1997 A
5612729 Ellis et al. Mar 1997 A
5613004 Cooperman et al. Mar 1997 A
5636292 Rhoads Jun 1997 A
5664018 Leighton Sep 1997 A
5687191 Lee et al. Nov 1997 A
5687236 Moskowitz et al. Nov 1997 A
5699427 Chow et al. Dec 1997 A
5719619 Hattori et al. Feb 1998 A
5719937 Warren et al. Feb 1998 A
5737329 Horiguchi Apr 1998 A
5752880 Gabai et al. May 1998 A
5761606 Wolzien Jun 1998 A
5764763 Jensen et al. Jun 1998 A
5778108 Coleman, Jr. Jul 1998 A
5787334 Fardeau et al. Jul 1998 A
5805635 Andrews, Jr. et al. Sep 1998 A
5809064 Fenton et al. Sep 1998 A
5819289 Sanford et al. Oct 1998 A
5822360 Lee et al. Oct 1998 A
5822432 Moskowitz et al. Oct 1998 A
5825892 Braudaway et al. Oct 1998 A
5828325 Wolosewicz et al. Oct 1998 A
5832119 Rhoads Nov 1998 A
5841978 Rhoads Nov 1998 A
5848155 Cox Dec 1998 A
5850249 Massetti et al. Dec 1998 A
5850481 Rhoads Dec 1998 A
5862260 Rhoads Jan 1999 A
5887243 Harvey et al. Mar 1999 A
5889868 Moskowitz et al. Mar 1999 A
5892900 Ginter et al. Apr 1999 A
5893067 Bender et al. Apr 1999 A
5901178 Lee et al. May 1999 A
5905800 Moskowitz et al. May 1999 A
5930369 Cox et al. Jul 1999 A
5933798 Linnartz Aug 1999 A
5937000 Lee et al. Aug 1999 A
5940124 Janko et al. Aug 1999 A
5940134 Wirtz Aug 1999 A
5940135 Petrovic et al. Aug 1999 A
5940429 Lam et al. Aug 1999 A
5943422 Van Wie et al. Aug 1999 A
5945932 Smith et al. Aug 1999 A
5949885 Leighton Sep 1999 A
5960081 Vynne et al. Sep 1999 A
5963909 Warren et al. Oct 1999 A
5986692 Logan et al. Nov 1999 A
6021432 Sizer et al. Feb 2000 A
6031914 Tewfik et al. Feb 2000 A
6035171 Takaya et al. Mar 2000 A
6035177 Moses et al. Mar 2000 A
6044156 Honsinger et al. Mar 2000 A
6061793 Tewfik et al. May 2000 A
6067440 Diefes May 2000 A
6078664 Moskowitz et al. Jun 2000 A
6094228 Ciardullo et al. Jul 2000 A
6101310 Terada et al. Aug 2000 A
6128597 Kolluru et al. Oct 2000 A
6145081 Winograd et al. Nov 2000 A
6154571 Cox et al. Nov 2000 A
6160986 Gabai et al. Dec 2000 A
6173271 Goodman et al. Jan 2001 B1
6175627 Petrovic et al. Jan 2001 B1
6189123 Anders Nystrom et al. Feb 2001 B1
6209092 Linnartz Mar 2001 B1
6209094 Levine et al. Mar 2001 B1
6222932 Rao et al. Apr 2001 B1
6229572 Ciardullo et al. May 2001 B1
6233347 Chen et al. May 2001 B1
6246775 Nakamura et al. Jun 2001 B1
6246802 Fujihara et al. Jun 2001 B1
6249870 Kobayashi et al. Jun 2001 B1
6252972 Linnartz Jun 2001 B1
6253113 Lu Jun 2001 B1
6253189 Feezell et al. Jun 2001 B1
6268866 Shibata Jul 2001 B1
6278792 Cox et al. Aug 2001 B1
6282299 Tewfik et al. Aug 2001 B1
6285774 Schumann et al. Sep 2001 B1
6289108 Rhoads Sep 2001 B1
6290566 Gabai et al. Sep 2001 B1
6330335 Rhoads Dec 2001 B1
6330672 Shur Dec 2001 B1
6332031 Rhoads et al. Dec 2001 B1
6332194 Bloom et al. Dec 2001 B1
6353672 Rhoads Mar 2002 B1
6363159 Rhoads Mar 2002 B1
6373974 Zeng Apr 2002 B2
6374036 Ryan et al. Apr 2002 B1
6381341 Rhoads Apr 2002 B1
6385330 Powell et al. May 2002 B1
6388712 Shinohara et al. May 2002 B1
6389152 Nakamura et al. May 2002 B2
6389538 Gruse et al. May 2002 B1
6400826 Chen et al. Jun 2002 B1
6400827 Rhoads Jun 2002 B1
6404781 Kawamae et al. Jun 2002 B1
6404898 Rhoads Jun 2002 B1
6411725 Rhoads Jun 2002 B1
6415040 Linnartz et al. Jul 2002 B1
6415041 Oami et al. Jul 2002 B1
6424726 Nakano et al. Jul 2002 B2
6427012 Petrovic Jul 2002 B1
6430301 Petrovic Aug 2002 B1
6430302 Rhoads Aug 2002 B2
6449367 Van Wie et al. Sep 2002 B2
6449496 Beith et al. Sep 2002 B1
6473560 Linnartz et al. Oct 2002 B1
6477431 Kalker et al. Nov 2002 B1
6487301 Zhao Nov 2002 B1
6490355 Epstein Dec 2002 B1
6496591 Rhoads Dec 2002 B1
6505160 Levy et al. Jan 2003 B1
6510233 Nakano Jan 2003 B1
6510234 Cox et al. Jan 2003 B1
6512837 Ahmed Jan 2003 B1
6523113 Wehrenberg Feb 2003 B1
6529506 Yamamoto et al. Mar 2003 B1
6530021 Epstein et al. Mar 2003 B1
6550011 Sims, III Apr 2003 B1
6553127 Kurowski Apr 2003 B1
6556688 Ratnakar Apr 2003 B1
6557103 Boncelet, Jr. et al. Apr 2003 B1
6570996 Linnartz May 2003 B1
6571144 Moses et al. May 2003 B1
6574350 Rhoads et al. Jun 2003 B1
6577744 Braudaway et al. Jun 2003 B1
6584138 Neubauer et al. Jun 2003 B1
6590996 Reed et al. Jul 2003 B1
6590997 Rhoads Jul 2003 B2
6591365 Cookson Jul 2003 B1
6592516 Lee Jul 2003 B2
6598162 Moskowitz Jul 2003 B1
6614914 Rhoads et al. Sep 2003 B1
6618484 Van Wie et al. Sep 2003 B1
6625297 Bradley Sep 2003 B1
6633653 Hobson et al. Oct 2003 B1
6636615 Rhoads et al. Oct 2003 B1
6636967 Koyano Oct 2003 B1
6647128 Rhoads Nov 2003 B1
6647129 Rhoads Nov 2003 B2
6654501 Acharya et al. Nov 2003 B1
6661905 Chupp et al. Dec 2003 B1
6665419 Oami Dec 2003 B1
6668068 Hashimoto Dec 2003 B2
6671376 Koto et al. Dec 2003 B1
6671388 Op De Beeck et al. Dec 2003 B1
6674861 Xu et al. Jan 2004 B1
6674876 Hannigan et al. Jan 2004 B1
6675146 Rhoads Jan 2004 B2
6678389 Sun et al. Jan 2004 B1
6681029 Rhoads Jan 2004 B1
6683958 Petrovic Jan 2004 B2
6697944 Jones et al. Feb 2004 B1
6700990 Rhoads Mar 2004 B1
6704431 Ogawa et al. Mar 2004 B1
6707926 Macy et al. Mar 2004 B1
6721439 Levy et al. Apr 2004 B1
6728390 Rhoads et al. Apr 2004 B2
6737957 Petrovic et al. May 2004 B1
6738495 Rhoads et al. May 2004 B2
6744906 Rhoads et al. Jun 2004 B2
6748360 Pitman et al. Jun 2004 B2
6751337 Tewfik et al. Jun 2004 B2
6757908 Vogel Jun 2004 B1
6768807 Muratani Jul 2004 B1
6771797 Ahmed Aug 2004 B2
6785399 Fujihara Aug 2004 B2
6785401 Walker et al. Aug 2004 B2
6785815 Serret-Avila et al. Aug 2004 B1
6792542 Lee et al. Sep 2004 B1
6798893 Tanaka Sep 2004 B1
6801999 Venkatesan et al. Oct 2004 B1
6823455 Macy et al. Nov 2004 B1
6829368 Meyer et al. Dec 2004 B2
6834344 Aggarwal et al. Dec 2004 B1
6834345 Bloom et al. Dec 2004 B2
6850626 Rhoads et al. Feb 2005 B2
6856693 Miller Feb 2005 B2
6880082 Ohta Apr 2005 B2
6888943 Lam et al. May 2005 B1
6891958 Kirovski et al. May 2005 B2
6912010 Baker et al. Jun 2005 B2
6912294 Wang et al. Jun 2005 B2
6912315 Wong et al. Jun 2005 B1
6915002 Gustafson Jul 2005 B2
6915422 Nakamura Jul 2005 B1
6915481 Tewfik et al. Jul 2005 B1
6928233 Walker et al. Aug 2005 B1
6931536 Hollar Aug 2005 B2
6944313 Donescu Sep 2005 B1
6944771 Epstein Sep 2005 B2
6947893 Iwaki et al. Sep 2005 B1
6952774 Kirovski et al. Oct 2005 B1
6954541 Fan et al. Oct 2005 B2
6961854 Serret-Avila et al. Nov 2005 B2
6973195 Matsui Dec 2005 B1
6993154 Brunk Jan 2006 B2
6996249 Miller et al. Feb 2006 B2
7007166 Moskowitz et al. Feb 2006 B1
7020304 Alattar et al. Mar 2006 B2
7024018 Petrovic Apr 2006 B2
7043049 Kuzma May 2006 B2
7043536 Philyaw et al. May 2006 B1
7043638 McGrath et al. May 2006 B2
7046808 Metois et al. May 2006 B1
7054461 Zeller et al. May 2006 B2
7054462 Rhoads et al. May 2006 B2
7058815 Morin Jun 2006 B2
7068809 Stach Jun 2006 B2
7072492 Ogawa et al. Jul 2006 B2
7107452 Serret-Avila et al. Sep 2006 B2
7111169 Ripley et al. Sep 2006 B2
7113613 Echizen et al. Sep 2006 B2
7142691 Levy Nov 2006 B2
7162642 Schumann et al. Jan 2007 B2
7164778 Nakamura et al. Jan 2007 B1
7167599 Diehl Jan 2007 B1
7171020 Rhoads et al. Jan 2007 B2
7177429 Moskowitz et al. Feb 2007 B2
7197368 Kirovski et al. Mar 2007 B2
7206649 Kirovski et al. Apr 2007 B2
7224819 Levy et al. May 2007 B2
7231061 Bradley Jun 2007 B2
7289643 Brunk et al. Oct 2007 B2
7298865 Lubin et al. Nov 2007 B2
7319759 Peinado et al. Jan 2008 B1
7321666 Kunisa Jan 2008 B2
7334247 Finseth et al. Feb 2008 B1
7336802 Kunisa Feb 2008 B2
7346514 Herre et al. Mar 2008 B2
7369677 Petrovic et al. May 2008 B2
7389421 Kirovski et al. Jun 2008 B2
7430670 Horning et al. Sep 2008 B1
7450727 Griesinger Nov 2008 B2
7454019 Williams Nov 2008 B2
7562392 Rhoads et al. Jul 2009 B1
7581103 Home et al. Aug 2009 B2
7587601 Levy et al. Sep 2009 B2
7616776 Petrovic et al. Nov 2009 B2
7617509 Brunheroto et al. Nov 2009 B1
7630497 Lotspiech et al. Dec 2009 B2
7644282 Petrovic et al. Jan 2010 B2
7660991 Nakamura et al. Feb 2010 B2
7664332 Wong et al. Feb 2010 B2
7693297 Zhang et al. Apr 2010 B2
7698570 Schumann et al. Apr 2010 B2
7788684 Petrovic et al. Aug 2010 B2
7788693 Robbins Aug 2010 B2
7840006 Ogawa et al. Nov 2010 B2
7979881 Wong et al. Jul 2011 B1
7983922 Neusinger et al. Jul 2011 B2
7986806 Rhoads Jul 2011 B2
8055013 Levy et al. Nov 2011 B2
8059815 Lofgren et al. Nov 2011 B2
8155463 Wong et al. Apr 2012 B2
8189861 Rucklidge May 2012 B1
8194803 Baum et al. Jun 2012 B2
8249992 Harkness et al. Aug 2012 B2
20010001159 Ford May 2001 A1
20010021926 Schneck et al. Sep 2001 A1
20010022786 King et al. Sep 2001 A1
20010044899 Levy Nov 2001 A1
20010051996 Cooper et al. Dec 2001 A1
20020007403 Echizen et al. Jan 2002 A1
20020012443 Rhoads et al. Jan 2002 A1
20020033844 Levy et al. Mar 2002 A1
20020044659 Ohta Apr 2002 A1
20020052885 Levy May 2002 A1
20020053026 Hashimoto May 2002 A1
20020054089 Nicholas et al. May 2002 A1
20020068987 Hars Jun 2002 A1
20020080964 Stone et al. Jun 2002 A1
20020080976 Schreer Jun 2002 A1
20020082731 Pitman et al. Jun 2002 A1
20020095577 Nakamura et al. Jul 2002 A1
20020097873 Petrovic Jul 2002 A1
20020120849 McKinley et al. Aug 2002 A1
20020120854 Levine et al. Aug 2002 A1
20020126842 Hollar Sep 2002 A1
20020126872 Brunk et al. Sep 2002 A1
20020138734 David et al. Sep 2002 A1
20020154144 Lofgren et al. Oct 2002 A1
20020168087 Petrovic Nov 2002 A1
20020178368 Yin et al. Nov 2002 A1
20030009671 Yacobi et al. Jan 2003 A1
20030012098 Sako et al. Jan 2003 A1
20030012403 Rhoads et al. Jan 2003 A1
20030016825 Jones Jan 2003 A1
20030021439 Lubin et al. Jan 2003 A1
20030021441 Levy et al. Jan 2003 A1
20030028796 Roberts et al. Feb 2003 A1
20030031317 Epstein Feb 2003 A1
20030033321 Schrempp et al. Feb 2003 A1
20030037075 Hannigan et al. Feb 2003 A1
20030053655 Barone et al. Mar 2003 A1
20030056213 McFaddin et al. Mar 2003 A1
20030061489 Pelly et al. Mar 2003 A1
20030063747 Petrovic Apr 2003 A1
20030072468 Brunk et al. Apr 2003 A1
20030076955 Alve et al. Apr 2003 A1
20030078891 Capitant Apr 2003 A1
20030081809 Fridrich et al. May 2003 A1
20030112974 Levy Jun 2003 A1
20030112997 Ahmed Jun 2003 A1
20030115504 Holliman et al. Jun 2003 A1
20030131350 Peiffer et al. Jul 2003 A1
20030152225 Kunisa Aug 2003 A1
20030174862 Rhoads et al. Sep 2003 A1
20030177359 Bradley Sep 2003 A1
20030179901 Tian et al. Sep 2003 A1
20030185417 Alattar et al. Oct 2003 A1
20030187679 Odgers et al. Oct 2003 A1
20030188166 Pelly et al. Oct 2003 A1
20030190054 Troyansky et al. Oct 2003 A1
20030190055 Kalker et al. Oct 2003 A1
20030200438 Kirovski et al. Oct 2003 A1
20030223584 Bradley et al. Dec 2003 A1
20040005076 Hosaka et al. Jan 2004 A1
20040008864 Watson et al. Jan 2004 A1
20040009763 Stone et al. Jan 2004 A1
20040010692 Watson Jan 2004 A1
20040015400 Whymark Jan 2004 A1
20040025176 Franklin et al. Feb 2004 A1
20040028255 Miller Feb 2004 A1
20040042635 Epstein et al. Mar 2004 A1
20040042636 Oh Mar 2004 A1
20040073916 Petrovic et al. Apr 2004 A1
20040078575 Morten et al. Apr 2004 A1
20040088556 Weirauch May 2004 A1
20040091111 Levy et al. May 2004 A1
20040093523 Matsuzaki et al. May 2004 A1
20040098593 Muratani May 2004 A1
20040101160 Kunisa May 2004 A1
20040103293 Ryan May 2004 A1
20040111740 Seok et al. Jun 2004 A1
20040133794 Kocher et al. Jul 2004 A1
20040136531 Asano et al. Jul 2004 A1
20040151316 Petrovic Aug 2004 A1
20040169581 Petrovic et al. Sep 2004 A1
20040174996 Tewfik et al. Sep 2004 A1
20040202324 Yamaguchi et al. Oct 2004 A1
20040204943 Kirovski et al. Oct 2004 A1
20040216157 Shain et al. Oct 2004 A1
20040250078 Stach et al. Dec 2004 A1
20040258274 Brundage et al. Dec 2004 A1
20050008190 Levy et al. Jan 2005 A1
20050010779 Kobayashi et al. Jan 2005 A1
20050013462 Rhoads Jan 2005 A1
20050025332 Seroussi Feb 2005 A1
20050050332 Serret-Avila et al. Mar 2005 A1
20050071669 Medvinsky et al. Mar 2005 A1
20050120220 Oostveen et al. Jun 2005 A1
20050154891 Skipper Jul 2005 A1
20050196051 Wong et al. Sep 2005 A1
20050202781 Steelberg et al. Sep 2005 A1
20050242568 Long et al. Nov 2005 A1
20050251683 Levy et al. Nov 2005 A1
20060005029 Petrovic et al. Jan 2006 A1
20060056653 Kunisa Mar 2006 A1
20060062426 Levy et al. Mar 2006 A1
20060075424 Talstra et al. Apr 2006 A1
20060104477 Isogai et al. May 2006 A1
20060227968 Chen et al. Oct 2006 A1
20060239501 Petrovic et al. Oct 2006 A1
20070003103 Lemma et al. Jan 2007 A1
20070005500 Steeves et al. Jan 2007 A1
20070039018 Saslow et al. Feb 2007 A1
20070100483 Kentish et al. May 2007 A1
20070110237 Tehranchi et al. May 2007 A1
20070143617 Farber et al. Jun 2007 A1
20070150418 Ben-Menahem et al. Jun 2007 A1
20070168673 Van Der Veen et al. Jul 2007 A1
20070177761 Levy Aug 2007 A1
20070192261 Kelkar et al. Aug 2007 A1
20070208711 Rhoads et al. Sep 2007 A1
20070223708 Villemoes et al. Sep 2007 A1
20080002854 Tehranchi et al. Jan 2008 A1
20080016360 Rodriguez et al. Jan 2008 A1
20080031463 Davis Feb 2008 A1
20080209219 Rhein Aug 2008 A1
20080228733 Davis et al. Sep 2008 A1
20080273861 Yang et al. Nov 2008 A1
20080298632 Reed Dec 2008 A1
20080310629 Van Der Veen et al. Dec 2008 A1
20080310673 Petrovic et al. Dec 2008 A1
20080313741 Alve et al. Dec 2008 A1
20090031134 Levy Jan 2009 A1
20090172405 Shiomi et al. Jul 2009 A1
20090177674 Yoshida Jul 2009 A1
20090262932 Petrovic Oct 2009 A1
20090319639 Gao et al. Dec 2009 A1
20090326961 Petrovic et al. Dec 2009 A1
20100034513 Nakano et al. Feb 2010 A1
20100115267 Guo et al. May 2010 A1
20100121608 Tian et al. May 2010 A1
20100146286 Petrovic et al. Jun 2010 A1
20100162352 Haga et al. Jun 2010 A1
20100214307 Lee et al. Aug 2010 A1
20100226525 Levy et al. Sep 2010 A1
20100228632 Rodriguez Sep 2010 A1
20100228857 Petrovic et al. Sep 2010 A1
20100287609 Gonzalez et al. Nov 2010 A1
20110016172 Shah Jan 2011 A1
20110068898 Petrovic et al. Mar 2011 A1
20110091066 Alattar Apr 2011 A1
20110103444 Baum et al. May 2011 A1
20110123063 Delp et al. May 2011 A1
20110202687 Glitsch et al. Aug 2011 A1
20110209191 Shah Aug 2011 A1
20110219229 Cholas et al. Sep 2011 A1
20110225427 Wood et al. Sep 2011 A1
20110235908 Ke et al. Sep 2011 A1
20110286625 Petrovic et al. Nov 2011 A1
20110293090 Ayaki et al. Dec 2011 A1
20110311056 Winograd Dec 2011 A1
20120017091 Petrovic et al. Jan 2012 A1
20120026393 Petrovic et al. Feb 2012 A1
20120072729 Winograd et al. Mar 2012 A1
20120072730 Winograd et al. Mar 2012 A1
20120072731 Winograd et al. Mar 2012 A1
20120084870 Petrovic Apr 2012 A1
20120130719 Petrovic et al. May 2012 A1
20120203556 Villette et al. Aug 2012 A1
20120300977 Petrovic et al. Nov 2012 A1
20130007462 Petrovic et al. Jan 2013 A1
20130011006 Petrovic et al. Jan 2013 A1
20130073065 Chen et al. Mar 2013 A1
20130108101 Petrovic et al. May 2013 A1
20130114847 Petrovic et al. May 2013 A1
20130114848 Petrovic et al. May 2013 A1
20130117570 Petrovic et al. May 2013 A1
20130117571 Petrovic et al. May 2013 A1
20130132727 Petrovic May 2013 A1
20130142382 Petrovic et al. Jun 2013 A1
20130151855 Petrovic et al. Jun 2013 A1
20130151856 Petrovic et al. Jun 2013 A1
20130152210 Petrovic et al. Jun 2013 A1
Foreign Referenced Citations (90)
Number Date Country
282734 Sep 1988 EP
372601 Jun 1990 EP
581317 Feb 1994 EP
1137250 Sep 2001 EP
2166725 Mar 2010 EP
2260246 Apr 1993 GB
2292506 Feb 1996 GB
2 363 027 Dec 2001 GB
2363027 Dec 2001 GB
10-150548 Jun 1998 JP
11-086435 Mar 1999 JP
11-284516 Oct 1999 JP
11-346302 Dec 1999 JP
2000-069273 Mar 2000 JP
2000083159 Mar 2000 JP
2000-174628 Jun 2000 JP
2000163870 Jun 2000 JP
2000216981 Aug 2000 JP
2001022366 Jan 2001 JP
2001-119555 Apr 2001 JP
2001175270 Jun 2001 JP
2001-188549 Jul 2001 JP
2001-218006 Aug 2001 JP
2001245132 Sep 2001 JP
2001-312570 Nov 2001 JP
2001-527660 Dec 2001 JP
2002-010057 Jan 2002 JP
2002-024095 Jan 2002 JP
2002-027223 Jan 2002 JP
2002-091465 Mar 2002 JP
2002091712 Mar 2002 JP
2002100116 Apr 2002 JP
2002125205 Apr 2002 JP
2002135557 May 2002 JP
2002-165191 Jun 2002 JP
2002176614 Jun 2002 JP
2002-519916 Jul 2002 JP
2002-232693 Aug 2002 JP
2002232412 Aug 2002 JP
2002319924 Oct 2002 JP
2002354232 Dec 2002 JP
2003-008873 Jan 2003 JP
2003-039770 Feb 2003 JP
2003-091927 Mar 2003 JP
2003-230095 Aug 2003 JP
2003-244419 Aug 2003 JP
2003-283802 Oct 2003 JP
2003316556 Nov 2003 JP
2004-023786 Jan 2004 JP
2004070606 Mar 2004 JP
2004-163855 Jun 2004 JP
2004173237 Jun 2004 JP
2004-193843 Jul 2004 JP
2004194233 Jul 2004 JP
2004-328747 Nov 2004 JP
2005051733 Feb 2005 JP
2005-094107 Apr 2005 JP
2005525600 Aug 2005 JP
20080539669 Nov 2008 JP
20100272920 Dec 2010 JP
20100009384 Jan 2010 KR
94-10771 May 1994 WO
95-14289 May 1995 WO
97-09797 Mar 1997 WO
97-33391 Sep 1997 WO
98-53565 Nov 1998 WO
99-03340 Jan 1999 WO
99-39344 May 1999 WO
99-45706 Oct 1999 WO
99-62022 Dec 1999 WO
00-00969 Jan 2000 WO
WO-0013136 Mar 2000 WO
00-56059 Sep 2000 WO
01-54035 Jul 2001 WO
WO-0155889 Aug 2001 WO
0197128 Dec 2001 WO
WO-0223883 Mar 2002 WO
0249363 Jun 2002 WO
02095727 Nov 2002 WO
03052598 Jun 2003 WO
2005017827 Feb 2005 WO
2005-027501 Mar 2005 WO
2005038778 Apr 2005 WO
2006051043 May 2006 WO
2006116394 Nov 2006 WO
2010073236 Jul 2010 WO
2013067439 May 2013 WO
2013090462 Jun 2013 WO
2013090466 Jun 2013 WO
2013090467 Jun 2013 WO
Non-Patent Literature Citations (103)
Entry
European Search Report dated Jul. 3, 2012 for European Patent Application No. 12150742.0, filed Oct. 7, 2003 (5 pages).
European Search Report for European Application No. 03774648.4 dated Nov. 10, 2010.
Barreto, et al. “Toward Secure Public-Key Blockwise Fragile Authentication Watermarking”, IEEE Proceedings—Vision, Image, and Signal Processing—Apr. 2002, vol. 149, Issue 2, p. 57-62.
Chen, B. et al. “Quantization Index Modulation: A Class of Provably Good Methods for Digital Watermarking and Information Embedding,” IEEE Transactions on Information Theory, Vo. 47, No. 4, p. 1423-1443.
International Search Report for PCT Application No. PCT/US03/31816 dated May 19, 2004.
International Search Report for PCT Application No. PCT/US07/16812 dated Sep. 26, 2008, p. 1-15.
Cox, I.J, et al. “Some General Methods for Tampering with Watermarks,” IEEE Journal on Selected Areas in Communications, vol. 16, No. 4, May 1998.
Furon, T., et al. “An Asymmetric Watermarking Method,” IEEE Trans. Signal Processing, vol. 51, No. 4 Apr. 2003, p. 981-995.
Germano Caronni, “Assuring Ownership Rights for Digital Images,” Proceedings of ‘reliable IT systems’ VIS 95, H.H. Bruggermann and W. Gerhardt-Hacki (Ed.), Vieweg Publishing Company, Germany, 1995.
Kim, T.Y., et al. “An Asymmetric Watermarking System with Many Embedding Watermarks Corresponding to One Detection Watermark”, IEEE Signal Processing Letters, vol. 11, No. 3, Mar. 2004, p. 375-377.
Petitcolas, F.A.P. et al. “The Blind Pattern Matching Attack on Watermark Systems,” IEEE Trans. Signal Processing, Apr. 2003.
Kirovski, D., et al.“Randomizing the Replacement Attach,” ICASSP 2004, p. 381-384.
Kirovski, et al. “Multimedia Content Screening Using a Dual Watermarking and Fingerprinting System”, Proceedings of the Tenth ACM International Conference, 2002, p. 372-381.
Kutter, M., et al. “The Watermark Copy Attack,” Proc. of the SPIE: Security and Watermarking of Multimedia Content II, vol. 3971, Jan. 2000, p. 1-10.
Lin et al. “Detection of Image Alterations Using Semi-Fragile Watermarks”, Proceedings of the SPIE International Conference on Security and Watermarking of Multimedia Contents II, vol. 3971, Jan. 2000.
Lu, Chun-Shien, et al. “Oblivious Cocktail Watermarking By Sparse Code Shrinkage: A Regional and Global-Based Scheme,” ICIP, 2000, (vol. III: 13-16).
Mason, A. J., et al. “User Requirements for Watermarking in Broadcast Applications,” IEEE Conference Publication, International Broadcasting Convention (IBC 2000), Amsterdam, Sep. 8-12, 2000.
Mintzer, et al. “If One Watermark if Good, Are More Better?” Acoustics, Speech, and Signal Processing, 1999. ICASSP'99., Publication Date Mar. 15-19, vol. 4, p. 2067-2069.
Mobasseri, B.G., et al. “Content Authentication and Tamper Detection in Digital Video”, Image Processing, 2000. Proceedings, 2000 International Conference, vol. 1, 2000, p. 458-461.
Moulin, P., et al. “Detection—Theoretic Analysis of Desynchronization Attacks in Watermarking,” Tech. Rep. MSR-TR-2002-24, Microsoft Research (Mar. 2002).
Park, et al. “Robust and Fragile Watermarking Techniques for Documents Using Bi-directional Diagonal Profiles”, Information and Communications Security: Third International Conference, ICICS 2001, Xian, China, Nov. 13-16, p. 483-494.
Petitcolas, F.A.P., et al. “Attacks on Copyright Marking Systems,” Second Workshop on Information Hiding, vol. 1525 of Lecture Notes in Computer Science, p. 218-238, Apr. 1998.
Steinebach, M., et al. “StirMark Benchmark: Audio Watermarking Attacks,” Int. Conference on Information Technology: Coding and Computing (ITCC 2001), Apr. 2-4, Las Vegas, Nevada, p. 49-54.
T. Kalker, “A Security Risk for Publicly Available Watermark Detectors,” Proc. Benelux Info. Theroy Symp., Veidhoven, The Netherlands, May 1998.
Tanaka, K, et al. “Secret Transmission Method of Character Data in Motion Picture Communication,” SPIE vol. 1605, Visual Communications and Image Processing '91, Visual Communications, p. 646-649, 1991.
Tsai, et al. “Wavelet packet and Adaptive Spatial Transformation of Watermark for Digital Image Authentication”, IEEE, Image Processing, 2000. Proceedings 2000 International Conference, Publication Date 2000, vol. 1, pp. 450-453.
Verance Corporation, “Confirmedia”, Powerpoint Presentation Made to National Associate of Broadcasters; Apr. 24, 2001.
Yeung, et al. “An Invisible Watermarking Technique for Image Verification”, 1997, pp. 680-683.
Hartung, F., et al., “Watermarking of MPEG-2 encoded video without decoding and re-coding,” Proc. SPIE Multimedia Computing and Networking 97, 3020:264-274, Feb. 1997.
Office Action dated Mar. 16, 2012 for Japanese Patent Application No. 2008-508985 (8 pages).
Office Action dated Jul. 21, 2011 for Japanese Patent Application No. 2008-508985 (6 pages).
Bangaleea, R., et al., “Performance improvement of spread spectrum spatial-domain watermarking scheme through diversity and attack characterisation,” IEEE Africon, pp. 293-298, 2002.
European Search Report dated Oct. 24, 2012 for European Patent Application No. 06758537.2, filed Apr. 21, 2006 (6 pages).
European Search Report dated Oct. 31, 2012 for European Patent Application No. 06758577.8, filed Apr. 25, 2006 (6 pages).
Office Action dated Nov. 26, 2012 for Japanese Patent Application No. 2011-114667 (8 pages).
Office Action dated Nov. 28, 2012 for Japanese Patent Application No. 2011-114666 (8 pages).
Wolfgang, R., et al., “Perceptual watermarks for digital images and video,” Proceedings of the IEEE, 87(7):1108-1126, Jul. 1999.
International Search Report and Written Opinion dated Apr. 8, 2013 for International Application No. PCT/US2012/069306, filed Dec. 12, 2012 (12 pages).
International Search Report and Written Opinion dated Mar. 25, 2013 for International Application No. PCT/US2012/069302, filed Dec. 12, 2012 (22 pages).
International Search Report and Written Opinion dated Feb. 28, 2013 for International Application No. PCT/US2012/066138, filed Nov. 20, 2012 (11 pages).
International Search Report and Written Opinion dated Mar. 14, 2013 for International Application No. PCT/US2012/069308, filed Dec. 12, 2012 (10 pages).
International Search Report and Written Opinion dated Mar. 18, 2013 for International Application No. PCT/US2012/063431, filed Nov. 2, 2012 (10 pages).
Kirovski, D., et al., “Robust spread-spectrum audio watermarking,” IEEE International Conference on Acoustics, Speech, and Signal Processing, 3:1345-1348, 2001.
Kirovski, D., et al., “Multimedia content; screening using a dual watermarking and fingerprinting system,” Multimedia '02 Proceedings of the tenth ACM international conference on Multimedia, 2002 (11 pages).
Pytlak, J.,“Anti-piracy coding,” URL: http://www.tele.com/pipermail/tig/2003-November/003842.html, Nov. 2003 (2 pages).
Seok, J., et al., “A novel audio watermarking algorithm for copyright protection of digital audio,” ETRI Journal, 24(3):181-189, Jun. 2002.
Cinea, Inc., “Forensic watermarking deterring video piracy,” 2004, (9 pages). [http://www.cinea.com/whitepapers/forensic—watermarking.pdf].
European Search Report dated Nov. 8, 2012 for European Patent Application No. 06785709.4, filed Jun. 27, 2006 (5 pages).
Kang, X., et al., “A DWT-DFT composite watermarking scheme robust to both affine transform and JPEG compression,” IEEE Transactions on Circuits and Systems for Video Technology, 8(13):776-786 Aug. 2003.
Office Action dated May 1, 2013 for Japanese Patent Application No. 2011-114667 (6 pages).
Perez-Gonzalez, F., et al., “Approaching the capacity limit in image watermarking a perspective on coding techniques for data hiding applications,” Signal Processing, 6(81):1215-1238 Jun. 2001.
Shih, F.Y., et al., “Combinational, image watermarking in the spatial and frequency domains,” Pattern Recognition, 36:696-975, May 2002.
Solanki, K., et al., “Robust image-adaptive data hiding: modeling, source coding and channel coding”, 41st Allerton Conference on Communications, Control and Computing, Oct. 2003 (10 pages).
Das, et al., “Distributed Priority Queues on Hybercube Architectures,” IEEE, 1996, pp. 620-627.
Maehara, F., et al., “A proposal of multimedial home education terminal system based on flash-squeak OS,” Technical report of the institute of image information and television engineers, 28(43):21-24, Jul. 2004.
Office Action dated May 8, 2012 for Japanese Patent Application No. 2009-522802 (4 pages).
European Search Report dated Apr. 12, 2012 for European Patent Application No. 07836262.1 filed Jul. 25, 2007 (12 pages).
Adelsbach, A., et al., “Proving Ownership of Digital Content,” Proc. 3rd Int. Workshop on Information Hiding, 1768:117-133, Sep. 1999.
Aggarwal, A., et al., “Multi-Layer Grid Embeddings,” Foundations of Computer Science, 26th Annual Symposium on Foundations of Computer Science, 85:186-196, Oct. 1985.
Aris Technologies, Inc. “Audio Watermarking System to Screen Digital Audio Content for LCM Acceptance,” May 1999 (17 pages).
Boney, L., et al., “Digital Watermarks for Audio Signals,” Dept. of Electrical Engineering, Univ. of Minnesota, Mar. 1996 (4 pages).
Cappellini, V., et al. “Robust Frame-based Watermarking for Digital Video,” Proceedings of the 12th International Workshop on Database and Expert Systems Applications, Sep. 2001 (5 pages).
Chou, J., et al., “A Robust Blind Watermarking Scheme based on Distributed Source Coding Principles,” Multimedial 2000 Proceedings of the eighth ACM international conference on multimedia, Los Angeles, California, 2000 (8 pages).
Chou, J., et al., “A Robust Optimization Solution to the Data Hiding Problem using Distributed Source Coding Principles,” Pro. SPIE, 3971, San Jose, California, Jan. 2000 (10 pages).
Costa, M., “Writing on Dirty Paper,” IEEE Trans. on Info. Theory, 29(3):439-441, May 1983.
Coxford, A., et al., “Advanced Mathematics: A Preparation for Calculus, Second Edition,” Harcourt Brace Jovanovish, Inc., 1978 (14 pages).
Davidson, M.F., “Music File Filter,” Sony Music, New York, May 23, 1999 (2 pages).
Digimarc Corporation, “Digimarc Watermarking Guide,” 1999 (22 pages).
Dittmann, J., “Combining digital watermarks and collusion secure fingerprints for customer copy monitoring,” Proc. IEEE Seminar on Secure Images and Image Authentication, Apr. 2000 (6 pages).
Epp, L.W., et al., “Generalized scattering matrices for unit cell characterization of grid amplifiers and device de-embedding,” IEEE, 2:1288-1291, Jun. 1995.
Guth, H.J., et al., “Error-and collusion-secure fingerprinting for digital data,” Proc. 3rd Int. Workshop on Information Hiding, LNCS 1768:134-145, Sep./Oct. 1999.
Hartung, F., et al., “Digital watermarking of MPEG-2 coded video in the bitstream domain,” Proc. IEEE Int. Conf. on Acoustics, Speech and Signal Processing, 4:2621-2624, Apr. 1997.
Hartung, F., et al., “Watermarking of uncompressed and compressed video,” Signal Processing, 3(66):283-301, May 1998.
Heegard, C., et al., “On the capacity of computer memory with defects,” IEEE Trans. Info. Theory, 5(IT-29):731-739, Sep. 1983.
International Search Report and Written Opinion dated Apr. 24, 2012 for International Application No. PCT/US2011/051857, filed Sep. 15, 2011 (9 pages).
International Search Report and Written Opinion dated Aug. 14, 1998 for International Application No. PCT/US1998/009587, filed May 12, 1998 (3 pages).
International Search Report and Written Opinion dated Aug. 22, 2007 for International Application No. PCT/US2006/031267, filed Aug. 9, 2006 (2 pages).
International Search Report and Written Opinion dated Feb. 14, 2002 for International Application No. PCT/US2001/026505, filed Aug. 27, 2001 (2 pages).
International Search Report and Written Opinion dated Jan. 4, 2008 for International Application No. PCT/US2006/015615, filed Apr. 25, 2006 (5 pages).
International Search Report and Written Opinion dated Mar. 28, 2012 for International Application No. PCT/US2011/051855, filed Sep. 15, 2011 (8 pages).
International Search Report and Written Opinion dated May 13, 2008 for International Application No. PCT/US2006/025090, filed Jun. 27, 2006 (2 pages).
International Search Report and Written Opinion dated May 29, 2008 for International Application No. PCT/US2006/015410, filed Apr. 21, 2006 (6 pages).
Jacobsmeyer, J., et al., “Introduction to error-control coding,” Pericle Communications Company, 2004 (16 pages).
Kalker, T., et al., “System issues in digital image and video watermarking for copy protection,” Proc. IEEE Int. Conf. on Multimedia Computing and Systems, pp. 562-567, Jun. 1999.
Kocher, P., et al., “Self-Protecting Digital Content: A Technical Report from the CRI Content Security Research Initiative,” Cryptography Research, Inc. (CRI), 2002-2003 (14 pages).
Kuznetsov, A.V., et al., “An error correcting scheme for defective memory,” IEEE Trans. Inf. Theory, 6(4):712-718, Nov. 1978 (7 pages).
Lacy, J., et al., “Intellectual property protection systems and digital watermarking,” Proceedings: Information Hiding, Second International Workshop, Portland, Oregon, pp. 158-168, 1998.
Lin, P.L., et al., “Robust transparent image watermarking system with spatial mechanisms,” The Journal of Systems and Software, 50:107-116, Feb. 2000.
Muranoi, R., et al., “Video retrieval method using shotID for copyright protection systems,” Proc. SPIE Multimedia Storage and Archiving Systems III, 3527:245-252, Nov. 1998.
Nikolaidis, N., et al., “Watermark detection: benchmarking perspectives,” 2002 IEEE Conference on Multimedia and Expo, 2002 (4 pages).
Office Action dated Mar. 18, 2011 for European Patent Application No. 03774648.4 (6 pages).
Philips Research Liquid Audio Fraunhofer Institute, “Digital Audio Screening Technology for Phased Rollout,” Version 1.00, May 1999 (38 pages).
RSA Laboratories, “Frequently asked questions about today's cryptography,” Version 4.1, May 2000 (37 pages).
Schneier, B., “Applied cryptography, second edition: protocols, algorithms and source code in C,” Oct. 1995 (10 pages).
Xu, C., et al., “Applications of digital watermarking technology in audio signals,” Journal of Audio Eng. Soc., 10(47):805-812, Oct. 1999.
Zhao, J., “A WWW service to embed and prove digital copyright watermarks,” Proc. European Conf. on Multimedia Applications, Services and Techniques (ECMAST'96), May 1996 (15 pages).
Zhao, J., “Applying digital watermarking techniques to online multimedia commerce,” Proc. Int. Conf. on Imaging Science, Systems and Applications (CISSA'97), Jun./Jul. 1997 (7 pages).
Lotspeich, J., “The Advanced Access Content System's Use of Digital Watermarking,” MCPS '06, Oct. 28, 2006, pp. 19-21.
“Advanced Access Content System (AACS), Pre-recorded Video Book,” Revision 0.951, Sep. 2009 (86 pages).
“Content Protection—Self Protecting Digital Content,” http://www.cryptography.com/technology/spdc/index.html, May 2010 (1 page).
“Microsoft response to CfP for technology solutions to screen digital audio content for LCM acceptance,” Microsoft Corporation, May 23, 1999 (9 pages).
“TASK AC122-copy protection for distribution services,” http://acad.bg/WISE/english/rd/partners/acts/areal/ac122-t.html, Jul. 1, 1997 (2 pages).
Dittmann, J., et al., “Combining digital watermarks and collusion secure fingerprints for digital images,” Proc. SPIE 3657:171-182, Jan. 1999 (12 pages).
Related Publications (1)
Number Date Country
20100287579 A1 Nov 2010 US
Provisional Applications (1)
Number Date Country
60418597 Oct 2002 US
Continuations (1)
Number Date Country
Parent 10681953 Oct 2003 US
Child 12777204 US