JP4652167B2 - Image processing apparatus, image processing method, and program - Google Patents

Description

The present invention relates to an apparatus and method see embedding a watermark, also extracts the digital content, further, a program used in them.

  Conventionally, digital information can be easily copied without causing deterioration by a computer or the like, and conversely, it can be easily rewritten or altered. For this reason, digital information is easily copied and reused without permission by simple processing and operations, or part of the digital information cannot be used for evidence photographs.

  In order to prevent this, there are methods called digital watermarking and data hiding. Digital watermarking is a technique for adding invisible information when digital contents such as digital images are normally reproduced.

Techniques for embedding digital watermarks can be broadly classified into the following two.
(1) Technology that embeds directly in sample values of content data (2) Technology that embeds in frequency components

  Here, in the method (1), when processing such as processing or compression is performed, embedded data is easily lost, but processing is light. On the other hand, the method (2) is strong in processing such as processing and compression, but has a characteristic that embedding and extraction are heavy.

  For the digital watermarking on images that do not make sense if the image quality is impaired or the value is greatly reduced in this application, the method (1) has the advantage that the image quality degradation location can be localized rather than the method (2). There is.

There are the following applications for adding a digital watermark to digital contents.
A. B. Recording of copyright information Tracking of illegal copy information D. History recording of IP address Prevention of illegal copying: Invisible and highly resistant type Application to prevention of tampering: Invisible / low tolerance Authentication G. Secret communication Embed digital content annotations and labels: visible and irreversible
…… Owner's display Enabling watermark removal: Visible / Reversible type ... Content distribution

  Among them, for example, the following “detection of alteration of ID photo” has been devised as an application to a digital camera.

  "A method has been proposed in which a camera is equipped with a mechanism for embedding a watermark into the photographed image, such as the camera's serial number and date / time, etc. at the same time as the photograph is taken. It is possible to identify the camera and check the shooting date and time.

  Although tampering detection is possible only with the digital signature technology, the use of watermark technology makes it possible to specify the shooting camera and shooting date and time, and is thought to work effectively by preventing tampering. (Survey report on digital watermark technology, March 1999: edited by Japan Electronics Industry Promotion Association)

  In addition, as a matter of this case, it is a daily thing to cut out and use a part of the captured or generated image, and as a measure to prevent unauthorized use for copyright protection in such cases, It is conceivable that the digital watermark once embedded in the entire image is partially found even in the cut out image and the copyright is claimed.

  However, since the digital content data to be embedded is deteriorated by embedding the digital watermark, it is important to reduce image quality deterioration due to the influence as much as possible even if the amount of embedded data is increased.

  Therefore, using the characteristic that “the human eye is less capable of sensing noise present at the edge than the ability to sense noise present in the flat portion of the image”, the digital watermark is directly embedded in the image. When doing so, it is common to embed a watermark in the image edge portion.

  However, in the image area, the edge part is often narrower than the flat part, and if the amount of watermark to be embedded is large, the image quality deterioration becomes abrupt. In particular, in an artificially created image such as a form, drawing, or map, it is the reader's logical meaning that the original image expresses that excessive erosion of the contour line or deterioration of the skeletal line is broken or disappeared. It becomes a fatal obstacle in the process of understanding.

Further, as a conventional technique, for example, there is a technique of “determining an embedding position by searching a plurality of extraction start positions different from each other using a digital watermark including position information” (see Patent Document 1). In addition, a method of embedding in DCT quantum coefficients (see Patent Document 2), a method of embedding in Fourier transform coefficients, and a method of changing the embedding strength according to the magnitude relation of local complexity of pixel values (Patent Documents 3 and 4). And the like (see Patent Document 5) which can improve the concealment of the inserted digital watermark data.
JP 2001-119558 A JP 2000-216983 A JP 2000-287073 A JP 2003-219148 A Japanese Patent No. 3630071

  In this way, the purpose of embedding digital watermark information is to improve the performance of tampering detection and copyright information extraction. The amount of embedded watermark information is as large as possible, and even from a partially segmented image, the digital watermark is embedded. It is preferable that can be extracted.

  However, as the watermark amount to be embedded increases, the degree of image quality degradation increases, so it is necessary to suppress image quality degradation as much as possible.

  The present invention has been made in view of such circumstances, and an image processing method and an image processing apparatus capable of recognizing a partially cut-out image region as small as possible while securing an embedding amount of copyright information capable of clearly indicating ownership. It is another object of the present invention to provide a program and a storage medium.

The image processing apparatus of the present invention, image is divided into blocks, embedded and embedding means a plurality of boundary identification information and a predetermined arbitrary data for specifying the boundary position of the block embedded as electronic watermark information by the embedding means Boundary position determining means for determining the boundary position of the block area based on the boundary identification information, and extraction means for extracting the arbitrary data embedded in the block area, the boundary identification information being Information determined based on information representing a distance from a predetermined position in the block area to a position where the boundary identification information is embedded, and the boundary position determining means is obtained from each of the plurality of boundary identification information in the block area. Based on the information for specifying the boundary position, the obtained boundary position is defined as the boundary of the block area. It is obtained so as to determine whether the position.

In such an image processing device, the boundary identification information is information determined based on coordinate information representing a relative position from a predetermined point on the boundary of the block region of the position where the boundary identification information is embedded. Good.
Further, the boundary position determining means may determine the boundary position of the block area based on the degree of coincidence of the boundary positions obtained from the boundary identification information in a plurality of block areas.

Further, the boundary position determining means uses a region having the same size as the block region starting from an arbitrary position of the image data as a region for acquiring the boundary identification information, and the boundary position obtained from each of the boundary identification information If the obtained boundary position is not determined to be the boundary position of the block area, the area of the same size as the block area starting from a position different from the arbitrary position, It is good to make it the area | region which acquires the said boundary identification information.

In each of the image processing apparatuses described above, the embedding position of the boundary identification information may be set at the head of the embedding information in the block area.
Alternatively, the embedding positions of the boundary identification information may be dispersed in the peripheral portion near the boundary in the block area.

The image processing method of the present invention includes an embedding procedure for embedding a plurality of boundary identification information and predetermined arbitrary data as electronic watermark information for dividing an image into blocks and specifying the boundary position of the block, and the embedding unit In an image processing method for executing a boundary position determination procedure for determining a boundary position of the block region based on the boundary identification information embedded by the above and an extraction procedure for extracting the arbitrary data embedded in the block region, The boundary identification information is information determined based on information representing a distance from a predetermined position of the block area to a position where the boundary identification information is embedded, and in the boundary position determination procedure, a plurality of the boundaries in the block area Based on the information for identifying the boundary position obtained from each of the identification information And the boundary position may be possible to determine whether the boundary position of the block area.

In such an image processing method, the boundary identification information may be information determined based on coordinate information representing a relative position from a predetermined point on the boundary of the block region of the position where the boundary identification information is embedded. .
Furthermore, in the boundary position determination procedure, the boundary position of the block area may be determined based on the degree of matching of the boundary positions obtained from the boundary identification information in a plurality of block areas.

Further, in the boundary position determination procedure, an area having the same size as the block area starting from an arbitrary position of the image data is set as an area for acquiring the boundary identification information, and the boundary position obtained from each of the boundary identification information If the obtained boundary position is not determined to be the boundary position of the block area, the area of the same size as the block area starting from a position different from the arbitrary position, It is good to make it the area | region which acquires the said boundary identification information.

In each of the image processing apparatuses described above, it is preferable that the embedding position of the boundary identification information is set at the head of the embedding information in the block area.
It is preferable that the embedding positions of the boundary identification information are distributed in a peripheral portion near the boundary in the block area.

The program of the present invention is characterized in that the image processing method according to any one of claims 7 to 12 is applied to operate a computer system to embed or extract a digital watermark in digital content. It is a program .

  Therefore, according to the present invention, it is possible to extract an electronic watermark from an image in which the electronic watermark is embedded even from a partially cut-out image area.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

  FIG. 1 shows an example of an image processing apparatus constituted by a computer system according to an embodiment of the present invention.

  In the figure, a CPU (Central Processing Unit) 1 controls the operation of the image processing unit, and a ROM (Read Only Memory) 2 stores programs executed by the CPU 1 at startup and necessary data. A RAM (Random Access Memory) 3 is for constituting a work area of the CPU 1 and a clock circuit 4 is for outputting current date information.

  The magnetic disk device 5 is for storing various data such as various application programs, work data, file data, and image data data.

  The block boundary position information generation unit 6 recognizes the block boundary position accurately from the partially cut out image by using the block boundary position information obtained by analyzing the digital watermark as a clue. This is to extract the embedded digital watermark. The image is divided into blocks in advance, and the boundary position information of the block (abbreviated as boundary identification information) is generated as the digital watermark information independently in each block. It is means to do. The generated data is stored in the magnetic disk device 5 and then given to the source data encoding unit 7.

  The source data encoding unit 7 encrypts or encodes data by using both data input by an external arbitrary data input means (described later) and data generated by the block boundary position information generation unit 8. It is for making it. The output data of the source data encoding unit 7 is stored in the magnetic disk device 5 and then given to a digital watermark embedding unit 9 (described later).

  The digital watermark extraction data decoding unit 8 decodes the digital watermark extraction data stored in the magnetic disk device 5 by the digital watermark extraction unit 10 (described later), and decrypts it into block boundary position information and arbitrary data, It is stored in another location on the magnetic disk device 5. The content of the arbitrary data is determined based on the block boundary position information after the block boundary recognition unit 11 (described later) recognizes the block boundary position in advance.

  The digital watermark embedding unit 9 is for embedding the embedded data generated by the source data encoding unit 7 into the image data to be embedded as a digital watermark.

  The digital watermark extraction unit 10 is for extracting a digital watermark from the image data in which the digital watermark is embedded and storing it in another location in the memory 4.

  The block boundary recognition unit 11 uses the block boundary position information stored in the magnetic disk device 5 by the digital watermark extraction data decoding unit 8 to recognize the block boundary position.

  The CRT screen display device 12 is for displaying a screen for operating the image processing device, and the display control unit 13 is for controlling the display contents of the CRT screen display device 12.

  The keyboard device 14 is for performing various key operations on the image processing device, and the screen instruction device 15 is for performing operation operations such as instructing an arbitrary point on the CRT screen display device 12. Yes, the input control unit 16 is for capturing input information of the keyboard device 14 and the screen instruction device 15.

The network interface circuit 17 is for connecting the image processing apparatus to a network (not shown), and the network transmission control unit 18 exchanges various information with other terminal apparatuses via the network. This is for performing transmission control processing.

These CPU 1, ROM 2, RAM 3, clock circuit 4, magnetic disk device 5, block boundary position information generation unit 6, source data encoding unit 7, digital watermark extraction data decoding unit 8, digital watermark embedding unit 9, digital watermark extractor 10, and block border recognition unit 11, the display control unit 13, the input control unit 16, a network transmission control unit 18 is connected to the bus 19, the exchange of these data between the elements, primarily This is done via this bus 19.

  The CRT screen display device 12, the keyboard device 14, and the screen instruction device 15 realize a user interface function for the user. For example, various operation instructions, function selection commands, editing data, etc. Enter the block size when embedding or extracting data in image block units, or decrypting the watermark data for the purpose of concealing the embedded data contents Sometimes used to enter a secret key. In addition, a display operation function can be realized in which a digital watermark decryption result is displayed superimposed on the input image image data by key operation, or only one of them is selected and displayed.

  The processed image data can be, for example, data stored in advance in the magnetic disk device 5 or data received from another terminal device or the like via a network.

  In addition, an optical disk device (for example, a CD-ROM drive device, a DVD drive device, etc.), a digital still camera device, and a scanner device to which a replaceable storage medium can be applied is provided so that processed image data is input. It is also possible to do.

  In this embodiment, a digital watermark is embedded in an image block as follows.

  Basically, as shown in FIG. 2, the image is divided into blocks, and both the boundary position information of the block (abbreviated as boundary identification information) and arbitrary data are embedded as digital watermark information independently in each block. Therefore, in the digital watermark extraction process, the block boundary position information obtained in the first stage by analyzing the digital watermark from the partially cut out image is used as a clue, and the block boundary position is accurately recognized. Thus, the arbitrary data embedded independently for each block can be extracted.

  It should be noted that the applicability of the target image in which the digital watermark is embedded throughout the present application has some redundant information, so that even if the amount of digital watermark is extremely small compared to the amount of image main body information, the image quality is affected. Other conditions are not required as long as they are difficult. In other words, the present invention can be applied to all the commonly introduced images such as various documents and patents as images to be embedded with a digital watermark.

  Here, since the detailed description of the type of image is a well-known technique, the description thereof is omitted. Only the points that are specific to the present application will be described below.

  First, “in the case of embedding directly in pixel values of a multi-value gray image” will be described.

  The image expression method using multi-valued shades is often applied to natural images that require a large number of colors and shade values for each color. In order to express the image in shades of color, the image data is composed of a plurality of bits (8, 16, 24, 32 bits, etc.) per pixel.

  The digital watermark described here is suitable for the purpose of storing a multi-value grayscale image in an uncompressed or reversible compression processed state for the purpose of pursuing evidence photographs or visual beauty. If an image is stored in an uncompressed or reversible compression state, an image that does not deteriorate image quality can be reproduced. Therefore, the cause of image quality deterioration can be limited to embedding an electronic watermark, and image quality deterioration is reduced, that is, weak tolerance (generally correlated) ) For digital watermarking (uses for tamper detection). Since digital image embedding does not involve image conversion such as frequency conversion, the embedding processing time is short.

  At the time of encoding, the area of the processing target image data is divided into blocks each consisting of 8 × 8 pixel areas, and a digital watermark is embedded in each block. Since the image data is composed of a plurality of bits per pixel, the digital watermark information is inserted using the least significant bit that has the least influence of image quality degradation.

  There are two types of information embedded as a digital watermark: boundary identification information for identifying the boundary of the block, and arbitrary data that is not directly related to the block boundary. For example, in the case of an 8 × 8 pixel block, the distance from an arbitrary pixel coordinate to the block boundary is 0 to 7 in both the X (horizontal) direction and the Y (vertical) direction. Each least significant bit for 6 pixels is used).

  For this reason, for example, the block boundary identifier is expressed by the offset (in-block coordinates) value (X direction: 000, Y direction: 000) of the top left top pixel in the block. If the density information for pixels is used to embed as a digital watermark, the least significant 1 bit of the density information for 6 pixels from the top left top pixel in the block is set to 0 (when not encrypted). It will be. In that case, it is possible to embed arbitrary data such as copyright information and falsification detection information using the least significant bit of the pixel information at a position other than the first six pixels of the block.

  At the time of decoding, the process is divided into two processes: “recognize the block boundary position” first, and then “extract arbitrary data embedded in each block”.

  The block boundary position recognition process searches for boundary identification information embedded in a predetermined position in a pixel area (block area) of a block size in the image data to be decoded (the initial position of the search is The position at which the upper left pixel (reference pixel) of the block area matches the upper left pixel of the image data).

  Specifically, the least significant bits of the pixel data at the coordinates where the boundary identification information is expected to be inserted are respectively extracted to check whether valid boundary identification information is configured. In order to ensure that the recognized block boundary position is certain, the majority of the boundary identification information extracted in the plurality of block areas is determined by a majority vote.

For example, in the 8 × 8 pixel block in the above encoding description, when the boundary identification information is expressed by 3 bits in both the X (horizontal) direction and the Y (vertical) direction, 1/8 (= 1/2 ³ ), respectively. In order to increase reliability, it is necessary to increase the number of bits of boundary identification information embedded in the block or to make a comprehensive judgment by recognizing a plurality of blocks.

  An example of increasing the number of block boundary identification information bits will be described with reference to FIG. In the figure, setting contents of block boundary identification information Ai (Xi, Yi) or arbitrary data Bj (Xj, Yj) to be embedded as an electronic watermark and an embedded position are shown in the image block.

  Ai or Bj represents 1-bit value embedded in the i-th or j-th, respectively. (Xi, Yi) or (Xj, Yj) represents the coordinates of the position where Ai or Bj is embedded, respectively, relative to the block boundary. Expressed in coordinates. Xi and Xj are distances from the leftmost block boundary, and Yi and Yj are distances from the uppermost block boundary.

  Here, an example in which the value of the block boundary identification information is determined in 1-bit units will be described.

(Example 1) Simple example of a method for determining block boundary identification information A0 = [least significant 1-bit value of (X0 + Y0)]
...
Ai = [least significant 1-bit value of (Xi + Yi)]

(Example 2) Another simple example of a method for determining block boundary identification information A0 = [least significant 1-bit value of (X0 + Y0)]
...
Ai = [the least significant 1-bit value of the sum of (X0 + Y0) to (Xi + Yi)]

(Example 3) An example of a determination method considering high-speed processing of block boundary identification information A0 relative block coordinate values (X0, Y0) are converted into binary values, and each bit value is embedded as A ₁ to A ₁ . Embed in A _2n .
_{X0 = (b x, n b} x, n-1 b x, n-2 ··· b x, 1), and _{Y0 = (b y, n b} y, n-2 ··· b y, 1) ,
_{A 2n = b x, n,} A 2 (n-1) = b x, n-1, ···, A 2 = b x, 1, A 2n-1 = b y, n, A 2 (n- _{1) -1} = by _{, n−1} ,..., A ₁ = by _{, 1} .
Here, b _{z, k} is a 2 ^k−1 coefficient in the bit string representing the coordinate value Z (= X0 or Y0) of A0.

(Example 4) Another example of determination method considering high-speed processing of block boundary identification information The relative coordinate value (X0, Y0) within the block of A0 is used as the input value of the monotonically increasing function F () or G (). The resulting values X and Y are converted into binary values, and the respective bit values are embedded in A1 to A2n as embedded data.
The function F () is, for example, F (X0) = X0 + m; F (X0) = X0−m; F (X0) = X0 * m; F (X0) = X0 / m; F (X0) where m is a natural number ) = X0 ^m ; F (X0) = log _m X0; F (X0) = m ^{X0 and the} like.
The function G () can use the same function as the function F (). Alternatively, other monotonically increasing or monotonic decreasing functions can be applied.
X = (bx _{, nbx, n- 1bx, n-2} ... bx _{, 1} ), Y = (by _{, nby, n-2} ... by _{, 1} ) ,
_{A 2n = b x, n,} A 2 (n-1) = b x, n-1, ···, A 2 = b x, 1, A 2n-1 = b y, n, A 2 (n- _{1) -1} = by _{, n−1} ,..., A ₁ = by _{, 1} .
Here, b _{z, k} is a 2 ^k−1 coefficient in the bit string representing the coordinate value Z (= X or Y) of A0.

(Example 5) Another example of determination method of block boundary identification information A0 = F (X0, Y0)
...
Ai = F (Xi, Yi)
Here, the function F (x, y) is a function for generating a 1-bit random number by using x and y as seeds.

  What is important in common to all of these examples 1 to 5 is that the block boundary identification information Ai includes in-block coordinate values of the embedded positions of A0 to Ai including Xi and Yi (including the embedded coordinate value of Bi). It is a point determined by a calculated value based on

That is, if the block boundary position is shifted between the time of embedding the digital watermark and the time of detection, the probability that the values of A0 to Ai calculated based on the relative coordinates are the same at the time of embedding and at the time of detection is Since it becomes lower at a rate of 1/2 ⁱ , the block boundary recognition accuracy increases as i increases.

  Among them, Example 1 and Example 2 are simple ones that do not take into consideration the processing speed (which should be faster) and ease of decoding (which should be difficult to decode by a third party to prevent impersonation). This shows an example of simple calculation.

  Example 1 represents that the value of Ai is set by the least significant 1 bit of the added value of Ai's own coordinate value Xi and Yi. In addition, Example 2 uses the cumulative value of the coordinate values of A0 to Ai, and it can be said that the calculation method becomes more complicated and slightly increases the difficulty of decoding.

  Examples 3 to 5 will be described later.

  Next, a method for searching for a block boundary based on the boundary identification information described above will be described below.

  If the above-described boundary identification information is not configured effectively, the block area is shifted to the right by one pixel (in the case of Example 3 and Example 4, one pixel or more), and the data of the pixel area of the block size is again obtained. Extract and repeat the same operation.

  If the boundary identification information cannot be obtained even if the right end area of the image data to be processed is repeated until it matches the right end of the block size, the upper boundary of the block area is set after the second line of the image data. Moving around, repeating the same operation to search for boundary identification information. If it still cannot be obtained, an error (determined that the digital watermark is not embedded) is made.

  When the boundary identification information is obtained, the block area is determined. Therefore, in each pixel in which arbitrary data is embedded from the determined block area, the least significant bit of each pixel data is extracted, and the extracted least significant bit of the least significant bit is extracted. Reproduce arbitrary data based on data. In order to guarantee the contents of the arbitrary data, the arbitrary data is extracted from each of the plurality of block areas and determined by the majority vote.

  Next, a description will be given of “a case where the image is directly embedded in an image composed of a limited number of colors such as a color map image”.

  An expression method that configures an image with a limited number of colors is applied to an artificial image (for example, image data in a format such as BMP or GIF) in which each expression is easily emphasized by using only limited colors such as a document text part and an illustration. There are many cases. In order to express an image with a limited color that is easy for humans to recognize, colors constituting the image data can be identified and expressed with a small number of bits (1, 2, 4, 8 bits, etc.) per pixel. In this case, the minimum identification color number is a binary image expressed by 1 bit per pixel.

  These images are characterized in that pixels of the same color form a continuous area. In addition, when irreversible compression coding processing such as DCT is performed, it tends to be easily recognized by humans mainly in the image quality deterioration in a continuous area formed with the same color. Often compressed and stored.

  Therefore, the digital watermark applied in this case is suitable for use in storing an image composed of limited colors in an uncompressed or lossless compressed state. If an image is stored in an uncompressed or reversible compression state, an image that does not deteriorate image quality can be reproduced. Therefore, the cause of image quality deterioration can be limited to embedding an electronic watermark, and image quality deterioration is reduced, that is, weak tolerance (generally correlated) ) For digital watermarking (uses for tamper detection). Since digital image embedding does not involve image conversion such as frequency conversion, the embedding processing time is short.

  In this case, at the time of encoding, the region of the processing target image data is divided into blocks each formed of a pixel region such as 8 × 8, and a digital watermark is embedded in each block. Since the image data is composed of a plurality of regions where pixels of the same color are continuous, in order to reduce the influence of image quality degradation, digital watermark information is added to the edge portion (the boundary portion of regions formed of pixels of the same color). Insertion is performed (one bit is represented by run-length evenness by shifting the position of the edge by a minimum amount, which is a known technique).

  There are two types of information embedded as a digital watermark: boundary identification information for identifying the boundary of the block, and arbitrary data that is not directly related to the block boundary.

  In the case of “embedding directly in an image composed of a limited number of colors such as a color map image”, the embedding position of the watermark information (block boundary) Is the fixed point in the pixel run representing the run length (for example, if the pixel run is changed from the upper left to the lower right while embedding the digital watermark information, the upper left corner of the pixel run. An edge portion is adopted (because the position of the edge portion is fixed and fixed prior to the lower right portion).

  At the time of decoding, the process is divided into two processes: “recognize the block boundary position” first, and then “extract arbitrary data embedded in each block”.

  In addition, in the case of “embedding directly in an image composed of a limited number of colors such as a color map image” as in the case of “embedding directly in the pixel value of a multi-value gray image” described above, an electronic watermark is embedded. The location is not the least significant bit of the pixel data, but is an even-odd value of run length formed by successive identical color pixels.

  Next, “when embedding in an image frequency space” will be described.

  In this case, the digital watermark is applied to the Fourier transform coefficient space, the DCT coefficient space employed in JPEG, the wavelet transform coefficient space employed in JPEG2000, and the like (hereinafter represented by DCT of JPEG compression). Embed.

  In order to prioritize a higher compression rate than to suppress image quality degradation as much as possible when storing an image, this is suitable for a case where image quality degradation for an original image cannot be avoided by irreversible compression processing suitable for that purpose. In many cases, the original image is a multi-value grayscale image, and the digital watermark is highly resistant to survive the image quality degradation at the time of image storage (use is suitable for copyright protection).

  At the time of encoding, the area of the processing target image data is divided into blocks each having a pixel area of 8 × 8 or the like, and a digital watermark is embedded in the frequency coefficient obtained by frequency conversion in each block. If this frequency conversion is included in the process of compression processing at the time of image storage (DCT for JPEG compression processing, etc.), the frequency coefficient of compression processing or its quantum coefficient can be applied.

  Since the frequency coefficient is composed of a plurality of bits per coefficient, the digital watermark information is inserted using the least significant bit that is least affected by image quality degradation. There are two types of information embedded as a digital watermark: boundary identification information for identifying the boundary of the block, and arbitrary data that is not directly related to the block boundary.

  Also, in the case of “embedding in the image frequency space”, the embedding position of the digital watermark information (relative coordinates from the block boundary) is the frequency as in the case of “embedding directly in the pixel value of the multi-value grayscale image” described above. Coordinates of coefficients for embedding digital watermarks in the transformed space are adopted. In addition, when it cannot be applied to the compression process at the time of image storage (such as DCT for JPEG compression process), the original image entity information (image is formed by frequency inverse transform using the frequency coefficient embedded in the digital watermark. It returns to the pixel value data) and is treated as a normal image.

  At the time of decoding, the process is divided into two processes: “recognize the block boundary position” first, and then “extract arbitrary data embedded in each block”.

  That is, the digital watermark embedding process can be applied in the process of compression processing when saving an image (DCT for JPEG compression processing, etc.), and the digital watermark can be applied in the process of compression processing when saving an image (DCT, etc. for JPEG compression processing). The processing contents differ depending on when the embedding process is not applicable.

  When digital watermark embedding processing is applied in the process of compression processing (such as DCT of JPEG compression processing) when saving an image, in the process of decompressing the compression processing, the frequency coefficient that is the target of digital watermark embedding or its quantum coefficient, Extract digital watermark information.

  If the digital watermark embedding process cannot be applied during the compression process (such as JPEG compression DCT) during image storage, the image entity information is frequency-converted in the same way as when the digital watermark is embedded, and the frequency Digital watermark information is extracted from the coefficients.

  Also, in the case of “embedding in the image frequency space”, as in the case of “embedding directly in the pixel value of the multi-value grayscale image” described above, the place where the digital watermark information is embedded is the lowest position of the pixel data. It is not the bit but the least significant bit of the frequency coefficient or its quantum coefficient.

  Here, the following is mentioned as a common point in the three types of images described above.

  A. In order to avoid image quality degradation as much as possible, avoid embedding digital watermarks in a uniform ratio in all data (pixel value data and frequency-converted quantum coefficients) spaces that represent images, and only where there is little influence of image quality degradation. It is usually done to embed.

  B. If the digital watermark embedding location is regular in a uniform position, the embedding location is likely to be overlooked, and impersonation is likely to occur, so in order to avoid it, choose the embedding location to be irregular There are many.

  For the above two reasons, FIG. 2 shows an example in which the digital watermark embedding location is irregular.

  Next, an example of a method that uses relative coordinate values for block boundary position information will be described.

  This method is a method of recognizing a block boundary at high speed by using a relative coordinate value (distance data) between a block boundary and a digital watermark embedding position as boundary identification information when embedding a digital watermark.

  In the extraction process, if the relative position of the currently focused pixel from the tentatively determined block boundary is larger than the digital watermark extracted value, the tentative boundary position is set so that the relative position from the tentatively determined block boundary becomes smaller. And the amount of movement can simply use the difference in relative position, so that the position of the block boundary can be grasped without re-searching (see Example 3 described above).

For example, according to Example 3, the sequence of pixels in which an electronic watermark is embedded in an image is A ₀ , A _2n , A _2n−1 , A _{2 (n−1)} , A _{2 (n−1) −1} , If A ₂ , A ₁ and so on are arranged continuously, A ₀ , A _2n, ..., A ₁ can be handled in a lump, so the position of A ₀ and A _2n ,. based on the contents of the a ₁ (X0, Y0 coordinate value during watermark embedding), it is capable to determine the position of the block boundary.

  Next, another example of a method using relative coordinate values for block boundary position information will be described.

  In this method, at the time of digital watermark embedding, by using monotonically increasing or monotonically decreasing function data in which the relative coordinate value between the block boundary and the watermark embedding position is input as the boundary identification information, the block boundary is made faster. Can be recognized.

  In the extraction process, if the relative position of the currently focused pixel from the tentatively determined block boundary is larger than the digital watermark extracted value, the tentative boundary position is set so that the relative position from the tentatively determined block boundary becomes smaller. The block boundary can be recognized at high speed by applying binary search or the like. In this case, since the distance value is not directly embedded in the embedded data, the embedded data has a function of concealing the meaning of the embedded data (not easily detected) (see Example 4 described above).

For example, according to Example 4, the sequence of pixels in which an electronic watermark is embedded in the image is A ₀ , A _2n , A _2n−1 , A _{2 (n−1)} , A _{2 (n−1) −1} , If A ₂ , A ₁ and so on are arranged continuously, A ₀ , A _2n, ..., A ₁ can be handled in a lump, so the current recognition position of A ₀ and A _2n. ‥, based on the contents of the a ₁ (calculated value during watermark embedding), is capable to determine the block border position by binary search. Since the binary search method is well-known, detailed description is abbreviate | omitted.

  Next, an example of a method using random numbers for block boundary position information will be described.

  In this method, at the time of digital watermark embedding, by using the random distance or pseudo random number generation function data with the relative distance data between the block boundary and the digital watermark embedding position as the input value (seed: seed data) as the boundary identification information Therefore, it is difficult to forget that the embedded information is boundary identification information (to avoid “spoofing” tampering).

  In the extraction process, a value calculated using random number or pseudo-random number generation function data in which the relative coordinate value of the currently focused pixel from the tentatively determined block boundary is an input value, and a value extracted from the digital watermark are Until the match, the temporary block boundary position is searched while shifting one pixel at a time. Therefore, the recognition speed of the block boundary is low. However, since the distance value is not embedded directly in the embedded data, but becomes a random value, the function of concealing the meaning of the embedded data can be provided (see Example 5 above).

  Next, another example of a method using a random number for block boundary position information will be described.

  In this method, not only the relative distance data between the block boundary and the digital watermark embedding position but also the processed data to which the pixel value in the block and arbitrary key data are applied as the boundary identification information are input values (seeds: seeds). By using the random number or pseudo-random number generation function data set to (data), it is possible to further prevent the embedded information from being seen through as boundary identification information (avoid “spoofing” alteration) (see Example 5).

  For example, if the block boundary identification information to be generated is A0 = F (X0, Y0) according to Example 5, when X0 and Y0 have the same value, A0 will always have the same value, but the random number generation function If F () is used as a nesting and A0 = F (F (F (X0, Y0), pixel value), arbitrary key), etc., and the number of random number generations is increased, the calculated value of A0 may match. It means that the nature is reduced.

  Next, a method of setting the block boundary position information embedding location at the head of the block will be described.

  In this case, by setting the embedding position of the boundary identification information at the head of the embedding information of each block, it is possible to preferentially embed the block boundary position even in a block that can be embedded only in a small amount.

  The place where the digital watermark can be embedded is limited for the reason that it is necessary to avoid the place where the image quality deteriorates. For that reason, some blocks can be embedded in only a small amount. In this method, even in such a block, since information for finding the block boundary position is preferentially embedded, the probability that the block boundary position can be found accurately increases.

  Next, a method for distributing the embedding location of block boundary position information to the peripheral portion near the block inner boundary will be described.

  In this case, the block boundary position can be recognized more accurately by dispersing the embedded position of the boundary identification information in the periphery near the boundary inside each block area (see FIG. 3).

  Next, a description will be given of a system in which the block boundary position information is embedded in the block.

  In this case, by embedding the same information in a plurality of blocks at the time of embedding a digital watermark, it is possible to perform majority processing based on the same information at the time of digital watermark extraction, and extract highly reliable information. Can do.

  FIG. 4 shows an example of the digital watermark embedding process.

  First, key input (input using a keyboard or the like) is performed to determine a selection function, and the contents are stored in a memory for the following processing (processing 101). (1) The information to be embedded as a digital watermark is encrypted in advance with a secret key (password or the like) and then embedded in the digital watermark, thereby making it difficult to decrypt the embedded information. However, it is not essential to embed a digital watermark after always encrypting, and it is possible to select whether encryption is necessary. (2) Specify the block size. The larger the block size, the larger the amount of information that can be embedded in each block, and it will be possible to embed a lot of information. There is a high probability that the digital watermark cannot be included, and thus there is a high risk that the digital watermark cannot be extracted. The block size needs to be determined in consideration of these matters.

  Next, the processing image in which the digital watermark is embedded is input and stored (processing 102).

  Next, the image is divided into blocks at the size specified by the process 101 (process 103).

  Here, it is checked whether or not processing has been completed for all blocks (decision 104). When the result of determination 104 is NO, a block to be processed is selected (process 105), and arbitrary data corresponding to the block to be processed is input (process 106). This arbitrary data is created based on the data input in the process 101.

  Then, in order to be able to recognize the block boundary at the time of extraction, boundary identification information embedded in the image block is generated by applying the various methods described above (process 107).

  Next, the arbitrary data input in the process 106 and the boundary identification information generated in the process 107 are mixed to generate information to be embedded as a digital watermark (process 108).

  Then, the digital watermark information generated in the process 108 is embedded in the block of the image to be embedded (process 109).

  Next, the process returns to decision 104. If the result of determination 104 is YES, the digital watermark embedded image data is stored in the magnetic disk device 5 (process 110), and this process is terminated.

  FIG. 5 shows an example of digital watermark extraction processing.

  First, key input (keyboard input or the like) is performed to determine a selection function, and the contents are stored in a memory for the following processing. (1) A decryption secret key (password or the like) is input to decrypt the embedded information encrypted at the time of embedding the digital watermark. However, it is not indispensable to always embed a digital watermark after it is encrypted. Since it is possible to select whether encryption is necessary or not, the usage method is determined based on the selection result at the time of embedding. (2) Normal digital watermark information cannot be extracted unless the same block size is specified as when the digital watermark is embedded.

  Next, processing target image data for decrypting the digital watermark is input and stored (processing 202). Next, an initial setting for recognizing a block boundary necessary for extracting a digital watermark is performed (process 203). For example, the start point (for example, the upper left coordinates) of the investigation target image is set as the block start point as the initial value of the investigation temporary position for recognizing the block boundary. The block end point is determined by the block size specified in the process 201.

  Then, it is determined whether or not an unsearched block in which a digital watermark is embedded remains in the investigation target image (decision 204). When the result of determination 204 is YES, digital watermark information is extracted from the block at the provisional position set after the previous block extraction.

  Then, the digital watermark information extracted from the block at the current temporary position is separated into boundary identification information (A) and arbitrary data (B) (process 206).

  Also, a block boundary identification information value (C) is calculated based on the relative coordinate value from the provisional block boundary position of the pixel position currently focused on (process 207).

  Here, the boundary identification information value (A) obtained from the digital watermark information value in the process 206 matches the boundary identification information (C) of the block calculated by the same method as that calculated in the digital watermark embedding process in the process 207. It is determined whether or not (decision 208). When the result of determination 208 is NO, the block at the provisional position that has been analyzed up to now cannot be regarded as a valid block in which the digital watermark is embedded. In a state in which the starting point of is moved to a position shifted by one pixel in the unsearched direction (processing 209), the processing returns to the determination 204.

  If the result of determination 208 is YES, the arbitrary data (B) in the digital watermark information extracted in the process 206 at that time is stored in the memory as valid digital watermark information ( Process 210) Since the block at the tentative position that has been analyzed up to now can be regarded as a valid block in which the digital watermark is embedded, the start point of the block at the tentative position to be examined next is set as the current block position. Are moved to a place where they do not overlap (step 211), and the process returns to decision 204.

  If the result of determination 204 is NO, the digital watermark extraction data and the like obtained at that time are output and stored in block units (process 212), and this process ends.

1 is a block diagram showing an example of an image processing apparatus configured from a computer system according to an embodiment of the present invention. Schematic which showed an example of the electronic watermark embedding position and setting content in an image block. Schematic for demonstrating the interference effect of the electronic watermark information embedding position. 6 is a flowchart illustrating an example of a digital watermark embedding process. The flowchart which showed an example of the digital watermark extraction process.

Explanation of symbols

1 CPU (Central processing unit 2 ROM (Read only memory)
3 RAM (Random Access Memory)
6 Block boundary position information generation unit 7 Source data encoding unit 8 Digital watermark extraction data decoding unit 9 Digital watermark embedding unit 10 Digital watermark extraction unit 11 Block boundary recognition unit 12 CRT screen display device 13 Display control unit 14 Keyboard device 15 Screen Instruction device 16 Input control unit 17 Network interface circuit 18 Network transmission control unit

Claims (13)

An embedding unit that divides an image into blocks and embeds a plurality of boundary identification information and predetermined arbitrary data as electronic watermark information for specifying the boundary position of the block;
Boundary position determining means for determining a boundary position of the block region based on the boundary identification information embedded by the embedding means;
Extracting means for extracting the arbitrary data embedded in the block area,
The boundary identification information is information determined based on information representing a distance from a predetermined position of the block area to a position where the boundary identification information is embedded,
Whether the boundary position determination means sets the obtained boundary position as the boundary position of the block area based on information for specifying the boundary position obtained from each of the plurality of boundary identification information in the block area. An image processing apparatus that determines whether or not. The boundary identification information is information determined based on coordinate information representing a relative position of a position where the boundary identification information is embedded from a predetermined point on the boundary of the block area. the image processing apparatus according. The boundary position determining means determines a boundary position of the block area based on a degree of coincidence of boundary positions obtained from the boundary identification information in a plurality of block areas. the image processing apparatus according to. The boundary position determining means,
An area having the same size as the block area starting from an arbitrary position of image data is an area for acquiring the boundary identification information,
Based on the boundary position obtained from each of the boundary identification information, when it is not determined that the obtained boundary position is the boundary position of the block region, a position different from the arbitrary position is set as a starting point. 4. The image processing apparatus according to claim 1, wherein an area having the same size as the block area is used as an area for acquiring the boundary identification information. 5. The boundary embedding position of the identification information, the block area of the embedded image processing apparatus according to any one of claims 1 to 4, characterized in that ahead of the standard in the information. The boundary embedding position of the identification information, the block region in the image processing apparatus according to any one of claims 1 to 4, characterized in that dispersed to the peripheral portion near the boundary. An embedding procedure for embedding a plurality of boundary identification information and predetermined arbitrary data as digital watermark information for dividing an image into blocks and specifying a boundary position of the block;
A boundary position determination procedure for determining a boundary position of the block region based on the boundary identification information embedded by the embedding unit;
An image processing method for executing an extraction procedure for extracting the arbitrary data embedded in the block region,
The boundary identification information is information determined based on information representing a distance from a predetermined position of the block area to a position where the boundary identification information is embedded,
Whether the obtained boundary position is set as the boundary position of the block area based on the information for specifying the boundary position obtained from each of the plurality of boundary identification information in the block area in the boundary position determination procedure. An image processing method characterized by determining whether or not. 8. The boundary identification information is information determined based on coordinate information representing a relative position of a position where the boundary identification information is embedded from a predetermined point on a boundary of the block region. the image processing method according. 9. The boundary position of the block area is determined based on a degree of coincidence of boundary positions obtained from the boundary identification information in a plurality of block areas in the boundary position determination procedure. the image processing method according to. In the boundary position determination procedure,
An area having the same size as the block area starting from an arbitrary position of image data is an area for acquiring the boundary identification information,
Based on the boundary position obtained from each of the boundary identification information, when it is not determined that the obtained boundary position is the boundary position of the block region, a position different from the arbitrary position is set as a starting point. The image processing method according to claim 7, wherein an area having the same size as the block area is used as an area for acquiring the boundary identification information. 11. The image processing method according to claim 7, wherein an embedding position of the boundary identification information is set at a head of embedding information in the block area. The image processing method according to claim 7, wherein the embedding positions of the boundary identification information are distributed in a peripheral portion near the boundary in the block area. 13. A program that applies the image processing method according to claim 7 to operate a computer system to embed or extract a digital watermark in digital content.

Images