Abstract:
A method comprises accessing encoded video data; accessing a list of watermarks to the encoded video data; determining syntax elements for current blocks of video data and syntax elements of currents blocks with the watermarks; removing watermarks that cause visible artifacts based on differences in the syntax elements between the current blocks and current blocks with watermarks, thereby creating filtered list of acceptable watermarks. The method can further include determining coding variable ranges for the current block and current block with watermarks from the list; comparing the coding variable ranges for the current blocks 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 blocks. Additionally, the method can include determining bit lengths of the current blocks and current blocks with watermarks from the list; comparing bit lengths of the current blocks and current blocks with watermarks from the list; and filtering out watermarks that yield bit lengths not equal to the bit lengths of the current blocks.

Description:
CROSS-REFERENCE 
       [0001]    This patent application claims the benefit of and priority to U.S. Provisional Patent Application No. 61/189,430, filed Aug. 19, 2008, and titled “CHANGEABLE BLOCK LIST”. The provisional application is expressly incorporated herein by reference in its entirety for all purposes. 
     
    
     FIELD OF THE INVENTION 
       [0002]    The present invention relates to a method for creating a list of acceptable watermarks that can be applied to compressed video streams. 
       BACKGROUND OF THE INVENTION 
       [0003]    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. 
       SUMMARY OF THE INVENTION 
       [0004]    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. 
         [0005]    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. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0006]    The invention will now be described by way of example with reference to accompanying drawings. 
           [0007]      FIG. 1  is a block diagram according to the invention illustrating the collection of the valid alternative mvd rear-suffix values and a simulation of encoding. 
           [0008]      FIG. 2  illustrates an encoder-based CBC system architecture. 
           [0009]      FIG. 3  illustrates a transcoder-based framework. 
       
    
    
     DESCRIPTION OF THE INVENTION 
       [0010]    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. 
         [0011]    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. 
         [0012]    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. 
         [0013]    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. 
         [0014]    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. 
         [0015]    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. 
         [0000]                                                        TABLE 1                   Binarization of the mvd prefix            Abs(mvd)   mvdm   mvd prefix                    0   —   0           1   0   1 0       2   1   1 10       3   2   1 110       4   3   1 1110       5   4   1 1111 0       6   5   1 1111 10       7   6   1 1111 110       8   7   1 1111 1110        9+    8+   1 1111 1111                    
Note that an mvd with magnitude 9 or higher will have a prefix of all 1&#39;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.
 
         [0016]    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. 
         [0017]    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. 
         [0018]    The binarization of the suffix is summarized in Table 2, where xxx represents the standard binary representation of the mvdm. 
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE 2 
               
             
             
               
                   
               
               
                 Binarization of the mvd suffix 
               
             
          
           
               
                 abs(mvd) range 
                 mvdm range 
                 Binarization 
               
               
                   
               
               
                  9-16 
                 0-7 
                 0 xxx 
               
               
                 17-32 
                  8-23 
                 10 xxxx 
               
               
                 33-64 
                 24-55 
                 110 xxxxx 
               
               
                  65-128 
                  56-119 
                 1110 xxxxxx 
               
               
                   
               
             
          
         
       
     
         [0019]    The whole binarization process of mvd magnitude is summarized in Table 3. 
         [0000]    
       
         
               
             
               
               
               
               
             
               
               
               
             
               
               
               
               
             
               
               
               
             
           
               
                 TABLE 3 
               
             
             
               
                   
               
               
                 Combined binarization of the mvd magnitude 
               
             
          
           
               
                 abs(mvd) 
                 Coded Prefix 
                 Coded Suffix 
               
               
                   
               
             
          
           
               
                 0 
                 0 
                 N/A 
               
               
                 1 
                 10 
                 N/A 
               
               
                 2 
                 110 
                 N/A 
               
               
                 3 
                 1110 
                 N/A 
               
               
                 4 
                 11110 
                 N/A 
               
               
                 5 
                 111110 
                 N/A 
               
               
                 6 
                 1111110 
                 N/A 
               
               
                 7 
                 11111110 
                 N/A 
               
               
                 8 
                 111111110 
                 N/A 
               
             
          
           
               
                  9-16 
                 111111111 
                 0xxx 
                 (suffix is 4 bits) 
               
               
                 17-32 
                 111111111 
                 10xxxx 
                 (suffix is 6 bits) 
               
               
                 33-64 
                 111111111 
                 110xxxxx 
                 (suffix is 8 bits) 
               
               
                 65-128 
                 111111111 
                 1110xxxxxx 
                 (suffix is 10 bits) 
               
             
          
           
               
                 . . . 
                 . . . 
                 . . . 
               
               
                   
               
             
          
         
       
     
         [0020]    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. 
         [0021]    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. 
         [0022]    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. 
         [0023]    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  FIG. 9-10 , of ITU-T H.264 Standard: Advanced video coding for generic audiovisual services, 2005/03. 
         [0024]    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. 
         [0025]    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. 
         [0026]    Note that while the coding variable “bitOutstanding” is available in the bypass encoding process per H.264/AVC Specification  FIG. 9-10 , of ITU-T H.264 Standard: Advanced video coding for generic audiovisual services, 2005/03, it is not present in the decoding process in H.264/AVC Specification  FIG. 9-5 , of ITU-T H.264 Standard: Advanced video coding for generic audiovisual services, 2005/03. This has herein motivated the implementation of the current method in a CABAC encoder where one can examine the value of this variable. 
         [0027]      FIG. 1  presents an embodiment for collecting all the valid alternative mvd rear-suffix values for a given original value. Two separate CABAC encoding engines are used. The main CABAC encoding engine  100  is used to gather the needed values of coding variables before and after the CABAC encoding of the rear-suffix value. The secondary CABAC encoding engine  121  is used to simulate the encoding process if an alternative rear-suffix value is used. By comparing the values of coding variables, one can conclude whether an alternative rear-suffix value is valid or not. 
         [0028]    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. 
         [0029]    The approach outlined specifically in  FIG. 1  is to first encode the fore-suffix in block  105  followed by saving the coding variables before encoding of the rear-suffix in block  110  in the main CABAC encoding engine  100 . This is followed by encoding of the original rear-suffix in block  115  followed by saving the new states after encoding of the original symbol value in block  120  in the main CABAC encoding engine  100 . The saved coding variables before encoding of the rear suffix in block  115  are then delivered to the secondary CABAC encoding engine  121  to set the coding variable states equal to those before encoding of the rear-suffix in block  130 , while all possible rear-suffix values represented in block  125  are fed into block  130  to be cycled in the secondary CABAC encoding engine  121 . Next is to set the coding variable states equal to those before encoding of the rear-suffix in block  135 . This is followed by comparing in block  140  the new states after encoding of the original symbol values from block  120  with the encoded alternative rear-suffix values in block  135 . If the states are the same then the alternative rear-suffix value is saved and is considered valid. 
         [0030]    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.  FIG. 2  presents an encoder-based CBC system architecture. If the baseband video imagery is available, it will be the input to the CABAC Encoder CBC module which generates all the valid alternative syntax values. If only a compressed video data in block  205  is available, a decoding module will be used to decode the compressed video data in block  210  into baseband imagery in block  220 . Then, the H264/AVC encoder will encode the baseband imagery in block  230  and generate an H.264/AVC compressed bitstream in block  240  together with the data list that identifies, preferably, all the valid alternative syntax values or a syntax element list in block  250 . 
         [0031]    Transcoder based changeable block collection (CBC) will now be discussed with reference to  FIG. 3 . The compression process is a computationally complex and time-consuming process. In a professional authoring environment, the compression is a costly process. If the video is already compressed using H.264/AVC which is represented in block  310 , full decoding and H.264/AVC recompression will not be an economic way to collect the changeable block information.  FIG. 3  shows a transcoder-based framework. The CABAC entropy decoding block only performs the CABAC entropy decoding process, which represented in block  320  of the compressed video data. The decoded syntax values are passed to a CABAC entropy encoder in block  330  which generates the data list that identifies all the valid alternative syntax values or a syntax element list in block  340 . 
         [0032]    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. 
         [0033]    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. 
         [0034]    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. 
         [0035]    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. 
         [0036]    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.