The present invention relates to a method for creating a list of acceptable watermarks that can be applied to compressed video streams.
Today, the demand for digital watermarking as an antipiracy technology is strong. To make it more difficult for pirates to circumvent watermarks it is important for many potential watermarks to be proposed and used. However, it is important for watermarks to not interfere with the intended viewing experience for the intended audience. As such, a need exists for more efficient watermarking techniques. As such, a goal of this invention is to generate a list of possible changes generally associated with watermarking that are CABAC/AVC (Context-based Adaptive Binary Arithmetic Coding/Advanced Video Compression) compliant and yet do not create visible artifacts.
A method for creating a list of acceptable watermarks comprises accessing encoded data; accessing, generating, or compiling a list of changes to the encoded data; removing changes that do not meet requirements, e.g. those that cause artifacts, thereby creating a filtered list of filtered changes; and applying at least one of the filtered changes in the filtered list to the encoded data. The encoded data can be compressed video data that can be in a CABAC-encoded H.264/AVC video stream. The filtered changes can be acceptable watermarks. The method can include the steps of determining motion vector differentials to at least one reference block and determining motion vector differentials of at least one current block to the at least one reference block. A comparison of the motion vector differentials can be used to filter the changes out of the list. The method can include determining syntax elements of the current blocks and changes to the current blocks; and setting motion vector differential values into at least 3 categories: a first category for values equal to zero, a second category is for a value or values above zero and below a maximum value and a third category is for a value or values above values in the second category to the maximum value. Additionally, the method can include applying a prefix value to the syntax element for motion vector differential values in the second category; and applying a suffix value to the syntax element for motion vector differential values in the second category. Further, the method can comprise determining coding variable ranges for the current block and changes to the current block, wherein the coding variable ranges are the possible values for a given bit length; and comparing the coding variable ranges for the changes to the motion vector differential values for current blocks; filtering changes that have coding variable ranges that do not contain the motion vector differential values of the current blocks; and determining bit lengths of the current block and changes to the current blocks. The method can include comparing bit lengths of the current blocks to changes to the current blocks; and filtering changes that have bit lengths not equal to the bit lengths of the current blocks, wherein the filtering of changes based on bit lengths can be done in combination with the filtering based in coding variables determinations.
A CABAC encoding engine or the like is provided that is adapted to perform the method comprising: accessing video data; accessing or generating a list of watermarks or possible changes to the video data; determining syntax elements for a current block of video data and syntax elements of the current block with the watermarks; removing watermarks based on differences in the syntax elements between the current block and the current block with watermarks, thereby creating filtered list of accepted watermarks. The removal step in the engine or the like can further include (1) determining coding variable ranges for the current block and current block with watermarks from the list; comparing the coding variable ranges for the current block and current blocks with watermarks from the list; and filtering out watermarks that yield coding variable ranges outside the coding variable ranges of the current block; and/or include (2) determining bit lengths of the current block and the current block with watermarks from the list; comparing bit lengths of the current block and current block with watermarks from the list; and removing watermarks that yield bit lengths not equal to the bit lengths of the current blocks. A further removal step can be employed, which removes accepted changes that are not robust enough or cause artifacts, if applied to the current block.
The invention will now be described by way of example with reference to accompanying drawings.
Embodiments of the invention will now be described generally within the context of CABAC encoded H.264/AVC video streams. However, the embodiments can have broader applications.
It is important to first point out that CABAC-encoded H.264/AVC video streams can include encoded motion vector differentials (mvd). In H.264, many blocks of pixel values are coded by first predicting their values from previously coded data and then coding the difference between this prediction and the actual values. One method of prediction, called inter-prediction, predicts the current block from a similarly sized block of data in a different frame, called a reference frame. This reference block is identified by the index of the reference frame and a set of motion vectors indicating the horizontal and vertical offsets of the reference block compared to the location of the current block.
The motion vectors of adjacent blocks can be correlated with each other. In order to exploit this correlation, H.264 can apply predictive coding to the motion vectors. The motion vectors for one block are coded by first predicting their values from previously coded data and then coding the difference between this prediction and the actual motion vector values.
This difference, called a motion vector differential (mvd), is the focus of at least one implementation. It is also an example of a syntax element.
Motion vector differential values of 0 are simply represented with the binary symbol 0. This 0 is sent to the CABAC writer along with a context index. The CABAC writer will use the context and the binary symbol as inputs and will modify the context. It will suffice to note that the coding of this 0 symbol indicating a zero value mvd is affected by and in turn affects a CABAC context. All other mvds are represented with a sign and a magnitude. The magnitude is coded first, followed by the sign. Motion vector differentials with a magnitude between 1 and 8 can be coded with a single value called an mvd prefix. Larger mvds will also require an mvd suffix. These two values are coded separately as described below.
Regarding encoding of mvd prefixes, a new value, called mvdm, is defined as abs(mvd)-1. For values of mvdm between 0 and 7 inclusive, mvdm indicates the number of binary 1 symbols to follow in the prefix. These 1 symbols are terminated with a binary 0 symbol. For values of mvdm 8 or higher, eight 1 symbols are written to the prefix and the prefix is followed by a suffix. The coding of the mvd prefix is summarized in Table 1.
Note that an mvd with magnitude 9 or higher will have a prefix of all 1's indicating that this value also has an mvd suffix that is to be coded. Each of the symbols in the mvd prefix is sent to the CABAC writer along with a corresponding context index.
Regarding encoding of mvd suffixes, all mvds with magnitude 9 or higher will require an mvd suffix to be coded. The suffix will code the value mvdm-8. This coding is performed in DecodeBypass mode (Refer to H.264 Specification Table 9-25. ITU-T H.264 Standard: Advanced video coding for generic audiovisual services, 2005/03). This mode uses equal probability ExGolomb (EpExGolomb) coding. An important aspect of EpExGolomb coding is that no context is used by the CABAC writer. Similarly, no context is affected by the CABAC writing of a symbol. The implication of this, as discussed in the attached application, is that it may be possible to change the mvd suffix to another value with equal length without introducing any CABAC or AVC decoding errors.
The mvd suffix is used to code the amount by which the absolute value of the mvd exceeds 9. This can be expressed as mvdm-8. This difference is binarized and the binary symbols are sent to the EpExGolomb writer.
The binarization of the suffix is summarized in Table 2, where xxx represents the standard binary representation of the mvdm.
The whole binarization process of mvd magnitude is summarized in Table 3.
There can be one or more implementations for modifying a CABAC-encoded H.264/AVC video stream. At least one such implementation involves two steps: an analysis stage where a list of changes is created and an embedding stage where the changes are applied. The analysis stage can be roughly described as a list creation process followed by a set of list filtering processes. The major difficulty is in the list creation process. The output of this process is a list of changes, any of which can be made without disrupting the AVC/CABAC compliance of the bitstream. The filtering operations are designed to remove changes that would introduce visible artifacts, remove changes that would be difficult to recover, and generate a set of changes that are compliant with other external constraints such as payload constraints and other application constraints. As such, embodiments address the implementation of the list creation process and uses portions of a CABAC arithmetic coder to identify valid alternative motion vector differential rear-suffixes.
In one example that involves an alternative MVD collection, all or part of the identifying of valid alternative motion vector differential rear-suffixes is implemented inside of the function that performs this EpExGolomb coding. Of particular interest in this case is that this function is called to code an mvd suffix value.
For each suffix value, a search for other suffix values that can be substituted without interfering with the CABAC or AVC syntax. The goal of this part of the watermarking process is to generate a list of all possible changes that remain CABAC/AVC compliant. Later this list can be filtered by other criteria. First, the process of collecting alternative values as CBC (Changeable Block Collection) is defined. The term CBC is used to describe the process of identifying the alternative mvd magnitude values.
From Table 2 and Table 3, one can see that there are ranges of mvd suffices that all lead to the same binarization length. For example, all of the mvd magnitudes from 17 to 32 will have a binarization value consisting of 16 symbols: 10 prefix symbols and 6 suffix symbols. For a given mvd with magnitude greater than 8, there is a set of other mvds that will have the same binarization length. Each of these other mvd magnitudes in the set are potential alternative values for the given mvd magnitude. The method disclosed here examines each of these other mvds, one at a time, to determine their suitability as alternative values. This determination is based on the coding variables and the encoded bit length. Specifically, the coding variables inspected are “cod1Low” and “bitOutstanding.” This can be better appreciated by referring to H.264spec
In the example above, it was stated that for mvd magnitudes in the range 17-32, the suffix has 6 symbols. But the first two symbols are fixed to be 1 0 for the entire set in the range. Only the last 4 symbols can differ. At least one actual implementation treats these two parts differently. The fixed part of the suffix is defined as the fore-suffix and the variable part is defined as the rear-suffix. For the 8 mvd magnitudes in the range 9-16, the rear-suffix is 3 symbols long. For the 16 mvd magnitudes in the range 17-32, the rear-suffix is 4 symbols long, and so on.
The method treats the CABAC writer as a black box. A potential alternative value is provided as input to the CABAC writer and the encoded bit length and the effect on the coding variables can be observed or considered. If these are the same as those obtained with the original value, then the alternative value is accepted as a valid alternative and is saved to the list. Otherwise, it is not a valid alternative and will not be saved.
Note that while the coding variable “bitOutstanding” is available in the bypass encoding process per H.264/AVC Specification
An approach is to first code the true rear-suffix, saving the coding variables before and after coding, then to simulate the coding of all alternatives and to compare their pre-coding and post-coding variable states with the saved states. In at least one embodiment, it was found to be simpler to modify this approach slightly. After coding the fore-suffix, a simulation of the coding of the true rear-suffix is performed, wherein the coding variables were saved before and after simulated coding. A simulation of the coding of all alternatives was performed and a comparison of their pre-coding and post-coding variable states with the saved states was done. This was followed by coding of the true rear-suffix as normal.
The approach outlined specifically in
Changeable block collection (CBC) architecture in encoder based CBC will now be addressed. Due to the fact that the bitOutstanding is not available in the CABAC decoder, the collection can only be done in the CABAC encoding process.
Transcoder based changeable block collection (CBC) will now be discussed with reference to
Several of the implementations and features described herein may be used in the context of the H.264/MPEG-4 AVC (AVC) standard. However, these implementations and features may be used in the context of another existing standard or future standard, or in a context that does not involve a standard. Although specific examples of the use of the invention having been described, it is important to point out that features can be adapted for other implementations.
The uses described herein may be implemented in, for example, a method or process, an apparatus, a software program, a datastream, or a signal. Even if only discussed in the context of a single form of implementation such as being discussed only as a method, the implementation or features discussed may also be implemented in other forms such as an apparatus or program. An apparatus may be implemented in, for example, appropriate hardware, software, and firmware. The methods can be further implemented in, for example, an apparatus such as a computer or other processing device. Additionally, the methods may be implemented by instructions being performed by a processing device or other apparatus, and such instructions may be stored on a computer readable medium such as a CD, or other computer readable storage device, or an integrated circuit. Further, a computer readable medium can store the data values produced by an implementation.
As should be evident to one of skill in the art, implementations may also produce a signal formatted to carry information that may be, for example, stored or transmitted. The information may include, for example, instructions for performing a method, or data produced by one of the described implementations. For example, a signal may be formatted to carry a watermarked stream, an unwatermarked stream, or watermarking information, for example.
Additionally, many uses can be applied to one or more of an encoder, a decoder, a post-processor processing output from a decoder, or a pre-processor providing input to an encoder.
It is important to point out that visible artifacts sought to be removed can be changes in a displayed video that a human viewer can see or notice. Such an artifact can be objectionable. Furthermore, the changes that are deemed acceptable can be those which cause a change in color, intensity, and/or a minute feature (such a change in the direction of a blade of grass in background) that are so small that a human viewer could not detect or notice them by merely seeing the video with their eyes.
This application claims the benefit, under 35 U.S.C. §365 of International Application PCT/US2009/004689, filed Aug. 17, 2009, which was published in accordance with PCT Article 21(2) on Feb. 25, 2010 in English and which claims the benefit of U.S. provisional patent application No. 61/189,430, filed Aug. 19, 2008.
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/US2009/004689 | 8/17/2009 | WO | 00 | 2/18/2011 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2010/021682 | 2/25/2010 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
5867109 | Wiedeman | Feb 1999 | A |
6009176 | Gennaro et al. | Dec 1999 | A |
6064661 | Benn | May 2000 | A |
6341350 | Miyahara et al. | Jan 2002 | B1 |
6373960 | Conover et al. | Apr 2002 | B1 |
6415041 | Oami et al. | Jul 2002 | B1 |
6553127 | Kurowski | Apr 2003 | B1 |
6687384 | Isnardi | Feb 2004 | B1 |
6894628 | Marpe et al. | May 2005 | B2 |
6900748 | Marpe et al. | May 2005 | B2 |
7113612 | Sugahara et al. | Sep 2006 | B2 |
7159117 | Tanaka | Jan 2007 | B2 |
7197164 | Levy | Mar 2007 | B2 |
7286710 | Marpe et al. | Oct 2007 | B2 |
7646881 | Zarrabizadeh | Jan 2010 | B2 |
7839312 | Tanaka et al. | Nov 2010 | B2 |
7865034 | So | Jan 2011 | B2 |
7974714 | Hoffberg | Jul 2011 | B2 |
8121341 | Tapson et al. | Feb 2012 | B2 |
8189854 | Watson | May 2012 | B2 |
8559501 | Chen et al. | Oct 2013 | B2 |
8571256 | Tourapis et al. | Oct 2013 | B2 |
8588459 | Bloom et al. | Nov 2013 | B2 |
8824727 | Zou et al. | Sep 2014 | B2 |
20020071593 | Muratani | Jun 2002 | A1 |
20020097892 | Oami et al. | Jul 2002 | A1 |
20020136428 | Sugahara et al. | Sep 2002 | A1 |
20030070075 | Deguillaume et al. | Apr 2003 | A1 |
20030152225 | Kunisa | Aug 2003 | A1 |
20040017852 | Garrido et al. | Jan 2004 | A1 |
20040168110 | Fuldseth et al. | Aug 2004 | A1 |
20040247154 | Bodo et al. | Dec 2004 | A1 |
20050044411 | Somin et al. | Feb 2005 | A1 |
20050069169 | Zarrabizadeh | Mar 2005 | A1 |
20050123207 | Marpe et al. | Jun 2005 | A1 |
20050207499 | Hwang et al. | Sep 2005 | A1 |
20060078292 | Huang et al. | Apr 2006 | A1 |
20060222344 | Ukai | Oct 2006 | A1 |
20060236130 | Ito et al. | Oct 2006 | A1 |
20060269096 | Kumar et al. | Nov 2006 | A1 |
20070053438 | Boyce et al. | Mar 2007 | A1 |
20070110033 | Tu et al. | May 2007 | A1 |
20070201720 | Rodriguez et al. | Aug 2007 | A1 |
20070242862 | Watson et al. | Oct 2007 | A1 |
20080009272 | Toledano | Jan 2008 | A1 |
20080063071 | Suzuki | Mar 2008 | A1 |
20080165849 | Moriya et al. | Jul 2008 | A1 |
20080247469 | Vadapalli et al. | Oct 2008 | A1 |
20090279603 | Chen et al. | Nov 2009 | A1 |
20090290750 | Tapson et al. | Nov 2009 | A1 |
20110129116 | Thorwirth | Jun 2011 | A1 |
20110176610 | He et al. | Jul 2011 | A1 |
20110222723 | He et al. | Sep 2011 | A1 |
20110293016 | Suzuki | Dec 2011 | A1 |
20120237078 | Watson et al. | Sep 2012 | A1 |
20130058395 | Nilsson et al. | Mar 2013 | A1 |
20130058405 | Zhao et al. | Mar 2013 | A1 |
20130208814 | Argyropoulos et al. | Aug 2013 | A1 |
Number | Date | Country |
---|---|---|
1301462 | Jun 2001 | CN |
101218830 | Jul 2008 | CN |
101236645 | Aug 2008 | CN |
1515506 | Mar 2005 | EP |
1909508 | Apr 2008 | EP |
11331622 | Nov 1999 | JP |
11341450 | Dec 1999 | JP |
11346302 | Dec 1999 | JP |
2001119557 | Apr 2001 | JP |
2003125227 | Apr 2003 | JP |
2003134329 | May 2003 | JP |
2003179740 | Jun 2003 | JP |
2003244419 | Aug 2003 | JP |
2003529297 | Sep 2003 | JP |
2004221715 | Aug 2004 | JP |
2005533410 | Nov 2005 | JP |
2006279992 | Oct 2006 | JP |
2006287364 | Oct 2006 | JP |
2006303580 | Nov 2006 | JP |
2007053687 | Mar 2007 | JP |
2007525074 | Aug 2007 | JP |
WO 2004066206 | Aug 2004 | WO |
WO 2007067168 | Jun 2007 | WO |
WO2008065814 | Jun 2008 | WO |
WO 2008118145 | Oct 2008 | WO |
WO 2008154041 | Dec 2008 | WO |
Entry |
---|
Zou, et al., “H.264/AVC Stream Replacement Technique for Video Watermarking”, ICASSO 2008, IEEE, pp. 1749-1752. |
Mobasseri, et al., “Authentication of H.264 streams by direct watermarking of CAVLC blocks”, Dep. of Electrical & Computer Engineering, SPIE-IS&T, vol. 6505, 2007, pp. 1-5. |
Copy of International Search Report, Jan. 21, 2010. |
Nguyen et al., “A Fast Watermarking System for H.264/AVC Video,” 2006 IEEE, Dept. of Electronic Engineering, La Trobe University, Bundoora, Australia, pp. 81-84. |
Seo et al., “Low-Complexity Watermarking Based on Entropy Coding in H.264/AVC,” IEICE Trans. Fundamentals, vol.E91-A, No. 8, Aug. 2008. |
Noorkami, “Secure and Robust Compressed-Domain Video Watermarking for H.264,” A Thesis Presented to The Academic Faculty at Georgia Institute of Technology, 124 pages, Aug. 2007. |
Song et al , “A Data Embedded Video Coding Scheme for Error-Prone Channels”, IEEE Transactions on Multimedia, vol. 3, No. 4, Dec. 1, 2001, pp. 415-423. |
Liu et al., “Data Hiding in Inter and Infra Prediction Modes of h.264/AVC”, IEEE Int'l Symposium on Circuits and Systems, 2008 (ISCAS 2008), May 18, 2008, pp. 3025-3028. |
Profrock et al., “H.264/AVC Video Authentication using Skipped Macroblocks for an Erasable Watermark”, Visual Communications and Image Processing, 2005 SPIE, Bellinigham, WA 2005. |
Hu, “Information Hiding Based on Intra Prediction Modes for H.264 AVC”, Multimedia and Expo, 2007 IEEE, International Conference, IEEE PI, Jul. 1, 2007, pp. 1231-1234. |
Winkler, “Preceptual Quality Assessments for Video Watermarking”, Proceedings from the IEEE Conference on Standardizaton and Innovation in Information Technology, Oct. 18, 2002, pp. 90-94. |
Number | Date | Country | |
---|---|---|---|
20110142419 A1 | Jun 2011 | US |
Number | Date | Country | |
---|---|---|---|
61189430 | Aug 2008 | US |