Abstract:
Disclosed is a method for the detection of pseudo-symmetric watermarks in an information signal. The method includes receiving the information signal, wherein the watermark is embedded in respective sections of the information signal by tiling a finite number of a plurality of watermark patterns, accumulating the sections, and correlating the accumulated sections with a sum of the plurality of watermark patterns. In particular, the information signal is folded as if there was only a single basic pattern. The presence of the watermark is then detected by a cyclic sliding correlating.

Description:
FIELD OF THE INVENTION 
     The invention relates to a method and arrangement for detecting a watermark in an information signal. 
     BACKGROUND OF THE INVENTION 
     Various methods of embedding a watermark in an information (e.g. video, audio) signal, and corresponding methods of detecting said watermark, are known in the art. 
     International patent application WO99/12331 discloses a known embedding and detecting method. In this prior art method, different watermark patterns are embedded in respective sections of an information signal (here: image blocks into which the image is divided). Such a watermark, which is built up from a finite number of basic pattern by tiling, is herein referred to as a pseudo-symmetric watermark. 
     OBJECT AND SUMMARY OF THE INVENTION 
     It is an object of the invention to provide a method and arrangement for detecting the watermark. 
     To this end, the method comprises the steps of accumulating said sections, and correlating the accumulated sections with the sum of the basic watermark patterns. 
     The invention is based on the insight that a known methodology of detecting symmetric watermarks can also be applied to pseudo-symmetric watermarks. International patent application WO 99/45705 discloses a art method of embedding and detecting symmetric watermarks. In this method, a watermark is embedded in a video signal by repeating a single small-sized basic watermark pattern over the extent of the video image. This “tiling” operation allows the watermark detection process to search the watermark over a relatively small space and improves the reliability of detection. A data payload is encoded into the basic watermark tile. As disclosed in WO 99/45705, the watermark is detected by accumulating or “folding” the sections of the image in a buffer (128×128 pixels in a practical embodiment) and correlating the buffer contents with the single 128×128 basic watermark pattern. Applying Symmetrical Phase Only Matched Filtering (SPOMF) in the detector renders the relative position of the reference watermark with respect to the image irrelevant. The known detector is thus invariant with respect to translation and cropping, two processes that the image may have undergone prior to watermark detection. SPOMF also makes it possible to easily encode a multi bit payload in the basic watermark pattern. 
     The inventors have found that the detection method known from WO 99/45705 can also effectively and reliably be applied to pseudo-symmetric watermarks if the following conditions are fulfilled: (1) each of the multiple patterns occurs with approximately equal probability, (2) the patterns are pairwise orthogonal or at least have little correlation, and (3) the patterns are all of equal size. 
     A particular advantage of the invention is that complicated circuits of different watermark detectors can be shared, if multimedia content is watermarked by pseudo-symmetric as well as symmetric watermarks. It is currently envisaged to merge two such different watermark embedding methods (although not necessarily the two methods mentioned above). 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         FIG. 1  shows schematically an image with an embedded pseudo-symmetric watermark in the form of multiple basic watermark patterns W 1  . . . W N . 
         FIG. 2  shows a schematically an embodiment of a watermark detector in accordance with the invention. 
         FIG. 3  shows a diagram to illustrate an operation carried out by the watermark detector which is shown in  FIG. 2 . 
     
    
    
     DESCRIPTION OF EMBODIMENTS 
       FIG. 1  shows schematically an image with an embedded pseudo-symmetric watermark in the form of multiple basic watermark patterns W 1  . . . W N . 
       FIG. 2  shows a practical embodiment of a watermark detector in accordance with the invention. The detector receives possibly watermarked images Q. The image (or a number of accumulated video frames) is partitioned into blocks having the size M 1 ×M 2  of the basic watermark pattern (here 128×128). The blocks are then stacked in a buffer q of size M 1 ×M 2  as illustrated in  FIG. 3 . These operations are carried out by a folding and buffer circuit  31 . 
     By folding the suspect signal as if there was only a single basic pattern, the fold buffer will have the sum pattern W=W 1 + . . . +W N  as a strong component. The presence of the watermark can then be detected by a cyclic sliding correlating the buffer contents with W. The reliability thereof down with a factor Sqrt[N] with respect to optimal correlation (i.e. synchronized correlation with the full signal watermark). 
     In order to correlate the buffer contents with W, the detector comprises an adding stage  39  in which the basic watermark patterns W 1 –W N  are sample wise added. 
     The operation of the detector further corresponds with the disclosure of WO 99/45705 and will here briefly be repeated. Computing the correlation of a suspect information signal q with a watermark pattern w comprises computing the inner product d=&lt;q,w&gt; of the information signal values and the corresponding values of the watermark pattern. For the two-dimensional M 1 ×M 2  image block q={q ij } and watermark pattern W={w ij }, the inner product can be written in mathematical notation as: 
     
       
         
           
             d 
             = 
             
               
                 1 
                 
                   
                     M 
                     1 
                   
                   ⁢ 
                   
                     M 
                     2 
                   
                 
               
               ⁢ 
               
                 
                   ∑ 
                   
                     i 
                     = 
                     1 
                   
                   
                     M 
                     1 
                   
                 
                 ⁢ 
                 
                   
                     ∑ 
                     
                       j 
                       = 
                       1 
                     
                     
                       M 
                       2 
                     
                   
                   ⁢ 
                   
                     
                       q 
                       ij 
                     
                     ⁢ 
                     
                       
                         w 
                         ij 
                       
                       . 
                     
                   
                 
               
             
           
         
       
     
     Because the suspect image Q may have undergone manipulations such as translation or cropping prior to the watermark detection, the detector does not know the spatial location of the watermark pattern W with respect to the boundaries of image block q. A multiple of correlations d k  must therefore be calculated for all possible shift vectors k (k x  pixels horizontally and k y  pixels vertically): 
               d   k     =       1       M   1     ⁢     M   2         ⁢       ∑     i   =   1       M   1       ⁢       ∑     j   =   1       M   2       ⁢       q   ij     ⁢     w       i   +     k   x       ,     j   +     k   y                         
Said correlation values d k  can be simultaneously computed using the (Fast) Fourier Transform. Both the contents of buffer q and the basic watermark pattern W are subjected to a Fast Fourier Transform (FFT) in transform circuits  32  and  33 , respectively. These operations yield:
   {circumflex over (q)}=FFT ( q ) and   ŵ=FFT ( w ), 
where {circumflex over (q)} and ŵ are sets of complex numbers.
 
     Computing the correlation is similar to computing the convolution of q and the conjugate of W. In the transform domain, this corresponds to:
 
 {circumflex over (d)}={circumflex over (q)}               conj ( ŵ )
 
where the symbol           denotes point wise multiplication and conj( ) denotes inverting the sign of the imaginary part of the argument. In  FIG. 3 , the conjugation of ŵ is carried out by a conjugation circuit  34 , and the point wise multiplication is carried out by a multiplier  35 . The set of correlation values d={d k } is now obtained by inverse Fourier transforming the result of said multiplication:
 
 d=IFFT ( {circumflex over (d)} )
 
which is carried out by an inverse FFT circuit  36 . The correlation values d k  are subsequently compared with a given threshold in a threshold circuit  37 . The image is detected to be watermarked if one of the correlation values has a significant peak, i.e. larger than the threshold.

     If it is necessary to detect whether the individual patterns W 1 –W N  are embedded, the same circuit can be used. The pattern to be checked (W 1 , W 2 , etc.) is then applied only to the arrangement which is shown in  FIG. 2 . 
     In a further embodiment of the method according to the invention, the size-M fold buffer is used to retrieve the position of the 128×128 tiling grid. Using the synchronized tiling grid, the the partial correlations C i,j =&lt;Y i ,W −j &gt; are computed, where i is the ith suspect signal tile, W j  is as before, and &lt; &gt; denotes the inner product. This reduces the translation search to steps over the grid, using only the partial correlation values C i,j . If there is additional structure in the full watermark, e.g. in case of a higher level symmetry in terms of the tiles W i , then very efficient detection is possible. 
     The invention can be summarized as follows. A pseudo-symmetric watermark is watermark pattern that is built up from a finite number of basic pattern by tiling. The well-known WaterCast pattern that is built up from one single pattern is a special case of this, and is referred to as a symmetric watermark pattern. It is well known that symmetric patterns allow an efficient detection method that consist of two phases, viz. first an accumulation phase, followed by a cyclic sliding correlation with the basic pattern over the accumulated data. The invention provides a detection method for pseudo-symmetric watermarks with a similar reduction in complexity as with symmetric watermarks, i.e. an accumulation phase followed by one or more cyclic sliding correlation steps (using the finite number of basic patterns). Let W 1 , . . . , W N  be the set of basic patterns, all of size M. The suspect signal is folded ( 31 ) as if there was only a single basic pattern. The fold buffer will have the sum pattern W=W 1 + . . . +W N  ( 39 ) as a strong component. The presence of the watermark can then be detected by a cyclic sliding correlating with W.