JP2009111480A - Electronic watermark embedding method, device and program, and electronic watermark detection method, device and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To generate a watermark embedding image in which watermark information is easily left even if parallel displacement and lossy compression encoding are applied thereto; and to accurately detect a watermark from the watermark embedding image. <P>SOLUTION: A watermark embedding part identification means 14 identifies a watermark embedding part by providing a displacement amount to coordinates of a compression unit block to disperse an encoding coefficient only in a vertical or horizontal direction of a screen when the image is subjected to parallel displacement based on the size of the compression unit block and a moving range of the parallel displacement. A watermark embedding means 11 embeds watermark information in a watermark embedding part identified by a watermark embedding part identification means 15 of an input image. A correspondence table 16 stores correspondence between the displacement amount identified by the watermark embedding part identification means 15 and the watermark embedding part. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to a digital watermark embedding method, apparatus and program, digital watermark detection method, apparatus and program, and in particular, can generate a watermark-embedded image in which a watermark is likely to remain even if translation and lossy compression are performed. The present invention relates to a digital watermark embedding method, apparatus and program, and a digital watermark detection method, apparatus and program capable of detecting watermark information with high accuracy from the watermark embedded image.

  The technology that embeds watermark information electronically in still images and moving images is intended to protect the copyright and to acquire additional information. Useful for embedding.

  Watermark information embedded in an image may be lost by editing the image, or may be lost by an attack on the image. In order to increase the resistance of the watermark information, it is conceivable to increase the amount of watermark information embedded or to embed the watermark information strongly, but this is a source of image quality degradation.

  Examples of image editing and image attacks include geometric transformation such as image enlargement, reduction, rotation, and translation, compression, and addition of noise.

  In Patent Document 1, a translation amount added to an image is calculated using an alignment signal, and after correcting for the calculated translation amount, an effective region for determining the presence of a digital watermark is determined. An image processing apparatus for determining a digital watermark from the effective area is described.

  Patent Document 2 describes a moving image digital watermarking device in which bit information is composed of a pair of different blocks and this bit information is embedded in an image as watermark information.

  In Patent Document 3, image data of each frame or each field constituting a moving image is separated into data composed of low frequency components and data composed of frequency components other than low frequency components, and the frame direction or field is used as digital watermark information. A digital watermark embedding device is described in which image data having a predetermined frequency in the direction is added to low frequency component data to generate and synthesize low frequency component data with a digital watermark.

In the cited document 4, the amplitude spectrum obtained by two-dimensional discrete Fourier transform of the original image to be watermark-embedded is subjected to logarithmic polar coordinate transformation, and then the rotation obtained by spatial frequency transformation in the angular direction of the logarithmic polar coordinate system and By generating an amplitude spectrum of a watermark to be embedded in an original image in a region that is invariant with respect to parallel movement, and inversely transforming the amplitude spectrum of the watermark into a spatial region of the orthogonal transformation system, a two-dimensional watermark of the orthogonal transformation system is obtained. An electronic watermark embedding device that generates data and embeds it in an original original image is described.
JP 2002-354221 A JP 2002-135736 A JP 2004-172758 A JP 2006-186626 A

  In the image processing apparatus of Patent Document 1, an alignment signal for calculating the amount of translation is used, and an effective region for determining the presence of a digital watermark is determined using this alignment signal. The embedded watermark can be resistant to translation. However, this has a problem that resistance to lossy compression is weak.

  In the moving image digital watermarking device disclosed in Patent Document 2, watermark information is embedded so that energy concentrates on a specific frequency, so that the embedded watermark can have compression resistance. However, this has a problem that resistance to parallel movement is weak.

  In the digital watermark embedding device of the cited document 3, since the digital watermark is embedded in the low frequency component, the digital watermark embedding device is resistant even when compressed at a low bit rate. However, in this case, no measures are taken for providing resistance to the parallel movement of the image.

  In the digital watermark embedding apparatus of the cited document 4, since the digital watermark embedding is performed on a region that is invariable with respect to the parallel movement, the tolerance for the parallel movement of the image is high. However, in this case, no measures are taken for providing resistance to image compression.

  As described above, in the conventional watermark information embedding and detection technology, embedded watermark information can be resistant to either translation or compression, but it is irreversible with translation in the pixel region. Does not have resistance to both reverse compression.

  An object of the present invention is to generate a watermark-embedded image in which watermark information is likely to remain even if parallel translation and lossy compression coding are performed, and to generate watermark information with high accuracy from the generated watermark-embedded image. It is an object to provide a digital watermark embedding method, apparatus and program, digital watermark detection method, apparatus and program that can be detected.

  In order to solve the above-described problem, the present invention provides a size of a compression unit block in a digital watermark embedding method for generating a watermark-embedded image in which watermark information is likely to remain even when parallel translation and lossy compression coding are performed. Based on the movement range of the parallel movement, a shift amount is given to the coordinates of the compression unit block so that the coding coefficient is distributed only in the vertical direction or horizontal direction when the image is translated. A watermark embedding location specifying process for specifying a watermark embedding location, a watermark embedding step for embedding watermark information in the watermark embedding location specified by the watermark embedding location specifying step of the input image, and a watermark embedding location specifying step Correspondence table storage process for storing correspondence table between shift amount and watermark embedding location There is first characterized in that.

  In addition, the present invention is based on an image in which translation and lossy compression encoding are performed on the watermark embedded image generated as described above, and then the amount of movement in decoding and translation is corrected. A watermark detection method for detecting watermark information, comprising: using the correspondence table to obtain a watermark detection location acquisition step for obtaining a location where watermark information is likely to remain corresponding to a movement amount in parallel movement; and the watermark detection location A watermark information detection process for detecting watermark information from a location determined by the acquisition process, or from a location determined by the watermark detection location acquisition process with the location being emphasized over other locations and other locations; and There is a second feature in that

  Furthermore, the present invention is based on an image in which the watermark embedded image generated as described above is subjected to translation and lossy compression encoding, and then subjected to decoding and correction of the amount of translation in translation. An electronic watermark detection method for detecting watermark information, wherein the correspondence table is generated in accordance with a movement amount in parallel movement to generate a correction correspondence table and generated by the correction correspondence table generation step. Using the corrected correspondence table, a watermark detection location acquisition process for obtaining a location where watermark information is likely to remain, and a location obtained by the watermark detection location acquisition process, or placing the location more important than other locations. And a watermark information detection process for detecting watermark information from the part obtained by the watermark detection part acquisition process and other parts. There third feature point.

  The present invention can be realized not only as the method described above but also as an apparatus provided with means for executing the processes described above, and can also be realized as a program for causing a computer to realize the functions of the processes described above.

  According to the present invention, it is possible to generate a watermark embedded image in which watermark information is likely to remain even if parallel translation and irreversible compression encoding are performed on an image having any resolution larger than the block size to which the image encoding process is applied. It is also possible to detect watermark information with high accuracy from the generated watermark embedded image. That is, watermark information can be embedded with resistance to both parallel translation and lossy compression encoding. Thereby, the embedded watermark information can be detected with high accuracy. Thereby, watermark embedding and watermark detection that can support many workflows can be realized.

  First, the basic principle of watermark embedding in the present invention will be described. For images compressed with MPEG or the like, a watermark embedded image in which watermark information is embedded can be generated by operating a specific DCT coefficient. Also, watermark information is embedded in an image on the pixel area by adding or subtracting a value obtained by multiplying the base of single or multiple specific conversion coefficients (specific DCT coefficients) when converted to the frequency domain by a constant. A watermark embedded image can be generated.

  When watermark information is embedded in the image on the pixel area and the watermark embedded image generated thereby is not subjected to translation, even if compression such as DCT or quantization is applied, decoding (dequantization and dequantization) is performed. The watermark information can be detected relatively well from the image after (IDCT). That is, in this case, since the base energy of the specific conversion coefficient embedded as watermark information in the compressed image tends to remain, the watermark information can be detected relatively well. The detection of watermark information can be performed by extracting a specific transform coefficient, and can also be performed by extracting a base of the specific transform coefficient after decoding.

  However, when the translation is performed on the watermark embedded image, the watermark information after DCT is diffused to a DCT coefficient different from the specific DCT coefficient. When the parallel movement of the image is only in the vertical or horizontal direction of the screen, the DCT coefficient is diffused only in the moving direction as will be described below.

  Assuming that the DCT coefficient matrix is X and the inverse DCT operation matrix is D, the DCT coefficient operation by watermark embedding can be regarded as noise superposition with respect to X. ) And expressed by the addition of X and noise matrix N.

  The pixel value when the inverse DCT is applied to the DCT coefficient matrix X ′ and returned to the pixel region is expressed by Expression (2). Equation (2) represents watermark embedding on the pixel region.

The pixel value when the image is translated is expressed by Expression (3). M ₁ and M ₂ are a translation operator for translation in the vertical direction of the screen and a translation operator for translation in the horizontal direction, respectively.

  The first term on the right side of Equation (3) represents an image obtained by translating an image before watermark embedding, and the second term represents diffusion of embedded watermark information. Here, a DCT coefficient matrix when DCT (encoding) is applied to this image is expressed by Equation (4).

The second term on the right side of Equation (4) represents watermark information and is DCT (M ₁ ) × N × DCT (M ₂ ). Here, if the watermark is embedded by adding / subtracting to the (1,1) DCT coefficient, since N has only the (1,1) component, the watermark information on the DCT coefficient is the first line. Or it will be distributed only in the first column. The above is for the I frame, but for the P and B frames, the watermark information is distributed according to the same principle as long as the watermark information is embedded on a specific frequency.

  Equation (5) shows a specific example of the inverse DCT calculation matrix D. Equations (6) and (7) are translation operators that translate the lower pixel in the vertical direction and the right one pixel in the horizontal direction, respectively. A specific example is shown. In addition, the element newly mixed by translation is set to 0.

  FIG. 7 is a diagram showing the relationship between the amount of movement in parallel movement and the diffusion of DCT coefficients. Here, `` 16 '' is embedded as watermark information in the (1,1) DCT coefficient, and the translation amount is (0,0) (no translation), (0,2) (screen horizontal movement), ( 4, 4) (moving in the horizontal and vertical directions of the screen) is shown. When there is no translation, the watermark information appears only in the (1,1) DCT coefficient, as shown in FIG. Further, when the translation is only in the horizontal (vertical) direction of the screen, the watermark information is spread only in one row (one column) as shown in FIG. When the parallel movement is in the horizontal and vertical directions of the screen, the watermark information is diffused as a whole as shown in FIG.

  Here, after watermark information is embedded in an image on a pixel area, parallel translation and compression coding are performed separately for the case where quantization is performed and the case where quantization is not performed. To do.

  First, when quantization is not performed, that is, after translation and compression coding (conversion to the frequency domain), decoding (conversion to the pixel domain) and correction of the translation amount in parallel translation (parallel The case where the reverse of the movement is performed will be described.

  In this case, the energy of the embedded watermark information remains almost completely. In other words, watermark information is embedded by adding the value of Δn to the base of a specific conversion coefficient on the pixel area for a compression unit block of an image, and translation, DCT conversion, inverse DCT (IDCT) conversion, When the movement amount is sequentially corrected, the energy of the watermark information is almost completely restored. Therefore, even after the above processing is sequentially performed, the energy of the watermark information of substantially Δn can be detected. If DCT conversion and inverse DCT conversion can be performed with real number accuracy, Δn is completely stored, so that the energy of the watermark information of Δn can be detected.

Next, when quantization is performed, that is, after each process of translation and compression (DCT transformation, quantization) is performed, expansion (inverse quantization, inverse DCT transformation), the amount of movement in translation A case where each process of correction is performed will be described. In this case, the remaining energy of the watermark information differs depending on the amount of movement in the parallel movement. The rest is roughly divided into the following (i), (ii), and (iii). Here, the horizontal and vertical translation amounts are indicated by s (dx, dy).
(i) When the translation amount is s (0,0), the energy of watermark information tends to remain very much even if quantization is performed.
(ii) When the translation amount is s (dx, 0) (where dx ≠ 0) or s (0, dy) (where dy ≠ 0), even if quantization is performed, In comparison, the energy of watermark information tends to remain.
(iii) When the translation amount is s (dx, dy) (where dx ≠ 0 and dy ≠ 0), the energy of the watermark information hardly remains when quantization is performed.

  The remaining energy of the watermark information varies depending on the value of the quantization parameter. For example, in the case of (i) above, if 100% of the watermark information energy Δn remains, the energy of the watermark information in the case of (ii) above. Δn remains 50%, and in the case of (iii), the energy Δn of watermark information remains 20%. As described above, the remaining energy Δn of the watermark information differs in the cases (i), (ii), and (iii). This is because the watermark energy is more likely to become zero due to quantization and disappear more easily as the absolute value of the watermark dispersed in other frequency components is smaller. In the case of (iii) above, it can be said that the watermark energy is less likely to remain because the absolute value of the watermark dispersed in other frequency components tends to be small.

  Therefore, in order to make the embedded watermark information resistant to translation and compression, the coding coefficient is distributed only in the vertical or horizontal direction when the image is translated, that is, the above ( The watermark embedding location is specified with a shift amount with respect to the coordinates of the compression unit block so that the watermark in the case of (i) or (ii) is always present and is always covered Then, by embedding watermark information in the specified watermark embedding location, the energy of the watermark information is easily left.

  The above is the basic principle of watermark embedding in the present invention, which is collectively shown in FIG. As shown in (1) and (3) of (a) in the figure, when the shift amount k (x, y) of the watermark embedding location with respect to the coordinates of the compression unit block is 0 (shift amount k (x, y) = k (0,0)), s (dx, 0) (where dx ≠ 0), or s (0, dy) (where dy ≠ 0) ) And the watermark is only divided into two blocks, so that the energy of the watermark information tends to remain even if quantization is performed. However, as shown in (2) of (a) in the figure, when a parallel movement of s (dx, dy) (however, dx ≠ 0 and dy ≠ 0) occurs, the above (iii) occurs, and the watermark is 4 Since it is divided into two blocks, the energy of watermark information hardly remains after quantization. FIG. 3 shows the case of s (dx, 0) = s (2,0), s (0, dy) = s (0,2), and s (dx, dy) = s (2,2). However, generally, when the shift amount k (x, y) = k (0,0), the parallel movement amount of the image is s (0, n) or s ( n, 0), the energy of the watermark information can easily remain.

  In order to deal with parallel movements other than those in the case of (a) in the figure, as shown in (b) of the figure, the shift amount k (x, y) of the watermark embedding location with respect to the coordinates of the compression unit block (where x ≠ 0 and Set watermark embedding location as y ≠ 0). For example, k (x, y) = k (−2, −2) is set, and watermark information is also embedded here. Here, even if translation of s (2, dy) or s (dx, 2) occurs, it is covered by the above case (i) or (ii), and the watermark is only divided into two blocks. Therefore, the energy of the watermark information tends to remain even if quantization is performed. Generally, by setting the shift amount k (x, y) = k (a, b) (where a ≠ 0 and b ≠ 0), the parallel movement amount of the image is s In the case of (−a, *) (* is an arbitrary number) or s (*, − b), the energy of the watermark information can easily remain.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings. Below, the case where this invention is implement | achieved as an apparatus is demonstrated.

  FIG. 1 is a block diagram showing an image processing apparatus including an embodiment of a digital watermark embedding apparatus according to the present invention. The image processing apparatus of FIG. 1 includes a watermark embedding unit 11, a parallel movement processing unit 12, an encoder 13, a watermark embedding location shift amount specifying unit 14, a watermark embedding location specifying unit 15, and a correspondence table 16. One embodiment of the digital watermark embedding device according to the present invention is a portion related to embedding watermark information in FIG. 1, that is, watermark embedding means 11, watermark embedding location shift amount specifying means 14, watermark embedding location specifying means 15 and Consists of correspondence table 16.

  The watermark embedding unit 11 adds / subtracts a value obtained by multiplying a base of single or plural specific conversion coefficients (specific DCT coefficients) by a constant to the input pixel area image as watermark information. A watermark embedded image in which information is embedded is generated. Here, the watermark information is embedded in a watermark embedding location specified by a watermark embedding location specifying means 15 described later or a watermark embedding location obtained by referring to the correspondence table 16. The image input to the watermark embedding unit 11 may be a still image or a moving image.

  The translation processing unit 12 performs translation on the pixel area with respect to the watermark embedded image generated by the watermark embedding unit 11. This processing includes image editing and image attack.

  The encoder 13 performs compression including conversion to a frequency domain (DCT) and quantization on the image translated by the translation processing means 12. The compression here includes quantization and is irreversible. A compressed image is output from the encoder 13.

  The watermark embedding location shift amount specifying means 14 receives the size of the compression unit block and the translation range of translation in the translation processing means 12 as input, and when the image is translated by the translation processing means 12, the coding coefficient ( The shift amount to be given to the watermark embedding location with respect to the coordinates of the compression unit block is specified so that the (DCT coefficient) is distributed only in the vertical direction or horizontal direction of the screen.

  The watermark embedding location specifying means 15 gives the shift amount specified by the watermark embedding location shift amount specifying means 14 to the watermark embedding location (watermark embedding location before the shift reflection) on the image plane when parallel movement is not considered. Thus, the watermark embedding location (the watermark embedding location after the shift reflection) is specified.

  The correspondence table 16 stores the correspondence between the shift amount specified by the watermark embedding location shift amount specifying means 14 and the watermark embedding location. With this correspondence table 16, it is possible to identify which watermark information is embedded at which watermark embedding position and which watermark information is embedded. This correspondence table 16 is used when watermark information is detected from a watermark embedded image.

  The watermark embedding unit 11 embeds watermark information in the watermark embedding location specified by the watermark embedding location specifying unit 15.

  Hereinafter, embedding of watermark information will be described with a specific example. First, the watermark embedding location shift amount specifying means 14 shown in FIG. 1 is given a movement range xmin ≦ sx ≦ xmax, ymin ≦ sy ≦ ymax and a compression unit block size in parallel movement. Here, sx and sy are moving ranges in the horizontal and vertical directions of the screen, respectively.

  When translation is not performed, it is only necessary to embed watermark information as it is according to the block when the image is divided into blocks, but when translation is performed or when it is predicted that translation will be performed, As the coding coefficient is distributed only in the vertical or horizontal direction of the screen when translated, that is, the range of movement in translation is covered in the case of (i) or (ii) above. The watermark embedding location is shifted by k (dx, dy) from the coordinates of the compression unit block. FIG. 2 shows a block k (dx, dy) = k (0,0) that has no deviation from the coordinates of the compression unit block and a block k (dx, dy) = k (6,6) that has a deviation. Yes.

  The watermark embedding location shift amount specifying means 14 specifies the watermark embedding location shift amount k (dx, dy) as follows.

  For example, when the translation range is 0 ≦ sy ≦ 2, 0 ≦ sx ≦ 2, k (0,0), k (-1, -1), k (-2 , -2) if there is watermark information that is shifted and embedded, there is watermark information that remains as in the case of (i) or (ii) above.

  FIG. 3A is an explanatory diagram showing the relationship between the shift amount from the coordinates of the compression unit block and the watermark information remaining in the above case (i) or (ii) after the parallel movement.

  If watermark information is embedded (no shift) with k (0,0) as the shift amount from the coordinates of the compression unit block, the translation amount of the image translation is s (0, *) or s (*, 0) In addition, the energy of the watermark information remains as in the case (i) or (ii). Also, if watermark information is embedded with the shift amount from the coordinates of the compression unit block as k (-1, -1), when the translation amount of the image is (1, *) or (*, 1), The energy of the watermark information remains as in the case (i) or (ii) above. Also, if the watermark information is embedded with the shift amount from the coordinates of the compression unit block as k (-2, -2), when the translation amount of the image is (2, *) or (*, 2), The energy of the watermark information remains as in the case (i) or (ii) above.

  Therefore, when the translation range is 0 ≦ sy ≦ 2 and 0 ≦ sx ≦ 2, the shift amount from the coordinates of the compression unit block is k (0,0), k (-1, -1), k By embedding the watermark information as (−2, −2), the energy of the watermark information can be left as in the case (i) or (ii). As described above, the watermark embedding location shift amount specifying means 14 shifts the coordinate information from the coordinates of the compression unit block k () so that the energy of the watermark information can remain as in the case of (i) or (ii). dx, dy).

  When watermark information is embedded in this way, as can be seen from FIG. 3B, when the movement range in parallel movement is 0 ≦ sy ≦ 2, 0 ≦ sx ≦ 2, and sy = sx, the watermark energy Has one watermark with the amount of shift that satisfies the above condition (i), and if sy ≠ sx, it has two watermarks with the amount of shift that satisfies the condition (ii) where watermark energy is likely to remain The watermark information can be detected stably for any deviation amount.

  Generally, when xmin = ymin and xmax = ymax, the shift amount from the coordinates of the compression unit block is k (-m, -m) (where m = xmin, xmin + 1, ..., xmax) By doing so, it can be ensured that the energy of the watermark information remains in the cases (i) and (ii) with respect to the translation range. The shift amount k (-m, -m) from the coordinates of the compression unit block is specified according to the size of the compression unit block. For example, if the size of the compression unit block is 8x8, if the shift amount from the coordinates of the compression unit block is k (-m, -m) (where m = 0,1, ..., 7), all It can be ensured that the energy of the watermark information remains in the cases (i) and (ii) with respect to the translation range. When sy = sx, the watermark energy is very likely to remain, and there is one shift amount of watermark that satisfies the condition (i). When sy ≠ sx, the watermark energy is likely to remain (ii) There are two watermarks with a certain shift amount, and the watermark information can be detected stably for any shift amount.

  The shift amount from the coordinates of the compression unit block may not be k (−m, −m) as long as the above (i) or (ii) is satisfied. That is, the shift amount k (dx, dy) from the coordinates of the compression unit block only needs to satisfy that the coding coefficient is dispersed only in the vertical direction or the horizontal direction when the image is translated, A shift amount other than the above can also be taken.

  For example, when the translation range is 0 ≦ sy ≦ 2 and 0 ≦ sx ≦ 2, the shift amount from the coordinates of the compression unit block is k (0,0), k (-1,0), k ( It is also possible to embed watermark information as -2,0). This is effective because when the horizontal movement of the image is likely to occur, the watermark energy tends to remain (i) in many cases. However, when a translation in the range of 1 ≦ sy ≦ 2 occurs, there is only one shift amount of watermark information that satisfies the above condition (ii), and the detection accuracy may be lowered. When the translation range is 0 ≤ sy ≤ 2 and 0 ≤ sx ≤ 2, the shift amount from the coordinates of the compression unit block is k (0,0), k (-1,0), k (0, -1) and k (-2, -2) can also embed watermark information. This is effective when the parallel movement of the image is likely to occur at s (1,0), s (0,1), since the watermark energy is often left as described above (i). Further, there are two or more pieces of watermark information of the shift amount (i) or (ii) for any parallel movement amount. However, increasing the amount of watermark information to be embedded by increasing the shift amount from three to four may lead to image quality degradation. Therefore, the shift amount may be determined in consideration of conditions such as the stability of watermark information detection in the translation range, the probability of occurrence of translation, and acceptable image quality degradation.

  As described above, the watermark embedding unit 11 performs watermarking on the watermark embedding location shifted by various shifting amounts k (dx, dy) specified by the watermark embedding location shifting amount specifying unit 14 and the watermark embedding location specifying unit 15. Embed information. The correspondence table 16 stores the correspondence between the shift amount k (dx, dy) specified by the watermark embedding location shift amount specifying means 14 and the watermark embedding location.

  FIG. 4 is a diagram showing a specific example of the correspondence table 16. This correspondence table 16 specifies the watermark embedding location of the shift amount k (0,0) from the macroblock coordinates (3,2), (20,20), (5,1),. The watermark embedding location of the shift amount k (-1, -1) from the coordinates (10, 4), (9, 15), (2, 7), ... is specified, and the macro block coordinates (8, 29) , (3, 6), (19, 14),..., The watermark embedding location of the shift amount k (2, 2) is specified. Here, although the watermark embedding location is described in the coordinates of the macroblock, it may be described in the actual coordinates of the pixel.

  Next, watermark detection from the watermark embedded image generated as described above will be described. FIG. 5 is a block diagram showing an image processing apparatus including an embodiment of a digital watermark detection apparatus according to the present invention. The image processing apparatus of FIG. 5 includes a decoder 51, a parallel movement correction unit 52, and a watermark detection unit 53. The watermark detection means 53 detects watermark information from the watermark embedded image according to the present invention.

  First, the compressed image generated by the image processing apparatus of FIG. The decoder 51 decodes the input compressed image (conversion to pixel area (IDCT) and inverse quantization), and outputs an image on the pixel area.

  The translation correction means 52 corrects the translation in the translation processing means (12 in FIG. 1) on the image watermark embedding apparatus side so as to restore the original translation. It is assumed that the parallel movement amount t in the parallel movement processing means is acquired and known in advance.

  The watermark detection unit 53 detects watermark information from the image subjected to the translation correction by the translation correction unit 52. The detection of the watermark information is performed only from the location where the energy of the watermark information is (i) and (ii) based on the acquired parallel movement amount t. The locations (i) and (ii) can be seen from the correspondence table 16 (FIG. 4) between the shift amount k and the watermark embedding location. A portion (block) shifted from the macroblock coordinates described in the correspondence table 16 by the shift amount k is a watermark embedding portion.

  The detection of watermark information can be performed by assigning priorities to the above (i) and (ii) and performing either one or a combination of both, and the above (i) and (ii) can be performed. It is also possible to perform this by giving importance and changing the importance degree in the order of (i), (ii), and (iii).

  Hereinafter, the watermark detection will be specifically described. When the amount of parallel movement on the digital watermark embedding apparatus side is t, the parallel movement correction means 52 performs parallel movement reverse to the parallel movement to correct the parallel movement. Here, if there is a shift amount of t (a, b) = k (-a, -b) in the correspondence table 16, this is the watermark embedding in the case of (i) above. Also, if the correspondence table 16 has a shift amount of t (a, *) = k (-a, *) or t (*, b) = k (*,-b) (* is a different arbitrary number), This is watermark embedding in case (ii) above.

  The watermark detection means 53 obtains the watermark embedding location where the watermark is embedded with the shift amount in the case (i) or (ii) from the correspondence table 16, and detects the watermark information only from that location.

  In the case of (i) above, the watermark information can be detected by extracting a specific conversion coefficient (specific DCT coefficient) at the watermark embedding location in the compressed data. Alternatively, after decoding the compressed data, the frequency component of the watermark information can be extracted from the watermark embedding location of the watermark embedding image.

  In the case of (ii), the watermark-embedded image is once decoded (inverse quantization and IDCT), and then subjected to translation correction by the translation amount t. As a result, the base of the watermark embedded image that has been corrected for translation is further shifted by k on the pixel area in accordance with the shift amount k. The watermark information can be detected by extracting the frequency component of the watermark information from the watermark embedding location of the watermark embedded image in this state.

  In the case of (ii) above, although the energy of the watermark information is less than that in the case of (i) above, a lot of energy remains, so the watermark information even after processing such as lossy compression coding is performed. Can be detected. In the above, the detection of the watermark information in the cases of (i) and (ii) has been described, but the detection of the watermark information in the case of (iii) is also performed in the same manner, and the above (i ) and (ii), the watermark information detected in the case of (iii) may be weighted so as to be more important than the watermark information detected in the case of (iii), and the watermark information may be detected by a combination thereof.

  At the time of watermark detection, parallel movement correction can be performed on the correspondence table side. FIG. 6 is a block diagram showing an image processing apparatus including the digital watermark detection apparatus in this case. The image processing apparatus of FIG. 6 includes a decoder 61, a translation correction unit 62, and a watermark detection unit 63, but the translation correction unit 62 does not correct the watermark embedded image, and corrects the correspondence table 16 by translation. 5 is different from the image processing apparatus of FIG. 5 in that a correction correspondence table is generated and the watermark detection means 63 refers to the correction correspondence table.

  The compressed image generated by the image processing apparatus in FIG. 1 is input to the decoder 61. The decoder 61 decodes the input compressed image (conversion to pixel area (IDCT) and inverse quantization), and outputs an image on the pixel area.

  The parallel movement correcting means 52 corrects the correspondence table 16 (FIG. 4) between the shift amount k and the watermark embedding location. Using the correspondence table 16, a watermark embedding location for the shift amount k can be obtained. When the parallel movement amount is t (a, b), the shift amount k (x, y) may be moved in the same direction to create a table with k (x + a, y + b). Also, when the watermark embedding coordinates in the correspondence table 16 are not macro block coordinates but normal pixel coordinates (however, a number that is divisible by the block size), the embedding coordinates are translated in the same direction as this amount t (a, b). It is sufficient to create a table that is corrected so as to be shifted by a distance. In this case, a portion (block) shifted from the coordinates by the shift amount k is a watermark embedding portion. Alternatively, a table may be created in which the embedded coordinates are corrected so as to be shifted by the parallel movement amount t (a, b) in the same direction, and further shifted by the shift amount k. In this way, it is not necessary to translate the watermark embedded image.

  The watermark detection means 53 detects watermark information from the watermark embedded image with reference to the correspondence table corrected by the translation correction means 62.

  Although the embodiment has been described above, the present invention is not limited to the above embodiment. For example, the input image may be a still image or a moving image. In addition, for embedding and detecting watermark information in a specific DCT coefficient, as described in Patent Document 2, a method of obtaining an absolute value difference between specific DCT coefficients of adjacent blocks can be used. In this method, an image is divided into macro blocks each having 16 × 16 pixels, and the macro block is further divided into four blocks each having 8 × 8 pixels. Which block's watermark energy is to be increased is determined in advance according to the embedded watermark information. For example, “0” is embedded by increasing the watermark energy of the upper left block from the upper right, and “1” is embedded by increasing the watermark energy of the upper right block from the upper left. When the pixel coordinates are (x, y), the macro block coordinates are (x / 16, y / 16). However, the decimal point is rounded down. The embedded macroblock coordinates are determined, and the watermark energy of the block is manipulated by the embedded watermark information. When detecting watermark information, the absolute values of specific frequency coefficients of adjacent blocks are compared. This comparison result indicates the embedded watermark information. In the above case, if the energy of the upper left block is greater than the energy of the upper right block, it is determined that “0” is embedded. Adopting such an embedding / detection technique can further increase the resistance to translation and compression. Various other methods can be used for embedding the specific DCT coefficient and the watermark information in its base.

1 is a block diagram showing an image processing apparatus including an embodiment of a digital watermark embedding apparatus according to the present invention. It is explanatory drawing which shows the block with a shift | offset | difference, and the block with a shift | offset | difference from a compression unit block. It is explanatory drawing which shows the relationship between the shift amount of a watermark embedding location, and the energy of the watermark information which remains after parallel movement. It is a figure which shows the specific example of the correspondence table created by the correspondence table creation means. 1 is a block diagram illustrating an image processing apparatus including an embodiment of a digital watermark detection apparatus according to the present invention. It is a block diagram which shows the image processing apparatus containing other embodiment of the digital watermark detection apparatus which concerns on this invention. It is a figure which shows the relationship between the movement amount in a parallel movement, and the spreading | diffusion of a DCT coefficient. It is a figure which shows the principle of the basic watermark embedding in this invention.

Explanation of symbols

11 ... watermark embedding means, 12 ... parallel movement processing means, 13 ... encoder, 14 ... watermark embedding location shift amount specifying means, 15 ... watermark embedding location specifying means, 16 ... corresponding Table creation means, 51, 61 ... Decoder, 52, 62 ... Parallel movement correction means, 53, 63 ... Watermark detection means

Claims (9)

In a digital watermark embedding method for generating a watermark embedded image in which watermark information is likely to remain even after being subjected to translation and lossy compression encoding,
Based on the size of the compression unit block and the range of movement in translation, the coordinates of the compression unit block are such that the coding coefficient is distributed only in the vertical or horizontal direction when the image is translated. A watermark embedding location specifying process for specifying a watermark embedding location with a shift amount,
A watermark embedding process of embedding watermark information in the watermark embedding location specified by the watermark embedding location specifying process of the input image;
A digital watermark embedding method, comprising: a correspondence table storing step of storing a correspondence table between a shift amount in the watermark embedding location specifying process and a watermark embedding location. In a digital watermark embedding apparatus for generating a watermark embedded image in which watermark information is likely to remain even after being subjected to translation and lossy compression encoding,
Based on the size of the compression unit block and the range of movement in the translation, the coordinates of the compression unit block are coordinated so that the coding coefficient is distributed only in the vertical or horizontal direction when the image is translated. A watermark embedding location specifying means for specifying a watermark embedding location with a shift amount,
Watermark embedding means for embedding watermark information in the watermark embedding location specified by the watermark embedding location specifying means of the input image;
An electronic watermark embedding apparatus comprising: correspondence table storage means for storing a correspondence table between a shift amount in the watermark embedding location specifying means and a watermark embedding location. In order to generate a watermark embedded image in which watermark information is likely to remain even after being subjected to translation and lossy compression encoding,
Based on the size of the compression unit block and the moving range in the translation, the moving range in the translation is such that the coding coefficient is distributed only in the vertical direction or horizontal direction when the image is translated. A watermark embedding location specifying function for specifying a watermark embedding location with a shift amount with respect to the coordinates of the compression unit block,
A watermark embedding function for embedding watermark information in the watermark embedding location specified by the watermark embedding location specifying function of the input image;
A program for realizing a correspondence table storage function for storing a correspondence table between a shift amount in the watermark embedding location specifying function and a watermark embedding location. Translation and lossy compression encoding of the watermark embedded image generated by the digital watermark embedding method according to claim 1, the digital watermark embedding device according to claim 2, or the program according to claim 3. Is a digital watermark detection method for detecting watermark information from an image that has been subjected to decoding and then correction of movement amount in decoding and translation,
Using the correspondence table, a watermark detection location acquisition process for finding a location where watermark information is likely to remain corresponding to the amount of movement in parallel translation;
A watermark for detecting watermark information from a location obtained by the watermark detection location acquisition process, or from a location obtained by the watermark detection location acquisition process with the location being emphasized over other locations and other locations An electronic watermark detection method comprising: an information detection process. Translation and lossy compression encoding of the watermark embedded image generated by the digital watermark embedding method according to claim 1, the digital watermark embedding device according to claim 2, or the program according to claim 3. And a watermark detection method for detecting watermark information from the decoded image,
A correction correspondence table generation process for generating the correction correspondence table by correcting the correspondence table according to the movement amount in the parallel movement;
Using the correction correspondence table generated by the correction correspondence table generation step, a watermark detection location acquisition step for obtaining a portion where watermark information tends to remain;
A watermark for detecting watermark information from a location obtained by the watermark detection location acquisition process, or from a location obtained by the watermark detection location acquisition process with the location being emphasized over other locations and other locations An electronic watermark detection method comprising: an information detection process. Translation and lossy compression encoding of the watermark embedded image generated by the digital watermark embedding method according to claim 1, the digital watermark embedding device according to claim 2, or the program according to claim 3. Is a digital watermark detection apparatus that detects watermark information from an image that has been subjected to decoding and then correction of movement amount in decoding and parallel movement,
Using the correspondence table, a watermark detection location acquisition means for obtaining a location where watermark information tends to remain corresponding to the amount of movement in parallel translation;
Watermark information is detected from the location obtained by the watermark detection location acquisition means, or from the location obtained by the watermark detection location acquisition means and the other location with the location being emphasized over other locations. An electronic watermark detection apparatus comprising: watermark information detection means for performing Translation and lossy compression encoding of the watermark embedded image generated by the digital watermark embedding method according to claim 1, the digital watermark embedding device according to claim 2, or the program according to claim 3. Is a digital watermark detection apparatus that detects watermark information from the decoded image, and
A correction correspondence table generating means for generating a correction correspondence table by correcting the correspondence table according to a movement amount in parallel movement;
Using the correction correspondence table generated by the correction correspondence table generation means, a watermark detection location acquisition means for obtaining a location where watermark information tends to remain;
A watermark for detecting watermark information from the location obtained by the watermark detection location acquisition means, or from the location obtained by the watermark detection location acquisition means with the location being emphasized over other locations and other locations An electronic watermark detection apparatus comprising: an information detection unit. Translation and lossy compression encoding of the watermark embedded image generated by the digital watermark embedding method according to claim 1, the digital watermark embedding device according to claim 2, or the program according to claim 3. In order to detect watermark information from the image that has been subjected to decoding and then the correction of the movement amount in the decoding and translation,
Using the correspondence table, a watermark detection location acquisition function for finding a location where watermark information is likely to remain corresponding to the amount of movement in parallel movement,
A watermark for detecting watermark information from a location obtained by the watermark detection location acquisition function, or from a location obtained by the watermark detection location acquisition function with the location being emphasized over other locations and other locations Program for realizing the detection function. Translation and lossy compression encoding of the watermark embedded image generated by the digital watermark embedding method according to claim 1, the digital watermark embedding device according to claim 2, or the program according to claim 3. And then to the computer to detect watermark information from the decoded image,
A correction correspondence table generation function for generating a correction correspondence table by correcting the correspondence table according to the amount of movement in parallel movement;
Using the correction correspondence table generated by the correction correspondence table generation function, a watermark detection location acquisition function for obtaining a location where watermark information tends to remain,
A watermark for detecting watermark information from a location obtained by the watermark detection location acquisition function, or from a location obtained by the watermark detection location acquisition function with the location being emphasized over other locations and other locations A program for realizing the information detection function.

Images