Interactive content acquisition using embedded codes

Information

  • Patent Grant
  • 9596521
  • Patent Number
    9,596,521
  • Date Filed
    Thursday, March 12, 2015
    9 years ago
  • Date Issued
    Tuesday, March 14, 2017
    7 years ago
Abstract
Methods and devices are provided to obtain associated information for a multimedia content. One such method includes receiving a content at a receiver device equipped with a watermark detector, performing watermark detection on the received content to extract a payload of an embedded watermark. The payload comprises a first field that includes a server identifier and a second field that includes an interval identifier associated with the server identifier. The first field provides a mapping to an Internet address accessible to retrieve metadata associated with content segments identified by the watermark payload. In this method, based on the detected watermark payload, a query is formed and transmitted to a server identified by the Internet address, and a response to the query is received from the server that includes metadata associated with the content.
Description
TECHNICAL FIELD

The subject matter of this patent document relates to management of multimedia content and more specifically using watermarks to facilitate recognition and utilization of multimedia content.


BACKGROUND

The use and presentation of multimedia content on a variety of mobile and fixed platforms have rapidly proliferated. By taking advantage of storage paradigms, such as cloud-based storage infrastructures, reduced form factor of media players, and high-speed wireless network capabilities, users can readily access and consume multimedia content regardless of the physical location of the users or the multimedia content. A multimedia content, such as an audiovisual content, often consists of a series of related images, which, when shown in succession, can impart an impression of motion, together with accompanying sounds, if any. Such a content can be accessed from various sources including local storage such as hard drives or optical disks, remote storage such as Internet sites or cable/satellite distribution servers, over-the-air broadcast channels, etc.


In some scenarios, such a multimedia content, or portions thereof, may contain only one type of content, including, but not limited to, a still image, a video sequence and an audio clip, while in other scenarios, the multimedia content, or portions thereof, may contain two or more types of content such as audiovisual content and a wide range of metadata. The metadata can, for example include one or more of the following: channel identification, program identification, content and content segment identification, content size, the date at which the content was produced or edited, the owner and producer identification of the content, timecode identification, copyright information, closed captions, and locations such as URLs where advertising content, software applications, interactive services content, and signaling that enables various services, and other relevant data that can be accessed. In general, metadata is the information about the content essence (e.g., audio and/or video content) and associated services (e.g., interactive services, targeted advertising insertion).


The metadata can enable content management, annotation, packaging, and search throughout content production and distribution value chain. Since the introduction of digital TVs, metadata has been introduced to enable digital interactive features and services. Various standardization efforts (such as MPEG-7, MPEG-21, TV-Anytime, DVB-SI, ATSC) strive to produce metadata standards with predefined data structures and transport methods for describing essence to support interoperability and unified services.


While such metadata may be useful in some applications, especially for enabling broadcast interactive services, they must be interleaved, prepended or appended to a multimedia content, which occupies additional bandwidth and, more importantly, can be lost when content is transformed into a different format (such as digital to analog conversion, transcoded into a different file format, etc.), processed (such as transcoding), and/or transmitted through a communication protocol/interface (such as HDMI, adaptive streaming)





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates a system for providing automatic content recognition and acquisition of interactive content in accordance with an exemplary embodiment.



FIG. 2 illustrates a diagram of how a Registrar, Domain Managers, Domain Member Embedder Managers and Embedders can be connected in a hierarchical structure in accordance with an exemplary embodiment.



FIG. 3 illustrates the relationship between the timeline of a broadcast content and the embedded watermarks in accordance with an exemplary embodiment.



FIG. 4 provides an example of how watermark payload can be associated with media time and interactive content.



FIG. 5(A) illustrates a set of exemplary operations that can be carried out to provide automatic content recognition and to acquire associated metadata in accordance with an exemplary embodiment.



FIG. 5(B) illustrates a set of exemplary operations that can be carried out to provide automatic content recognition and to acquire associated metadata in accordance with an exemplary embodiment.



FIG. 6 illustrates a system and associated components that enables automatic content recognition and acquisition of corresponding metadata in accordance with an exemplary embodiment.



FIG. 7 illustrates a watermark payload structure in accordance with an exemplary embodiment.



FIG. 8(A) illustrates a watermark payload structure in accordance with an exemplary embodiment.



FIG. 8(B) is a table describing Payload Type values in accordance with an exemplary embodiment.



FIG. 8(C) illustrates a structure including Large Domain, Medium Domain, and Small Domain fields in accordance with an exemplary embodiment.



FIG. 8(D) is a table illustrating server code and interval code values in accordance with an exemplary embodiment.



FIG. 8(E) is a table illustrating the number of domains and durations per domain in accordance with an exemplary embodiment.



FIG. 9 illustrates a block diagram of a device 900 within which various disclosed embodiments may be implemented.



FIG. 10 illustrates a set of exemplary operations that may be carried out in accordance with an exemplary embodiment to obtain metadata associated with a multimedia content.





SUMMARY OF CERTAIN EMBODIMENTS

The disclosed technology facilitates automatic recognition of a content, and enable acquisition of metadata associated with the content.


One aspect of the disclosed technology relates to a method for obtaining associated information for a multimedia content. The method includes receiving a content at a receiver device equipped with a watermark detector and performing watermark detection on the received content to extract a payload of one or more embedded watermarks. The payload includes a first field that includes a server identifier and a second field that includes an interval identifier associated with the server identifier. The first field provides a mapping to an Internet address accessible to retrieve metadata associated with content segments identified by the watermark payload. The method further includes, based on the detected watermark payload, forming a query and transmitting the query to a server identified by the Internet address, and receiving a response to the query from the server, the response including metadata associated with the content.


In one exemplary embodiment, the value of the first field is assigned by a central authority to domain registrants, and each domain registrant controls an assignment and usage of the second field. In another exemplary embodiment, a correspondence between the first field and the Internet addresses is pre-established at least in-part by a registrar server. In yet another exemplary embodiment, the mapping is stored in the receiver device in a memory. In another exemplary embodiment, the receiver device receives the mapping or the Internet address in response to a lookup request including the first field to a lookup server. In one exemplary embodiment, the query is a standardized query that is used to obtain the metadata corresponding to a particular value of the interval identifier. In still another exemplary embodiment, the payload includes a third field that is indicative of availability of the metadata associated with a content interval that is identified by the interval identifier. In yet another exemplary embodiment, the query is formed and transmitted to the server upon detection of a change in a value of the third field.


According to one exemplary embodiment, the payload is further structured to include a payload type field that identifies the payload as corresponding to one of a small domain, a medium domain or a large domain. In one particular embodiment, the payload is 50 bits long and the payload type field is a 2-bit field. In another particular embodiment, the payload that corresponds to a small domain includes a 30-bit first field, a 17-bit second, and a 1-bit interactive bit, the payload that corresponds to the medium domain includes a 22-bit first field, a 25-bit second field, and a 1-bit interactive bit, and the payload that corresponds to the large domain includes an 18-bit first field, a 29-bit second field, and a 1-bit interactive bit. In one exemplary embodiment, the interactive bit provides an indication as to whether or not an interactive content is available.


According to another embodiment, the first field specifies a server code, the second field specifies an interval code that is associated with a specific interval of the content, and each server code is assigned by a central authority to one of a content producer, a content distributor, or a service provider. In yet another embodiment, the metadata includes instructions that allows the receiver device to execute particular interactive services associated with a content interval that is identified by the interval identifier. In one particular embodiment, the metadata identifies one or more of the following: an Internet address of an interactive services server, or one or more parameters that indicate when and how an interactive service can be configured.


Another aspect of the disclosed embodiments relates to a device capable of receiving a multimedia content. The device includes a watermark detector implemented at least in-part using electronic circuitry to detect one of more watermarks from the received multimedia content. The detected watermarks include a payload that comprises a first field that includes a server identifier and a second field that includes an interval identifier associated with the server identifier. The first field provides a mapping to an Internet address accessible to retrieve metadata associated with content segments identified by the watermark payload. The device further includes a processor and a memory including processor executable instructions embodied thereupon. The instructions, upon execution, cause the processor to form a query. The device also includes a communication component implemented at least in-part using electronic circuitry to transmit the query to a server identified by the Internet address, and to receive a response to the query from the server. The response includes metadata associated with the content.


In one exemplary embodiment, value of the first field is assigned by a central authority to domain registrants, and each domain registrant controls an assignment and usage of the second field. In another exemplary embodiment, a correspondence between the first field and the Internet addresses is pre-established at least in-part by a registrar server. In still another embodiment, the mapping is stored in the receiver device and is accessible for use by the receiver device for retrieving the Internet address based on the first field. In yet another embodiment, the communication component is configured to transmit a lookup request including the first field to a lookup server and to receive the mapping or the Internet address in response to the lookup request.


According to another exemplary embodiment, the instructions executed by the processor form a lookup query based on a value of the first field, and the communication component is configured to transmit the lookup request to a lookup server and to receive the Internet address. In this particular embodiment, the instructions executed by the processor further form the query as a standardized query based on the Internet address and a particular value of the interval identifier, and the communication component further is configured to transmit the standardized query to a server and to receive the metadata corresponding to the particular value of the interval identifier. In one exemplary embodiment, the instructions executed by the processor form the query upon detection of a change in a value of the third field.


In another exemplary embodiment associated with the above device, the payload includes a third field that is indicative of availability of the metadata associated with a content interval that is identified by the interval identifier. In still another embodiment, the payload is further structured to include a payload type field that identifies the payload as corresponding to one of a small domain, a medium domain or a large domain. In one specific implementation, the payload is 50 bits long and the payload type field is a 2-bit field. In another specific implementation, the payload corresponding to a small domain includes a 30-bit first field, a 17-bit second, and a 1-bit interactive bit, the payload corresponding to the medium domain includes a 22-bit first field, a 25-bit second field, and a 1-bit interactive bit, and the payload corresponding to the large domain includes an 18-bit first field, a 29-bit second field, and a 1-bit interactive bit. In still another embodiment, the interactive bit provides an indication as to whether or not an interactive content is available.


According to one exemplary embodiment associated with the above device, the first field specifies a server code, the second field specifies an interval code that is associated with a specific interval of the content, and each server code is assigned by a central authority to one of a content producer, a content distributor, or a service provider. In yet another embodiment, the instructions executed by the processor causes the processor to use the metadata to execute particular interactive services associated with a content interval that is identified by the interval identifier. In another exemplary embodiment, the metadata identifies one or more of the following: an Internet address of an interactive services server, or one or more parameters that indicate when and how an interactive service can be configured.


Another aspect of the disclosed technology relates to a computer program product embodied on one or more non-transitory computer readable media. The computer program product includes program code for receiving a content at a receiver device equipped with a watermark detector, and program code for performing watermark detection on the received content to extract a payload of one or more embedded watermarks. The payload includes a first field that includes a server identifier and a second field that includes an interval identifier associated with the server identifier. The first field provides a mapping to an Internet address accessible to retrieve metadata associated with content segments identified by the watermark payload. The computer program product further includes program code for, based on the detected watermark payload, forming a query and transmitting the query to a server identified by the Internet address, and program code for, receiving a response to the query from the server, the response including metadata associated with the content.


Another aspect of the disclosed technology relates to a device that includes a processor, and a memory including processor executable code. The processor executable code when executed by the processor configures the device to extract one or more watermarks that are embedded in a multimedia content, where the extracted watermarks include a payload that comprises a first field that includes a server identifier and a second field that includes an interval identifier associated with the server identifier. The first field provides a mapping to an Internet address accessible to retrieve metadata associated with content segments identified by the watermark payload. The processor executable code when executed by the processor further configures the device to form a query, transmit the query to a server identified by the Internet address, and receive a response to the query from the server, the response including metadata associated with the content.


DETAILED DESCRIPTION

In the following description, for purposes of explanation and not limitation, details and descriptions are set forth in order to provide a thorough understanding of the disclosed embodiments. However, it will be apparent to those skilled in the art that the present invention may be practiced in other embodiments that depart from these details and descriptions.


Additionally, in the subject description, the word “exemplary” is used to mean serving as an example, instance, or illustration. Any embodiment or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the word exemplary is intended to present concepts in a concrete manner


As noted earlier, typical techniques for incorporating metadata into multimedia content often rely on interleaving, prepending or appending the metadata fields or packets with the associated multimedia content. These techniques have proven to be unreliable under certain circumstances, such as when the multimedia content is transformed into a different format, which can cause the metadata to be lost. Notably, in some scenarios, an intervening device such as a set-top box issued by a multichannel video program distributor (MVPD) receives a multimedia content from a content source and provides the uncompressed multimedia content to a television set or another presentation device, which can result in the loss of various metadata and functionalities such as interactive applications that would otherwise accompany the multimedia content. Therefore alternative techniques for content identification can complement or replace metadata multiplexing techniques.


The disclosed embodiments enable automatic content recognition (ACR) using embedded watermarks. The watermarks can be embedded in the audio and/or video portions of a content and are substantially imperceptible to a viewer (or listener) of the content. The watermarks are also immune to various content processing operations and channel impairments, such as compression and decompression, cropping, scaling, transcoding, format conversion, noise addition, acoustic propagation, optical (e.g., free space) transmission, digital-to-analog (D/A) and analog-to-digital (A/D) conversions and the like. Once detected by a watermark detector (also sometimes referred to as a watermark extractor), the payload of the watermark can be used to identify the content, as well as the current temporal position (timing information) of the content being viewed, and recover the metadata associated with the identified content and temporal position to enable various operations, such as receiving an additional content, performing dynamic advertising insertion, or participating in an interactive opportunity. The viewing device (or an associated device) is connected to the Internet (or more generally, to a remote database) for the retrieval of the additional content, for participating in the interactive opportunities or other services.


The disclosed embodiments further comply with the requirements of the Advanced Television Systems Committee (ATSC), Inc., Call for Proposals For ATSC-3.0 AUTOMATIC CONTENT RECOGNITION WATERMARKING SOLUTIONS—ATSC Technology Group 3 (ATSC 3.0) (S33 Doc. 067r3). In particular, some embodiments provide for the embedding of watermarks using a watermark inserter into a content at a content source, that is subsequently transmitted to a MVPD, which provides the content to a set-top box (or similar device) at consumers' homes. The content that comes from the set-top box (typically via a HDMI interface) is presented on a viewing device (“Receiver”) that is compliant with ATSC 3.0 standard. The uncompressed audio/video at the viewing device includes embedded watermarks that enables the identification of the content and the current position of the content being viewed. The identified content and the current temporal position of the content are used to recover the metadata that enables the viewing device to receive additional contents, services or features associated with the presented content. It should be noted that while in some embodiments, a receiver (sometime also referred to as a receiver device) is a separate component than the set-top box, in other variations a receiver device may include, or be part of a larger device that includes, any one or combinations of additional components such as a set-top box a display, keyboard or other user interface devices, or a watermark detector, as well as processors (e.g., microprocessors, digital signal processors (DSPs), etc.) and other circuitry that may be needed for implementation of such device, or devices.


In some embodiments of the present application, the information conveyed by the embedded watermarks allows a viewing device to identify the channel currently being watched and recognize a channel change within a short period of time (e.g., 2 seconds). Further, the information conveyed by the embedded watermarks allows a viewing device to identify the content and the current position of the content being viewed, including short content such as interstitials. Information conveyed by the embedded watermarks also allows a viewing device to discover a remote location (for example a URL of a remote server) for accessing metadata information about the content and associated services. It allows a viewing device to identify the temporal position within the content being rendered, to a level of per sample or access unit accuracy. Additionally, the information conveyed by the embedded watermarks allows a viewing device to receive a time-sensitive event trigger in real time which may activate the viewing device to perform various operations such as requesting for the metadata from the remote location.


The methods, systems, devices and computer program products that are described in this document further enable centralized management of the high-level namespace associated with the watermarks and, at the same time, enable decentralized namespace lookup. The disclosed embodiments further allow key points of interoperability to be standardized to achieve independent management of watermarks within a namespace, as well as distributed and independent operation and management of related data services associated with individual broadcast content.


The watermark structure in some exemplary embodiments includes the following fields: a Domain ID and a Sequence ID. Each Domain ID is assigned by a central authority to a Domain Registrant who controls assignment and use of the Sequence ID codes under that domain. Each Domain ID maps one-to-one to an Internet domain name which is used to retrieve metadata associated with Sequence IDs in that domain. Clients use a lookup service to find the domain name associations. A standardized query is used to obtain metadata matching a Sequence ID from servers in the domain. Note that the domain name associated with a Domain ID that is registered with the Domain Registrar for use in the Domain Lookup Service may be the same domain name that is used to serve interactive services for broadcast content that has the associated Domain ID embedded in a watermark within it or it may be a different domain name from which is used to serve the associated interactive services. A Sequence ID can be used to identify a content and the current temporal position of the content being viewed within the domain specified by the Domain ID.


Example Watermark Payload: According to an exemplary embodiment, a 50-bit payload is embedded in every 1.5 seconds of the content. In this exemplary embodiment, the watermark payload can be standardized with the following structure: [Payload Type:2a] [Payload:48]. That is, the right-most 48 bits are designated to carry the payload and the 2 left-most bits are designated to carry the Payload Type. For example, the Payload Type values can be in the range 0 to 3, where a “0” designates a Reserved payload type, a “1” designate a Large Domain payload type, a “2” designates a Medium Domain payload type, and a “3” designates a Small Domain payload type. The payload type values can thus each describe the structure of the payload.


In some exemplary embodiments, the payload structure for each payload type is defined as follows:

    • Small Domain: [Domain field:30 bits][Sequence field:17 bits][Trigger field:1 bit]
    • Medium Domain: [Domain field:22 bits][Sequence field:25 bits][Trigger field:1 bit]
    • Large Domain: [Domain field:18 bits][Sequence field:29 bits][Trigger field:1 bit]


The Domain field from any structure can be mapped into a unique Domain ID by prepending the Payload Type value to the Domain field and zero-padding (on the right) to 32 bits. For ASCII encoding, the Domain ID can be represented as an 8-character hexadecimal value. Domain field value of 0 can be reserved in all domains. The Sequence field from any structure can be mapped directly into a Sequence ID. For ASCII encoding, hexadecimal representation of the Sequence field (leading zeros optional) can be utilized. Sequence IDs with decimal value of 1024 or less can be reserved for use as Control Codes. Control Codes are currently reserved.


The trigger bit, when set (e.g. to a value of “1”), informs the Receiver of an event that may activate the Receiver to perform various operations such as requesting metadata from the domain server. It indicates that further services or features, such as interactive content or advertising insertion associated with the Sequence ID should be available to the Receiver from the domain server associated with the payload's Domain ID. In some implementations the trigger field can include multiple bits. In some implementations, the trigger field may be used for other purposes. For example, a field can be defined as an “overwriteable” bit which indicates whether or not a preexisting watermark previously embedded by a content distributor or content producer can be replaced by another distributor (this is sometimes referred to as watermark “replacing”). In this case, a watermark embedder first checks for the presence of a watermark payload, and verifies the value of such ‘overwriteable’ bit if a payload is preset, and decides if a new watermark payload can be embedded to replace the pre-existing one according to the value of the bit. In another example, another field can be defined as an “over-watermarkable” bit which indicates whether or not a new watermark payload can be embedded in the content to co-exists with a pre-existing one so that both can be extracted (this is sometimes referred to as watermark “layering”). In some implementations, additional fields may be added into the watermark payload structure to support these two exemplary use cases. Because the “overwritable” bit and/or “over-watermarkable” bit is associated with a content segment identified by a Sequence ID, each segment of a content may set these bits differently; thus, allowing some segments to be overwritable and/or over-watermarkable.


In another embodiment, authorization of overwriting watermarks or over-watermarking can be performed via a domain server. Such authorization may be associated with one or more Domain IDs and/or Sequence IDs. When a watermark embedder detects a pre-existing watermark payload, it sends the payload to a domain server according to the Domain ID of the payload, and receives a response indicating whether such payload can be replaced by a new payload or a new payload can be layered on top of the pre-existing one.


In some cases, a content distributor may want to check the services enabled by the pre-existing watermark payload before making a decision to replace the pre-existing payloads or layer new payloads in some or all content segments. The distributor can query the domain servers identified by the pre-existing payload for all relevant metadata identifying the services, inspect it, select metadata associated with some content segments, and post the selected metadata to the domain servers preferred by such distributor. The distributor can introduce new services associated with the pre-existing payloads. Alternatively, the distributor can also embed new payloads into some segments and associate new services with these segments enabled by the new payloads on the domain server. Furthermore, it is also possible for the distributor to embed new payloads in some segments on top of pre-existing payloads. Thus, both new payloads and pre-existing payloads can be detected and provided to a domain server, a receiver may receive multiple triggers identified by the new payload or the pre-existing payload associated with a segment. The receiver may choose the services caused by one of the triggers according to user preference or pre-configuration, or bring all services caused by multiple triggers to the user.


One of the services caused by triggers may be presentation of a secondary audiovisual content, typically delivered via Internet, such as pre-fetched advertisements. Such audiovisual content is treated as regular audiovisual content, i.e., it can also be watermarked and watermark-based triggers can be registered with a domain server. Thus, the watermark payloads in the secondary content can also trigger interactive services. This is sometimes called “nested triggers”.


In an alternative embodiment, the watermark embedder always overwrites existing watermarks, but keeps track of preexisting watermarks, and their relationship to newly embedded watermarks, and informs the domain server about it. This is particularly useful for live broadcasts, where examining the content for preexisting watermarks can go in parallel with watermark embedding/overwriting without causing any latency in the overwriting process. For example, the domain server can be informed that at the moment when the embedding of watermark with payload X has begun, the preexisting watermark with payload Y has been found, where the preexisting watermark begins T milliseconds before the newly embedded watermark. With this information, the domain server can later, when queried with payload X, calculate the timeline of preexisting watermarks, and provide the metadata about services in synchronization with timeline of the payload Y.


In yet another embodiment, multiple watermarks can be embedded into the same content using distinct watermark embedding parameters. For example, content producer may use one set of parameters for its watermark, but content distributor may have a distinct parameter set that produces watermarks that substantially do not interfere with detection of content producer watermarks. Alternatively, embedding of watermarks with distinct parameters may be used to increase watermark code space, or overall watermark data throughput. This way, sometimes referred to as watermark layering, multiple watermarks may be detected by a receiver, and the receiver may access domain servers associated with each of them and obtain multiple services.


Using the above watermark payload structures, if we assume that a watermark payload has temporal duration of 1.5 seconds, over 250,000 Large Domains can be identified (e.g. for long-term continuous embedding) that would allow 25.5 years of uniquely marked content per domain. This structure further allows over 4 Million Medium domains to be uniquely identified (e.g. for continuous marking of Olympics-scale events, annual channel assignments, or long-term selective embedding) that would allow 1.5 years of uniquely marked content per domain. The structure for Small Domains allows unique identification of over 1 Billion Small Domains (e.g. shows) with 54 hours of uniquely marked content per domain. Depending on the payload type, a domain may be assigned to one or more 1) broadcasters or content producers; 2) MVPDs; 3) channels; 4) sport events; 5) shows; 6) movies; or 7) episodes.


The watermark payload can undergo various coding, modulation and formatting operations before being embedded into a content. For example, the payload may be error correction code (ECC) encoded, scrambled, interleaved with other packets, appended with a synchronization or registration header, encrypted or channel coded to form a sequence of bits with particular characteristics. Often, a watermark payload is repeatedly embedded in multiple portions of the host content to improve the detection reliability of the embedded watermarks. Once embedded, the embedded content can be processed by a watermark extractor to recover the embedded watermark bits (or, more generally, symbols), and perform the reverse of the above coding, modulation or formatting schemes to recover the payload. In some instances, statistical techniques are used to recover the embedded symbols from the content using multiple instances of embedded watermarks.



FIG. 1 illustrates a system for providing automatic content recognition for content that is provided by a broadcaster to a consumer device and acquisition of interactive content in accordance with an exemplary embodiment. The content is embedded with watermarks by a Domain Member prior to broadcast. For example, such a Domain Member can be a content producer or a Broadcaster. A Broadcaster transmits the content to one or more user premises. Such content is often received at a receiver such as a set top box (STB), where decompression and formatting operations may take place before the content is provided to the Receiver. Decompression and formatting may alternatively take place within the Receiver. The Receiver which includes a watermark detector, examines the received content for the presence of watermarks. The detection of watermarks may trigger further actions such as identifying a domain name associated with the detected watermark payload and sending a query to an identified domain server.


The Domain Registrar in FIG. 1 is a unique centralized entity responsible for registering Domain IDs and publishing the mapping between Domain IDs and domain names to Domain Lookup Servers. Domain registration is a process wherein a Domain ID is uniquely assigned to a Domain Registrant entity. The Domain Registrar provides Domain Registrant with a process (e.g., designated as REGISTER in FIG. 1) to establish and maintain the relationship between the Domain ID and a domain name (e.g., Internet format). Multiple Domain IDs may be mapped to the same domain name. The Domain Registrar further maintains a database of all mappings from Domain IDs to domain names. The Domain Registrar employs a standardized protocol (e.g., designated as PUBLISH in FIG. 1) to publish new and modified domain mappings to Domain Lookup Services that can include Domain Lookup Servers, as well as any other devices that may be needed to implement Domain Lookup Services. This protocol used by the Domain Registrar enables interoperability between the central Domain Registrar and all Domain lookup services. In some implementations, support for PUBLISH protocol is mandatory on both the Domain Lookup Servers and the Domain Registrar.


Referring again to FIG. 1, Domain Registrants are responsible for coordinating the use of Sequence IDs in watermarks by one or more Domain Members. The Domain Registrant may be a member of its domain. The Domain Registrant is also responsible for registering a domain name (to be associated with its assigned Domain ID) with the Domain Registrar.


Domain Lookup Server(s) maintain a copy of the Domain Registration database which maps each registered Domain ID to a domain name and keeps it current using the PUBLISH protocol with the Domain Registrar. Domain Lookup Server(s) also employ a standardized protocol (e.g., designated as LOOKUP in FIG. 1) to provide domain name mappings from the database in response to Domain ID lookup queries originated by the Receivers. In some embodiments, the use of a standardized LOOKUP protocol is necessary to obtain interoperability between any Receiver and any Domain Lookup Server, but does not need to be mandatory on either the Receivers or Domain Lookup Server(s) because a Receiver manufacturer can direct all lookup queries from devices that they manufacture to a private Domain Lookup Service and employ a non-standard protocol to do so. In some embodiments the Receivers are ATSC-compatible or ATSC-complaint. That is, those receivers comply with ATSC requirements, such as those under ATSC 3.0.


Domain Servers are Internet servers that are accessible at the domain name associated with a registered Domain ID and can provide metadata to Receivers in response to queries triggered by watermark detections. In some implementations, queries employ a standardized message protocol (e.g., designated as QUERY in FIG. 1). A query is initiated by a Receiver and provides the domain server with a Domain ID and Sequence ID. The Domain Server responds with available metadata (e.g. broadcast channel identifier, a broadcast segment identifier, a timecode, a signaling) associated with the provided Domain ID and Sequence ID. Domain servers are not required to provide data for all required data fields available for all queries. In some embodiments, support for the QUERY protocol is mandatory on all Receivers and Domain Servers in order to enable interoperability among all receivers and content. This protocol enables interoperability between all receivers and all domain servers and support may be mandatory on both the receivers and the domain servers.


Domain Management: Domains are managed via coordinated interaction between a Domain Registrant and Domain Members (entities within a domain). Domain


Management includes allocation of Sequence IDs within the domain to Domain Members, assignment of Sequence IDs to content segments, management of Sequence ID usage by watermark embedders, and/or distribution of metadata associated with Sequence IDs to Domain Servers. Standardization of protocols or processes for these functions may be valuable to obtain interoperability of professional systems, but is not essential for interoperability of devices. Domain Management may include analysis of the digital broadcast stream which contains both audiovisual broadcast content and multiplexed digital metadata to decode both watermarks and embedded digital metadata and automatically establish the association between watermark payloads present in the audio and video essence of the broadcast content and digital metadata present and associated with the same essence in the broadcast stream for population of the Domain Servers. Domain Management may also include functions and interfaces that allow broadcasters or content producers to edit the metadata extracted from the broadcast content or add new metadata for population of the Domain Servers.


The previously described watermark structure that comprises a domain identifier (Domain ID), a sequence identifier (Sequence ID) and a trigger field, can be used as an alternative method to deliver metadata (signaling) to receivers, and is of particular utility in scenarios where the receiver has access to the essence of the broadcast content (i.e. its audio and video) but not the complete digital broadcast stream which contains the metadata (signaling) in a multiplexed digital data stream. This may happen if the receiver obtains the broadcast content from an interface that does not include the portion of the multiplexed broadcast stream which includes the triggers, such as over an analog or HDMI interface. In such a scenario, the following exemplary sequence of operations can be implemented to allow a user to obtain the full set of features associated with the full broadcast content, as well as additional features that are enabled through the use of the disclosed technology. The exemplary sequence of operations is as follows. First, the name of a network server from which the metadata can be accessed (“domain name”) is identified. Next, the identified server is queried to obtain the associated metadata. In one exemplary embodiment, the process of retrieving a metadata can be accomplished by placing a set trigger bit in a particular watermark payload to cause receivers to imitate the trigger retrieval process.


According to one exemplary embodiment, the Sequence IDs in a Domain are dynamically allocated to Domain Members by a Domain Manager (which performs Domain


Management functions). Moreover, the Embedders of a Domain Member may be deployed in multiple facilities in various locations. They are managed by and connected with a Domain Member Embedder Manager via Internet, an enterprise network, or another appropriate communication link. A block of Sequence IDs (which can include one or more continuous Sequence IDs) may initially be allocated for each Embedder. When an Embedder needs more Sequence IDs, it sends a request to its Domain Member Embedder Manager for a new block of Sequence IDs. Such a request may be sent prior to performing watermark embedding or when the number of remaining Sequence IDs reaches a predefined number. Similarly, a Domain Manager initially allocates one or more blocks of Sequence IDs to a Member Embedder Manager. When a Member Embedder Manager needs more Sequence IDs, it sends a request to its Domain Manager for a new Sequence IDs. Both the Domain Manager and Domain Member Embedder Manager ensure that each Embedder has adequate Sequence IDs. In addition to Sequence ID allocation, a Domain Member Embedder Manager can also configure each Embedder it manages, including the Domain ID of the watermark payload to be embedded by such Embedder and other embedding parameters. It also collects the embedding logs and metadata of watermarked content from the Embedders and reports them to a Domain Manager. A Domain Manager may use this data for registering the allocated Sequence IDs and associating Sequence IDs with content segments and associated metadata in the Domain Server as described earlier.



FIG. 2 illustrates a diagram of how a Registrar, Domain Managers, Domain Member Embedder Managers and Embedders can be connected in a hierarchical structure in accordance with an exemplary embodiment. As shown in FIG. 2, each Domain Member Embedder Manager (e.g., Domain Member Embedder Manager 1) may be associated with a plurality of Embedders (Embedders 1A through 1N), each Domain Manager (e.g., Domain Manager 1) can be associated with a plurality of Domain Member Embedder Managers (e.g., Domain Member Embedder Managers 1 through k), and a Registrar may be associated with a plurality of Domain Managers (e.g., Domain Managers 1 through P).


In one exemplary embodiment, a Domain can have more than one Domain Servers, each of which may serve a specific region and/or a Domain Member. In this case, the lookup services can be provided by a cluster of lookup servers in a hierarchical structure. For example, a Registrar level server first maps a Domain ID provided by a Receiver to a domain-level lookup server; and then such domain-level lookup server resolves the Domain ID to a specific Domain server.


Referring again to FIG. 1, the Receivers and Domain Lookup Services employ a standardized message protocol (e.g., designated as LOOKUP in FIG. 1) to query a Domain Lookup Service to provide the domain name associated with a Domain ID. The Domain ID-to-domain name mapping can be cached locally in the Receiver and the cache can be timed out periodically (e.g. with a time-to-live value) or refreshed as needed (e.g. if a server fails to respond). This protocol enables interoperability between all receivers (e.g., ATSC receivers) and all Domain Lookup Services. As noted earlier, support for a standardized LOOKUP protocol need not be mandatory for either the Receivers or the Domain Lookup Services because a receiver manufacturer (e.g., an ATSC receiver manufacturer) could provide their own domain lookup service and use a proprietary protocol for their interaction. Receiver manufacturers should be permitted to associate their receivers with a Domain Lookup Service of their choosing and may permit end-users to select a Domain Lookup Service to use. For one or more Domain IDs, Receiver manufacturers may also choose to use an alternate domain server whose name is registered with the Domain Registrar. For such Domain IDs, it is the responsibility of that manufacturer to ensure that they direct those queries to a domain server which is populated with timely and correct metadata associated with the Domain IDs and Segment IDs identified in the received watermark payloads. In such instances, the domain server may be populated as previously described from real-time analysis of the complete digital broadcast stream.


Referring again to FIG. 1, the Receiver employs a watermark detector to scan content it receives for a watermark payload. The receiver may activate the watermark detector only for content received separately from a complete digital broadcast stream and/or from a specific broadcast channel. When a watermark payload is detected, a Receiver may request associated metadata by querying an associated Domain Server. The trigger bit set in a watermark payload is a “hint” to the device that interactive content associated with the Sequence ID should be available from the domain server associated with the payload's Domain ID. The Receiver may therefore use the presence of the trigger bit set as the basis for determining when to initiate a Domain Server query. The Receiver may further choose to initiate a Domain Server query in other contexts, such as when a watermark payload is detected after content playback has begun (e.g. after the Receiver is first turned on), after channel change, after network connectivity is restored following a period of interruption, or when a signaling is provided in a previous trigger that such “hint” may be ignored.


In implementations that use the trigger bit, such a bit can support the use case where a broadcaster chooses to embed the watermark throughout its content (maybe for other applications; e.g. audience measurement, advertisement tracking, etc.) but only signals the availability of special content (e.g., ATSC-compatible interactive content) for certain portions of the content. In the absence of such trigger bit, millions of TV sets may attempt to query their server when there is no interactive content available. It should be noted that in some implementations the trigger bit is not needed. For example, when a receiver queries triggers from a domain server, it may request for a set of triggers for a particular duration of the content to reduce the query traffic.


The queried domain server responds to the Receiver's query by providing the stored metadata associated with the provided watermark payload information. The Receivers may then use the metadata received from the domain server to access, configure, and execute interactive services. Such metadata may include, but is not limited to, a broadcast channel identifier, an identifier that uniquely identifies the broadcast content and broadcast segment, a timecode, a trigger, an event or an action, supplement content, advertising content, or a server location (e.g., URL) where the above can be obtained. The Receivers should be resilient to an absent, delayed, or malformed response from a domain server.


The following provides an exemplary scenario in which the trigger field may be used to obtain metadata that enables additional features related to the content. In some implementations, where the timeline of a broadcast is broken into contiguous “segments” of content (e.g., show, ad, ad, promo, ad, show), for individual segments, metadata may be associated with particular moments on the segment timeline. The trigger field indicates whether or not such metadata is available. The metadata may contain instructions for how, when, or under what conditions a receiver should load and execute particular content or service, such as an interactive service associated for the segment. The metadata may identify an Internet server from which the interactive services can be loaded. The metadata may additionally identify a segment which is being displayed with which, e.g., the interactive services are associated. The metadata may additionally identify one or more parameters for when and how, e.g., the interactive service should be configured.



FIG. 3 illustrates the relationship between the timeline of a broadcast content and the embedded watermarks in accordance with an exemplary embodiment. The depicted broadcast content timeline includes two broadcast segments of the main program (i.e., show segments 49 and 50), an advertisement segment 62 and a promo segment 12. The lower part of FIG. 3 illustrates the payload of the watermark embedded in the promo segment 12 that includes a payload type (PT) field (shown as having a value of 1), a domain ID (DID), a segment ID (SID) and a trigger field (IS). FIG. 3 shows consecutive SID values (62801 to 62840) that are embedded in each of 40 segments within the promo segment 12. The DID value for all 40 segments is 4204, the payload type is 1, and the trigger field is set to 1.



FIG. 4 provides an example of how watermark payload can be associated with media time and interactive content in accordance with exemplary embodiments. In particular, the table in FIG. 4 shows that the Sequence ID 62801 within the Domain ID 5837FE00 is associated with media time 16:28:43.195, and is mapped to XBC-East channel, which is associated with an interactive feature that can be accessed from the URL xbc.tv/p12?e=7.5. Similarly, FIG. 4 shows that Sequence ID 62802 is associated with media time 16:29:44.695, and is mapped to XBC-East channel, which is associated with an interactive feature that can be accessed from the URL xbc.tv/p12?e=7.5&m=77ee. The table that is illustrated in FIG. 4 can be stored at a Domain Server and selected data can be provided to the Receivers in response to queries.



FIG. 5(A) illustrates a set of exemplary operations that may be carried out to provide automatic content recognition and to acquire associated metadata in accordance with an exemplary embodiment. The operations in FIG. 5(A) can be carried out by a receiver (such as the Receiver shown in FIG. 1). At 502, a content is received at a receiver device equipped with a watermark detector. The received content can, for example, be in uncompressed format. In some embodiments, the content may arrive at the receiver in compressed format and be decompressed within the receiver prior to watermark detection. At 504, watermark detection is performed on the received content to extract one or more embedded watermark payloads. At 506, it is determined whether or not the Domain ID from the extracted watermark payload is in the cache of the receiver. If the Domain ID is cached, the operations continue at 514. If the Domain ID does not reside in cache (or other local storage), at 508, the receiver forms a query from the extracted payload and sends the query to a Lookup Server to lookup a domain server corresponding to the Domain ID in the extracted payload. In some implementations, the URLs of one or more Lookup Servers are pre-configured in the receiver. At 510, it is determined whether or not the receiver receives a domain server address (e.g., a URL) and upon reception of the domain server address, the receiver, at 512, stores the Domain ID with the corresponding domain server address in the cache and, at 514, the receiver forms a query based on the extracted payload for metadata and sends it to the identified domain server. At 516, a response to the query is received from the domain server, the response includes metadata associated with the content. If the Lookup server fails to respond, the receiver may try another Lookup server. After failure of at least two trials, the receiver may notify the user of the error message.



FIG. 5(B) illustrates a set of exemplary operations that may be carried out to provide automatic content recognition and to acquire associated metadata in accordance with an exemplary embodiment. The operations in FIG. 5(B) are similar to those in FIG. 5(A) but further emphasize the conditions that provide a hint to the receiver to initiate a query to the server. In particular, after receiving a content (at 501) and performing watermark detection (at 503), it is determined at 505 if the playback is initiated, a channel change is detected, or the trigger field is set. For example, such a determination can provide an affirmative answer (YES) if the trigger field (e.g., the trigger bit) is set to “1” or if the trigger field value has changed from a previously detected trigger field value. Such a determination can also provide an affirmative answer (YES), when, for example, the detected watermark is a first one after content playback begins or the first one after a channel change has occurred. If the determination at the 505 is a NO, the operations return to 503, where additional watermarks from the received content are detected. If the determination at 505 results in a YES, the operations continue to 507, where it is determined whether or not the Domain ID corresponding to the detected watermark is stored in cache. The operations 507, 509, 511, 513, 515 and 517 in FIG. 5(B) are similar to the previously described operations 506, 508, 510, 512, 514 and 516 of FIG. 5(A), respectively.


VP1 Watermark: One specific example implementation of the disclosed technology is fully compatible with requirements set forth in the call for proposals (“CfP”) for ATSC-3.0 Automatic Content Recognition Watermarking Solutions. Such an implementation provides a flexible, decentralized and scalable Internet-based system architecture that employs a particular watermark, called VP1, in conjunction with a collection of standardized communication protocols and a lightweight administrative process that enable any connected ATSC Receiver to fully recover ATSC-3.0 broadcast stream metadata which has been lost over interfaces which do not carry the full broadcast stream. Such an architecture supports the server-based usage model outlined in the CfP, but also enables a more open, decentralized, and efficient architecture that obviates receiver manufacturers of the requirement to provide ACR services or contract metadata services, and enables this function to be provided by the same Content and Signaling Servers that support interactive services enabled in ATSC Receivers via direct access to the full ATSC broadcast stream. One function which must be centralized in this architecture, however, is a domain registrar (e.g., a Server Registrar), which runs a lightweight administrative process for assigning blocks of watermark codes to registrants and publishes a database of the registrations to service providers. (This function may be operated by ATSC or an administrative entity designated by it.) All other functions are open and decentralized and can be operated by broadcasters, receiver manufacturers, or third-party service providers. Such an architecture offers significant market and operational benefits by avoiding the need for any service provider to aggregate and publish metadata associated with multiple broadcast streams. Similarly, ATCS receiver manufacturers are not required to engage with a commercial service provider to aggregate and publish metadata associated with all broadcast streams.


The VP1 watermark and the associated system architecture are based upon the use of a 50-bit watermark data payload which has a 1.5 second duration in the marked content. A single detected watermark is sufficient to synchronize the receiver with the timecode of the embedded content with frame (e.g., millisecond) accuracy and recover any lost metadata and interactive services associated with the original broadcast stream. The VP1 watermark may be embedded continuously in content for subsequent detection such that:


(a) The audio quality is “near transparent” (i.e. a difference grade with a 95% confidence lower bound greater than −0.5) under the test conditions of ITU BS-1116-1 “Subjective Assessment of Small Audio Impairments;”


(b) The mean-time-to-first-detection of the payload is less than 3 seconds for broadcast content subjected to HE AAC v2 at 48 kbps;


(c) False detections (i.e., detected reported from unembedded content) and erroneous detections (i.e., detection of data payload different from what is embedded in the content) are reported by the detector with frequency not greater than once per 5 years of continuous detection; note that the data payload obtained in the case of a false or erroneous detection is considered to have a random value uniformly distributed across the range of defined codes. Since many possible code values will not be associated with broadcast content, the frequency of user-facing errors resulting from false or erroneous detections will be substantially less than the above (i.e., will be even further apart than 5 years).


(d) Embedding of the VP1 watermark requires not more than 20 mega instructions per second (MIPS) of processing per 48 kHz audio channel;


(e) Detection of the VP1 watermark requires not more than 10 MIPS of processing per multichannel audio program.


Additionally, VP1 watermark supports overwriting of watermarks and erasure of watermarks to enable any party in the content production or distribution chain to control all downstream watermark functionality. VP1 further supports the carriage of additional orthogonal watermark data channels (often referred to as “layers”) containing other data payloads for other applications.


The distributed system architecture associated with the VP1 watermark enables not only standardization of the watermark technology, but also includes a standardized code management scheme and three network protocols. An illustration of the architecture, which is compatible with the approach set forth in FIG. 2 of the CfP, is provided in FIG. 6. With reference to FIG. 6, the code management (or domain management) scheme, system component functionality, and necessary protocols are described in the following sections.


Similar to the previously describes watermark payload structure, the VP1 watermark includes a watermark payload with three fields. These fields carry a Server Code, an Interval Code, and a Trigger. It should be noted that the fields of VP1 watermark payload structure conform to the previously described watermark structure, with Sever Code and Interval Code being analogous to the Domain ID and a Sequence ID. An exemplary VP1 watermark structure is shown in FIG. 7. The Server Code is a value which is registered with a central authority designated by a Server Registrar (e.g., ATSC) that provides a mechanism for dividing the watermark code space among independent code-issuing entities (e.g., Server Registrants). For example, a Server Code can be registered by a content producer that wants to manage and use codes within content that they produce, a network that wants to manage and use codes within content that they distribute, or a service provider that wants to manage interactive services on their behalf These independent code-issuing entities are sometimes referred to as “ATSC Domains” because the Server Code can also provide a one-to-one mapping to an Internet domain. The domain identifiers are recorded by the Server Registrar, are published to Server Lookup Services which maintain copies of the registration database, and can be accessed by receivers to discover the Internet domain name at which they can access servers hosting metadata associated with content embedded with that Server Code.


The Server Registrant is responsible for coordinating the management of all Interval Codes associated with their assigned Server Code. Each Interval Code value can be associated uniquely with a specific interval of an instance of broadcast content. In some implementations, the interval is equal to the watermark duration (e.g., 1.5 seconds) but can be longer in circumstances where there is no need to enable a receiver to identify timing within the interval. We refer to the range of codes defined by an assigned Server Code and all associated Interval Codes as a Code Domain. The Trigger field of the VP1 watermark is a Boolean signal from the Content Source to the ATSC Receiver indicating that the ATSC Receiver should query for new interactive service content.


It should be noted that several components that are shown in FIG. 6 can find analogous counterparts in FIG. 1. For example, the Server Registrar and the Domain Registrar; the Content, Signaling and Metadata Server and Domain Server; and the Server Lookup Service/server and Domain Lookup Server can carry out analogous operations. The various components in FIG. 6 are further described below. A Server Registrar is established by ATSC for the purpose of registering ATSC Domains and assigning to each a unique Server Code. Registrants inform the registrar of a Server Name, which is the Internet domain name or URL at which metadata services associated with the Code Domain are located. The Server Registrar publishes the Server Code and associated Server Name to the Server Lookup Services.


One or more Server Lookup Services are established. These services may be operated by ATSC, the Server Registrar, Content Owners, ATSC Receiver manufacturers, or a third party. Each Server Lookup Service maintains a database of all Server Code/Server Name associations published by the Server Registrar and responds to lookup requests from ATSC Receivers. The Server Lookup Services do not need to access or store any broadcast metadata; they simply provide ATSC Receivers with access to Server Names associated with Server Codes detected from broadcast watermarks.


A Content Source, acting either as a Server Registrant or in concert with a Server Registrant, associates a valid registered Server Code and one or more unique Interval Codes and maps them to intervals of broadcast content essence. The Content Source embeds those codes in the broadcast content using a Watermark Inserter prior to delivery of the broadcast content to an MVPD. The Interval Codes and the metadata for those same intervals of broadcast essence (e.g. any interactive content, signaling, metadata, triggers, channel identifier, media timeline timecode, etc.) are associated together in a database which is provided to a Content, Signaling, and Metadata Server (“CSM Server”). Content Sources may associate and embed watermarks continuously throughout their program material using sequentially increasing Interval Codes, may embed watermarks only in those intervals of content where interactive services are enabled, or may embed an Interval Code repeatedly through a program segment where an interactive service is available but does not require timing precision. Content Sources may register additional Code Domains in advance of depleting the Interval Code space associated with a given Server Code and may associate newly assigned Server Codes with the same Internet domain name to maintain infrastructure continuity.


The CSM Server responds to various requests from ATSC Receivers, including delivery of signaling and interactive content based on interactive service data received from a complete broadcast stream. The CSM Server also responds to code metadata queries, in which a query containing the watermark payload (e.g. in the ASCII representational format) is submitted by the WM Client in an ATSC Receiver, with a request for metadata associated with the interval of broadcast content. The metadata included in the CSM Server response may include channel identifiers, timecodes, content or segment identifiers, triggers, etc.; these are referred to as the “information to convey” in the CfP. It should be noted that while metadata services can be hosted in the same servers as the content and signaling services, they may alternatively be hosted on different servers from those used for content and signaling services.


ATSC Receivers may obtain broadcast content essence absent the full ATSC broadcast stream from an MVPD via a STB. The ATSC receiver may provide the content essence to the watermark client for detection of any embedded codes. As part of watermark client implementation in a given product, associations between Server Codes and Server Names can be stored in a cache (e.g., memory device), but it can also include the Internet address of a Server Lookup Service so that it may lookup newly registered or modified Server Names. The cache may be pre-populated at the time at ATSC Receiver manufacture to reduce traffic to Server Lookup Services.


When the watermark client detects a watermark payload embedded in the content it is playing, it checks to see whether or not the detected Server Code is present in its cache. If it is, the watermark client queries the CSM Server whose Server Name is associated with the Server Code to obtain the metadata associated with the detected watermark payload. If the Server Code from the detected watermark is not present in its cache, or if the contacted server fails to respond as expected, the watermark client may look up the current Server Name associated with the Server Code from the Server Lookup Service, cache the result, and then initiate a query directed at the newly identified Server Name.


Watermark clients may be configured to initiate a query only for certain watermark detections; e.g. the first one after playback begins, the first one after a channel change, only those with the Trigger field set if a query has not been performed within the past, e.g., 30 seconds, etc. Timecode metadata provided to watermark clients by the CSM Server can be used in conjunction with data recovered from the watermark detection process to determine the original media timecode of the broadcast content with frame or millisecond accuracy.


To enable the architecture that is depicted in FIG. 6, open standards can be provided for the following three network protocols: PUBLISH, LOOKUP, and QUERY.


PUBLISH is a protocol whereby the Server Registrar notifies interested ecosystem participants of a newly established or updated mapping between a Server Code and an Internet domain name and publishes the association to Server Lookup Services.


LOOKUP is a protocol whereby an ATSC Receiver can submit a Server Code to a Server Lookup Service and receive a response containing the associated Server Name which has been most recently published by the Server Registrar.


QUERY is a protocol whereby an ATSC Receiver can submit a Server Code and Interval Code to a CSM Server and receive ATSC metadata (e.g. channel, timecode, interactive services triggers, etc.) associated with the specified interval of broadcast content.


The CfP further describes a scenario in its FIG. 2, where the associated architecture relies on having receivers programmed to access a metadata server designated by receiver manufacturer with all of their watermark-related requests. The disclosed architecture of the present application supports the use of this approach by receiver manufacturers who wish to employ such a model. In such an arrangement, (where the italicized terminology is taken from FIG. 2 of the CfP) the code DB and metadata server can be populated by any metadata server operator with access to the full broadcast stream for all broadcasters in a region. The same service provider can perform watermark detection and metadata recovery from the broadcast stream to populate their Code DB for use by the metadata server. Since the watermark specification is open, the Content Source need not use a Watermark Inserter affiliated with any particular metadata server operator and any metadata sever operator can recover the watermarks embedded by any broadcaster.


As a very specific example, the code DB and the Content and Signaling Server can be populated by any automatic content recognition (ACR) service provider with access to the full broadcast stream for all broadcasters in a region. The ACR service provider can perform watermark detection and metadata recovery from the broadcast stream to populate their Code DB for use by the Content and Signaling Server. Since the watermark specification is open, the Content Source need not use a Watermark Inserter affiliated with any particular ACR service provider and any ACR service provider can recover the watermarks embedded by any broadcaster.


ATSC receivers within such a closed ecosystem need not employ the LOOKUP or QUERY protocols and can instead rely on the private protocols for accessing services within this private ecosystem created by the metadata server operator (e.g., by the ACR service provider). Such receivers can seamlessly coexist alongside other ATSC receivers that employ the standardized protocols and infrastructure that is described in the present application.


The following provides a detailed example of a code structure and payload encoding in accordance with certain embodiments of the present application. The representational structure that previously described in connection with FIG. 7, supports a larger space than a 50-bit payload. In the sections that follow, we define a subset of that code space that can be suitably used to provide the needed signaling in more efficient manner; we further describe a proposed approach for encoding into the watermark payload.



FIG. 8(A) illustrates an exemplary watermark structure in accordance with an exemplary embodiment. As illustrated in FIG. 8(A), the 50-bit watermark payload is divided into two top-level fields; the Payload Type field (2 bits) and the Payload Field (48 bits). The Payload Type field describes the format of the Payload Field, with the mapping as shown in FIG. 8(B). The structure of the Large Domain, Medium Domain, and Small Domain fields are as shown in FIG. 8(C). Each of the 48-bit payload fields in FIG. 8(C) includes a Server Field, an Interval Field and a Trigger Field.


The Server Code is related to the Server Field for any of the three domain types by ((PT<<30)+SF), where <<30 is bit-wise left shift by 30 bits, PT is the Payload Type value and SF is the Server Field value. FIG. 8(D) provides a listing of the supported range of Server Codes and the supported range of Interval Codes per Code Domain with this approach. Codes outside of the supported range are considered to be reserved. This arrangement, which supports allocation of Code Domains of varying size, aids in efficient code space usage. The table in FIG. 8(E) summarizes the number of domains of each type that can be allocated with the above approach and the amount of continuously broadcast, uniquely embedded content that each domain type can support (assuming 1 unique code per 1.5 seconds of broadcast content). Server registrants may select the size of domain (small, medium, or large) needed at the time of registration.


Certain aspects of the disclosed embodiments can be implemented as a device that includes a processor, and a memory comprising processor executable code. The processor executable code, when executed by the processor, configures the device to perform any one of and/or all operations that are described in the present application.



FIG. 9 illustrates a block diagram of a device 900 within which various disclosed embodiments may be implemented. The device of FIG. 9 can be implemented as part of any one of: the Receiver device, the set-top box, the Domain Member, the Domain Registrant or the Domain Registrar that are depicted in FIG. 1. The device 900 comprises at least one processor 904 and/or controller, at least one memory 902 unit that is in communication with the processor 904, and at least one communication unit 906 that enables the exchange of data and information, directly or indirectly, through the communication link 908 with other entities, devices, databases and networks. The communication unit 906 may provide wired and/or wireless communication capabilities in accordance with one or more communication protocols, and therefore it may comprise the proper transmitter/receiver, antennas, circuitry and ports, as well as the encoding/decoding capabilities that may be necessary for proper transmission and/or reception of data and other information. The exemplary device 900 of FIG. 9 may be integrated as part of any devices or components shown in FIG. 1 to perform any of the disclosed methods.



FIG. 10 illustrates a set of exemplary operations that may be carried out in accordance with an exemplary embodiment to obtain metadata associated with a multimedia content. At 1002, a content is received at a receiver device equipped with a watermark detector. The received content can, for example, consist of a portion or a components (e.g., an audio or video component) of the multimedia content. At 1004, watermark detection is performed on the received content to extract a payload of one or more embedded watermarks. The payload includes a first field that includes a server identifier and a second field that includes an interval identifier associated with the server identifier. The first field provides a mapping to an Internet address accessible to retrieve metadata associated with content segments identified by the watermark payload. At 1006, a query is formed based on the detected watermark payload, and the query is transmitted to a server identified by the Internet address. At 1008, a response to the query is received from the server. The response includes metadata associated with the content.


One aspect of the disclosed embodiments relates to a system that includes a domain lookup server and a registrant server. The domain lookup server is configured to receive a lookup request from a receiver, where the request comprises a server code obtained from watermarks extracted from a multimedia content. The domain lookup server can receive a server name associated with the server code from a registrar server, and to further provide a response for transmission to the receiver. The domain lookup server's response includes the server name. The system's registrant server includes or is in communication with a metadata server that is populated with at least metadata associated with the multimedia content, and a processor implemented using electronic circuitry to receive, from the registrar server, the server code assigned to the registrant server, to assign one or more interval codes corresponding to one or more segments of the multimedia content, and to communicate information comprising each assigned interval code and associated metadata to the metadata server.


In one exemplary embodiment, the above system further includes a watermark inserter coupled to the registrant server. The watermark inserter is configured to receive the sever code, and the one or more interval codes the multimedia content, and to embed the server code and the one or more interval codes as watermarks into the multimedia content. In another exemplary embodiment, the system also is in communication with a content broadcaster that is coupled to the watermark inserter. The content broadcaster can receive the embedded multimedia content and can transmit the embedded multimedia content to the receiver. In some implementations, the system also includes the receiver, and a set-top-box (STB) coupled to the receiver. The STB is configured to receive the embedded multimedia content from the content broadcaster and to provide at least one component of the received embedded multimedia content to the receiver. In some exemplary implementations, the at least one component is an audio component of the multimedia content.


According to one exemplary embodiment, the above system further includes one or more additional content registrant servers, where each of the one or more additional registrant servers is coupled to the registrar server and to the metadata server. Each registrant server includes a corresponding processor implemented using electronic circuitry to receive, from the registrar server, a unique server code assigned to the corresponding registrant server. Further, each registrant server can assign one or more interval codes associated with the registrant server's unique server code and corresponding to one or more segments of the multimedia content. Each registrant server can further communicate information comprising the registrant server's assigned interval code(s) and associated metadata to the metadata server. In one exemplary implementation, the watermark inserter is coupled to at least one of the additional registrant servers to receive the server code and interval codes corresponding to the at least one of the additional registrant servers, and to embed the server code and interval codes corresponding to the at least one of the additional registrant servers as watermarks into the multimedia content.


In another exemplary embodiment, the watermark inserter is configured to insert the server code and interval codes corresponding to the at least one of the additional registrant servers as a different watermark layers into the multimedia content than the server code and interval codes of another registrant server. In yet another exemplary embodiment, the receiver is configured to detect the embedded watermarks from at least two watermarking layers to obtain at least two unique server codes, and to further transmit one or both of the unique server codes to the lookup server, and, in response, to receive, from the domain lookup server, server names associated with one or both of the unique server codes.


The components or modules that are described in connection with the disclosed embodiments can be implemented as hardware, software, or combinations thereof. For example, a hardware implementation can include discrete analog and/or digital components that are, for example, integrated as part of a printed circuit board. Alternatively, or additionally, the disclosed components or modules can be implemented as an Application Specific Integrated Circuit (ASIC) and/or as a Field Programmable Gate Array (FPGA) device. Some implementations may additionally or alternatively include a digital signal processor (DSP) that is a specialized microprocessor with an architecture optimized for the operational needs of digital signal processing associated with the disclosed functionalities of this application.


Various embodiments described herein are described in the general context of methods or processes, which may be implemented in one embodiment by a computer program product, embodied in a computer-readable medium, including computer-executable instructions, such as program code, executed by computers in networked environments. A computer-readable medium may include removable and non-removable storage devices including, but not limited to, Read Only Memory (ROM), Random Access Memory (RAM), compact discs (CDs), digital versatile discs (DVD), Blu-ray Discs, etc. Therefore, the computer-readable media described in the present application include non-transitory storage media. Generally, program modules may include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Computer-executable instructions, associated data structures, and program modules represent examples of program code for executing steps of the methods disclosed herein. The particular sequence of such executable instructions or associated data structures represents examples of corresponding acts for implementing the functions described in such steps or processes.


For example, one aspect of the disclosed embodiments relates to a computer program product that is embodied on a non-transitory computer readable medium. The computer program product includes program code for carrying out any one or and/or all of the operations of the disclosed embodiments.


The foregoing description of embodiments has been presented for purposes of illustration and description. The foregoing description is not intended to be exhaustive or to limit embodiments of the present invention to the precise form disclosed, and modifications and variations are possible in light of the above teachings or may be acquired from practice of various embodiments. The embodiments discussed herein were chosen and described in order to explain the principles and the nature of various embodiments and its practical application to enable one skilled in the art to utilize the present invention in various embodiments and with various modifications as are suited to the particular use contemplated. The features of the embodiments described herein may be combined in all possible combinations of methods, apparatus, modules, systems, and computer program products, as well as in different sequential orders. Any embodiment may further be combined with any other embodiment.

Claims
  • 1. A method for obtaining associated information for a multimedia content, comprising: receiving a content at a receiver device equipped with a watermark detector, the received content missing the associated information;performing watermark detection on the received content to extract a payload of one or more embedded watermarks, the payload including a first field that includes a server identifier and a second field that includes an interval identifier associated with the server identifier, the interval identifier identifying a specific interval of the received content, the first field providing a mapping to an Internet address accessible to retrieve metadata associated with content segments identified by the watermark payload;based on the detected watermark payload, forming a query and transmitting the query to a metadata server identified by the Internet address; andreceiving a response to the query from the server, the response including metadata associated with the content comprising the associated information.
  • 2. The method of claim 1, wherein value of the first field is assigned by a central authority to domain registrants, each domain registrant controlling an assignment and usage of the second field.
  • 3. The method of claim 1, wherein a correspondence between the first field and the Internet addresses is pre-established at least in-part by a registrar server.
  • 4. The method of claim 1, wherein the mapping is stored in the receiver device in a memory.
  • 5. The method of claim 1, wherein the receiver device receives the mapping or the Internet address in response to a lookup request including the first field to a lookup server.
  • 6. The method of claim 1, wherein the query is a standardized query that is used to obtain the metadata corresponding to a particular value of the interval identifier.
  • 7. The method of claim 1, wherein the payload includes a third field that is indicative of availability of the metadata associated with a content interval that is identified by the interval identifier.
  • 8. The method of claim 7, wherein the query is formed and transmitted to the metadata server upon detection of a change in a value of the third field.
  • 9. The method of claim 1, wherein the payload is further structured to include a payload type field that identifies the payload as corresponding to one of a small domain, a medium domain or a large domain.
  • 10. The method of claim 9, wherein the payload is 50 bits long and the payload type field is a 2-bit field.
  • 11. The method of claim 1, wherein the first field specifies a server code, the second field specifies an interval code that is associated with the specific interval of the received content, and each server code is assigned by a central authority to one of a content producer, a content distributor, or a service provider.
  • 12. The method of claim 1, wherein the metadata includes instructions that allows the receiver device to execute particular interactive services associated with a content interval that is identified by the interval identifier.
  • 13. The method of claim 1, wherein the metadata identifies one or more of the following: an Internet address of an interactive services server; orone or more parameters that indicate when and how an interactive service can be configured.
  • 14. A device capable of receiving a multimedia content, the device comprising: a watermark detector implemented at least in-part using electronic circuitry to detect one or more watermarks from the received multimedia content, the received content missing an associated information, the detected watermarks including a payload that comprises a first field that includes a server identifier and a second field that includes an interval identifier associated with the server identifier, the interval identifier identifying a specific interval of the received content, the first field providing a mapping to an Internet address accessible to retrieve metadata associated with content segments identified by the watermark payload;a processor and a memory including processor executable instructions embodied thereupon, the instructions upon execution, cause the processor to form a query; anda communication component implemented at least in-part using electronic circuity to: transmit the query to a metadata server identified by the Internet address, and to receive a response to the query from the server, the response including metadata associated with the content comprising the associated information.
  • 15. The device of claim 14, wherein value of the first field is assigned by a central authority to domain registrants, each domain registrant controlling an assignment and usage of the second field.
  • 16. The device of claim 14, wherein a correspondence between the first field and the Internet addresses is pre-established at least in-part by a registrar server.
  • 17. The device of claim 14, wherein the mapping is stored in the receiver device and is accessible for use by the receiver device for retrieving the Internet address based on the first field.
  • 18. The device of claim 14, wherein the communication component is configured to transmit a lookup request including the first field to a lookup server and to receive the mapping or the Internet address in response to the lookup request.
  • 19. The device of claim 14, wherein the instructions executed by the processor form a lookup query based on a value of the first field, the communication component is configured to transmit the lookup request to a lookup server and receive the Internet address, the instructions executed by the processor further form the query as a standardized query based on the Internet address and a particular value of the interval identifier, and the communication component further configured to transmit the standardized query to the metadata server and to receive the metadata corresponding to the particular value of the interval identifier.
  • 20. The device of claim 14, wherein the payload includes a third field that is indicative of availability of the metadata associated with a content interval that is identified by the interval identifier.
  • 21. The device of claim 20, wherein the instructions executed by the processor form the query upon detection of a change in a value of the third field.
  • 22. The device of claim 14, wherein the payload is further structured to include a payload type field that identifies the payload as corresponding to one of a small domain, a medium domain or a large domain.
  • 23. The device of claim 14, wherein the payload is 50 bits long and the payload type field is a 2-bit field.
  • 24. The device of claim 14, wherein the first field specifies a server code, the second field specifies an interval code that is associated with the specific interval of the content, and each server code is assigned by a central authority to one of a content producer, a content distributor, or a service provider.
  • 25. The device of claim 14, wherein the instructions executed by the processor causes the processor to use the metadata to execute particular interactive services associated with a content interval that is identified by the interval identifier.
  • 26. The device of claim 14, wherein the metadata identifies one or more of the following: an Internet address of an interactive services server e; orone or more parameters that indicate when and how an interactive service can be configured.
  • 27. A computer program product embodied on one or more non-transitory computer readable media, comprising: program code for receiving a content at a receiver device equipped with a watermark detector;program code for performing watermark detection on the received content to extract a payload of one or more embedded watermarks, the received content missing an associated information, the payload including a first field that includes a server identifier and a second field that includes an interval identifier associated with the server identifier, the interval identifier identifying a specific interval of the received content, the first field providing a mapping to an Internet address accessible to retrieve metadata associated with content segments identified by the watermark payload;program code for, based on the detected watermark payload, forming a query and transmitting the query to a server identified by the Internet address; andprogram code for, receiving a response to the query from the server, the response including metadata associated with the content comprising the associated information.
  • 28. A device, comprising: a processor; anda memory including processor executable code, the processor executable code when executed by the processor configures the device to:extract one or more watermarks that are embedded in a multimedia content, the content missing an associated information, the extracted watermarks including a payload that comprises a first field that includes a server identifier and a second field that includes an interval identifier associated with the server identifier, the interval identifier identifying a specific interval of the received content, the first field providing a mapping to an Internet address accessible to retrieve metadata associated with content segments identified by the watermark payload;form a query;transmit the query to a metadata server identified by the Internet address, andreceive a response to the query from the server, the response including metadata associated with the content comprising the associated information.
RELATED APPLICATIONS

This application claims priority to the U.S. provisional application with Ser. No. 61/952,840, filed on Mar. 13, 2014, and U.S. provisional application with Ser. No. 61/953,668, filed on Mar. 14, 2014. The entire contents of the above noted provisional applications are incorporated by reference as part of the disclosure of this document.

US Referenced Citations (753)
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, Jr. 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, Jr. 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
5436653 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
5523794 Mankovitz et al. Jun 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
5809139 Girod et al. Sep 1998 A
5819289 Sanford, II 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
5870030 DeLuca et al. Feb 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, II 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
6037984 Isnardi 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
6122610 Isabelle Sep 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
6442285 Rhoads et al. 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
6490579 Gao et al. 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
6535617 Hannigan 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
6577747 Kalker 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
6628729 Sorensen 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
6757405 Muratani et al. Jun 2004 B1
6757908 Vogel Jun 2004 B1
6760463 Rhoads Jul 2004 B2
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
6810527 Conrad et al. Oct 2004 B1
6823455 Macy et al. Nov 2004 B1
6829368 Meyer et al. Dec 2004 B2
6829582 Barsness Dec 2004 B1
6834344 Aggarwal et al. Dec 2004 B1
6834345 Bloom et al. Dec 2004 B2
6839673 Choi et al. Jan 2005 B1
6850555 Barclay Feb 2005 B1
6850626 Rhoads et al. Feb 2005 B2
6856693 Miller Feb 2005 B2
6871180 Neuhauser et al. Mar 2005 B1
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
6947571 Rhoads et al. Sep 2005 B1
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
7058809 White et al. Jun 2006 B2
7058815 Morin Jun 2006 B2
7068809 Stach Jun 2006 B2
7072492 Ogawa et al. Jul 2006 B2
7103678 Asai et al. Sep 2006 B2
7107452 Serret-Avila et al. Sep 2006 B2
7111169 Ripley et al. Sep 2006 B2
7113613 Echizen et al. Sep 2006 B2
7123718 Moskowitz et al. Oct 2006 B1
7140043 Choi et al. Nov 2006 B2
7142691 Levy Nov 2006 B2
7159118 Petrovic Jan 2007 B2
7162642 Schumann et al. Jan 2007 B2
7164778 Nakamura et al. Jan 2007 B1
7167560 Yu Jan 2007 B2
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
7369678 Rhoads May 2008 B2
7389421 Kirovski et al. Jun 2008 B2
7409073 Moskowitz et al. Aug 2008 B2
7430670 Horning et al. Sep 2008 B1
7450727 Griesinger Nov 2008 B2
7454019 Williams Nov 2008 B2
7460667 Lee et al. Dec 2008 B2
7533266 Bruekers et al. May 2009 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
7707422 Shin et al. Apr 2010 B2
7756272 Kocher et al. Jul 2010 B2
7779271 Langelaar Aug 2010 B2
7788684 Petrovic et al. Aug 2010 B2
7788693 Robbins Aug 2010 B2
7818763 Sie et al. Oct 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
7991995 Rabin et al. Aug 2011 B2
8005258 Petrovic et al. Aug 2011 B2
8015410 Pelly et al. Sep 2011 B2
8055013 Levy et al. Nov 2011 B2
8059815 Lofgren et al. Nov 2011 B2
8059858 Brundage et al. Nov 2011 B2
8081757 Voessing et al. Dec 2011 B2
8085935 Petrovic Dec 2011 B2
8106744 Petrovic et al. Jan 2012 B2
8106745 Petrovic et al. Jan 2012 B2
8138930 Heath Mar 2012 B1
8151113 Rhoads Apr 2012 B2
8155463 Wong et al. Apr 2012 B2
8181262 Cooper et al. May 2012 B2
8189861 Rucklidge May 2012 B1
8194803 Baum et al. Jun 2012 B2
8249992 Harkness et al. Aug 2012 B2
8259873 Baum et al. Sep 2012 B2
8259938 Petrovic et al. Sep 2012 B2
8280103 Petrovic et al. Oct 2012 B2
8301893 Brundage Oct 2012 B2
8315835 Tian et al. Nov 2012 B2
8340348 Petrovic et al. Dec 2012 B2
8346532 Chakra et al. Jan 2013 B2
8346567 Petrovic et al. Jan 2013 B2
8451086 Petrovic et al. May 2013 B2
8467717 Croy et al. Jun 2013 B2
8479225 Covell et al. Jul 2013 B2
8483136 Yuk Jul 2013 B2
8533481 Petrovic et al. Sep 2013 B2
8538066 Petrovic et al. Sep 2013 B2
8560604 Shribman et al. Oct 2013 B2
8588459 Bloom et al. Nov 2013 B2
8589969 Falcon Nov 2013 B2
8601504 Stone et al. Dec 2013 B2
8615104 Petrovic et al. Dec 2013 B2
8666528 Harkness et al. Mar 2014 B2
8681978 Petriovic et al. Mar 2014 B2
8682026 Petrovic et al. Mar 2014 B2
8726304 Petrovic et al. May 2014 B2
8745403 Petrovic Jun 2014 B2
8768714 Blesser Jul 2014 B1
8781967 Tehranchi et al. Jul 2014 B2
8791789 Petrovic et al. Jul 2014 B2
8806517 Petrovic et al. Aug 2014 B2
8811655 Petrovic et al. Aug 2014 B2
8825518 Levy Sep 2014 B2
8838977 Winograd et al. Sep 2014 B2
8838978 Winograd et al. Sep 2014 B2
8869222 Winograd et al. Oct 2014 B2
8898720 Eyer Nov 2014 B2
8923548 Petrovic et al. Dec 2014 B2
8959202 Haitsma et al. Feb 2015 B2
8990663 Liu Mar 2015 B2
9009482 Winograd Apr 2015 B2
9042598 Ramaswamy et al. May 2015 B2
9055239 Tehranchi et al. Jun 2015 B2
9106964 Zhao Aug 2015 B2
9117270 Wong et al. Aug 2015 B2
9147402 Chen et al. Sep 2015 B2
9277183 Eyer Mar 2016 B2
20010001159 Ford May 2001 A1
20010021926 Schneck et al. Sep 2001 A1
20010022786 King et al. Sep 2001 A1
20010025341 Marshall Sep 2001 A1
20010044899 Levy Nov 2001 A1
20010051996 Cooper et al. Dec 2001 A1
20010054146 Carro et al. Dec 2001 A1
20020007403 Echizen et al. Jan 2002 A1
20020010684 Moskowitz Jan 2002 A1
20020012443 Rhoads et al. Jan 2002 A1
20020019769 Barritz et al. Feb 2002 A1
20020032864 Rhoads et al. Mar 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
20020078356 Ezaki et al. 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
20020138695 Beardsley 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
20020199106 Hayashi Dec 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
20030063570 Katayama et al. Apr 2003 A1
20030063747 Petrovic Apr 2003 A1
20030070075 Deguillaume et al. Apr 2003 A1
20030072468 Brunk et al. Apr 2003 A1
20030076955 Alve et al. Apr 2003 A1
20030078891 Capitant Apr 2003 A1
20030081780 Kim May 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
20030191941 Terada 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
20040025023 Yamada et al. Feb 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
20040093202 Fischer 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
20040120544 Eguchi 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
20040260930 Malik 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
20050071283 Randle et al. Mar 2005 A1
20050071669 Medvinsky et al. Mar 2005 A1
20050120220 Oostveen et al. Jun 2005 A1
20050144632 Mears et al. Jun 2005 A1
20050154891 Skipper Jul 2005 A1
20050177861 Ma et al. Aug 2005 A1
20050182792 Israel et al. Aug 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
20050267928 Anderson et al. Dec 2005 A1
20060005029 Petrovic et al. Jan 2006 A1
20060047704 Gopalakrishnan Mar 2006 A1
20060053292 Langelaar Mar 2006 A1
20060056653 Kunisa Mar 2006 A1
20060062426 Levy et al. Mar 2006 A1
20060075424 Talstra et al. Apr 2006 A1
20060083242 Pulkkinen Apr 2006 A1
20060104477 Isogai et al. May 2006 A1
20060115108 Rodriguez et al. Jun 2006 A1
20060190403 Lin et al. Aug 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
20070033146 Hollar Feb 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
20070214049 Postrel Sep 2007 A1
20070223708 Villemoes et al. Sep 2007 A1
20070250560 Wein et al. Oct 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
20080219643 Le Buhan et al. Sep 2008 A1
20080228733 Davis et al. Sep 2008 A1
20080250240 Celik et al. Oct 2008 A1
20080273861 Yang et al. Nov 2008 A1
20080281448 Uhrig et al. Nov 2008 A1
20080297654 Verberkt et al. Dec 2008 A1
20080298632 Reed Dec 2008 A1
20080301304 Chitsaz 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
20090033617 Lindberg et al. Feb 2009 A1
20090060055 Blanchard et al. Mar 2009 A1
20090089078 Bursey Apr 2009 A1
20090100492 Hicks, III et al. Apr 2009 A1
20090136082 Zandifar et al. May 2009 A1
20090158318 Levy Jun 2009 A1
20090172405 Shiomi et al. Jul 2009 A1
20090175594 Ann et al. Jul 2009 A1
20090177674 Yoshida Jul 2009 A1
20090208008 Lubin Aug 2009 A1
20090262932 Petrovic Oct 2009 A1
20090319639 Gao et al. Dec 2009 A1
20090326961 Petrovic et al. Dec 2009 A1
20100011217 Tachibana et al. Jan 2010 A1
20100023489 Miyata et al. Jan 2010 A1
20100034513 Nakano et al. Feb 2010 A1
20100054531 Kogure et al. Mar 2010 A1
20100063978 Lee et al. Mar 2010 A1
20100069151 Suchocki Mar 2010 A1
20100111355 Petrovic et al. May 2010 A1
20100115267 Guo et al. May 2010 A1
20100121608 Tian et al. May 2010 A1
20100131461 Prahlad et al. May 2010 A1
20100146286 Petrovic et al. Jun 2010 A1
20100159425 Hamlin Jun 2010 A1
20100162352 Haga et al. Jun 2010 A1
20100172540 Davis et al. Jul 2010 A1
20100174608 Harkness et al. Jul 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
20100281142 Stoyanov Nov 2010 A1
20100287579 Petrovic et al. Nov 2010 A1
20100287609 Gonzalez et al. Nov 2010 A1
20100332723 Lin et al. Dec 2010 A1
20110016172 Shah Jan 2011 A1
20110068898 Petrovic et al. Mar 2011 A1
20110088075 Eyer Apr 2011 A1
20110091066 Alattar Apr 2011 A1
20110103444 Baum et al. May 2011 A1
20110123063 Delp et al. May 2011 A1
20110161086 Rodriguez Jun 2011 A1
20110173210 Ahn et al. Jul 2011 A1
20110188700 Kim et al. Aug 2011 A1
20110194727 Guo et al. Aug 2011 A1
20110202687 Glitsch et al. Aug 2011 A1
20110202844 Davidson et al. Aug 2011 A1
20110209191 Shah Aug 2011 A1
20110214044 Davis et al. Sep 2011 A1
20110214143 Rits et al. Sep 2011 A1
20110216936 Reed et al. Sep 2011 A1
20110219229 Cholas et al. Sep 2011 A1
20110225427 Wood et al. Sep 2011 A1
20110235908 Ke et al. Sep 2011 A1
20110255690 Kocher et al. Oct 2011 A1
20110261667 Ren et al. Oct 2011 A1
20110286625 Petrovic et al. Nov 2011 A1
20110293090 Ayaki et al. Dec 2011 A1
20110311056 Winograd Dec 2011 A1
20110320627 Landow et al. Dec 2011 A1
20120017091 Petrovic et al. Jan 2012 A1
20120023595 Speare 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
20120102304 Brave Apr 2012 A1
20120117031 Cha et al. May 2012 A1
20120122429 Wood et al. May 2012 A1
20120129547 Andrews, III et al. May 2012 A1
20120130719 Petrovic et al. May 2012 A1
20120203556 Villette et al. Aug 2012 A1
20120203734 Spivack et al. Aug 2012 A1
20120216236 Robinson et al. Aug 2012 A1
20120265735 McMillan et al. Oct 2012 A1
20120272012 Aronovich et al. Oct 2012 A1
20120272327 Shin et al. Oct 2012 A1
20120300975 Chalamala et al. Nov 2012 A1
20120300977 Petrovic et al. Nov 2012 A1
20120304206 Roberts et al. Nov 2012 A1
20120308071 Ramsdell et al. Dec 2012 A1
20130007462 Petrovic et al. Jan 2013 A1
20130011006 Petrovic et al. Jan 2013 A1
20130024894 Eyer Jan 2013 A1
20130031579 Klappert Jan 2013 A1
20130060837 Chakraborty et al. Mar 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
20130129303 Lee 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
20130171926 Perret et al. Jul 2013 A1
20130283402 Petrovic Oct 2013 A1
20130339029 Petrovic et al. Dec 2013 A1
20140029786 Winograd Jan 2014 A1
20140047475 Oh et al. Feb 2014 A1
20140059591 Terpstra et al. Feb 2014 A1
20140067950 Winograd Mar 2014 A1
20140068686 Oh et al. Mar 2014 A1
20140071342 Winograd et al. Mar 2014 A1
20140074855 Zhao et al. Mar 2014 A1
20140075465 Petrovic et al. Mar 2014 A1
20140075466 Zhao Mar 2014 A1
20140075469 Zhao Mar 2014 A1
20140115644 Kim et al. Apr 2014 A1
20140196071 Terpstra et al. Jul 2014 A1
20140229963 Petrovic et al. Aug 2014 A1
20140237628 Petrovic Aug 2014 A1
20140267907 Downes et al. Sep 2014 A1
20140270337 Zhao et al. Sep 2014 A1
20140270338 Zhao et al. Sep 2014 A1
20140279296 Petrovic et al. Sep 2014 A1
20140279549 Petrovic et al. Sep 2014 A1
20140325550 Winograd et al. Oct 2014 A1
20140325673 Petrovic Oct 2014 A1
20140355817 Wong et al. Dec 2014 A1
20140376723 Petrovic Dec 2014 A1
20150016228 Petrovic et al. Jan 2015 A1
20150016663 Tehranchi et al. Jan 2015 A1
20150030200 Petrovic et al. Jan 2015 A1
20150036873 Petrovic et al. Feb 2015 A1
20150043728 Kim et al. Feb 2015 A1
20150043768 Breebaart Feb 2015 A1
20150121534 Zhao et al. Apr 2015 A1
20150170661 Srinivasan Jun 2015 A1
20150229979 Wood et al. Aug 2015 A1
20150261753 Winograd et al. Sep 2015 A1
20150324947 Winograd et al. Nov 2015 A1
20150340045 Hardwick et al. Nov 2015 A1
20160055606 Petrovic et al. Feb 2016 A1
20160055607 Petrovic et al. Feb 2016 A1
20160057317 Zhao et al. Feb 2016 A1
20160148334 Petrovic et al. May 2016 A1
20160150297 Petrovic et al. May 2016 A1
20160182973 Winograd et al. Jun 2016 A1
20160241932 Winograd et al. Aug 2016 A1
Foreign Referenced Citations (140)
Number Date Country
2276638 Jan 2000 CA
1447269 Oct 2003 CN
1556987 Dec 2004 CN
101001354 Jul 2007 CN
282734 Sep 1988 EP
372601 Jun 1990 EP
581317 Feb 1994 EP
1137250 Sep 2001 EP
1474924 Nov 2004 EP
2166725 Mar 2010 EP
2439735 Apr 2012 EP
2489181 Aug 2012 EP
2605485 Jun 2013 EP
2653964 Oct 2013 EP
2782337 Sep 2014 EP
2899720 Jul 2015 EP
2260246 Apr 1993 GB
2292506 Feb 1996 GB
2358313 Jul 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-216763 Aug 2001 JP
2001-218006 Aug 2001 JP
2001245132 Sep 2001 JP
2001257865 Sep 2001 JP
2001-312570 Nov 2001 JP
2001-527660 Dec 2001 JP
2001339700 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
2003134461 May 2003 JP
2003-230095 Aug 2003 JP
2003-244419 Aug 2003 JP
2003-283802 Oct 2003 JP
2003316556 Nov 2003 JP
2003348324 Dec 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
5283732 Jul 2013 JP
1020080087047 Sep 2008 KR
20100009384 Jan 2010 KR
10201016712 Feb 2011 KR
1020120083903 Jul 2012 KR
1020120128149 Nov 2012 KR
20130078663 Jul 2013 KR
1020130074922 Jul 2013 KR
101352917 Jan 2014 KR
10201424049 Jul 2014 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
0000969 Jan 2000 WO
00-13136 Mar 2000 WO
00-56059 Sep 2000 WO
0059148 Oct 2000 WO
01-54035 Jul 2001 WO
0150665 Jul 2001 WO
01-55889 Aug 2001 WO
0197128 Dec 2001 WO
0213138 Feb 2002 WO
0219589 Mar 2002 WO
0223883 Mar 2002 WO
0249363 Jun 2002 WO
02095727 Nov 2002 WO
03052598 Jun 2003 WO
03102947 Dec 2003 WO
2005017827 Feb 2005 WO
2005-027501 Mar 2005 WO
2005038778 Apr 2005 WO
2006051043 May 2006 WO
2006116394 Nov 2006 WO
2009031082 Mar 2009 WO
2010073236 Jul 2010 WO
2010135687 Nov 2010 WO
2011046590 Apr 2011 WO
2011116309 Sep 2011 WO
2012177126 Dec 2012 WO
2012177874 Dec 2012 WO
2013025035 Feb 2013 WO
2013067439 May 2013 WO
2013090462 Jun 2013 WO
2013090466 Jun 2013 WO
2013090467 Jun 2013 WO
2013163921 Nov 2013 WO
WO 2013163921 Nov 2013 WO
2014144101 Sep 2014 WO
2014153199 Sep 2014 WO
2014160324 Oct 2014 WO
2015013419 Jan 2015 WO
2015138798 Sep 2015 WO
2015168697 Nov 2015 WO
2015174086 Nov 2015 WO
2016028934 Feb 2016 WO
2016028936 Feb 2016 WO
2016029055 Feb 2016 WO
2016086047 Jun 2016 WO
Non-Patent Literature Citations (138)
Entry
“Advanced Access Content System (AACS), Pre-recorded Video Book,” Revision 0.951, Sep. 2009 (86 pages).
“ATSC—3.0 Automatic Content Recognition Watermarking Solutions,” ATSC Technology Group, Advanced Television Systems Committee, Inc., Jan. 2014 (6 pages).
“Civolution's 2nd screen synchronisation solution wins CSI product of the year 2011 award at IBC,” IBC Press Release, Hall 2—Stand C30, Sep. 2011 (2 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).
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).
Bangaleea, R., et al., “Performance improvement of spread spectrum spatial-domain watermarking scheme through diversity and attack characterisation,” IEEE Africon, pp. 293-298, 2002.
Barreto, P.S.L.M., et al. “Toward Secure Public-Key Blockwise Fragile Authentication Watermarking,” IEEE Proceedings Vision, Image, and Signal Processing, 149(2):57-62, Apr. 2002.
Baudy, S., et al., “Estimation of geometric distortions in digital watermarking,” IEEE International Conference on Watermarking, (2):885-888, Sep. 2002.
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).
Caronni, G., “Assuring Ownership Rights for Digital Images,” Proceedings of reliable IT systems VIS 95, Vieweg Publishing Company, Germany, 1995 (10 pages).
Chen, B., et al. “Quantization index modulation: a class of provably good methods for digital watermarking and information embedding,” IEEE Transactions on Information Theory, 47(4):1423-1443, May 2001.
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).
Cinea, Inc., “Forensic watermarking deterring video piracy,” 2004, (9 pages). [http://www.cinea.com/whitepapers/forensic—watermarking.pdf].
Costa, M., “Writing on Dirty Paper,” IEEE Trans. on Info. Theory, 29(3):439-441, May 1983.
Cox, I. J., et al., “Some general methods for tampering with watermarks,” IEEE Journal on Selected Areas in Communications, 16(4): 587-593, May 1998.
Coxford, A., et al., “Advanced Mathematics: A Preparation for Calculus, Second Edition,” Harcourt Brace Jovanovish, Inc., 1978 (14 pages).
Das, et al., “Distributed Priority Queues on Hybercube Architectures,” IEEE, 1996, pp. 620-627.
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).
Dittmann, J., et al., “Combining digital watermarks and collusion secure fingerprints for digital images,” Proc. SPIE 3657:171-182, Jan. 1999 (12 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.
European Search Report dated Apr. 12, 2012 for European Patent Application No. 07836262.1 filed Jul. 25, 2007 (12 pages).
European Search Report dated Jul. 3, 2012 for European Patent Application No. 12150742.0, filed Oct. 7, 2003 (5 pages).
European Search Report dated Nov. 10, 2010 for European Patent Application No. 03774648.4, filed Oct. 7, 2003 (5 pages).
European Search Report dated Nov. 8, 2012 for European Patent Application No. 06785709.4, filed Jun. 27, 2006 (5 pages).
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).
European Search Report dated Oct. 14, 2014 for European Patent Application No. 14173053.1, filed Oct. 7, 2003 (5 pages).
European Search Report dated Apr. 23, 2015 for European Patent Application No. 12846172.0, filed Nov. 2, 2012 (8 pages).
European Search Report dated May 28, 2015 for European Patent Application No. 11825990.2, filed Sep. 15, 2011 (6 pages).
European Search Report dated May 29, 2015 for European Patent Application No. 11825992.8 filed Sep. 15, 2011 (6 pages).
Furon, T., et al., “An asymmetric watermarking method,” IEEE Trans. Signal Processing, 4(51):981-995, Apr. 2003.
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 MPEG-2 encoded video without decoding and re-coding,” Proc. SPIE Multimedia Computing and Networking 97, 3020:264-274, Feb. 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 May 1, 2015 for International Application No. PCT/US2014/052973, filed Aug. 27, 2014 (16 pages).
International Search Report and Written Opinion dated Sep. 12, 2014 for International Application No. PCT/US2014/035474, filed Apr. 25, 2014 (17 pages).
International Search Report and Written Opinion dated Sep. 15, 2014 for International Application No. PCT/US2014/035539, filed Apr. 25, 2014 (16 pages).
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 Apr. 8, 2013 for International Application No. PCT/US2012/069306, filed Dec. 12, 2012 (12 pages).
International Search Report and Written Opinion dated Aug. 14, 1998 for International Application No. PCT/US1998/009587, filed May 12, 1998 (3 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).
Office Action dated Oct. 30, 2014 for Korean Patent Application No. 10-2013-7009718 (8 pages).
Office Action dated Mar. 30, 2015 for Korean Patent Application No. 10-2014-7015220 (19 pages).
Office Action dated Feb. 3, 2015 for Chinese Patent Application No. 201180051678.7 (27 pages).
Park, J.H., et al., “Robust and fragile watermarking techniques for documents using bidirectional diagonal profiles,” Information and Communications Security: Third International Conference, Xian, China, Nov. 2001, pp. 483-494.
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.
Petitcolas, F., et al., “The blind pattern matching attack on watermark systems,” IEEE Trans. Signal Processing, Apr. 2003 (4 pages).
Petitcolas, F.A.P., et al., “Attacks on copyright marking systems,” Second Workshop on Information Hiding, Lecture Notes in Computer Science, Portland, Oregon, pp. 218-238, Apr. 1998.
Philips Research Liquid Audio Fraunhofer Institute, “Digital Audio Screening Technology for Phased Rollout,” Version 1.00, May 1999 (38 pages).
Pytlak, J.,“Anti-piracy coding,” http://www.tele.com/pipermail/tig/2003-November/003842.html, Nov. 2003 (2 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).
Seok, J., et al., “A novel audio watermarking algorithm for copyright protection of digital audio,” ETRI Journal, 24 (3):181-189, Jun. 2002.
Shin, 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).
Spangler, T., “Social Science,” http://www.multichannel.com/content/social-science, Sep. 2011 (5 pages).
Steinebach, M., et al., “StirMark benchmark: audio watermarking attacks,” International Conference on Information Technology: Coding and Computing (ITCC 2001), Las Vegas, Nevada, Apr. 2001 (6 pages).
Tanaka, K., et al., “Secret transmission method of character data in motion picture communication,” SPIE Visual Communications and Image Processing '91, 1605:646-649, 1991.
Tsai, M.J., et al., “Wavelet packet and adaptive spatial transformation of watermark for digital image authentication,” IEEE Image Processing, 2000 International Conference, 1:450-453, 2000 (4 pages).
Verance Corporation, “Confirmedia,” PowerPoint presentation made to National Association of Broadcasters, Apr. 24, 2001 (40 pages).
Wang, H., “Communication-resource-aware adaptive watermarking for multimedia authentication in wireless multimedia sensor networks,” J Supercomput, 64:883-897, 2013.
Wang, X., et al., “Robust correlation of encrypted attack traffic through stepping stones by manipulation of interpacket delays,” Proceedings of the 10th ACM conference on computer communications security, Oct. 27-30, 2003, Washington D.C., USA.
Wolfgang, R., et al., “Perceptual watermarks for digital images and video,” Proceedings of the IEEE, 87 (7):1108-1126, Jul. 1999.
Xu, C., et al., “Applications of digital watermarking technology in audio signals,” Journal of Audio Eng. Soc., 10 (47):805-812, Oct. 1999.
Yeung, M. M., et al., “An invisible watermarking technique for image verification,” Image Processing, International Conference Proceedings, 2:680-683, Oct. 26-29, 1997.
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).
“Red Bee and Civolution develop companion app for FX UK,” http://www.digitaltveurope.net/19981/red-bee-and-civolution-develop-companion-app-for-fx-uk, Jan. 2012 (2 pages).
International Search Report and Written Opinion dated May 28, 2015 for International Application No. PCT/US2015/020282, filed Mar. 12, 2015 (7 pages).
International Search Report and Written Opinion dated Aug. 25, 2014 for International Application No. PCT/US2014/029564, filed Mar. 14, 2014 (10 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 Aug. 25, 2013 for International Application No. PCT/US2014/026322, filed Aug. 25, 2014 (12 pages).
International Search Report and Written Opinion dated Aug. 8, 2014 for International Application No. PCT/US2014/028372, filed Mar. 14, 2014 (18 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 Feb. 28, 2013 for International Application No. PCT/US2012/066138, filed Nov. 20, 2012 (11 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. 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).
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 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 19, 2004 for International Application No. PCT/US2003/031816, filed Apr. 29, 2004 (3 pages).
International Search Report and Written Opinion dated May 29, 2008 for International Application No. PCT/US2006/015410, filed Apr. 21, 2006 (6 pages).
International Search Report and Written Opinion dated Sep. 26, 2008 for International Application No. PCT/US2007/016812, filed Jul. 25, 2007 (6 pages).
International Search Report and Written Opinion dated Nov. 11, 2014 for International Application No. PCT/US2014/047840, filed Jul. 23, 2014 (15 pages).
International Search Report and Written Opinion dated Feb. 25, 2015 for International Application No. PCT/US2014/041166, filed Jun. 5, 2014 (10 pages).
Jacobsmeyer, J., et al., “Introduction to error-control coding,” Pericle Communications Company, 2004 (16 pages).
Kalker, T., et al., “A security risk for publicly available watermark detectors,” Proc. Benelux Info. Theory Symp., Veldhoven, The Netherlands, May 1998 (7 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.
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.
Kim, T.Y., et al., “An asymmetric watermarking system with many embedding watermarks corresponding to one detection watermark,” IEEE Signal Processing Letters, 3(11):375-377, Mar. 2004.
Kirovski, D., et al., “Multimedia content screening using a dual watermarking and fingerprinting system,” Proceedings of the tenth ACM international conference, pp. 372-381, 2002.
Kirovski, D., et al., “Randomizing the replacement attack,” ICASSP, pp. 381-384, 2004.
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).
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).
Kutter, M., et al., “The watermark copy attack,” Proc. of the SPIE: Security and Watermarking of Multimedia Content II, 3971:1-10, Jan. 2000.
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, E.T., et al., “Detection of image alterations using semi-fragile watermarks,” Proceedings of the SPIE International Conference on Security and Watermarking of Multimedia Contents II, Jan. 2000 (12 pages).
Lin, P.L., et al., “Robust transparent image watermarking system with spatial mechanisms,” The Journal of Systems and Software, 50:107-116, Feb. 2000.
Lotspeich, J., “The Advanced Access Content System's Use of Digital Watermarking,” MCPS '06, Oct. 28, 2006, pp. 19-21.
Lu, C.S., et al., “Oblivious cocktail watermarking by sparse code shrinkage: A regional-and global-based scheme,” IEEE Transactions on Multimedia, 4(2):209-224, Dec. 2000.
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.
Mason, A. J., et al., “User requirements for watermarking in broadcast applications,” IEEE Conference Publication, International Broadcasting Convention (BC 2000), Amsterdam, Sep. 8-12, 2000 (7 pages).
Miller, M.L. et al. “Computing the probability of false watermark detection,” Published in the Proceedings of the Workshop on Information Hiding, Dresden, Germany, Sep. 29-Oct. 1, 1999.
Miller, M.L. et al. “Informed embedding: exploiting image and detector information during watermark insertion,” IEEE Conference Publication, Image Processing, (3):1-4, Sep. 2000.
Mintzer, F., et al., “If one watermark is good, are more better?,” Acoustics, Speech, and Signal Processing, ICASSP, 4:2067-2069, Mar. 1999.
Mobasseri, B.G., et al. “Content authentication and tamper detection in digital video,” Image Processing Proceedings, International Conference, 1:458-461, 2000.
Moulin, P., et al., “Detection-theoretic analysis of desynchronization attacks in watermarking,” Technical Report MSR-TR-2002-24, Microsoft Corporation, Mar. 2002.
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 Dec. 29, 2014 for Chinese Patent Application No. 201180051690.8 (14 pages).
Office Action dated Jan. 20, 2014 for Japanese Patent Application No. 2013-036990 (6 pages).
Office Action dated Jul. 21, 2011 for Japanese Patent Application No. 2008-508985 (6 pages).
Office Action dated Mar. 16, 2012 for Japanese Patent Application No. 2008-508985 (8 pages).
Office Action dated Mar. 18, 2011 for European Patent Application No. 03774648.4 (6 pages).
Office Action dated May 1, 2013 for Japanese Patent Application No. 2011-114667 (6 pages).
Office Action dated May 8, 2012 for Japanese Patent Application No. 2009-522802 (4 pages).
International Search Report and Written Opinion dated Aug. 13, 2015 for International Application No. PCT/US2015/029097, filed May 4, 2015 (14 pages).
International Search Report and Written Opinion dated Dec. 7, 2015 for International Application No. PCT/US2015/045960, filed Aug. 19, 2015 (14 pages).
International Search Report and Written Opinion dated Jan. 28, 2016 for International Application No. PCT/US2015/045964, filed Aug. 19, 2015 (8 pages).
International Search Report and Written Opinion dated Mar. 15, 2016 for International Application No. PCT/US2015/062514, filed Nov. 24, 2015 (10 pages).
International Search Report and Written Opinion dated Apr. 12, 2016 for International Application No. PCT/US2015/066872, filed Dec. 18, 2015 (7 pages).
Office Action dated Jun. 10, 2016 for Korean Patent Application No. 10-2016-7002291 (19 pages).
Office Action dated Jun. 10, 2016 for Korean Patent Application No. 10-2016-7002289 (11 pages).
International Search Report and Written Opinion dated Jan. 21, 2016 for International Application No. PCT/US2015/046166, filed Aug. 20, 2015 (8 pages).
Related Publications (1)
Number Date Country
20150264429 A1 Sep 2015 US
Provisional Applications (2)
Number Date Country
61952840 Mar 2014 US
61953668 Mar 2014 US