Transactional video marking system

Abstract

Methods, devices, systems and computer program products facilitate embedding and extraction of transactional watermarks into and from a video content. One method for selecting an area for watermark insertion includes selecting a candidate area within a frame of the video content that is smaller in size that the frame itself, adding a first and a second watermark value to obtain corresponding first and second versions of the area, add noise to each of the first and second versions, and perform watermark extraction operations to obtain corresponding correlation values for the selected area. The above operations are repeated using different areas that are selected at pseudo-random offset values from the previously selected areas until the entire video frame is exhausted. One or more areas with the highest correlation value(s) are selected and designated as areas that are suitable for watermark insertion.

Description

FIELD OF INVENTION

The disclosed embodiments relate to methods, devices, systems and computer program products that enable insertion of transactional (or forensic) watermarks in a video content in an efficient and flexible manner.

BACKGROUND

Transactional video marking system is a forensic video watermarking system that can be used for applications such as high-value content distribution, including, but not limited to, distribution of pre-release content (e.g., early release of a movie before nationwide theatre distribution, early release for reviewer viewing, etc.), digital cinema, and video-on-demand applications. In such applications, a unique identifier is inserted into each individual video stream in the form of digital watermarks to identify, for example, the content distributor and the transaction (e.g., the provision of the content to a particular user or entity). The embedded watermarks after release of the movie, and potential piracy of the content, can be used to trace back the source of content piracy by identifying the particular user, entity or distribution channel(s) involved in dissemination of the content.

SUMMARY

The disclosed embodiments relates to methods, devices, systems and computer program products that facilitate the insertion of transactional watermarks into a video content. One aspect of the disclosed embodiments relates to a method for facilitating embedding of watermarks into a video content, comprising selecting a first number of frames from the video content, performing one or both of a temporal and a spatial psychovisual analysis on the first number of frames, identifying at least one area within the first number of frames for insertion of watermarks, embedding a first watermark symbol in the identified area(s) of the first number of frames, re-encoding the first number of frames subsequent to embedding with the first watermark symbol to obtain a first alternative data, embedding a second watermark symbol in the identified area(s) of the first number of frames, re-encoding to the first number of frames subsequent to embedding with the second watermark symbol to obtain a second alternative data; and forming an inserter manifest comprising the first and the second alternative data to enable insertion of a watermark into the video content by selecting one or the other of the first and second alternative data for insertion into the video content.

In one exemplary embodiment, the first number of frames are selected to minimize a number of frames that must be re-encoded. In another exemplary embodiment, the first number of frames consist of only frames that are not referred to by other frames in the video content. In another exemplary embodiment, the video content is a compressed video content. In yet another exemplary embodiment, the first number of frames are selected to include image areas that remain substantially similar in consecutive frames. In another exemplary embodiment, identifying the at least one area for insertion of watermarks comprises performing a watermark extraction simulation operation to assess a robustness measure of one or more areas of the first number of frames, and selecting an area within each of the first number of frames that produces highest robustness measure.

According to another exemplary embodiment, performing the watermark extraction simulation operation comprises, for each of the first number of frames: (a) selecting a candidate area of a selected frame for insertion of watermarks; (b) inserting the first watermark symbol into the selected candidate area; (c) impairing the selected candidate area subsequent to embedding with the first watermark symbol; (d) determining a correlation value associated with extraction of the first watermark value from the impaired area; (c) selecting another area of the selected frame that is shifted with respect to the previously selected candidate area; (f) repeating steps (b) through (e) for a plurality of additional shifted areas within the selected frame to obtain a plurality of correlation values; (g) performing steps (a) through (f) but instead of inserting the first watermark value, inserting the second watermark value; and (h) identifying an area with highest correlation value.

In one exemplary embodiment, the method further includes customizing the inserter manifest in accordance with a profile. In another exemplary embodiment, the method further includes receiving a pre-marking message to be inserted as a watermark into the video content for generation of a pre-marked video stream. In yet another exemplary embodiment, the method further includes receiving a built-in message, the built-in message identifying at least a portion of the first or the second alternative data to be excluded from insertion into the video content and to thereby generate a customized inserter and/or extractor manifest that designates, for the excluded portion, the insertion of either the first or the second alternative data into the video content. In one exemplary embodiment, generation of the customized inserter manifest comprises removing one or more of the alternate data from the inserter manifest.

In still another exemplary embodiment, the method further includes producing an extractor manifest to facilitate extraction of watermark from contents include the first and the second alternative data, the extractor manifest including information to assist selection of specific video frames or areas within the specific video frames for watermark extraction. In another exemplary embodiment, the profile specifies at least one of: a channel design, a repeat of payload, a message size, a payload size, or a priority. In yet another exemplary embodiment, each channel represents a different transaction watermark, the channel design is one of a sequential design or an overlapping design, the sequential channel design designates, in a particular sequential order, non-overlapping segments of the video content for insertion of watermark payloads of each channel, and the overlapping channel design designates overlapping segments of the video content for insertion of watermark payloads for two or more channels.

Another aspect of the disclosed embodiments relates to a device that includes a frame selection component coupled to a video decoder to receive a video content from the video decoder and to select a first number of frames from the video content. The device also includes an evaluation component coupled to the frame selection component to receive the first number of frames, the evaluation component including: a temporal psychovisual analysis component to conduct a temporal psychovisual analysis on the first number of frames, a spatial psychovisual analysis component to conduct a spatial psychovisual analysis on the first number of frames, and an area selection component to identify at least one area within the first number of frames for insertion of watermarks. The device further includes one or more combiners coupled to the evaluation component to embed a first watermark symbol in the identified area(s) of the first number of frames and to embed a second watermark symbol in the identified area(s) of the first number of frames, and a video re-encoder coupled to the one or more combiners to re-encode to the first number of frames subsequent to embedding with the first watermark symbol to obtain a first alternative data, to re-encode the first number of frames subsequent to embedding with the second watermark symbol to obtain a second alternative data, and to form an inserter manifest comprising the first and the second alternative data.

In one exemplary embodiment, the frame selection component is configured to select the first number of frames to minimize a number of frames that must be re-encoded. In another exemplary embodiment, the frame selection component is configured to select the first number of frames that only consist of frames that are not referred to by other frames in the video content. In still another exemplary embodiment, the video decoder is coupled to a video input, and is configured to receive a compressed video content and to decompress the received compressed video content.

In another exemplary embodiment, the frame selection component is configured select the first number of frames to include image areas that remain substantially similar in consecutive frames. According to another exemplary embodiment, the area selection component includes a simulator component to perform a watermark extraction simulation operation to assess a robustness measure of one or more areas of the first number of frames, and the frame selection component is configured to select an area within each of the first number of frames that produces highest robustness measure.

In one exemplary embodiment, the simulator component of the above device is configured to perform the following operations on each the selected first number of frames: (a) select a candidate area of a selected frame for insertion of watermarks, (b) insert the first watermark symbol into the selected candidate area, (c) impair the selected candidate area subsequent to embedding with the first watermark symbol, (d) determine a correlation value associated with extraction of the first watermark value from the impaired area, (c) select another area of the selected frame that is shifted with respect to the previously selected candidate area, (f) repeat operations (b) through (e) for a plurality of additional shifted areas within the selected frame to obtain a plurality of correlation values, (g) perform operations (a) through (f) but instead of inserting the first watermark value, insert the second watermark value, and (h) identify an area with highest correlation value.

In one exemplary embodiment, the above device further includes a customizer component coupled to the re-encoder to receive the inserter manifest and to customize the inserter manifest in accordance with a profile. In another exemplary embodiment, the customizer component is configured to receive a pre-marking message to be inserted as a watermark into the video content for generation of a pre-marked video stream. In still another exemplary embodiment, the customizer component is configured to receive a built-in message, the built-in message identifying at least a portion of the first or the second alternative data to be excluded from insertion into the video content and to thereby generate a customized inserter and/or extractor manifest that designates, for the excluded portion, the insertion of either the first or the second alternative data into the video content.

According to another exemplary embodiment, the customizer component generates the customized inserter manifest by removing one or more of the alternate data from the inserter manifest. In another exemplary embodiment, the customizer component is configured to generate an extractor manifest to facilitate extraction of watermark from contents that include the first and the second alternative data, the extractor manifest including information to assist selection of specific video frames or areas within the specific video frames for watermark extraction.

Another aspect of the disclosed embodiments relates to a computer program product stored on a one or more non-transitory computer readable media, that includes program code for selecting a first number of frames from the video content, program code for performing one or both of a temporal and a spatial psychovisual analysis on the selected frames, program code for identifying at least one area within the first number of frames for insertion of watermarks, program code for embedding a first watermark symbol in the identified area(s) of the first number of frames, program code for re-encoding the first number of frames subsequent to embedding with the first watermark symbol to obtain a first alternative data, program code for embedding a second watermark symbol in the identified area(s) of the first number of frames, program code for re-encoding to the first number of frames subsequent to embedding with the second watermark symbol to obtain a second alternative data, and program code for forming an inserter manifest comprising the first and the second alternative data to enable insertion of a watermark into the video content by selecting one or the other of the first and second alternative data for insertion into the video content.

Another aspect of the disclosed embodiments relates to 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 select a first number of frames from the video content, to perform one or both of a temporal and a spatial psychovisual analysis on the selected frames, to identify at least one area within the first number of frames for insertion of watermarks, to embed a first watermark symbol in the identified area(s) of the first number of frames, to re-encode the first number of frames subsequent to embedding with the first watermark symbol to obtain a first alternative data, to embed a second watermark symbol in the identified area(s) of the first number of frames, to re-encode to the first number of frames subsequent to embedding with the second watermark symbol to obtain a second alternative data, and to form an inserter manifest comprising the first and the second alternative data to enable insertion of a watermark into the video content by selecting one or the other of the first and second alternative data for insertion into the video content.

Another aspect of the disclosed embodiments relates to a method that includes using a first inserter manifest associated with a first video stream to facilitate insertion of watermarks into a second video stream. The first inserter manifest comprises at least a first and a second alternative data, and the first and the second video stream include similar image content. In such a method one or both of the following takes place: (a) a frame in the second video stream is identified for embedding of watermark symbols based on a corresponding frame in the first video stream, or (b) an area within a frame in the second video stream is identified for embedding of watermark symbols based on a corresponding area in a corresponding frame in the first video stream.

Another aspect of the disclosed embodiments relates to a computer program product stored on a one or more non-transitory computer readable media, that includes computer code for using a first inserter manifest associated with a first video stream to facilitate insertion of watermarks into a second video stream, where the first inserter manifest comprises at least a first and a second alternative data, and the first and the second video stream include similar image content. Further, one or both of the following is carried out: (a) a frame in the second video stream is identified for embedding of watermark symbols based on a corresponding frame in the first video stream, or (b) an area within a frame in the second video stream is identified for embedding of watermark symbols based on a corresponding area in a corresponding frame in the first video stream.

Another aspect of the disclosed embodiments relates to 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: use a first inserter manifest associated with a first video stream to facilitate insertion of watermarks into a second video stream, wherein the first inserter manifest comprises at least a first and a second alternative data, the first and the second video stream include similar image content, and one or both of the following: (a) a frame in the second video stream is identified for embedding of watermark symbols based on a corresponding frame in the first video stream, or (b) an area within a frame in the second video stream is identified for embedding of watermark symbols based on a corresponding area in a corresponding frame in the first video stream.

Another aspect of the disclosed embodiments relates to a method for inserting a watermark into a video content that includes receiving the video content, obtaining an inserter manifest comprising at least a first and a second alternative data, where the at least the first and the second alternative data having been generated by preprocessing the video content prior to the receiving, each of the at least the first and the second alternative data, when replacing a particular segment of the video content, producing video segments that are perceptually similar to the particular segment. The method also includes selecting the first alternative data in accordance with a transactional watermark payload and replacing a first segment of the received video content with the selected first alternative data, selecting the second alternative data in accordance with the transactional watermark payload and replacing a second segment of the received video with the selected second alternative data.

Another aspect of the disclosed embodiments relates to a computer program product stored on a one or more non-transitory computer readable media, that includes computer code for receiving the video content, computer code for obtaining an inserter manifest comprising at least a first and a second alternative data, the at least the first and the second alternative data having been generated by preprocessing the video content prior to the receiving, each of the at least the first and the second alternative data, when replacing a particular segment of the video content, producing video segments that are perceptually similar to the particular segment. The computer program product also includes computer code for selecting the first alternative data in accordance with a transactional watermark payload and replacing a first segment of the received video content with the selected first alternative data, and computer code for selecting the second alternative data in accordance with the transactional watermark payload and replacing a second segment of the received video with the selected second alternative data.

Another aspect of the disclosed embodiments relates to 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 receive a video content, obtain an inserter manifest comprising at least a first and a second alternative data, the at least the first and the second alternative data having been generated by preprocessing the video content, each of the at least the first and the second alternative data, when replacing a particular segment of the video content, producing video segments that are perceptually similar to the particular segment. The processor executable code when executed by the processor also configures the device to select the first alternative data in accordance with a transactional watermark payload and replace a first segment of the received video content with the selected first alternative data, and select the second alternative data in accordance with the transactional watermark payload and replace a second segment of the received video with the selected second alternative data.

Another aspect of the disclosed embodiments relates to a method for over-watermarking a segment of a video content that has an existing watermark embedded therein. The method includes detecting a value of the existing watermark in the segment, determining whether a new value that is designated for embedding is identical to the value of the existing watermark, upon a determination that the new value that is designated for embedding is not identical to the value of the existing watermark, using an inserter manifest to obtain an alternate data corresponding to the new value. The inserter manifest can include at least a first and a second alternative data, the at least the first and the second alternative data having been generated by preprocessing the video content prior to the detecting, each of the at least the first and the second alternative data, when replacing a particular segment of the video content, producing video segments that are perceptually similar to the particular segment. The method also includes inserting the new value into the segment.

In one exemplary embodiment, the over-watermarking is performed in an swapping mode of operation that includes updating the inserter manifest to exclude one alternative data from the inserter manifest that corresponds to each of the embedded symbols of the new value.

Another aspect of the disclosed embodiments relates to a computer program product stored on a one or more non-transitory computer readable media that includes computer code for detecting a value of the existing watermark in the segment, computer code for determining whether a new value that is designated for embedding is identical to the value of the existing watermark, computer code for, upon a determination that the new value that is designated for embedding is not identical to the value of the existing watermark, using an inserter manifest to obtain an alternate data corresponding to the new value. The inserter manifest includes at least a first and a second alternative data, the at least the first and the second alternative data having been generated by preprocessing the video content prior to the detecting, each of the at least the first and the second alternative data, when replacing a particular segment of the video content, producing video segments that are perceptually similar to the particular segment. The computer program product further includes computer code for inserting the new value into the segment.

Another aspect of the disclosed embodiments relates to 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 detect a value of the existing watermark in the segment, determine whether a new value that is designated for embedding is identical to the value of the existing watermark. The processor executable code when executed by the processor also configures the device to, upon a determination that the new value that is designated for embedding is not identical to the value of the existing watermark, use an inserter manifest to obtain an alternate data corresponding to the new value. The inserter manifest comprising at least a first and a second alternative data, the at least the first and the second alternative data having been generated by preprocessing the video content, each of the at least the first and the second alternative data, when replacing a particular segment of the video content, producing video segments that are perceptually similar to the particular segment. The processor executable code when executed by the processor further configures the device to insert the new value into the segment.

Another aspect of the disclosed embodiments relates to a method for facilitating insertion of a watermark into an encrypted video. The method includes decrypting a portion of the encrypted video, using a preprocessor for processing the decrypted portion to generate an inserter manifest comprising at least a first and a second alternative data. Each of the at least the first and the second alternative data, when replacing a particular segment of the video content in non-encrypted format, produce video segments that are perceptually similar to the particular segment. The method also includes, upon a determination that a size of the first or the second alternate data is not a multiple of encryption block size, increasing the size of the first or the second alternate data to become a multiple of the encryption block size, encrypting the first and the second alternate data using an encryption key used for encrypting the video, and generating an inserter manifest that includes the encrypted first and second alternative data.

Another aspect of the disclosed embodiments relates to a computer program product stored on a one or more non-transitory computer readable media that includes computer code for decrypting a portion of the encrypted video, computer code for using a preprocessor for processing the decrypted portion to generate an inserter manifest comprising at least a first and a second alternative data. Each of the at least the first and the second alternative data, when replacing a particular segment of the video content in non-encrypted format, produce video segments that are perceptually similar to the particular segment. The computer program product also includes computer code for, upon a determination that a size of the first or the second alternate data is not a multiple of encryption block size, increasing the size of the first or the second alternate data to become a multiple of the encryption block size, computer code for encrypting the first and the second alternate data using an encryption key used for encrypting the video, and computer code for generating an inserter manifest that includes the encrypted first and second alternative data.

Another aspect of the disclosed embodiments relates to 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 decrypt a portion of the encrypted video, process the decrypted portion to generate an inserter manifest comprising at least a first and a second alternative data. Each of the at least the first and the second alternative data, when replacing a particular segment of the video content in non-encrypted format, produce video segments that are perceptually similar to the particular segment. The processor executable code when executed by the processor also configures the device to, upon a determination that a size of the first or the second alternate data is not a multiple of encryption block size, increase the size of the first or the second alternate data to become a multiple of the encryption block size, encrypt the first and the second alternate data using an encryption key used for encrypting the video, and generate an inserter manifest that includes the encrypted first and second alternative data.

Another aspect of the disclosed embodiments relates to a device that includes a decryptor coupled to a video input to receive an encrypted video content and to decrypt at least a portion of the received encrypted content using an encryption key and a pre-processor component coupled to the decryptor to receive the decrypted portions of the video content and to generate an inserter manifest comprising at least a first and a second alternative data. Each of the at least the first and the second alternative data, when replacing a particular segment of the video content in non-encrypted format, producing video segments that are perceptually similar to the particular segment. The device further includes a customizer coupled to the pre-processor component to generate an inserter manifest that includes encrypted first and second alternative data. The customizer includes an encryption block alignment component, where the encryption block alignment component to increase a size of the first or the second alternate data to become a multiple of encryption block size when the size of the first or the second alternate data is not a multiple of the encryption block size. The customizer also includes an alternate data encryptor component to encrypt the first and the second alternate data using the encryption key.

Another aspect of the disclosed embodiments relates to a method for identification of a watermark within an embedded content. The method includes obtaining the embedded content, searching a database of extraction manifests to obtain one or more extraction manifests that potentially match the embedded content, iteratively using each of the obtained one or more extraction manifests to perform a watermark extraction process, and, upon a successful extraction of a watermark message, providing an indication that the embedded content has been identified.

In one exemplary embodiment, obtaining one or more extraction manifests that potentially match the embedded content is carried out using one or more of a metadata search, a fingerprint search, or a watermarking-based content identifier search.

Another aspect of the disclosed embodiments relates to a computer program product stored on a one or more non-transitory computer readable media that includes computer code for obtaining the embedded content, computer code for searching a database of extraction manifests to obtain one or more extraction manifests that potentially match the embedded content, computer code for iteratively using each of the obtained one or more extraction manifests to perform a watermark extraction process, and computer code for, upon a successful extraction of a watermark message, providing an indication that the embedded content has been identified.

Another aspect of the disclosed embodiments relates to 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 obtain the embedded content, search a database of extraction manifests to obtain one or more extraction manifests that potentially match the embedded content, iteratively use each of the obtained one or more extraction manifests to perform a watermark extraction process, and upon a successful extraction of a watermark message, provide an indication that the embedded content has been identified.

Another aspect of the disclosed embodiments relates to a system that includes a portal for receiving a content from a subscriber, and a back-end processing device coupled to the portal so as to allow the portal to transmit the received content to the back-end processing device. The back-end processing component includes a watermark extractor, an extraction coordinator, an extraction manifest search component and one or more databases with fingerprints and extraction manifests stored therein. The watermark extractor coupled to the extraction coordinator to communicated watermark extraction results to the extraction coordinator and the extraction coordinator coupled to the portal to transmit information associated with the watermark extraction results to the portal for presentation to the subscriber.

In one exemplary embodiment, the portal is configured to allow reception of extractor manifests from the back-end device. In another exemplary embodiment, the portal is configured to allow reception of metadata from the subscriber in conjunction with the received content.

Another aspect of the disclosed embodiments relates to a method for selecting an area within a video content for insertion of watermarks. The method includes (a) selecting a candidate area within a frame of the video content that is smaller in size that the frame itself; (b) adding a first watermark value to the selected candidate area to obtain a first version of the area; (c) adding one or more noise components to the first version of the area to obtain a noisy first version of the area; (d) conducting a watermark extraction operation on the noisy first version of the area to obtain a first correlation value; (e) adding a second watermark signal to the selected candidate area to obtain a second version of the area; (f) adding one or more noise components to the second version of the area to obtain a noisy second version of the area; (g) conducting a watermark extraction operation on the noisy second version of the area to obtain a second correlation value; (h) selecting one or more pseudo-random offset values to select a different candidate area within the frame for adding the first watermark value or for adding the second watermark value; (i) repeating operations (a) through (g) until all pixels of the frame have been selected as part of one or more of the selected candidate areas, wherein in each iteration of operations (a) through (g) the values obtained for the first correlation value and the second correlated value are stored; and (j) designating one or more of the selected areas that produced the largest first correlation value or the largest second correlation value for the insertion of watermarks.

In one exemplary embodiment, the method also includes conducting a spatial psychovisual analysis on one or more frame frames that include the designated selected area(s). The spatial psychovisual analysis includes applying a non-linear inverse gamma curve to luminance components of the one or more video frames corresponding to the human visual system response in dark areas; performing a Laplacian or a Gaussian pyramid operation multiple times at multiple resolutions on the one or more video frames subsequent to the applying of the non-linear inverse gamma curve to detect highly textured areas; and performing an edge detection operation to detect edge features within the one or more frames.

In another exemplary embodiment, the above noted method further includes embedding the first watermark value in the designated area of the frame to produce a first embedded version of the frame, embedding the first watermark value in the designated area of the frame to produce a first embedded version of the frame, re-encoding the first and the second versions of the frame to obtain a first and a second encoded version of the frame, respectively, decoding the first and second versions of the encoded frames, comparing one or more measures of quality associated with the decoded first and second versions with corresponding one or more reference measures of quality, and based on the comparing, making a determination to accept or reject the frame as a frame that is suitable for watermark insertion.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is simplified diagram that illustrates the principles of transactional or forensic mark insertion into a content using preprocessed content.

FIG. 2, is a high level block diagram of various components for embedding and detection of forensic marks.

FIG. 3( a) is a simplified diagram illustrating some of the components of a preprocessor in accordance with an exemplary embodiment.

FIG. 3( b) is a block diagram of the preprocessor engine in accordance with an exemplary embodiment.

FIG. 4( a) illustrates an mapping of a PRN sequence to a rectangular area in accordance with an exemplary embodiment.

FIG. 4( b) illustrates a mapping of a PRN sequence to a circular area in accordance with an exemplary embodiment.

FIG. 5 illustrates an example of inter-frame dependencies for I, P and B frames.

FIG. 6 shows a set of selected frames and frames that need to be re-encoded in accordance with an exemplary embodiment.

FIG. 7 shows two alternative data generated in accordance with an exemplary embodiment which may be stored in inserter manifest.

FIG. 8( a) illustrates a preprocessor engine for preprocessing an uncompressed video stream in accordance with an exemplary embodiment.

FIG. 8( b) illustrates a preprocessor engine in accordance with another exemplary embodiment.

FIG. 9 is a block diagram of a customizer in accordance with an exemplary embodiment.

FIG. 10 illustrates a sequential channel design in accordance with an exemplary embodiment.

FIG. 11 illustrates an overlapping channel design in accordance with an exemplary embodiment.

FIG. 12 illustrates the components that perform over-watermarking of a video stream in accordance with an exemplary embodiment.

FIG. 13 illustrates the components that perform customization of the inserter manifest to enable watermarking of an encrypted content in accordance with an exemplary embodiment.

FIG. 14 illustrates the components of a watermark extractor in accordance with an exemplary embodiment.

FIG. 15 illustrates an example watermarked area and selected frame that can facilitate the understanding of correlation operations of the present application.

FIG. 16 illustrates a system that can be used to allow extraction and assessment of watermarks from a video content in accordance with an exemplary embodiment.

FIG. 17 illustrates a set of exemplary operations that may be carried out by the extraction coordinator in accordance with an exemplary embodiment.

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

FIG. 19 illustrate a set of operations that can be carried out for facilitating embedding of watermarks into a video content in accordance with an exemplary embodiment.

FIG. 20 illustrate a set of operations that can be carried out for inserting a watermark into a video content in accordance with an exemplary embodiment.

FIG. 21 illustrate a set of operations that can be carried out for over-watermarking a segment of a video that has an existing watermark embedded therein in accordance with an exemplary embodiment.

FIG. 22 illustrate a set of operations that can be carried out for facilitating insertion of a watermark into an encrypted video in accordance with an exemplary embodiment.

FIG. 23 illustrate a set of operations that can be carried out for identification of a watermark within an embedded content in accordance with an exemplary embodiment.

DETAILED DESCRIPTION OF CERTAIN EMBODIMENTS

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.

FIG. 1 is simplified diagram that illustrates the principles of transactional or forensic mark insertion into a content using preprocessed content. In the exemplary diagram of FIG. 1, a preprocessing engine processes some segments of a particular content to produce two alternative data 42 and 44 for each segment. Alternative data 1 (42), for example, can be produced by embedding all zero-valued watermark symbols in a segment of the content. Alternative data 42, thus, is perceptually similar to the original (unmarked) content but includes embedded zero-valued watermarks at locations identified as segment 1 (48-1), segment 2 (48-2), etc. Similarly, the preprocessing engine processes the same segment of the unmarked content to produce alternative data 44 that is perceptually similar to the original (unmarked) content but includes, for example, embedded one-valued watermarks at the same locations identified as segment 1 (48-1), segment 2 (48-2), etc. The generation of the alternative data, such as alternative data 12 and 44 at the locations 48-1, 48-2, etc., facilitates the production of a forensically marked content at future stages of processing or at other locations. For example, alternative data 42 and 44 at all locations 48-1, 48-2, etc. may be transmitted to an inserter entity, where a transactional (or forensic) watermark is embedded using little computational effort. In particular, as shown at the bottom two rows of FIG. 1, embedding of the forensic mark code value can be carried out by selecting either alternative data 42 or 44 at a particular location 18-1, 48-2, etc., and then replacing the segments at such location with the selected alternative data to produce a forensically marked content. It should be noted that the diagram of FIG. 1 only illustrates a scenario in which binary watermark symbols are used. However, transactional marking can be done using non-binary symbols, i.e., more than 2 alternative data can be produced at any particular location. Further, alternative data 42 and 44 may be used to replace the segments at some locations, and segments at other locations may be unmarked or may contain other types of watermarks. As such, in some scenarios that will be described in the sections that follow, only a portion of each tributary may be preprocessed, and provided to subsequent stages to effect transactional watermarking.

The disclosed embodiments enable insertion of transactional (or forensic) watermarks in a video content in an efficient and flexible manner. It should be noted that the disclosed embodiments relate to principles that are well suited for embedding watermarks in compressed video domain, it is, however, understood that the disclosed embodiments are also applicable to watermarking in uncompressed video, as also described in the present application.

FIG. 2 is a high level block diagram of various components for embedding and detection of forensic marks in an exemplary embodiment. The preprocessor 202 includes an input that allows a video content to be delivered to the preprocessor 202. The preprocessor 202 is also coupled to a an inserter 204 and is configured to analyze the input video asset to produce an inserter manifest and/or extractor manifest. The operations at the pre-processor 202 are expected to be computationally expensive and can include various processing, filtering, psychovisual analyses, and the like, that produce an inserter manifest. The insert manifest simplifies and guides the operations of the inserter 204. The preprocessor 202 also optionally produces an extractor manifest to assist watermark extraction by the extractor 206. The inserter manifest may be multiplexed into the video transport stream or transmitted securely and separately to the inserter 204. The inserter 204 is a simple and lightweight engine that inserts the video watermark according to the inserter manifest into video streams. The insertion of watermarks can be based on a provided watermark message (e.g., an identification number that identifies a transaction), as well as based on pre-assigned watermark payload values (e.g., a serial number identifying a device, user, or entity). The inserter 204 can operate within a video distribution server (e.g., at a content distribution head-end, at an edge server, etc.) or at a video client (e.g., a set top box, a TV, or an application running on a device).

Referring again to FIG. 2, the extractor 206 recovers the embedded watermark message typically after the content has been distributed to the public. For example, once a content has been embedded and publically distributed, the content owner (or another interested entity) may obtain a copy of the content that is suspected as being pirated. In this case, the extractor, optionally, with the assistance of the extractor manifest, can assess the video content to obtain the embedded watermarks and to investigate the origins and channels of content piracy.

FIG. 3( a) is a simplified diagram illustrating some of the components of the preprocessor 300 in accordance with an exemplary embodiment. The preprocessor 300 comprises two components: the preprocessor engine 302 and the customizer 304. The pre-processor engine 302 is responsible for the majority of the computationally expensive operations performed on the video content. The preprocessor engine 302 generates the inserter and optionally the extractor manifests that are provided to the customizer 304. The operations and components of the preprocessor engine 302 will be discussed in further detail the sections that follow. The customizer 304 modifies the inserter manifest based on a given profile to produce customized inserter extractor manifests that facilitate embedding and extraction of watermarks at subsequent stages. In some embodiments, the customizer 304 can also optionally produce a pre-marked video. Further details of the operations and components of the customizer 304 are described in the sections that follow.

FIG. 3( b) is a block diagram of the preprocessor engine 302 in accordance with an exemplary embodiment. It should be noted that FIG. 3(b) is only a simplified diagram of the preprocessor engine 302 and thus may not show all components of the preprocessor and/or the connections among the various components. In the exemplary diagram of FIG. 3(b), the input video (e.g., a compressed video stream such as an MPEG stream) is routed through two different paths. In particular, the upper path is merely a pass-through path that allows video to be handed off to the next stage (e.g., stored on a media, transmitted to another component, such as the inserter, etc.). The upper path (e.g., the pass-through functionality) may be implemented inside or outside of the preprocessor engine 302. The video that enters the preprocessor engine 302, through the lower path undergoes several stages of processing to produce the inserter/extractor manifests at its output.

While each component of the preprocessor 302 will be described in greater detail in later sections, it is instructive to describe the overall operations of the pre-processor engine 302 as follows. The video is input to a decoder 324 to produce an uncompressed video stream, which is directed to a frame selection component 306 that selects a particular video frame or frames for the insertion of watermark. The selected frames are input to evaluation component 322 that may comprise several subcomponents. In particular, the temporal psychovisual analysis component 308 and spatial psychovisual analysis component 310 can conduct psychovisual analysis to determine areas within the frame(s) that can accommodate the embedding of watermarks. For instance, temporal analysis cam determine areas that due to the motion of images within a sequence of frames produce less perceptible artifacts when embedded with watermarks, or alternatively areas of the image that should not be embedded with watermarks since they produce perceptible artifacts. Similarly, spatial analysis determines areas within a frame where the presence of watermarks can be masked (and/or alternatively cannot be masked) due to, for example, the presence of stronger image signals, or higher spatial frequencies. The area selection component 312 determines the actual areas within a frame that can be used for embedding of watermarks. The mask values that are generated by the psychovisual analysis components can be binary valued or non-binary valued (e.g., as a real number). The area selection component 312 can, for example, simulate embedding and extraction of watermarks to select the areas that are suitable for watermark insertion. Thus, the output of the evaluation component 322 can include the selected areas, as well as the masking factors that can attenuate (or eliminate altogether) the embedding of watermarks at certain locations within the selected areas.

The pseudo-random number (PRN) generator 314 produces a set of random numbers (e.g., a random carrier) that can be used for embedding of watermarks. Using the combiner 318 (e.g., a modulator), the PRN is combined (e.g., modulated) with a robustness factor and the pixel values of the selected area as modified by the mask to produce the watermark signals. For example, in case of binary watermark symbols, such watermark signals can represent two streams, one corresponding to the “zero” watermark and one corresponding to the “one” watermark. Using the combiner 320 (e.g. an adder), the watermark signals can then be combined with the selected frames of the unmarked video signal to produce the watermarked video signal. The watermarked video signal is then re-encoded to properly form the compressed video stream that is part of the inserter/extractor manifests.

The PRNs that are generated by the PRN generator 314 are data signals or sequences with strong autocorrelation and/or cross-correlation properties. They also present noise-resistance features because they are pseudo random noise sequences. Examples of the PRNs include maximal length sequences, Gold codes, Kasami codes, Barker codecs, and complementary sequences. A watermark symbol can be embedded by modulating a specific PRN sequence into the video stream. The notation S_i^j will be used throughout this document to indicate the element j of sequence i, where is the index to the PRN sequence and can range between 0 and the total number of the bits to be embedded as a watermark symbol, and j is the index to an element of the sequence S_i and can range between 1 and the total number of pixels of a video frame. Most PRNs are binary sequence, e.g., the value of S_i^j is either 1 or −1 (or, 0 or 1). Multiple PRA sequences in a set can be generated for embedding multi-bit symbols, and each such sequence has a very low correlation with any other sequence in the set. For example, for a set of 32 PRN sequences, 32 “alternative data” at a single location in the video stream may be produced by the preprocessor engine 302. In other words, up to 5 bits per symbol can be transmitted using the set of 32 PRN sequences.

It should be noted that the term alternative data refers to one or more video stream portions that may alternatively replace a particular segment of the video stream in a manner that such replacement does not produce perceptually significant differences on the rendering and quality of the video stream. For example, a first and a second segment of video stream that are embedded with a zero-valued and one-valued watermark are examples of two alternative data that can replace a corresponding unmarked segment of the video stream. Alternative data is often the same size as, or smaller than, the segment of the video stream that it intends to replace.

PRN Patterns:

A PRN sequence S_i that is used in accordance with the disclosed embodiments can be expanded and mapped into one or more arbitrary 2-dimensional shapes such as rectangles, polygons, circles, ovals and the like. One exemplary shape is rectangular area that consists of W×H elements, where W and H are the width and height of the rectangular area, respectively. Such a rectangular area can be further divided into W/Wc×H/Hc cells, where Wc and Hc are the width and height of each cell, respectively. In one exemplary embodiment, mapping a PRN sequence to such a rectangular area is performed by applying the value of S_i^j to all elements of a cell of the rectangular area.

FIG. 4( a) shows a mapping of a PRN sequence to a rectangular area in accordance with an exemplary embodiment. The exemplary diagram of FIG. 4(a) shows a 16-element PRN sequence S_i that is mapped to a rectangular 16×16 PRN pattern, where the value of each element (S_i⁰ to S_i¹⁵) is applied to a 4×4 cell. For example, in the upper left 4×4 cell grid of FIG. 4(a) (highlighted in gray), the value of S_i⁰ is applied to the top-left cell, and the value of S_i¹⁵ is applied to the bottom-right cell. In this example, the value of both W and H is 16, and the value of both Wc and He is 4. However, the value of W may be in the range between 1 and the width of video frame, and the value of H may be in the range between 1 and the height of video frame. Moreover, the value of Wc may range between 1 to W and the value of Hc may range between 1 and H.

In another exemplary embodiment, the PRN pattern can be in the form of a circular area. In particular, one example circular design maps a PRN sequence into an solid core with multiple bands of non-overlapping rings around the core. The value of each is applied to all elements of a specific ring (including the solid core), and/or a specific section of a ring. FIG. 4(b) illustrates a mapping of a PRN sequence to a circular area in accordance with an exemplary embodiment. In the exemplary diagram of FIG. 4(b), the 8 elements of a PRN sequence are mapped into a core and 7 rings, of the circular pattern, respectively. It should be noted that multiple elements of the PRN sequence may be mapped into different non-overlapping sections of a ring, especially in the large outer ring. Another example is to map each element of the PRN sequence into a circular section of a disk.

A PRN pattern is an expanded spatial representation of the PRN. In one exemplary embodiment, the number of elements in a PRN pattern is equal to the number of pixels of the watermarked area (e.g., in luminance domain), and the shape of the watermarked area in a video frame is identical to the shape of the PRN pattern. There are a number of ways to map a PRN sequence into a PRN Pattern. Some non-exclusive examples include: (a) the PRN has only one element and such element is applied to the entire video frame, (b) the PRN has 4 elements, and each element is applied to one of the quarters of the video frame, (c) the PRN has 2 elements, which are applied to the top half and bottom half of the video frame, respectively.

Once mapping of the PRN is carried out, the resulting spatial representation of the PRN is modulated with the mask values calculated by the psycho-visual analysis components to create the watermark signals, as shown in FIG. 3(b).

Referring back to FIG. 3(b), the frame selection component 306 selects one or more frames for embedding of watermarks. In some exemplary embodiments, a number of consecutive frames (“watermarked frames” or “selected frames”) are typically selected for embedding of a watermark symbol. In other words, in such a scenario, the same symbol value is embedded into consecutive frames. The number of such consecutive frames may range from 1 to the total number of frames in a video stream to be watermarked. When the watermark signal is added to the selected frames in compressed domain (e.g., using the combiner 320 in FIG. 3(b)), one consideration for selection of the frames is to select particular frames in such a way to minimize the portion of the video stream that must be re-encoded in preprocessing stage. Re-encoding is described in detail in a later section of this document. Another consideration for frame selection is to ensure that the presence of “stable” areas over the selected consecutive frames, for example, the pictures in these stable areas over the selected consecutive frames are similar. These stable areas are in similar spatial locations in all selected consecutive frames.

Guided Frame Selection:

According to some exemplary embodiments, one or more frames of a video can be selected according to a guided frame selection methodology. In particular, an inserter manifest and/or extractor manifest produced from a first video stream can be used to guide the frame selection for a second video stream. For example, the first and the second video streams can be different encodings of the same movie title that are produced for different purposes, such as to provide different bit rates or language versions for the same movie title. In such scenarios, the content of one video are substantially similar to the contents of the other video and, therefore, an inserter (or extractor) manifest that has been generated for one video can greatly facilitate the generation of the inserting and/or extraction manifests for the other video. When the frames in the first video stream are not synchronized with the frames in the second stream (due to editing and/or different frame rates), temporal synchronization information (e.g., fingerprints, timestamps and temporal locations of key frames, scene changes) that is stored in the inserter/extractor manifests can be used to synchronize the frames between the first and second video streams when conducting a guided frame selection. After synchronization, if the selected frames at a temporal location in the first video stream do not exist in the second stream (e.g., because of editing), no frames at the same temporal location in the second stream are selected. Moreover, any frame in the second stream that does not exist in the first video stream is not selected.

In a guided frame selection mode, frames in the second video stream are identified with the frame numbers and/or timestamps of the selected frames specified in the inserter/extractor manifests produced from the first video stream. In another exemplary embodiment, the frames of the first video stream are identified based on an identification scheme (e.g., by computing a fingerprint that uniquely identifies a frame). Such identification information can, for example, reside at the inserter/extractor manifest, or at a database. Guided frame selection in the second video can be carried out by identifying the frames of the second video using the same identification scheme, matching them to frames in the first video stream, and obtaining the associated embedding/extraction information from the manifest.

Additionally, or alternatively, information obtained from sources other than the inserter/extractor manifest can be used to guide the frame selection. One example of such information is a client manifest or playlist for adaptive video streaming used in protocols and systems such as MPEG-DASH (Dynamic Adaptive Streaming over HTTP), Microsoft Smooth Streaming, HTTP Live Streaming (HLS) or HDS (HTTP Adaptive Streaming). Such a client manifest or playlist specifies the indices for a client to access the content segments for each bitrate version of the content.

Temporal Psychovisual Analysis: Referring back to FIG. 3(b), temporal psychovisual analysis component 308 analyzes the temporal features of the selected frames, and produces a temporal mask for each selected frame. The size of each temporal mask is identical to the frame size. The temporal mask reduces the visual artifacts in temporal domain that would be potentially introduced by the insertion of watermarks. In some embodiments, a temporal multi-resolution contrast mask is computed by analyzing neighboring frames. Areas with high temporal masking can significantly improve the transparency of embedded watermarks.

Spatial Psychovisual Analysis:

In the exemplary diagram of FIG. 3(b), the spatial psychovisual analysis component 310 analyzes a selected frame to produce a spatial mask that reduces the visual artifacts in the spatial domain that would be potentially introduced by the insertion of watermarks. Similar to the temporal mask, the size of each spatial mask is identical to the frame size. An example of a spatial psychovisual analysis includes using an algorithm that operates based on detection of highly textured areas using multi-resolution local contrast analysis.

In an exemplary embodiment, the spatial psychovisual analysis operations includes the following operations: 1) a non-linear inverse gamma curve is applied to the luminance component of video images to better match the human visual system response in dark areas; 2) a Laplacian/Gaussian pyramid is performed multiple times at multiple resolutions on video frames in the contrast domain for detection of highly textured areas; and 3) a edge and contour detection algorithm to handle edges is performed. In some cases, image areas within a few pixels of an edge (e.g., edge included) may be avoided by setting the mask values for such areas to 0, or adjusting the mask values to better match the human visual system response around edges. The Laplacian or Gaussian pyramid techniques involve creating a series of images which are weighted down using, e.g., a Gaussian average and scaled down. When these techniques are used multiple times, they create a stack of successively smaller images, with each pixel containing a local average that corresponds to a pixel neighborhood on a lower level of the pyramid.

The temporal mask and spatial mask for each selected frame can be combined multiplied with weights) to produce the final mask.

Area Selection:

Referring back to FIG. 3(b), the area selection component 312 is responsible for selection one or more particular areas within the selected frame(s) for watermark insertion. In one exemplary embodiment, the area selector component 312 utilizes an extraction simulator to select the best areas in the selected frame where the maximum robustness may be achieved when the watermark signals are added into such area. Furthermore, for each candidate area in a selected frame, different PRNs may be applied to such area repeatedly in watermark extraction simulation. The MIN with the maximum robustness is selected and stored in an Extractor manifest for each area. That is, watermarks that are embedded in such areas can still be detected when those areas within the frame(s) are subject to added noise, distortion and other impairments. Another consideration for area selection is to use the spatial masks to select areas with specific characteristics that allow the insertion of watermarks in a substantially transparent manner, without producing perceptible artifacts. For example, highly textured areas may be selected and flat image areas may be avoided. It is often beneficial to combine and balance these considerations (e.g., robustness versus transparency) for area selection.

To simulate noise channels, such as camcorder capture of the video content, compression or other image/video processing operations, additional noise signals are modulated onto the watermarked video. In one exemplary embodiment, an extraction simulator component, which can be implemented as part of the area selection component 312, performs the following steps in sequence. Assume that f is the selected frame, f(x,y,w,h) is a rectangular area within the frame f, where (x,y) is the top-left coordinate of the area, and w and h are the width and height of the area, and further assume that the number of alternative data is 2 (i.e., binary watermark symbols are used), and w₀ and w₁ are the watermark signals carrying the symbol ‘0’ and ‘1’ when they are added to f(x,y,w,h), respectively.

• 1. Set x=0, y=0, and reset C (C is a list for storing the correlation values),
• 2. Add the watermark signal w₁ to f(x,y,w,h) by calling the Watermark Embedding Function (which is described in detail in a later section of this document) to produce the watermarked frame f′;
  • Add additional simulation noises introduced by noise channels (e.g., camcordering, compression, etc.) to the watermarked frame f′;
  • Perform the extraction operations to obtain correlation values and add the correlation value (which is a result of the extraction function) to C.
• 3. Add the watermark signal w₀ to f(x,y,w,h) by calling the Watermark Embedding Function to produce the watermarked frame f′
  • Add additional simulation noises introduced by noise channels such as camcordering, compression, etc., to the watermarked frame f′;
  • Perform extraction operations and add the correlation value to C.
• 4. Set x=N where N is constant value as the step size (e.g., N=1) or a pseudo-random number in a particular range n1 to n2 where n1 and n2 are numbers, and repeat Step 2-3 until x is equal to or greater than the width of f.
• 5. Set y=y+N and x=0 where N is a constant value as the step size N=1) or a pseudo-random number in a particular range n1 to n2 where n1 and n2 are numbers, and repeat Step 2-4 until y is equal to or greater than the height of f.
• 6. Sort the correlation values in C and select the area with the highest correlation value in C for watermarking. Such area is called the ‘selected area’ or ‘watermarking area’ in f.

Guided Area Selection:

Similar to the above-described guided frame selection, an inserter manifest and/or an extractor manifest produced from a first video stream can be used to guide the area selection for a second video stream. For example, the first and the second video streams can be different encodings of the same movie title that are produced for different purposes, such as to provide different bit rates or language versions for the same movie title. In a guided area selection mode, areas in the second video stream are selected based on the spatial location, size and/or shape of the selected area specified in the inserter/extractor manifests produced from the first video stream. If the width and/or height of the frames in the first video stream are different from the second video stream, the area selected by the guided selection in the second stream can be resized proportionally according to the width and height of the video frame of the first video stream, or registered with the selected area in the first video stream based on spatial fingerprints or other metadata.

Guided preprocessing based on the inserter/extractor manifests produced from the first video stream, including the guided frame and area selections, ensures that when an extractor manifest is required for watermark extraction, only a single extractor manifest is needed for different video streams that are derived from a specific visual work through encoding and/or editing or other processing. One example is the adaptive streaming scenario where multiple video streams with different bit rates are delivered to users based on, for example, the user's network bandwidth and capability of the playback client. In these cases, the input video stream to the preprocessor should be in streaming-ready format such as fragmented MP4, MPEG Transport Stream, or MPEG Dynamic Adaptive Streaming over HTTP (DASH) compatible video stream. In one exemplary embodiment, each video stream is divided into multiple segments, and all segments in all video streams with different bit rates at a specific temporal location are switchable under the request of the playback client. The preprocessor first generates inserter/extractor manifests from one of such multiple video streams (e.g., the video stream with the highest bit rate), and then uses such manifest(s) to guide the generation of inserter manifests for other video streams in such a way that 1) the inserter will insert the same watermark symbols (if any) in a segment, independent of which video stream such a segment come from; and 2) the extractor can extract the watermarks with the aid of the extractor manifest (if required) from a content mixed from segments from all video streams with the different bit rates. For example, assume that S1, S2, . . . Sn are the segments of the first video stream S at one bite rate, and S′1, S′2, . . . S′n are the corresponding segments of the second stream S′ at another bit rate. The guided preprocessing ensures that the same watermark symbol is embedded into either Si or S′i (1≦i≦n), and the watermark can be extracted with a single extractor manifest (if required) from the content delivered to the playback client, which may consists of segments from either S or S′.

Another broader use case of the guided pre-processing is to ensure that a single extractor manifest can be used for all video streams derived from a specific visual work across different regions for a distributor or for all distributors. In the former case, an extractor/inserter manifest produced from the first video stream by a branch of a distributor may be provided to another branch of the same distributor for selected preprocessing of the second stream. In the latter case, a content producer or owner may provide extractor/inserter manifests to all distributors, in addition to the associated content; such distributors may optionally encode and edit the received content to produce video streams for distribution, and then can use such manifest to perform guided preprocessing on such video streams.

Video Re-Encoder:

Referring again to FIG. 3(b), the video-re-encoder 316 performs some or all of video encoding operations that may be needed after the unmarked video has been processed to embed watermark signals. In one exemplary embodiment, the algorithm for detection of one or more frames which need to be re-encoded is implemented using the following steps. Assume F is a set of frames that need to be re-encoded. F is determined by the following steps.

• 1. Set F={f1, . . . fn}, where f1, . . . , fn are the selected consecutives frames designated for carrying a watermark symbol, and n is the total number of such selected frames for watermarking;
• 2. If no frame in F is “referred” in the video stream by any frame that is not in F, go to Step 5. Otherwise, proceed to the next step. Referencing of frames in the video stream is clarified in a later section of this document,
• 3. If any frame in F is referenced by the frames that are not in F, add these referring frames to F.
• 4. Repeat Step 3 until no frame in F is referenced by the frames that are not in F.
• 5. Re-encode each frame in F.

It should be noted that any frame in the set F can be referred by any other frame within the frame set F, and also can use any other frames that are not in the set F as references, A strategy to reduce the number of re-encoded frames is to select the frames for watermarking immediately prior to a key frame (e.g., an instantaneous decoding refresh (IDR) frame in H.264).

In one exemplary embodiment, after a video frame is optionally re-encoded, the resulting video frame is decoded and its quality is compared with the original video frame using quality measurement methods such as SSIM (Structural Similarity) method, signal-to-noise ratio (SNR) and peak signal-to-noise ratio (PSNR). If the quality of re-encoded frame reaches unacceptable levels (compared to the original video frame), the candidate frames for watermarking may not be selected.

As is well known in video compression, a compressed video stream, such as an MPEG stream or High Efficiency Video Coding (HEVC), comprises a series of frames, some of which require information from the previous or future frames for decoding. For example, the raw frames in an MPEG-2 video can be compressed into three kinds of frames: intra-coded frames (I-frames), predictive-coded frames (P-frames), and bidirectionally-predictive-coded frames (B-frames). An I-frame is a compressed version of a single uncompressed (raw) frame that may be decoded independently, without referencing other P- or B-frames. P-frames and B-frames are not independently decidable since they are produced by computing a motion vector which points to the position of a matching block in a reference frame. The process of motion vector determination is called motion estimation. P-frames provide more compression than I-frames because they take advantage of the data in a previous I-frame or P-frame (i.e., the relied upon I- or P-frame is considered as a reference frame for the P-frame). B-frames use the picture in a subsequent reference frame as well as the picture in a preceding reference frame. As a result, B-frames usually provide more compression than P-frames. Further details of video compression and decoding are not described in this document since the details of video compression techniques can be readily found in many published documents and standards.

FIG. 5 illustrates an example of inter-frame dependencies for I, P and B frames. If a frame is referred, there is an arrowed line pointing to that frame originated from another frame. If a frame uses another frame as a reference, there is an arrowed line originated from that frame. As shown in FIG. 5, the group of the frames (B9-B11) is independent from other frames because any frame within the group (B9-B11) is not referred by other frames outside this group. However, the frames within the group (B9-B11) may rely on other frames outside the group for reference. For example, frame B11 uses both P8 and P12 as references. If as part of preprocessing the video stream to produce the inserter/extractor manifests (e.g., by the preprocessor 302 of FIG. 3(b)) modifications are made to the frames within the group (B9-B11), then only frames of this group must be re-encoded (e.g., by the video re-encoder 316 of FIG. 3(b)).

In some cases, the number of frames to be re-encoded may be larger than the frames in the selected group of frames. For example, FIG. 6 shows a scenario in which frames B7, P8 and B9 are the selected frames, but a group of 7 frames, (B5-B11), needs to be re-encoded because frame 37 if referred by frame 36, frame 38 is referred by frames 35 and 311, and frame 39 is referred by frame 310. Fortunately, such cases are not common. Even if such rare cases occur, a block-level analysis can be conducted to reduce the number of frames to be re-encoded by detecting un-referenced areas in each frame (since referencing is typically done on a sub-block or sub-block (e.g., macro-block by macro-block) basis. If a frame does not reference an area to be watermarked, it may not need to be re-encoded. Motion estimation can also be recomputed while avoiding certain areas of a frame or using other reference frames. Therefore, in some embodiments, the number of frames to be re-encoded is reduced by using block-level analysis and recalculation of motion estimation.

Alternative Data:

As also noted in connection with FIG. 1, in a transactional watermarking scheme, the selected frames or selected areas must be embedded with all values of a watermark symbol to allow subsequent replacement for watermark insertion. Therefore, the Re-Encoder 316 of FIG. 3(b) must also run for each watermark symbol value repeatedly to re-encode all selected frames or selected areas as alternative data. Moreover, to maintain the same size of the re-encoded frames as the original frame, the Re-Encoder 316 may need to repeat the re-encoding process by adjusting the bitrates of the re-encoded alternative data.

FIG. 7 shows two alternative data generated in accordance with an exemplary embodiment which may be stored in inserter manifest, In FIG. 7, w′₉ through w′₁₁ represent the watermark signals that carry the symbol ‘0’ for the selected frames B9 through B11, respectively. Analogously, w₉ to w₁₁ represent the watermark signals that carry the 1-bit symbol ‘1’ for the selected frames B9 through B11, respectively. In the example scenario of FIG. 7, the frames identified as B9+w′₉ through B11+w′₁₁ form one set of alternative data, and the frames identified as B9+w₉ through B11+w₁₁ form another set of alternative data. In another example that uses 5-bit watermark symbols, 32, such alternative data is generated for each selected frame in a similar fashion as described in connection with FIG. 7. When a selected frame is re-encoded into multiple slices, only the slice that contains the selected area is required to be re-encoded multiple times to produce the alternative data.

In some embodiments, to detect intentional or unintentional manipulations of the alternative data or wrong segment replacement, a hash value of the original data to be replaced by one of the alternative data is computed and associated with each alternative data. The inserter can then perform an integrity validation by comparing the hash value computed from the original data to be replaced with the hash value associated with the replacing alternative data before any replacement.

Watermark Embedding Function:

Referring back to FIG. 3(b), the watermark embedding function can be implemented at least in-part using the combiners 318 and 320. In one exemplary embodiment, watermark embedding in a rectangular area within a frame can be implemented according to the following procedure described as the watermark embedding function of Equation (1):f′_i(x,y,w,h)=f_i(z,y,w,h)+[n_j,u,v(x,y,w,h)*m_i(x,y,w,h)]  Eq. (1),where

• • f_i is the luminance component of the original frame that contains at least one area to be watermarked.
  • f′_i is the luminance component of the watermarked frame that contains at least one watermarked area.
  • x and v specify the coordinates of an element in f_i or m_i (which have the identical width and height),
  • w and h are the width and height of the watermarked area, respectively.
  • u and v specify the coordinate of an element in the selected area to be watermarked. The default size of the watermarking area is w by h pixels.
  • Assume that 1-bit symbols were embedded in the watermarked area (i.e., P₀ and P₁ are used), n_j,u,v (x,y,w,h) (for j=0 or 1) is defined as follows:
    • if j=0 and xε[u,u+w] and yε[v,v+h], n_j,u,v (x,y,w,h)=P₀(x−u, y−v) where P₀ is the PRN Pattern of S₀ as described earlier and the width and height, of P₀ are w and h, respectively.
    • if j=1 and xε[u,u+w] and yε[v,v+h], n_j,u,v(X,y,w,h)=P₁(x−u, y−v) where P₁ is the PRN Pattern of S₁ as described earlier and the width and height of P₀ are w and h, respectively.
    • Otherwise, n_j,u,v(x,y,w,h)=0.
  • m_i is the mask frame for f_i, produced by the psycho-visual analysis components.

Watermarking in Uncompressed Domain:

In some embodiments, transactional watermarking can be carried out in an uncompressed video stream. FIG. 8(a) illustrates a preprocessor engine for preprocessing an uncompressed video stream in accordance with an exemplary embodiment. FIG. 8(a) includes similar components as FIG. 3(b) except that the re-encoder (such as the re-encoder 316 of FIG. 3(b)) is eliminated. Moreover, the video decoder 802 in FIG. 8(a) differs from the video decoder 324 of FIG. 3(h) since the latter performs various decompression operations to obtain the frames from a compressed stream, whereas the former obtains the frames from an uncompressed stream. The inserter/extractor manifests that are produced at the output of the pre-processing engine of FIG. 8(a) may be used to allow customization of the inserter/extractor manifests, as well as watermark insertion and/or extraction at subsequent stages. The pre-processor engine of FIG. 8(a) may be used to allow embedding of transactional watermarks in an uncompressed video stream.

Another exemplary embodiment is depicted in FIG. 8(b), in which a subset of the pre-processor engine of FIG. 8(a), such as components that perform frame selection, temporal and spatial psycho-visual analysis, area selection, PRN generation, are used to produce a single watermark signal that is produced based a particular payload information (rather than embedding multiple alternative data). In FIG. 8(b), the message may optionally be error-correction-code (ECC) encoded to add parity symbols to help recover the watermark message in the presence of channel errors. The produced watermark payload is input to the PRN generator. The produced watermark signal can be modulated directly onto one or more components of the selected frames to produce the watermarked video. An example is to modulate such watermark signal into the luminance of the selected frames to represent a watermark symbol. This particular embodiment may be used for direct embedding of watermark in, for example, digital cinema, video decoder, media receiver, or video camcorder, or playback devices and applications, without preprocessing.

Customizer:

As noted in connection with FIG. 3(a), the customizer 304 optimizes and customizes the inserter/extractor manifest generated by the pre-processor engine 302 according to a profile (sometimes referred to as “message profile”). An inserter or extractor manifest may consist of a list entries, where each entry corresponds to one watermark symbol (which can contain one or more bits). A message profile can specify the structure (but not necessarily the actual values) of the message that is to be embedded into the video frames, including the message channels, sizes, payload embedding and extraction intervals, and/or the arrangement of inserter/extractor manifests entries for such message definition. A wide range of methods can be applied to customize inserterExtractor manifest files. Non-exclusive examples of the customizer operations include:

• • Select the best entries in the inserter/extractor manifests based on a set of selection criteria;
  • Remove the entries in the inserter/extractor manifests that are not needed;
  • Process (e.g., encrypt) the alternative data in the inserter/extractor manifests according to the profile;
  • Update the entries in the inserter/extractor manifests accordingly if the video stream is updated.
  • Invoke the Inserter (e.g., the Inserter 204 in FIG. 2) to generate a ‘pre-marked’ stream prior to the distribution of such video stream;
  • Customize the inserter manifest in such a way that a predefined built-in message is inserted by an inserter;
  • Encrypt the entire inserter manifest for delivery.

FIG. 9 is a block diagram of a customizer in accordance with an exemplary embodiment. The sub-components of the customizer will be described in the sections that follow. It should be noted that the exemplary customizer of FIG. 9 shows certain inputs and outputs. However, in different exemplary embodiments, some of those inputs and outputs may not be implemented. For example, the inputs labeled as “built-in” message” and “pre-marking message,” as well as the output labeled as “pre-marked video stream” may not be present in some exemplary embodiments.

Profile:

The profile includes a set of instruction or information that is provided to the customizer to facilitate the generation of customized inserter/extractor manifests, and/or the pre-marked video stream. A Profile may include a list of attributes described below.

Channel design: Transactional watermarking in accordance with the disclosed embodiments allows the insertion of different transactional watermarks in separate “channels.” For example, if a video stream can support a watermarking bit rate of 100 bits per second, the watermarks bits may be allocated as 5 separate channels, each allowing 20-bits-per-second watermark insertion rate. The channel design field (or entry) in the profile defines the design of the channels (for example, up to 5 channels), including, for example, a built-in channel that is only available to the preprocessor (i.e., customizer) for insertion of particular watermark message that will be described later.

As such the disclosed embodiments enable more than one watermark messages to be inserted into a single video stream through one or multiple insertion, sessions. This capability is sometimes referred to as “multi-channel watermarking.”

Each channel can have a payload interval that defines the duration of the segment of the video stream in which one payload for such channel is embedded. In some exemplary embodiments, each payload interval can be configured as being either dynamic or static.

A dynamic payload interval does not have a fixed duration. Therefore, when a payload with a dynamic payload interval is repeatedly embedded into a video stream, each instance of the payload may be embedded in a different duration of the video stream. A static payload interval has a fixed duration. Therefore, when a payload with a static payload interval is repeatedly embedded into the video stream, each instance of the payload shall be embedded in a fixed duration of the video stream.

In some embodiments, a channel may be designed as a sequential channel or as an overlapping channel.

Sequential channel design: FIG. 10 illustrates a sequential channel design in accordance with an exemplary embodiment. In FIG. 10, N is the total number of channels, each square represents a watermark insertion location, and the number inside of each square represents the channel number associated with that watermarking location. In a sequential design, all channels defined in the profile are serially arranged in the order of the channel definition. For example, if the profile defines channel 1 before the definition of channel 0 in a profile, the inserter manifest entries should be assigned to channel 1 and channel 0 in a serial order.

Overlapping channel design: FIG. 11 illustrates an overlapping channel design in accordance with an exemplary embodiment. The notation in FIG. 11 is similar to that in FIG. 10. In an overlapping design, watermarking locations for each payload interval may be divided among more than one channel. For example, in FIG. 11, the payload interval for channel 0 includes 6 embedding locations, three of which are designated for use with channel 0, two of them designated for use with channel 1, and one designated for use with channel 2. Similarly, the payload interval for channel 1 includes 11 embedding locations that are shared amongst channels 0, 1 and 2. As depicted in FIG. 11, when a payload interval overlaps with another payload interval, the overlapping segment may consist of inserter manifest entries for both payload Intervals.

Repeat:

Another entry in the profile can be the repeat field. This field defines the repetition structure of the payload in each channel. For example, a repeat entry of zero indicates that the payload must be repeated from the start to the end of the video stream, whereas a non-zero entry (e.g., N>0) can indicate that the payload must be repeated in every N times in the video stream.

Message Size:

This field in the profile defines the number of bits in Message defined in each channel.

Payload Size:

This field in the profile defines the number of bits in the Payload defined in each channel.

Payload Interval:

This field in the profile defines the duration in which a payload in a specific channel is embedded once. For example, if the value of this field is 0, the payload interval is dynamic (e.g., a single payload is embedded in a dynamic duration of the video stream based on the embedding capability of the inserter manifest entries). If the value of this field is N (N>0), a single payload is embedded in a fixed N-seconds of the video stream.

Priority:

This field in the profile defines the priority (or importance) of each channel (e.g. from 1 to 5 if the total number of the channels is 5). The greater the value of this field, the higher the priority (or importance) of the channel when more than one channel competes for the embedding resources and capabilities (e.g., when the channels compete to acquire better inserter manifest entries). If two or more channels have the same value of this field, the Inserter Manifest entries are assigned to the channels without considering the priority. By default, this field is set to 0 (i.e., no priority).

In some exemplary embodiments, the priority is determined by one of more following criteria:

Watermark Robustness: Inserter manifest entries with more robust watermarks are selected for channels with a higher priority; the watermark robustness can be determined based on, for example, correlation values that were described previously.

Inserter Manifest Size: Inserter manifest entries with the smaller sizes are selected for channels with a higher priority.

Watermark Transparency: Inserter manifest entries with more transparent watermarks are selected for channels with a higher priority; the transparency can be determined based on, for example, the mask values that were described previously.

The following Table illustrates the assignment of priority values in accordance with an exemplary embodiment.

Value       Explanation
0           No priority, all inserter manifest entries are assigned to
            channels without considering the priority.
R1 . . . Rn Priorty according to the robustness of each watermark; R1
            represents the lowest priority (e.g., the inserter manifest
            entries with weakest robustness) and Rn for the strongest
            robustness where n is the total number of channels.
S1 . . . Sn Priorty according to the size of inserter manifest entry; S1
            represents the lowest priority (e.g. the inserter manifest entries
            with the largest sizes) and Sn for the smallest sizes where n
            is the total number of channels.

Pre-Watermarking:

Referring back to FIG. 9, the customizer may have a pre-marking message input. Such an input may optionally be ECC-encoded by the ECC encoder engine, and inserted into the input video stream. The customizer can perform the insertion by, for example, invoking the inserter (or inserter functionality). In embodiments where pre-marking (or pre-watermarking) is implemented, the customizer output includes not only the inserter/extractor manifest files but also a pre—marked video stream.

Built-In Message:

Referring again to FIG. 9, the customizer may have a built-in message input. A built-in message is a watermark message that is configured by customizer and blindly inserted by an inserter. For example, the customizer may remove some of the alternative data in the channel that is dedicated to such built-in message based on the value of such message. For example, if the first bit of the built-in message is ‘0’, the alternative data that carries the bit ‘1’ is removed from the first entry of the inserter manifest. In one exemplary embodiment, the customized inserter manifest at the output of the customizer includes only one “alternative data” in the manifest entry dedicated for such a built-in message.

An example application of the built-in message includes a scenario in which the inserter only needs to insert a unique identifier for each pre-processor, as provided by the built-in message. Such identifier can be stored in a pre-processor prior to its shipment. Thus, all video streams that are preprocessed by such preprocessor will contain such preprocessor identifier after applying inserter functionality. When such pre-processor identifiers are associated with a content distributor, such identifiers (e.g., “Distributor IDs”) can also be used to identify the content distributor.

Over-Watermarking:

An inserter manifest can be customized to allow an inserter to insert a new watermark message that completely replaces the existing watermark message in the video stream.

FIG. 12 illustrates the components that perform over-watermarking of a video stream in accordance with an exemplary embodiment. As shown in FIG. 12, the watermark in video stream may be marked by message #1 to produce a marked video stream #1, which is subsequently overwritten by message #2 to produce the marked video stream #2.

Over-watermarking in accordance with the exemplary embodiments of the present application may be carried out in one of two different manners: in overwriting mode and in swapping mode. In the swapping mode, the inserter updates the inserter manifest for each insertion, whereas in the overwriting mode the same inserter manifest may be used for ail over-watermarking.

Overwriting Mode:

In the overwriting mode, the number of alternative data in the inserter manifest entries is equal to all possible alternative data entries. In one exemplary embodiment, the inserter manifest includes 2ⁿ alternative data entries, where n is the number of bits that can be inserted in an entry. The inserter performs the insertion without considering the presence of the existing watermark. For example, if the new watermark is a “1” watermark, the alternative data in the inserter manifest entry associated with the “1” watermark is selected and is used to replace the video segment associated with the existing watermark in the video stream regardless of the value of the existing watermark.

Swapping Mode:

In the swapping mode, the inserter manifest does not include all of possible alternative data entries. In one exemplary embodiment, the number of alternative data in inserter manifest entries is 2ⁿ−1, where n is the number of bits that can be inserted in an entry. The reason for the missing entry (compared to the overwriting mode) is that the missing entry is presumed to have been inserted in the video stream. In the swapping mode, if the pre-existing watermark value (e.g., a bit) is different from the value of the new watermark to be inserted, the alternative data is swapped with the data that is in the video stream (i.e., the original data). However, if the pre-existing watermark value is the same as the alternative data, no replacement or swapping takes place.

The swapping mode reduces the inserter manifest size by remembering the presence and the value represented by the “original data” in the inserter manifest. However, the inserter manifest needs to be updated by the inserter for each over-watermarking session.

Watermark Encrypted Content:

To support direct insertion on encrypted video stream, the inserter manifest produced by pre-processor is customized in accordance with an exemplary embodiment to meet the following criteria: 1) all alternative data in the inserter manifest is encrypted by the same algorithm and the same key used for encryption of the video stream; and 2) all alternative data must is an integer byte number of the encryption block size. For example, the size of an alternative data must be in the multiple of 16 bytes if an AES encryption block size is 16 bytes.

FIG. 13 illustrates the components that perform customization of the inserter manifest to enable watermarking of an encrypted content in accordance with an exemplary embodiment. The encrypted video stream is first decrypted using a decryption key before being input to the pre-processor. The inserter manifest produced by the pre-processor is provided to the customizer, which produces a customized inserter manifest. The exemplary configuration of FIG. 13 allows customization of the inserter manifest in conformance with the above two criteria. In particular, the encryption block alignment component increases the size of the alternative data if its size is not a multiple of encryption block size and the alternative data encryptor uses the same encryption algorithm and key used for video stream encryption to encrypt the aligned alternative data in the entire inserter manifest.

Watermark Extraction:

FIG. 14 illustrates the components of a watermark extractor in accordance with an exemplary embodiment. The components that are depicted in FIG. 14 may be implemented as part of the extractor 206 of FIG. 2. It should be noted that throughout this document the term user is used to denote a user of the systems and devices that are described in the present application. Such users can include content owners, content distributors, and like, and may or may not include consumers of video content, such as members of general public that purchase, rent or otherwise use the video.

Video Preparation:

As illustrated in FIG. 14, video preparation components operate on the user video using the extractor. Video preparation can include temporal and/or spatial registration, temporal and spatial tittering, and/or other operations that may be needed to prepare the video stream for watermark extraction. The information in the extractor manifest file, such as the reference frame images, fingerprints, geometric descriptions of the watermarked area within the watermarked frames may help video preparation. The temporal and spatial registration may be performed manually or automatically. That is, the images of received video may have been rotated or shifted in space, or may have undergone other geometric deformations that may need to be corrected. Further, the video sequence may have been shifted in time and may need to be temporally aligned prior to watermark extraction.

According to an exemplary embodiment, at least two kinds of fingerprints that are registered by the pre-processor and stored in the extractor manifest file can help the automated video temporal and spatial registration: 1) temporal fingerprints based on the relationships and characteristics between and among frames for identifying the watermarked frames, and 2) spatial fingerprints based on salient and feature points for identifying the watermarked areas within the watermarked frames.

Correlation:

Referring to FIG. 14, correlation and aggregation component(s) video preparation components operate on the video prepared by the video preparation components to enable extraction of the embedded watermarks. In one exemplary embodiment, reference PRN Patterns (i.e., the PRN patterns used for embedding of watermarks that are fixed, stored at the extractor, or communicated to the extractor through the extractor manifest or through other techniques) are correlated with the watermarked areas within the selected frames of the user video where a watermark signal was originally inserted to extract a watermark symbol. The expected locations of the inserted watermarks can be signaled through the extractor manifest. Alternatively, a blind extraction attempt may be conducted which eliminates the need for knowing the expected locations of the inserted watermarks at the expense of increased processing.

In one example embodiment, to extract an N-bit symbol, 2^N PRN patterns are retrieved, or generated, as described earlier. Each of these 2^N PRN patterns is correlated with the watermarked area of the user video to produce N correlation values. The symbol value corresponding to the highest correlation value is the extracted symbol value (or the most likely extracted symbol value).

Local optimization may be performed by conducting a local search of the watermarked areas in the user video with a search window. The correlation operation is performed repeatedly by moving the watermarked area within the windows. FIG. 15 illustrates an example watermarked area and selected frame that can facilitate the understanding of correlation operations of the present application. FIG. 15 depicts a rectangular PRN pattern and a search window that is defined by M and N pixels. In this configuration, 2M*2N correlations are performed if the search step is one pixel. When the search window is extended to the entire or majority part of the video frame, watermark detection can be performed without any additional information (other than the user video). In this case, the extractor manifest is not required for watermark extraction.

Aggregation Over Watermarked Frames: The correlation operations described above extract a symbol value from a single selected frame. When two or more consecutive frames are selected to embed the same symbol, the correlation values from each of such consecutive frames are statistically aggregated. In one exemplary embodiment, the symbol value corresponding to the highest aggregated correlation value determines the extracted symbol value. In the example system of FIG. 14, aggregation can be carried out by a subcomponent within the correlation and aggregation component.

One, or a combination, of the following aggregation methods can be used for watermark aggregation: (1) first aggregate watermark signals over consecutive watermarked frames, and then perform correlation, or (2) first perform correlation on each watermarked frame, and then aggregate the correlation values over consecutive watermarked frames.

Message Decoder:

Message decoder decodes the extracted payload into a watermark message. The following example illustrates how message decoding can be done in one exemplary embodiment where the inserted watermark payload is error-correction-code encoded. Once an instance of the payload is detected, an error correction decoder is invoked to decode the payload instance. If the error correction decoder fails to decode the payload instance, this instance is statistically combined with the previous consecutive payload instances, which cannot be decoded individually or combined, to produce a combined payload instance. The error correction decoder is called again to decode the combined payload instance. The above steps can be repeated until a watermark message is successfully decoded, or to a point where the end of the content from which the extraction is attempted is reached.

Extraction Portal:

FIG. 16 illustrates a system that can be used to allow extraction and assessment of watermarks from a video content in accordance with an exemplary embodiment. To enable automated extraction of watermarks from submitted videos (e.g., when such videos are discovered and suspected as being a pirated movie) the extractor must be capable of handling automated temporal and spatial (image) registration, especially when pirated videos that are often geometrically distorted are being examined. In some embodiments, scene change detection and image fingerprint can be used to achieve temporal and spatial (image) registration.

In the exemplary system of FIG. 16, the content owners/distributors can submit the generated extraction manifest to the portal as part of an extractor manifest registration process. The extraction manifests are sent to the back-end extraction components and saved in one or more databases. When a subscriber conies across a suspect video, the video can be submitted to the extraction portal, optionally with an associated metadata, such as the title of the video, the language of the video, the duration of the video or any other information that can facilitate identification of the content and extraction of watermarks. The video and associated metadata is sent to the back-end extraction components to extract the embedded watermarks, and to identify the transaction node(s), users, playback device, and/or the chain of content distribution.

Extractor Manifest Registration:

In the exemplary system of FIG. 16, the extractor manifest files produced by the preprocessor are uploaded to the extraction portal for subsequent utilization in the extraction services. The extractor manifest file can include a metadata section that includes: Title name, operator/distributor, identification information of the audio and/or video for the content from which the extractor manifest was produced (e.g., watermark-based content identifier or digital fingerprints) and/or other information than can assist with extraction of watermarks. The uploaded extractor manifest files are stored in the extractor manifest database. It should be noted that EM in FIG. 16 represent a database that holds the extraction manifests, and FP in FIG. 16 represents a database that holds the fingerprints.

Extractor Manifest Search:

According to an exemplary embodiment, once the extractor manifest search module receives an extraction request, it first identifies the corresponding extractor manifests that have been registered with the portal. The search can be conducted using any one, or combinations of, the following methodologies.

Metadata Search:

This method identities the extraction manifests by matching the metadata optionally provided in the request against the metadata in the extractor manifest files that reside at the extractor manifest database.

Fingerprints Match:

This method uses fingerprints to identify the extractor manifest. For example, video fingerprints of movie titles are registered in the fingerprint (FP) database(s). The extractor manifest search module extracts the fingerprints from the submitted video, matches them against the stored fingerprints at the FP database, and provides all extractor manifest files that belong to the matched title to the extraction coordinator.

Watermarking-Based Content Identifier (CID):

In this search method, a CID detected from the watermarks embedded in the audio and/or video tracks of the submitted video can be used to identify the registered extractor manifests by matching such CIDs with the CIDs of the registered video that reside at the database.

Extraction Coordinator:

Referring again to FIG. 16, the extraction coordinator coordinates the automated extraction process in response to the extraction request submitted by a subscriber. FIG. 17 illustrates a set of exemplary operations that may be carried out by the extraction coordinator in accordance with an exemplary embodiment. At 1702, the coordinator calls the extractor manifest search module (or component) to identify all extractor manifest (EM) files in the Extractor Manifest database that match the submitted video. At 1704 it is determined if an extractor manifest is found. Upon a determination that no EMs are found, at 1706 the coordinator provides feedback to the requestor that no message could be extracted, or the content is sent to be subject to further investigation. If one or more EMs are found, at 1708 the extraction coordinator calls the watermark extractor at 1710 repeatedly to attempt the extraction of watermark message from the video using the each of the identified extractor manifest files. At 1712, a determination is made as to whether or not a watermark message is extracted. If a watermark message is extracted, at 1714 the requestor can be informed as such, and optionally provided with information regarding transactional history and distribution channels of the content. If no message is extracted after all extraction iterations, the coordinator provides feedback to the requestor that no message could be extracted, or the content is sent to be subject to further investigation.

Extraction Investigation:

Extraction investigation is a forensic investigation phase typically involving a manual process and/or an in-depth scrutiny of content to evaluate whether or not watermarks are present (even if their value cannot be ascertained) and to provide any other insight as to the origins or history of the content. In one exemplary embodiment, the extraction investigation process includes 1) verifying the extractor manifest files selected by the extractor manifest search module and/or 2) verifying the extraction results by investigating the detailed log files produced by the extractor. Such detailed log files may only be produced by Extractor under an “investigative” execution mode.

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. For example, FIG. 18 illustrates a block diagram of a device 1800 within which various disclosed embodiments may be implemented. The device 1800 comprises at least one processor 1804 and/or controller, at least one memory 1802 unit that is in communication with the processor 804, and at least one communication unit 1806 that enables the exchange of data and information, directly or indirectly, through the communication link 1808 with other entities, devices, databases and networks. The communication unit 1806 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 1800 of FIG. 18 may be integrated as part of the transactional watermarking system of the present application, including as part of the pre-processor, the inserter, and/or the extractor.

FIG. 19 illustrate a set of operations that can be carried out for facilitating embedding of watermarks into a video content in accordance with an exemplary embodiment. At 1902, a first number of frames from the video content is selected. At 1904, one or both of a temporal and a spatial psychovisual analysis on the selected frames is performed. At 1906, for each frame of the selected frames, at least one area for insertion of watermarks is identified. At 1908, a first watermark symbol is embedded in the identified area(s) of the selected frames. At 1910, the selected frames subsequent to embedding with the first watermark symbol are re-encoded to obtain a first alternative data. At 1912, a second watermark symbol is embedded in the identified area(s) of the selected frame. At 1914, the selected frames subsequent to embedding with the second watermark symbol are re-encoded to obtain a second alternative data. At 1916, an inserter manifest is formed that comprises the first and the second alternative data to enable insertion of a watermark into the video content by selecting one or the other of the first and second alternative data for insertion into the video content

FIG. 20 illustrate a set of operations that can be carried out for inserting a watermark into a video content in accordance with an exemplary embodiment. At 2002, a video content is received. At 2004, inserter manifest is obtained that comprises at least a first and a second alternative data. At 2006, only one of the first or the second alternative data is selected in accordance with a transactional watermark payload and replacing a first segment of the received video with the selected alternative data. At 2008, only one of the first or the second alternative data is selected in accordance with a transactional watermark payload and replacing a second segment of the received video with the selected alternative data.

FIG. 21 illustrate a set of operations that can be carried out for over-watermarking a segment of a video that has an existing watermark embedded therein in accordance with an exemplary embodiment. At 2102, a value of an existing watermark in a content segment is detected. At 2104, it is determined whether a new value that is designated for embedding is the same as the value of the existing watermark. At 2106, upon a determination that the new value is designated for embedding is not the same as the value of the existing watermark, an inserter manifest is used to obtain an alternate data corresponding to the new value. At 2108, the new value is inserted into the segment. At 2110, the inserter manifest is updated to include alternate data corresponding to the existing watermark.

FIG. 22 illustrate a set of operations that can be carried out for facilitating insertion of a watermark into an encrypted video in accordance with an exemplary embodiment. At 2202, a portion of a video content is decrypted. At 2204, the decrypted portion is processed to generate an inserter manifest comprising at least a first and a second alternative data. At 2206, upon a determination that a size of the first or the second alternate data is not a multiple of encryption block size, the size of the first or the second alternate data is increased to become a multiple of encryption block size. At 2208, the first and the second alternate data is encrypted using an encryption key used for encrypting the video, thereby generating an inserter manifest.

FIG. 23 illustrate a set of operations that can be carried out for identification of a watermark within an embedded content in accordance with an exemplary embodiment. At 2302, an embedded content is obtained. At 2304, a database of extraction manifests is searched to obtain one or more extraction manifests that potentially match the embedded content. At 2306, each of the obtained extraction manifests is iteratively used to perform a watermark extraction process. At 2308, upon a successful extraction of a watermark message, an indication that the embedded content has been identified is provided.

As shown in various figures of the present application, such as FIGS. 2, 3(a), 3(b), 9 and others, 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, integrate(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 (psT) 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 their 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.

Claims

1. A method for selecting an area within a video content for insertion of watermarks, the method comprising: (a) selecting a candidate area within a frame of the video content that is smaller in size that the frame itself;(b) adding a first watermark value to the selected candidate area to obtain a first version of the area;(c) adding one or more noise components to the first version of the area to obtain a noisy first version of the area;(d) conducting a watermark extraction operation on the noisy first version of the area to obtain a first correlation value;(e) adding a second watermark signal to the selected candidate area to obtain a second version of the area;(f) adding one or more noise components to the second version of the area to obtain a noisy second version of the area;(g) conducting a watermark extraction operation on the noisy second version of the area to obtain a second correlation value;(h) selecting one or more pseudo-random offset values to select a different candidate area within the frame for adding the first watermark value or for adding the second watermark value;(i) repeating operations (a) through (g) until all pixels of the frame have been selected as part of one or more of the selected candidate areas, wherein in each iteration of operations (a) through (g) the values obtained for the first correlation value and the second correlated value are stored; and(j) designating one or more of the selected areas that produced the largest first correlation value or the largest second correlation value for the insertion of watermarks.

2. The method of claim 1, further comprising conducting a spatial psychovisual analysis on one or more frame frames that include the designated selected area(s), the spatial psychovisual analysis comprising: applying a non-linear inverse gamma curve to luminance components of the one or more video frames corresponding to the human visual system response in dark areas;performing a Laplacian or a Gaussian pyramid operation multiple times at multiple resolutions on the one or more video frames subsequent to the applying of the non-linear inverse gamma curve to detect highly textured areas; andperforming an edge detection operation to detect edge features within the one or more frames.

3. The method of claim 1, further comprising: embedding the first watermark value in the designated area of the frame to produce a first embedded version of the frame;embedding the first watermark value in the designated area of the frame to produce a first embedded version of the frame;re-encoding the first and the second versions of the frame to obtain a first and a second encoded version of the frame, respectively;decoding the first and second versions of the encoded frames;comparing one or more measures of quality associated with the decoded first and second versions with corresponding one or more reference measures of quality; andbased on the comparing, making a determination to accept or reject the frame as a frame that is suitable for watermark insertion.

4. A computer program product stored on a one or more non-transitory computer readable media, comprising: program code for (a) selecting a candidate area within a frame of the video content that is smaller in size that the frame itself;program code for (b) adding a first watermark value to selected candidate area to obtain a first version of the area;program code for (c) adding one or more noise components to the first version of the area to obtain a noisy first version of the area;program code for (d) conducting a watermark extraction operation on the noisy first version of the area to obtain a first correlation value;program code for (e) adding a second watermark signal to the selected candidate area to obtain a second version of the area;program code for (f) adding one or more noise components to the second version of the area to obtain a noisy second version of the area;program code for (g) conducting a watermark extraction operation on the noisy second version of the area to obtain a second correlation value;program code for (h) selecting one or more pseudo-random offset values to select a different candidate area within the frame for adding the first watermark value or for adding the second watermark value;program code for (i) repeating operations (a) through (g) until all pixels of the frame have been selected as part of one or more of the selected candidate areas, wherein in each iteration of operations (a) through (g) the values obtained for the first correlation value and the second correlated value are stored; andprogram code for (j) designating one or more of the selected areas that produced the largest first correlation value or the largest second correlation value for the insertion of watermarks.

5. The computer program product of claim 4, further comprising program code for conducting a spatial psychovisual analysis on one or more frame frames that include the designated selected area(s), the spatial psychovisual analysis comprising: applying a non-linear inverse gamma curve to luminance components of the one or more video frames corresponding to the human visual system response in dark areas;performing a Laplacian or a Gaussian pyramid operation multiple times at multiple resolutions on the one or more video frames subsequent to the applying of the non-linear inverse gamma curve to detect highly textured areas; andperforming an edge detection operation to detect edge features within the one or more frames.

6. The computer program product of claim 4, further comprising: program code for embedding the first watermark value in the designated area of the frame to produce a first embedded version of the frame;program code for embedding the first watermark value in the designated area of the frame to produce a first embedded version of the frame;program code for re-encoding the first and the second versions of the frame to obtain a first and a second encoded version of the frame, respectively;program code for decoding the first and second versions of the encoded frames;program code for comparing one or more measures of quality associated with the decoded first and second versions with corresponding one or more reference measures of quality; andprogram code for based on the comparing, making a determination to accept or reject the frame as a frame that is suitable for watermark insertion.

7. A device, comprising: a processor; anda memory comprising processor executable code, the processor executable code when executed by the processor configures the device to:(a) select a candidate area within a frame of the video content that is smaller in size that the frame itself;(b) add a first watermark value to the selected candidate area to obtain a first version of the area;(c) add one or more noise components to the first version of the area to obtain a noisy first version of the area;(d) conduct a watermark extraction operation on the noisy first version of the area to obtain a first correlation value;(e) add a second watermark signal to the selected candidate area to obtain a second version of the area;(f) add one or more noise components to the second version of the area to obtain a noisy second version of the area;(g) conduct a watermark extraction operation on the noisy second version of the area to obtain a second correlation value;(h) select one or more pseudo-random offset values to select a different candidate area within the frame for adding the first watermark value or for adding the second watermark value;(i) repeat operations (a) through (g) until all pixels of the frame have been selected as part of one or more of the selected candidate areas, wherein in each iteration of operations (a) through (g) the values obtained for the first correlation value and the second correlated value are stored; and(j) designate one or more of the selected areas that produced the largest first correlation value or the largest second correlation value for the insertion of watermarks.

8. The device of claim 7, wherein, the processor executable code when executed by the processor, configures the device to: conduct a spatial psychovisual analysis on one or more frame frames that include the designated selected area(s), including the following:apply a non-linear inverse gamma curve to luminance components of the one or more video frames corresponding to the human visual system response in dark areas;perform a Laplacian or a Gaussian pyramid operation multiple times at multiple resolutions on the one or more video frames subsequent to the applying of the non-linear inverse gamma curve to detect highly textured areas; andperform a edge detection operation to detect edge features within the one or more frames.

9. The device of claim 7, wherein, the processor executable code when executed by the processor, configures the device to: embed the first watermark value in the designated area of the frame to produce a first embedded version of the frame;embed the first watermark value in the designated area of the frame to produce a first embedded version of the frame;re-encode the first and the second versions of the frame to obtain a first and a second encoded version of the frame, respectively;decode the first and second versions of the encoded frames;compare one or more measures of quality associated with the decoded first and second versions with corresponding one or more reference measures of quality; andbased on the comparing, make a determination to accept or reject the frame as a frame that is suitable for watermark insertion.