KR20140091393A - Apparatus and method for steganography, apparatus and method for data restoration - Google Patents

Abstract

An apparatus for hiding data includes a receiving unit which receives an original image, a hiding key, and data; a group forming unit which divides the original image into one or more blocks, and forms target pixels, which are positioned on a predefined grid among pixels included in the blocks, into first and second groups according to the hiding key; an adjacent pixel sum calculating unit which calculates a sum of adjacent pixels corresponding to target pixels included in one of the first and second groups according to the data; and a converting unit which creates a converted image by adding a predefined value to the value of the target pixel or subtracting the predefined value therefrom, according to whether the sum of the adjacent pixels is less than or equal to a predefined threshold.

Description

[0001] APPARATUS AND METHOD FOR STAGEOGRAPHY [0002] APPARATUS AND METHOD FOR DATA RESTORATION [0003]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data hiding technique, and more particularly, to a technique for hiding and restoring data in an image.

Data hiding technology refers to a technique of hiding arbitrary data without significantly affecting the original image. Recently, for the data concealment method, pixels of an image are divided into two groups, and the values of pixels belonging to one of the two groups are invert to conceal the data.

An object of the present invention is to provide an apparatus and method for generating verification data required for verification of geographic data.

According to an aspect of the present invention, there is provided an image processing apparatus including: a receiving unit that receives an original image, a secret key, and data; A group forming unit dividing the original image into one or more blocks and forming target pixels located on a predetermined lattice among the pixels included in the block as a first group and a second group according to the secret key; An adjacent pixel sum calculating unit for calculating an adjacent pixel sum corresponding to a target pixel included in any one of the first group and the second group according to the data; And a conversion unit for generating a transformed image by adding or subtracting a predetermined value from the value of the target pixel according to whether the sum of the adjacent pixels is less than or equal to a predetermined threshold value.

The lattice may be a shape in which pixels in the upper, lower, left, and right directions of a target pixel located on the lattice are not located on the lattice.

The group forming unit may match each of the bits included in the target pixel and the secret key and include the target pixel in the first group or the second group based on the value of each bit included in the secret key have.

Wherein the conversion unit subtracts a predetermined value from the value of the target pixel when the sum of the adjacent pixels exceeds a predetermined threshold, and when the sum of the adjacent pixels is equal to or less than a predetermined threshold value, Can be added.

According to another aspect of the present invention, there is provided an image processing apparatus including: a receiving unit that receives a transformed image and a hidden key; A group forming unit for dividing the transformed image into one or more blocks and forming target pixels located on a predetermined lattice among the pixels included in the block as a first group and a second group according to the secret key; An adjacent pixel average calculation unit for calculating an adjacent pixel average corresponding to a target pixel included in the first group and the second group according to the data; And a second adder for adding the difference between the target pixel contained in the first group and the adjacent pixel average and the difference between each target pixel included in the second group and the adjacent pixel average, And a data extracting unit for selecting a bit corresponding to a group corresponding to a small sum of the two summation values as a bit for the block and generating data by merging the selected bits for each block.

The data decompression apparatus may further include a decompression unit that generates an image by adding or subtracting a predetermined value from the value of the target pixel according to whether the sum of adjacent pixels of the target pixel is equal to or less than a predetermined threshold value.

Wherein the restoring unit adds a predetermined value in the value of the target pixel when the sum of the adjacent pixels exceeds a predetermined threshold value and sets a predetermined value in the value of the target pixel when the sum of the adjacent pixels is less than a predetermined threshold value Can be deducted.

The lattice may be a shape in which pixels in the upper, lower, left, and right directions of a target pixel located on the lattice are not located on the lattice.

The group forming unit may match each of the bits included in the target pixel and the secret key and include the target pixel in the first group or the second group based on the value of each bit included in the secret key have.

According to another aspect of the present invention, there is provided a method for a data concealment apparatus to conceal data, comprising: receiving an original image, a concealment key and data; Dividing the original image into one or more blocks; Forming target pixels located on a predetermined lattice among the pixels included in the block into a first group and a second group according to the secret key; Calculating an adjacent pixel sum corresponding to a target pixel included in any one of the first group and the second group according to the data; And generating a transformed image by adding or subtracting a predetermined value from the value of the target pixel according to whether the sum of adjacent pixels is less than or equal to a predetermined threshold value.

The lattice may be a shape in which pixels in the upper, lower, left, and right directions of a target pixel located on the lattice are not located on the lattice.

Wherein the forming of the target pixel located on the predetermined lattice among the pixels included in the block as the first group and the second group according to the secret key comprises: matching each bit included in the target pixel and the secret key, And including the target pixel in the first group or the second group based on the value of each bit included in the secret key.

Wherein the step of generating a transformed image by adding or subtracting a predetermined value from the value of the target pixel according to whether the sum of adjacent pixels is less than or equal to a predetermined threshold value comprises: A step of subtracting a predetermined value from the value of the pixel and adding a predetermined value to the value of the target pixel when the sum of the adjacent pixels is equal to or less than a predetermined threshold value.

According to still another aspect of the present invention, there is provided a method of restoring hidden data by a data restoration device, comprising: receiving a transformed image and a secret key; Dividing the transformed image into one or more blocks; Forming target pixels located on a predetermined lattice among the pixels included in the block into a first group and a second group according to the secret key; An adjacent pixel average calculation unit for calculating an adjacent pixel average corresponding to a target pixel included in the first group and the second group according to the data; A second sum obtained by summing the difference between each target pixel included in the first group and the adjacent pixel average and a difference between each target pixel included in the second group and the adjacent pixel average, Selecting a bit corresponding to a group corresponding to a small sum of the sum as a bit for the block, and merging the bits selected for the block to generate data; A data restoration method is disclosed.

The data decompression method may further include generating an image by adding or subtracting a predetermined value from the value of the target pixel according to whether the sum of adjacent pixels of the target pixel is equal to or less than a predetermined threshold value.

Wherein the step of generating an image by adding or subtracting a predetermined value from the value of the target pixel according to whether the sum of adjacent pixels of the target pixel is equal to or less than a predetermined threshold value comprises: A step of adding a predetermined value to the value of the target pixel and subtracting a predetermined value from the value of the target pixel when the sum of the adjacent pixels is equal to or less than a predetermined threshold value.

Wherein the grid is a shape in which pixels in the upper, lower, left, and right directions of a target pixel located on the grid are not located on the grid.

The lattice may be a shape in which pixels in the upper, lower, left, and right directions of a target pixel located on the lattice are not located on the lattice.

Forming a target pixel located on a predetermined lattice among the pixels included in the block as a first group and a second group according to the secret key, the group forming unit may include a step of forming each of the bits included in the target pixel and the secret key And including the target pixel in the first group or the second group based on the value of each bit included in the secret key.

As described above, according to the present invention, it is possible to reduce image distortion due to insertion of hidden data.

In addition, according to the present invention, it is possible to reduce the probability of occurrence of an error in the restoration process of hidden data.

1 is a block diagram schematically illustrating a data hiding apparatus according to an embodiment of the present invention;
2 is a diagram illustrating a grid pattern used by a data hiding apparatus according to the first embodiment of the present invention to perform data hiding;
3 is a diagram illustrating a grid pattern used by a data concealment apparatus according to a second embodiment of the present invention to perform data concealment;
FIG. 4 illustrates a data recovery apparatus according to an embodiment of the present invention. FIG.
5 is a diagram illustrating a process of concealing data by a data concealment apparatus according to an embodiment of the present invention.
FIG. 6 is a diagram illustrating a process of data reconstruction performed by a data reconstruction apparatus according to an embodiment of the present invention; FIG.

While the present invention has been described in connection with certain exemplary embodiments, it is to be understood that the invention is not limited to the disclosed embodiments, but, on the contrary, is intended to cover various modifications and similarities. It should be understood, however, that the invention is not intended to be limited to the particular embodiments, but includes all modifications, equivalents, and alternatives falling within the spirit and scope of the invention.

Also, in this specification, when an element is referred to as " transmitting " a signal to another element, the element can be directly connected to the other element to transmit a signal, It should be understood that the signal may be transmitted by mediating another component in the middle.

1 is a block diagram schematically illustrating a data hiding apparatus according to an embodiment of the present invention.

The data hiding apparatus 100 according to an embodiment of the present invention includes a receiving unit 110, a group forming unit 120, an adjacent pixel sum calculating unit 130, and a converting unit 140.

The receiving unit 110 receives data, an image, and a secret key from an input device such as a keyboard or a network. In this case, the data means data to be hidden in the image, and the secret key means a secret key value issued so that only a specific person can extract data from the image. The receiving unit 110 transmits the data, the image, and the secret key to the group forming unit 120.

The group forming unit 120 divides each pixel included in the image into blocks of a predetermined size and divides the pixels located on the predetermined grid pattern among the pixels corresponding to each block into two groups. Hereinafter, the grid pattern will be described in detail with reference to FIGS. 2 and 3. FIG.

FIG. 2 is a diagram illustrating a grid pattern used by the data hiding apparatus according to the first embodiment of the present invention to perform data hiding. FIG. 3 is a diagram illustrating a data hiding apparatus according to the second embodiment of the present invention. Fig. 5 is a diagram illustrating a grid pattern used for performing the above-described embodiment.

Referring to FIG. 2, the group forming unit 120 divides an image into blocks each having a size of sxs (where s is a natural number equal to or greater than 1). The group forming unit 120 divides the pixels on the predetermined grid pattern among the pixels included in each block into two groups. The pixel on the lattice pattern according to the first embodiment may be a pixel located at the coordinate (i, j) according to the following equation (1).

[Equation 1]

i = 2k + 1 (0? k? (s-3) / 2)

j = 2l + 1 (0? k? (s-3) / 2)

In addition, the data concealment apparatus according to the second embodiment can divide the pixels corresponding to the grid pattern shown in FIG. 3 into two groups. A pixel on the lattice pattern according to the second embodiment may be a pixel according to Equation (1) and a pixel located at a coordinate (i, j) according to Equation (2).

&Quot; (2) "

i = 2k (0? k? (s-3) / 2)

j = 2l (0? k? (s-3) / 2)

The pixels in the upper, lower, left, and right directions of the pixels located on the grid pattern illustrated in FIGS. 2 and 3 are all pixels that are not located on the grid pattern. That is, the grid pattern may be a pattern in which the pixels in contact with the upper, lower, left, and right directions of the pixels (hereinafter, referred to as target pixels) located on the grid pattern are pixels other than the target pixel.

The group forming unit 120 generates a random number through a predetermined random number generator that generates a random number by using the secret key as a seed. The group forming unit 120 matches the target pixel with each bit of the generated random number one by one and, when the bit of the matched random number is 0, includes the target pixel as the first group. In addition, if the bit of the matched random number is 1, the group forming unit 120 includes the target pixel in the second group.

The adjacent pixel sum calculating unit 130 calculates the sum of the pixels in the upper, lower, left, and right directions of the target pixel included in the first group or the second group (hereinafter, Quot;).

The conversion unit 140 converts the target pixel so that one bit of data is inserted into one block. For example, when one bit on the data is 0, the conversion unit 140 may convert the target pixel included in the first group according to a predetermined pattern. In addition, the conversion unit 140 may convert the target pixel included in the second group according to a predetermined pattern when one bit of data is one.

At this time, the conversion unit 140 requests the adjacent pixel sum calculation unit 130 to calculate the adjacent pixel sum of the pixel to be converted. The conversion unit 140 receives the adjacent pixel sum from the adjacent pixel sum calculation unit 130 and subtracts a predetermined value I from the target pixel if the adjacent pixel sum exceeds the predetermined threshold value T do. In addition, when the adjacent pixel sum is equal to or less than the threshold value T, the conversion unit 140 adds a predetermined value I from the target pixel. The process of transforming the target pixel of the transform unit 140 may be summarized by Equation (3) below.

&Quot; (3) "

In this case, p ' _{i , j} means the transformed target pixel on the block phase coordinate (i, j), and p _{i , j} means the target pixel before transformation on the block phase coordinate (i, j). c _{i , j} denotes an adjacent pixel sum corresponding to a target pixel on a block phase coordinate (i, j).

Accordingly, the conversion unit 140 can generate and output a converted image obtained by concealing one bit per one block.

4 is a diagram illustrating a data restoration apparatus according to an embodiment of the present invention. Referring to FIG. 4, the data restoration apparatus 200 includes a receiving unit 210, a group forming unit 220, an adjacent pixel average calculating unit 230, a data extracting unit 240, and a restoring unit 250.

The receiving unit 210 receives the converted image and the hidden key from the external device or the network.

The group forming unit 220 divides the transformed image into blocks having a size of sxs (where s is a natural number equal to or larger than 1). The group forming unit 120 divides target pixels on a predetermined grid pattern among the pixels included in each block into two groups. The process of dividing the pixels on the lattice pattern into two groups (the first group and the second group) is the same as the group forming unit 120 of the data hiding apparatus 100, and thus a detailed description thereof will be omitted.

The adjacent pixel average calculating unit 230 calculates an adjacent pixel average that is an average of pixels in the upper, lower, left, and right directions of each target pixel for each block.

The data extracting unit 240 calculates the difference between each target pixel included in the first group and the average of the adjacent pixels, and calculates the sum of the calculated differences (hereinafter referred to as the first sum). Further, the data extracting unit 240 calculates the difference between each target pixel included in the second group and the adjacent pixel average, and calculates the sum of the calculated differences (referred to as a second sum). The data extracting unit 240 extracts the bits of the group corresponding to the smaller of the first sum and the second sum as hidden bits. For example, when the first summation value is smaller than the second summation value, the data extracting unit 240 regards the first group as a group including the converted target pixel, and outputs 0, which is a bit corresponding to the first group, Bit. If the second summation value is smaller than the first summation value, the data extracting unit 240 regards the second group as a group including the converted target pixel, extracts 1, which is a bit corresponding to the second group, do.

The process of calculating the first sum value and the second sum value of the data extracting unit 240 may be expressed by the following Equation 3 in the case of the lattice form according to FIG.

&Quot; (3) "

At this time, f is a first value or a second summer summing chiyigo, P _{2i + 1,2j + 1} is the value of the pixel located at the coordinates (2i + 1, 2j + 1 ) in each block, m _{i, j} is a neighbor is the average of the pixel _{(p 2i, 2j + 1 +} p 2i + 2,2j + 1 + p 2i + 1,2j + p 2i + 1,2j + 2) / 4. And n is the number of target pixels included in the first group or the second group.

The process of calculating the first sum value and the second sum value of the data extracting unit 240 may be expressed by Equation (4) in the case of the lattice form according to FIG.

&Quot; (4) "

(2i + 1, 2j + 1) in each block, and m _{i , j} are adjacent to each other. In this case, f is a first sum or a second sum, P _{2i +1} and _{2j +} coordinates in the pixel average of _{(p 2i, 2j + 1 +} p 2i + 2,2j + 1 + p 2i + 1,2j + p 2i + 1,2j + 2) / 4 , and, p _{2i, 2j} are the blocks ( and the values of the pixels located in _{2i, 2j), l i,} j is the average of adjacent pixels _{(p 2i -1,2j + p 2i +} 1,2j + p 2i, 2j-1 + p 2i, 2j + 1) / 4 and n is the number of target pixels included in the first group or the second group.

The data extracting unit 240 extracts 1-bit hidden bits per block by performing the above-described process for each block of the transformed image, and combines the extracted bits from each block to recover and output the concealed data.

The restoration unit 250 restores the transformed image into an image before transformation. For example, when each target pixel included in a group corresponding to a smaller one of the first sum value and the second sum value is greater than a predetermined threshold value T, If it exceeds the value (T), a predetermined value (I) is added to the target pixel. In addition, when the adjacent pixel sum is equal to or smaller than the threshold value T, the conversion unit 140 subtracts a predetermined value I from the target pixel. The restoration process of the restoration unit 250 may be summarized by the following equation (5).

&Quot; (5) "

In this case, d ' _{i , j} means the transformed target pixel on the block phase coordinate (i, j), and d _{i , j} means the target pixel of the transformed image on the block phase coordinate (i, j). c _{i , j} denotes an adjacent pixel sum corresponding to a target pixel on a block phase coordinate (i, j).

Therefore, the restoration unit 250 can restore the transformed image into the original image before being transformed and output it.

5 is a diagram illustrating a process of concealing data by a data concealment apparatus according to an embodiment of the present invention. Each process described below will be collectively referred to as a data hiding device 100 for performing the functions performed by the respective function units included in the data hiding device 100 or for the sake of brevity and clarity of the invention.

Referring to FIG. 5, at step 310, the data concealment apparatus 100 receives the secret data, the image and the secret key.

In step 320, the data concealment apparatus 100 divides the image into blocks of a predetermined size, and designates the target pixels of the image positioned on the predetermined lattice for each block into two groups according to the secret key.

In operation 330, the data concealment apparatus 100 calculates the adjacent pixel sum which is the sum of the pixels in the upper, lower left, and right directions of each target pixel included in one of the two groups according to the concealed data.

In step 340, the data concealment apparatus 100 determines in step 330 for each block whether a sum of adjacent pixels of a target pixel included in either one of the two groups is greater than a predetermined threshold value.

If the sum of adjacent pixels of the target pixel is larger than a predetermined threshold value, the data concealment apparatus 100 subtracts a predetermined value (I) from the value of the target pixel in step 350.

In step 360 where the adjacent pixel sum of the target pixel is less than the predetermined threshold, the data concealment apparatus 100 adds the predetermined value I to the value of the target pixel.

In step 370, the data concealment apparatus 100 outputs a transformed image including the transformed target pixel according to step 350 and step 360.

6 is a diagram illustrating a process of data reconstruction performed by a data reconstruction apparatus according to an embodiment of the present invention. Each of the processes described below will be collectively referred to as a data restoration device 110 in order to simplify and explain the process of each function part included in the data restoration device 110 described above.

In operation 410, the data recovery apparatus 110 receives the converted image and the secret key.

In operation 420, the data decompression apparatus 110 assigns target pixels of an image located on a predetermined grid to two groups according to a secret key.

In operation 430, the data decompression apparatus 110 calculates the adjacent pixel average by an average of the target pixels in the upper, lower, left, and right directions of each target pixel.

In step 440, the data restoration apparatus 110 calculates the difference between the average of the entry pixels for each target pixel and the target pixel for each group, and calculates the sum of the differences. For example, the data decompression apparatus 110 calculates a first sum value and a second sum value, which are the sum of the difference between the target pixel for each group and the average of the incident pixels for the target pixel.

In operation 450, the data recovery apparatus 110 determines whether the hidden bit is 0 or 1 according to the comparison result of the first sum value and the second sum value, and merges the hidden bits for each block to generate data.

In step 460, the data decompression apparatus 110 determines whether the adjacent pixel sum corresponding to the target pixel included in the group corresponding to the smaller of the first sum value and the second sum value is greater than a predetermined threshold value.

If the adjacent pixel sum corresponding to the target pixel included in the group corresponding to the smaller of the first sum value and the second sum value is greater than a predetermined threshold value, the data decompression apparatus 110 deletes the value Is added to a predetermined value.

If the adjacent pixel sum corresponding to the target pixel included in the group corresponding to the smaller of the first summed value and the second summed value is less than or equal to a predetermined threshold value, the data restoration apparatus 110 sets the value of the target pixel Subtracts a predetermined value.

In step 490, the data restoration apparatus 110 outputs the hidden data and the restored image.

Accordingly, the steps 470 and 480 described above can restore the transformed image to the original image by performing the addition and subtraction of the predetermined values in reverse, compared with the processes of steps 350 and 360 of FIG.

In addition, since the target pixel is converted according to the value of the adjacent pixel not converted in steps 350 and 360, the probability of occurrence of an error that the data generated in step 450 differs from the data received in step 310 can be reduced.

The present invention has been described above with reference to the embodiments thereof. Many embodiments other than the above-described embodiments are within the scope of the claims of the present invention. It will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims. The disclosed embodiments should, therefore, be considered in an illustrative rather than a restrictive sense. The scope of the present invention is defined by the appended claims rather than by the foregoing description, and all differences within the scope of equivalents thereof should be construed as being included in the present invention.

Claims (18)

A receiving unit for receiving the original image, the secret key and data;
A group forming unit dividing the original image into one or more blocks and forming target pixels located on a predetermined lattice among the pixels included in the block as a first group and a second group according to the secret key;
An adjacent pixel sum calculating unit for calculating an adjacent pixel sum corresponding to a target pixel included in any one of the first group and the second group according to the data; And
A conversion unit for adding or subtracting a predetermined value from the value of the target pixel according to whether the sum of the adjacent pixels is equal to or less than a predetermined threshold value,
.
The method according to claim 1,
Wherein the grid is a shape in which pixels in the upper, lower, left, and right directions of a target pixel located on the grid are not located on the grid.
The method according to claim 1,
The group forming unit may include the target pixel and each of the bits included in the secret key, and include the target pixel in the first group or the second group based on the value of each bit included in the secret key Characterized in that the data concealment device comprises:
The method according to claim 1,
Wherein the conversion unit subtracts a predetermined value from the value of the target pixel when the sum of the adjacent pixels exceeds a predetermined threshold,
And adds a predetermined value to the value of the target pixel when the sum of adjacent pixels is equal to or less than a predetermined threshold value.
A receiving unit receiving the converted image and the secret key;
A group forming unit for dividing the transformed image into one or more blocks and forming target pixels located on a predetermined lattice among the pixels included in the block as a first group and a second group according to the secret key;
An adjacent pixel average calculation unit for calculating an adjacent pixel average corresponding to a target pixel included in the first group and the second group according to the data; And
A second sum obtained by summing the difference between each target pixel included in the first group and the adjacent pixel average and a difference between each target pixel included in the second group and the adjacent pixel average, A data extracting unit for selecting a bit corresponding to a group corresponding to a small sum of the sum as a bit for the block and generating data by merging the bits selected for the block;
.
6. The method of claim 5,
A restoration unit for adding or subtracting a predetermined value from the value of the target pixel according to whether a sum of adjacent pixels of the target pixel is equal to or less than a predetermined threshold value,
Further comprising:
The method according to claim 6,
Wherein the restoration unit adds a predetermined value in the value of the target pixel when the sum of the adjacent pixels exceeds a predetermined threshold,
And subtracts a predetermined value from the value of the target pixel when the sum of adjacent pixels is equal to or less than a predetermined threshold value.
6. The method of claim 5,
Wherein the grid is a shape in which pixels in the upper, lower, left, and right directions of a target pixel located on the grid are not located on the grid.
6. The method of claim 5,
The group forming unit may include the target pixel and each of the bits included in the secret key, and include the target pixel in the first group or the second group based on the value of each bit included in the secret key Wherein said data restoration device comprises:
A method for a data concealment device to conceal data,
Receiving an original image, a secret key and data;
Dividing the original image into one or more blocks;
Forming target pixels located on a predetermined lattice among the pixels included in the block into a first group and a second group according to the secret key;
Calculating an adjacent pixel sum corresponding to a target pixel included in any one of the first group and the second group according to the data; And
Generating a transformed image by adding or subtracting a predetermined value from the value of the target pixel according to whether the sum of adjacent pixels is less than or equal to a predetermined threshold value;
/ RTI >
11. The method of claim 10,
Wherein the grid is a shape in which pixels in the upper, lower, left, and right directions of a target pixel located on the grid are not located on the grid.
11. The method of claim 10,
The forming of the target pixels located on the predetermined lattice among the pixels included in the block into the first group and the second group according to the secret key,
Matching the target pixel with each bit included in the secret key and including the target pixel in the first group or the second group based on the value of each bit included in the secret key. .
11. The method of claim 10,
The step of generating a transformed image by adding or subtracting a predetermined value from the value of the target pixel according to whether the sum of adjacent pixels is less than or equal to a predetermined threshold value,
Subtracting a predetermined value from the value of the target pixel when the sum of the adjacent pixels exceeds a predetermined threshold value,
And adding a predetermined value to the value of the target pixel when the sum of adjacent pixels is equal to or less than a predetermined threshold value.
A method for restoring hidden data by a data restoring device,
Receiving a transformed image and a secret key;
Dividing the transformed image into one or more blocks;
Forming target pixels located on a predetermined lattice among the pixels included in the block into a first group and a second group according to the secret key;
An adjacent pixel average calculation unit for calculating an adjacent pixel average corresponding to a target pixel included in the first group and the second group according to the data; And
A second sum obtained by summing the difference between each target pixel included in the first group and the adjacent pixel average and a difference between each target pixel included in the second group and the adjacent pixel average, Selecting a bit corresponding to a group corresponding to a small sum of the sum as a bit for the block, and merging the bits selected for the block to generate data;
/ RTI >
15. The method of claim 14,
Generating an image by adding or subtracting a predetermined value from a value of the target pixel according to whether a sum of adjacent pixels of the target pixel is equal to or less than a predetermined threshold value
Further comprising the steps of:
16. The method of claim 15,
The step of generating an image by adding or subtracting a predetermined value from the value of the target pixel according to whether the sum of adjacent pixels of the target pixel is equal to or less than a predetermined threshold value
A predetermined value is added to the value of the target pixel when the sum of the adjacent pixels exceeds a predetermined threshold value and a predetermined value is subtracted from a value of the target pixel when the sum of the adjacent pixels is equal to or less than a predetermined threshold value Wherein the step of reconstructing the data comprises the steps of:
15. The method of claim 14,
Wherein the grid is a shape in which pixels in the upper, lower, left, and right directions of a target pixel located on the grid are not located on the grid.
15. The method of claim 14,
Wherein forming the target pixels located on the predetermined lattice among the pixels included in the block into the first group and the second group according to the secret key
Wherein the group forming unit matches each of the bits included in the target pixel and the secret key and includes the target pixel in the first group or the second group based on a value of each bit included in the secret key .

Images