CN102263879A - Image data processing system and related data hiding method thereof - Google Patents

Abstract

The invention discloses an image data processing system, which comprises an image input module, a bitmap generation module and a coding module, wherein the image input module receives an image and confidential information, and obtains at least one gray scale image according to the image; the bitmap generation module is coupled to the image input module, and is used for generating a bitmap image according to the gray scale image and generating an order dither block truncation coding image according to the bitmap image and the gray scale image; each pixel in the bitmap image is a black or white point; and the coding module is coupled to the image input module and the bitmap generation module to generate a coded gray scale image according to the bitmap image and the confidential information. The coding module divides the gray scale image into a plurality of image blocks, finds candidate blocks with proximate black point and white point numbers from the image blocks, screens high frequency blocks from the found candidate blocks and hides the confidential information into the high frequency blocks to generate the coded gray scale image with the hidden confidential information.

Description

Image data processing system and related data hidden method thereof

Technical field

The present invention relates to a kind of data hiding technique, relate in particular to a kind of moderately, and utilize gray scale image to come the data-hiding method and the associated processing system thereof of hiding data with computation complexity.

Background technology

The digital halftone technology be a kind of with gray scale image with two kinds of color technique for displaying of black and white.Halftone technique is mainly used in print data, and for example Yin Shua magazine, newspaper and books or the like are because these output devices are only to export with black and white form.Halftone technique mainly is to utilize the human not high characteristic of eyes acuteness, so a uniform site, and we can control its density degree, utilizes monochrome pixels to demonstrate the GTG effect that originally will express.Halftone technique mainly can be divided into two big classes: standalone processes method and neighbor point facture.For the standalone processes method, the output of halftoning is normally passed through with certain mask (Mask) comparison by each pixel of original image and is got, and this kind method is representative with the method for trembling (DitherMethod).

The development of digital information and world-wide web in recent years is rapid, and the transmission opportunity of digital information file significantly increases, and make data be downloaded easily, alter and destroy at world-wide web, so protection of Intellectual Property Rights becomes more important.Most of multimedia in the storage area or the delivery time all store with the pattern of compressed-bit crossfire, therefore, the Information hiding subject under discussion just is subjected to popular attention.By doing some processing in multimedia content, as: add digital relief watermark, digital signature, can protect the copyright of digital information and the correctness and the ownership of authorization information.

A kind of common Stealth Modus be with data hidden in gray scale image, data hidden can also be reached compression effects in gray scale image.In this field, a kind of common coding algorithm be block block compiling method (Block Truncation coding, BTC).It is that an original image is divided into several nonoverlapping blocks that block blocks compiling method, and in the block that each is cut apart, replace the interior all pixel values of block with maximum in the block (maximumvalue) and minimum value (minimum value), maximum, minimum value and the bitmap that therefore can only need transmit each block just can calculate very quick in the original image before the receiving terminal reconstruction is not encoded.

Yet,, cause irksome false limit and block effect easily, and block is cut apart more greatly, and block effect more obviously influences the quality of coded image because each block that uses block to block in the coded image that coding produces has only maximum and minimum value.

Summary of the invention

In view of this, the invention provides a kind of data handling system that is used for data hidden with and data-hiding method, so that a confidential information is hidden in colour or the gray scale image, or hide the confidential information of going into and rebuild back original image by decoding in the image.

The embodiment of the invention provides a kind of image data processing system, and it comprises an image input module, a bitmap generation module and a coding module.Image input module receives an image and a confidential information, and obtains at least one gray scale image according to image.The bitmap generation module is coupled to image input module, produces a bitmap images and according to bitmap images and gray scale image, blocks coded image and produce an orderly shake block with the foundation gray scale image, and wherein each pixel in the bitmap images is black or white point.Coding module is coupled to image input module and bitmap generation module, with foundation bitmap images and confidential information, produces a coding gray scale image.Wherein, coding module is divided into a plurality of image block with gray scale image, and by finding out the stain candidate block close in the image block with the white point number, in the candidate block of being found out, filter out the high frequency block, again confidential information is hidden in the tremendously high frequency block at random, keep the coding gray scale image of confidential information with generation.

The embodiment of the invention provides a kind of data-hiding method in addition, with a confidential information data hidden in an image, it is applicable to a system, this system comprises at least one image input module, a bitmap generation module and a coding module.This method comprises the following steps.At first, receive an image and confidential information, and obtain at least one gray scale image according to image.Then, bitmap module produces an orderly shake block and blocks coded image, and obtain shaking the bitmap images that block blocks coded image in order corresponding to this according to a gray scale image and a halftoning array.Afterwards, coding module can be divided into bitmap images a plurality of image block, and by finding out the stain candidate block close with the white point number in the image block, by filtering out the high frequency block that belongs to HFS in the candidate block of finding out.Secondly, coding module can be hidden confidential information into the tremendously high frequency block at random, and obtains changing the plan of transposition image.At last, coding module can obtain the maximum and the minimum value of each block in the gray scale image, and utilizes the maximum and the minimum value of each block, replaces changing the corresponding block of bitmap images, keeps a coding gray scale image of confidential information with generation.

The embodiment of the invention more provides a kind of data-hiding method, decodes confidential information to comprise in the input coding gray scale image of a confidential information by one, and it is applicable to a system, and this system comprises at least one decoder module.This method comprises the following steps.At first, decoder module can utilize the input coding gray scale image, obtains a bitmap images.Then, this decoder module can be divided into bitmap images a plurality of image block, and by finding out the stain candidate block close with the white point number in the image block, by filtering out the high frequency block that belongs to HFS in the candidate block of finding out.Afterwards, decoder module utilizes the high frequency block in the bitmap images, and an average gray scale image of corresponding input coding gray scale image, decides to hide the place value into the high frequency block.At last, the place value of high frequency block is gone in the Tibetan that the decoder module utilization determines, and obtains confidential information.

Said method of the present invention can see through the procedure code mode and include in tangible media.When procedure code was written into and carries out by a machine, this machine will become in order to carry out device of the present invention.

Description of drawings

Accompanying drawing described herein is used to provide further understanding of the present invention, constitutes the application's a part, does not constitute limitation of the invention.In the accompanying drawings:

Figure 1A is for showing a data handling system that is used for data hidden according to the embodiment of the invention;

Figure 1B is the thin portion block diagram of demonstration one according to the bitmap generation module of the embodiment of the invention;

Fig. 2 A is for showing a schematic diagram according to halftoning array of the invention process;

Fig. 2 B is for showing the schematic diagram of a confidential information of demonstrating;

Fig. 3 is for the flow chart of demonstration one according to the data-hiding method of the embodiment of the invention, in order to a confidential information is hidden in the gray scale image;

Fig. 4 is for showing the schematic diagram in contiguous 3 * 3 zones on every side of a pixel B;

Fig. 5 is for showing another flow chart according to the data-hiding method of the embodiment of the invention;

Fig. 6 is the flow chart of demonstration one according to the data-hiding method of the embodiment of the invention, wherein comprises confidential information and rebuilds back gray scale image in order to go into the input coding image of confidential information from the Tibetan, to decode;

Fig. 7 is for showing another flow chart according to the data-hiding method of the embodiment of the invention;

Fig. 8 A is for showing the original gray scale image of a demonstration;

Fig. 8 B is for showing the data-hiding method according to the embodiment of the invention, and the orderly shake block that Fig. 8 A is produced blocks coded image;

Fig. 8 C is for showing the data-hiding method according to the embodiment of the invention, and the orderly shake block that keeps confidential information that Fig. 8 B is produced blocks coded image;

Fig. 8 D is for showing the data-hiding method according to the embodiment of the invention, by the bitmap images that is decoded among Fig. 8 C.

Drawing reference numeral:

100～system;

110～image input module;

120～bitmap generation module;

122～extreme value judging unit;

124～halftoning array lookup unit;

126～in order shake block blocks coding unit;

130～coding module;

132～high frequency region block analysis unit;

134～information embeds the unit;

140～decoder module;

142～high frequency region block analysis unit;

144～information reverting unit;

150～original gray scale image;

160～confidential information;

170～coding gray scale image;

180～decoded picture;

S310-S350～execution in step;

S610-S690～execution in step.

Embodiment

For above-mentioned and other purposes of the present invention, feature and advantage can be become apparent, cited below particularlyly go out preferred embodiment, and conjunction with figs., be described in detail below.

The present invention relevant for a kind of data handling system that is used for data hidden with and data-hiding method, so that confidential information (a for example watermark of half tone image) is hidden in colour or the gray scale image, or by decode in the image Tibetan into confidential information, and rebuild GTG or coloured image.Method proposed by the invention is with data concealment and coding techniques, data are embedded (Tibetan is gone into) to gray scale image, block coding (Ordered Dither Block Truncation Coding at orderly shake block, hereinafter to be referred as ODBTC) but the bit plane elasticity of image embeds different data volumes, wherein orderly shake is used for the jitter quantisation block and blocks coded image, avoids previous block to block irksome false limit and block effect that coded image causes.Compared to existing block method, under identical image quality efficient, the present invention not only can keep good image quality, also can make the decoding accuracy up to 100%.In addition; go into the image of confidential information according to the Tibetan that data-hiding method of the present invention produced; under the observation of human eye, can't find out difference; and can utilize decoding and rebuilding to return original image; and therefore the correct confidential information of concealing of decoding can provide a good mechanism of copyright protection to verify action.

Below introduce the data handling system that is used for data hidden of the embodiment of the invention.What must remind is, for convenience of description, be to be that a gray scale image is main describing with original image in following examples, yet the present invention is not limited to this.In other words, data handling system of the present invention and data-hiding method also can be used for handling the situation that original image is a coloured image.For instance, when original image is a coloured image, can earlier coloured image be converted to different look planes respectively, for example can be converted to R, G, three look planes of B respectively, the color separated image that each look plane is produced is considered as a gray scale image, again with data-hiding method of the present invention, apply mechanically to each pairing gray scale image in look plane and can reach identical effect.Similarly, when when decoding,, just can obtain the color effect of former figure as long as indivedual look planes corresponding codes gray scale image overlapping combining of decoding respectively again.For example, in certain embodiments, when original image is a coloured image, can adopt data-hiding method of the present invention respectively, each pairing gray scale image in look plane is hidden into identical or different confidential information, therefore can hide into more information.For instance, can hide respectively into three different watermark and carry out data hidden, decode by three look plane corresponding codes gray scale images respectively again during decoding and hide three watermark of going into R, G, three pairing gray scale images in look plane of B.

Figure 1A shows the data handling system that is used for data hidden 100 according to the embodiment of the invention.Shown in Figure 1A, comprise an image input module 110, a bitmap generation module 120, a coding module 130 and a decoder module 140 in this system 100 at least.Image input module 110 in order to receive an image and desire hide into a confidential information 160 (a for example watermark), and obtain at least one original gray scale image data 150 according to the image that receives.Wherein, image can be a coloured image or a gray scale image.What must remind is, in the present embodiment, image input module 110 can directly read a gray scale image with as original gray scale image data 150, and in another embodiment, image input module 110 can read a coloured image, be converted to R, G, three look planes of B respectively with the coloured image that will be read, and respectively with the pairing color separated image in plane of the same colour wherein, as original gray scale image data 150.Wherein, confidential information 160 is a half tone image.Generally speaking, the size of confidential information 160 depends on the size of original gray scale image 150.For example, if original gray scale image 150 sizes be 1024 * 1024 and each cut section block size be 8 * 8, then confidential information is necessary for 128 * 128, shown in Fig. 2 B.Bitmap generation module 120 is coupled to image input module 110, and it can receive original gray scale image data 150 and confidential information 160, and original gray scale image 150 is carried out ODBTC coding of the present invention, is encoded to main bitmap to produce ODBTC.Wherein, the hybrid technology that ODBTC is encoded to orderly shake (OD) and block blocks coding (BTC), wherein the account form of the pairing value of every bit of bitmap is shown in following equation (1).

Please refer to Figure 1B, it is the thin portion block diagram of demonstration one according to the bitmap generation module 120 of the embodiment of the invention.Shown in Figure 1B, bitmap generation module 120 can more comprise an extreme value judging unit 122, a halftoning array lookup unit 124 and is shaken block in order and blocked coding (ODBTC) unit 126.Wherein, extreme value judging unit 122 can be divided into a plurality of blocks with received original gray scale image 150, and to finding out its maximum and minimum value in each block of cutting apart, again with the maximum X that finds out _MaxWith minimum value X _MinBe sent to ODBTC unit 126.ODBTC unit 126 can receive the maximum X that extreme value judging unit 122 is found _MaxWith minimum value X _MinAnd utilize a halftoning array (shown in Fig. 2 A) that original gray scale image 150 is converted to a half tone image 150 ' (that is its pixel value is not that black (0) is exactly white (255)), again to stain or white point in each block that half tone image 150 ' cut out, with the maximum X in the pairing block in the original gray scale image 150 _MaxWith minimum value X _MinReplace, if stain then is substituted by minimum value X _MinOtherwise,, if white point then is substituted by maximum X _Max, and produce an ODBTC coded image in view of the above.

In the present invention, it adopts orderly dithering (Order dithering) that gray scale image is converted to a half tone image.The correlation computations that about how the orderly dithering of gray scale image utilization is converted to a half tone image is existing technology, below only lists its result, and details is omitted at this.

In this embodiment, at first, extreme value judging unit 122 can be a plurality of sub-block of block size for the original gray scale image of M * N is divided into n * n with the image block size.Suppose X _iThe GTG value unit that represents pixel in this block, calculate single order moment, second order moment and the variance of each block, then utilize the single order moment, second order moment and the variance that calculate that the pixel value in the block is represented with maximum (highmean) and minimum value (low mean) and bitmap again.

If maximizing and minimum value are respectively with x in the block of BTC _MaxWith x _MinExpression, the size of this halftoning array is identical with BTC cutting area block size, then shake in order block block coding (ODBTC) unit 126 can following equation generation ODBTC image:

$O_{i,j}=\left\{\begin{array}{cc}{x}_{\max },& \mathrm{if}{x}_{i,j}\&GreaterEqual;{\mathrm{DA}}_{i\mathrm{mod}M,j\mathrm{mod}N}^{\left(k\right)}+x_{\min }\\ x_{\min },& \mathrm{if}{x}_{i,j}<{\mathrm{DA}}_{i\mathrm{mod}M,j\mathrm{mod}N}^{\left(k\right)}+x_{\min }\end{array}\right.,---\left(1\right)$

Wherein, O _{I, j}The pixel value and the k=x of expression output _Max-x _Min, herein with two extreme values of the high mean value (high mean) of previous BTC and harmonic(-)mean value (low mean) with x _MaxWith x _MinThe reason of expression is that the threshold value for halftoning array (dither array) may be higher than high mean value or be lower than the harmonic(-)mean value.This phenomenon makes the reconstructed results sensation dark partially.Therefore, more use a kind of look-up table among the present invention based on the ODBTC image, and utilize halftoning array lookup unit 124 via following equation (2), each halftoning array is adjusted at different sizes, so that its correction is adjusted to 255, wherein the halftoning array of each specific size all has 255 different adjusted values (scaling value) of its correspondence.These 255 different adjusted values can be resultant by following formula:

${\mathrm{DA}}_{m,n}^{\left(k\right)}=k\&times;\frac{{\mathrm{DA}}_{m,n}-{\mathrm{DA}}_{\min }}{{\mathrm{DA}}_{\max }-{\mathrm{DA}}_{\min }}---\left(2\right)$

1≤k≤255,1≤m≤M and 1≤n≤N wherein; DA _MinWith DA _MaxThen represent maximum and minimum value in the halftoning array respectively. The dynamic area be k, its minimum value is 0, therefore

Value must add x _Min, so that the threshold value of the justice of all pixel values in the block to be provided.Because it is calculated off-line halftoning array in advance

Value, be used as a table of comparisons and use, and can effectively reduce complexity.

Coding module 130 is coupled to image input module 110 and bitmap generation module 120, and bitmap images and confidential information that it can be produced according to bitmap generation module 120 produce a coding gray scale image 170.Coding module 130 comprises that more a high frequency region block analysis unit 132 and data embed unit 134, wherein high frequency region block analysis unit 132 is divided into a plurality of image block with bitmap images, and by finding out the stain block close in these image block of cutting apart with as candidate block, by filtering out the high frequency block that belongs to HFS in the image in these candidate block of finding out with the white point number.Data embed unit 134 and confidential information are hidden at random to these high frequency blocks again, and then produce the coding gray scale image 170 that keeps confidential information.The explanation of following Fig. 3 is asked for an interview in the detailed action of coding module 130.

Fig. 3 shows a flow chart according to the data-hiding method of the embodiment of the invention, and it is in order to be hidden in a confidential information in the gray scale image.Can be applicable in the system 100 shown in Figure 1A according to the data-hiding method of the embodiment of the invention.Similarly, the original gray scale image 150 in the present embodiment can directly get by the gray scale image of input or by the color separated image of the coloured image of importing.At first, as step S310, data input module 110 can receive original gray scale images 150 and a desire hide into confidential information 160, wherein confidential information 160 is a half tone image.Generally speaking, the size of confidential information 160 depends on the size of original gray scale image 150.For example, if original gray scale image 150 sizes be 1024 * 1024 and each block size be 8 * 8, then confidential information 160 is necessary for 128 * 128.

Then, as step S312, bitmap generation module 120 can be with original gray scale image 150, (shown in Fig. 2 A) is converted to original half tone image via a halftoning array, again with stain and white point in the block of original half tone image, be made as maximum and minimum value in the corresponding original image block respectively, to obtain an ODBTC image.

Then, as step S320, the high frequency region block analysis unit 132 in the coding module 130 can be divided into a plurality of image block with original half tone image (being the bitmap image), and by finding out the stain candidate block close with the white point number in the image block of telling.Wherein, the judgement of the candidate block that stain is close with the white point number in the image block can be judged by the formula of following equation (3).

Because the halftoning array that is adopted is 16 * 16, it has symmetric property, therefore this halftoning array can be cut into 4 blocks.Each block is all 4 * 4.Fig. 2 A shows according to a halftoning array of the invention process.Therefore shown in Fig. 2 A, it is upper left identical with the bottom right, and is upper right identical with the lower-left, can all be divided into 4 * 4 to original half tone image, next, selects stain number and the most close block of white point number in the half tone image block, with as candidate block.Wherein, the judgement of the candidate block that the stain in the image block is close with the white point number, can be judged by the formula of following equation (3):

|#black?pixel-#white?pixel|＜BW _Th (3)

Wherein #black pixel represents total number of stain in the block, and #white pixel represents total number of white point in the block, and BW _ThBe adjustable threshold parameter, it can be defined according to actual demand.Therefore, if wherein the block formula that satisfies equation (3) promptly can be considered a candidate block.

After the decision candidate block,, filter out the high frequency block in the candidate block that high frequency region block analysis unit 132 is found out by step S320 again as step S330.Please refer to the explanation of following equation (4) about the mode that filters out the high frequency block.

The 132 pairs of candidate block that find in high frequency region block analysis unit judge whether to satisfy following equation (4):

CON _max≥#connect≥CON _min (4)

CON wherein _MaxWith CON _MinBe adjustable parameter.Generally speaking, bigger parameters C ON _MaxWith less parameters C ON _MinCan obtain more block and go into more confidential information, but excessive or too small parameter value also may can produce wrong judgement in decoding end with the Tibetan.If wherein a candidate block satisfies equation (4), represent that just this candidate block should belong to the HFS in the half tone image, is defined as the high frequency block with it.Wherein, parameter #connect is defined as follows:

$\mathrm{con}(m,n)=\underset{i=0}{\overset{7}{\mathrm{\&Sigma;}}}w\left(i\right)h(P,P_i)$

And

$h(P,P_i)=\left\{\begin{array}{cc}1& P=P_i,\\ 0& P{\&NotEqual;P}_i,\end{array}\right.$

$w\left(i\right)=\left\{\begin{array}{ccc}1,& \mathrm{for}& i=\mathrm{1,3,4,6}\\ 0,& \mathrm{for}& i=\mathrm{0,2,5,7}\end{array}\right.$

See also Fig. 4, it shows the schematic diagram in contiguous 3 * 3 zones on every side of a pixel B.Then, the con in the block (m n) adds up, and just can obtain the value of parameter #connect, is expressed as follows formulation:

$\#\mathrm{connect}=\underset{m,n\&Element;\frac{M}{2}X\frac{N}{2}}{\mathrm{\&Sigma;}}\mathrm{\&Sigma;con}(m,n)---\left(5\right)$

Wherein M * the N in the equation (5) represents the size of halftoning array, for example 8 * 8 arrays shown in Fig. 2 A.Therefore, the block that condition searched that satisfies aforesaid equation (4) just can be considered the high frequency block.

Find out after the high frequency block, data embed unit 134 just desire can be hidden into confidential information 160 be embedded in these high frequency blocks.So as step S340, data embed unit 134 and confidential information 10 can be hidden to go into to these high frequency blocks at random.Because confidential information 160 is a half tone image, therefore, only comprise 0 (being GTG value 0) and 1 (being GTG value 255) in the confidential information.In this step, if desire hide into the position for " 1 ", then with all pixel values counter-rotatings in corresponding this high frequency block, that is black bleaching, leucismus is black.On the contrary, if desire hide into the position for " 0 ", then all pixel values in corresponding this high frequency block are kept original values.Hiding one in the fashionable confidential information names a person for a particular job to be gone in the high frequency block by the Tibetan.

It should be noted that; the present invention also can utilize original confidential information one default golden key (key) that it is broken up earlier before hiding confidential information, with form desire hide into the confidential information figure; utilize formed confidential information figure execution in step S340 again, then further protected data.

As step S350, data embed unit 134 can correspond to corresponding original gray scale image 150 with the half tone image of this change, insert the maximum (high mean) and the minimum value (low mean) of each corresponding block in the gray scale image 150, and its corresponding block of difference substitution, to obtain keeping the coding gray scale image 170 of confidential information.What deserves to be mentioned is, in the present embodiment, block all is cut into the block of 8 * 8 sizes, when only the half tone image after the coil insertion device confidential information will be inserted maximum and minimum value, adopting the block size is 4 * 4 maximum and minimum values with corresponding block in the gray scale image, come backfill to hide half tone image, therefore can make image seem more not have block effect into confidential information.Through abovementioned steps S310 to S350, just confidential information can be hidden to image.

Fig. 5 shows another flow chart according to the data-hiding method of the embodiment of the invention, so that a confidential information is hidden in the gray scale image.Please be simultaneously with reference to Fig. 8 A to Fig. 8 C.Fig. 8 A shows an original gray scale image that is used to illustrate.Fig. 8 B shows the data-hiding method according to the embodiment of the invention, and the orderly shake block that Fig. 8 A is produced blocks coded image.Fig. 8 C shows the data-hiding method according to the embodiment of the invention, the coding gray scale image that keeps confidential information that Fig. 8 B is produced.

At first, original gray scale image 50 (as Fig. 8 A) is blocked coded system through orderly shake block of the present invention as the aforementioned, be encoded into orderly shake and block coding (ODBTC) image 51 (shown in Fig. 8 B), again by obtaining bitmap images 52 in the ODBTC image.Then, bitmap images is seen through formula (3), find out candidate block possible in the bitmap images block 53, again by utilizing formula (4) to filter out high frequency block 54 in the candidate block.The high frequency block 54 that these filter out will be used to hide confidential information.Afterwards, after confidential information 55 was utilized a golden at random key beater confidential information earlier, the confidential information after breaing up was inserted corresponding high frequency block 54 again, wherein, if desire hide into the position for " 1 ", then with all pixel values counter-rotatings in corresponding this high frequency block, that is black bleaching, leucismus is black.On the contrary, if desire hide into the position for " 0 ", then all pixel values in corresponding this high frequency block are kept original values.Therefore, can produce the bitmap images of a change, the bitmap images of this change keeps confidential information.At last, the bitmap images that utilizes ODBTC 51 again and change adds together 58, block coded image (shown in Fig. 8 C) with the orderly shake block that obtains containing confidential information, this ODBTC image that contains confidential information is the coding gray scale image, afterwards, the coding gray scale image can be sent to receiving terminal gets final product.

System 100 can more comprise a decoder module 140, to go into the input coding image of confidential information, to decode wherein to comprise confidential information 160 from the Tibetan and to rebuild back gray scale image or coloured image (being decoded picture 180).Decoder module 140 can more comprise a high frequency region block analysis unit 142 and a reduction of data unit 144.Wherein, high frequency region block analysis unit 142 is in order to find out the high frequency block that belongs to HFS in the image, and its action is similar to high frequency region block analysis unit 132, so details is omitted at this.Reduction of data unit 144 corresponds to relative position with the confidential information position of being judged in the high frequency region block analysis unit 142 detected high frequency blocks, just can obtain half tone image data, and this half tone image is hides the confidential information of going into.It should be noted that, if before hiding confidential information, have and earlier original confidential information is utilized a default golden key that it is broken up, then in this step, resulting half tone image must utilize the golden key before broken up to break up detected image is counter, just can separate back the real confidential information of going into of hiding.The explanation of following Fig. 6 is asked for an interview in the detailed action of decoder module 140.

Fig. 6 shows a flow chart according to the data-hiding method of the embodiment of the invention, and it is in order to from the input coding image of hiding confidential information, decodes wherein to comprise confidential information and also rebuild back gray scale image or coloured image.Similarly, the data-hiding method according to the embodiment of the invention can be applicable to as the system among Figure 1A 100.At first, as step S610, data input module 110 meeting receptions one keep the input coding image 170 of confidential information.In the present embodiment, the ODBTC coded image of input coding image for forming according to ODBTC coded system coding of the present invention.As step S620, utilize to receive the ODBTC coded image 170 of hiding confidential information, can produce the bitmap images that has only stain and white point.Wherein, if the wherein pixel value in the ODBTC image is when being maximum (high mean), its corresponding bitmap pixels value just is 1, and when if the wherein pixel value in the ODBTC image is minimum value (low mean), its corresponding bitmap pixels value just is 0.Then, as step S630, the bitmap images that high frequency region block analysis unit 142 will produce, and utilize aforementioned formula (3) to find the stain number block similar in the block to the white point number, just these blocks can be used as candidate block.Find out after the interior stain number of the block candidate block similar to the white point number, as step S640, high frequency region block analysis unit 142 utilizes formula (4) that the candidate block that is found is calculated again, judges the high frequency block.Afterwards, as step S650, image restoring unit 144 will be with the block relative position that is found, and the half tone image obtained with average gray scale image calculates Hamming distance (Hamming distance) H _dWherein, image restoring unit 144 will ask average after all the pixel value additions in the ODBTC coded image 170 earlier, to obtain an average pixel value, again each pixel value is made as average pixel value to form average gray scale image, utilize as the aforementioned halftoning array (shown in Fig. 2 A) that average gray scale image is carried out the second time of shake (second round ordereddithering) computing in order again, to obtain half tone image.Then, as step S660, the Hamming distance H that calculates can be judged in image restoring unit 144 _dWhether more than or equal to half of number of pixels in the block.If H _dHalf ("Yes" of step S660) more than or equal to block size number of pixels, represent that then it is via counter-rotating (inverse) operation that the interior pixel value of this block has half, this block is via a large amount of counter-rotatings, therefore can determine the confidential information value of hiding into this block to be " 1 " (step S670).On the contrary, if H _dLess than half ("No" of step S660) of block size number of pixels, represent that the pixel value in this block does not pass through reverse turn operation, therefore can determine the confidential information value of hiding to be " 0 " (step S680) into this block.

After all high frequency block execution of step S670-S680, as step S690, the confidential information position that image restoring unit 144 can be judged detected high frequency block corresponds to relative position, just can obtain half tone image data, and this half tone image is hides the confidential information 160 of going into.It should be noted that, if before hiding confidential information, have and earlier original confidential information is utilized a default golden key that it is broken up, then in this step, resulting half tone image must utilize the golden key before broken up to break up detected image is counter, just can separate back the real confidential information of going into of hiding.Because confidential information utilization gold key is broken up, can prevent therefore that data in the data transfer procedure are stolen and the problem of leaking confidential information takes place.In addition, according to the data-hiding method of Fig. 6, can return hiding confidential information 100% decoding of going into, decoding rate is 100%.

Fig. 7 shows another flow chart according to the data-hiding method of the embodiment of the invention, and it is in order to from the input coding image of hiding confidential information, decodes wherein to comprise confidential information and rebuild back gray scale image or coloured image.Please be simultaneously with reference to Fig. 8 C to Fig. 8 D.Fig. 8 D is for showing the data-hiding method according to the embodiment of the invention, by decoded among Fig. 8 C bitmap images.

At first, utilize the orderly shake block that contains confidential information that receives to block coding (ODBTC) image 70 (shown in Fig. 8 C), obtain a bitmap images 71.By the mode that obtains bitmap images 71 in the ODBTC image 70 that contains confidential information, for pixel value in the ODBTC image 70 that will receive is that the peaked of block just is made as 1, and pixel value be block minimum value just be made as 0, produce bitmap images 71 by this.Note that bitmap images 71 still keeps confidential information.Then, bitmap images 71 via formula (3), is found the stain number candidate block 72 close with the white point number in the block.Again by in the candidate block 72 that finds via formula (4), filter out and belong to the subregional high frequency block 73 of radio-frequency head.Again these high frequency blocks 73 are carried out anti-halftoning computing, obtain the bitmap 74 of anti-halftone, again to the bitmap 74 of anti-halftone, utilize the halftoning array (as Fig. 2 A shown in) identical to carry out the second time of shake computing in order afterwards with coding side, and the bitmap 75 that obtains changing.Afterwards, calculate the bitmap 75 of change and the Hamming distance H between the ODBTC image 70 resulting bitmap images 71 again _d, and judge the Hamming distance H that calculates _dWhether more than or equal to number of pixels in the block half 76.Therefore for instance, in the present embodiment, the block size is 4 * 4, so number of pixels is 16 in the block, judges that the Hamming distance that calculates whether more than or equal to number of pixels in the block half, is and judges the Hamming distance H that calculates _dWhether more than or equal to 8.If the Hamming distance H that calculates _dHalf ("Yes" of step S660) more than or equal to block size number of pixels, represent that it is via counter-rotating (inverse) operation that the interior pixel value of this block has half, this block is via a large amount of counter-rotatings, can determine the confidential information value of hiding to be " 1 ", so can find all blocks 78 of hiding " 1 " into this block.On the contrary, if H _dLess than block size number of pixels half, represent that the pixel value in this block does not pass through reverse turn operation, can determine the confidential information value of hiding to be " 0 ", so can find all blocks 77 of hiding " 0 " into this block.Afterwards, the block 78 of hide " 1 " is combined with the block 77 of hiding " 0 " obtain a temporary transient bitmap images (shown in Fig. 8 D) again.If confidential information is not broken up with random key earlier in compression end, then this temporary transient bitmap images is and hides the confidential information of going into.Yet, in the present embodiment, be compression end is broken up confidential information earlier with random key after, to be encoded to example again, therefore, need counter to break up running after 80s with detecting the golden at random key of imagery exploitation of hiding the implantation site in the temporary transient bitmap images, the confidential information 81 that just can obtain rebuilding.In addition, if wish to get original gray scale image, can compare ODBTC image 70 that contains confidential information and the block 78 of hiding " 1 ", all pixel values counter-rotatings in the corresponding block of the block that will contain in the ODBTC image 70 of confidential information and hide " 1 " 78, the orderly shake block that just can obtain reversing blocks coded image (decoded picture), and the orderly shake block that just can reverse thus blocks coded image and obtains original gray scale image.

Be noted that though aforementioned modules of the present invention or unit are the independent assembly that is illustrated as this system, these two or more assemblies can be incorporated into together, thereby can reduce intrasystem package count.In like manner, one or above assembly can be separated to use, thereby increase intrasystem package count.In addition, these modules or unit block can be implemented in the combination of any hardware, firmware and software.

Method of the present invention, or specific kenel or its part, can be contained in tangible media with the kenel of procedure code, get (getting) Storage Media as floppy disk, CD, hard disk or any other machine readable as computer-readable, wherein, when procedure code by machine, when being written into and carrying out as computer, this machine becomes in order to participate in device of the present invention.Method and apparatus of the present invention also can see through some transfer mediums with the procedure code kenel, transmit as electric wire or cable, optical fiber or any transmission kenel, wherein, when procedure code by machine, as the computer reception, when being written into and carrying out, this machine becomes in order to participate in device of the present invention.When the general service processor is done in fact, the procedure code associative processor provides a class of operation to be similar to the unique apparatus of using particular logic circuit.

Though the present invention discloses as above with preferred embodiment; right its is not in order to qualification the present invention, any those skilled in the art, without departing from the spirit and scope of the present invention; when can doing a little change and retouching, so protection scope of the present invention is as the criterion when looking the claim scope person of defining.

Claims (10)

1. an image data processing system is characterized in that, described image data processing system comprises:

One image input module receives an image and a confidential information, and obtains at least one gray scale image according to described image;

One bitmap generation module, couple described image input module,, produce a bitmap images and described bitmap images of foundation and described gray scale image in order to according to described gray scale image, produce an orderly shake block and block coded image, each pixel in the wherein said bitmap images is black or white point; And

One coding module is coupled to described image input module and described bitmap generation module, according to described bitmap images and described confidential information, produces a coding gray scale image,

Wherein said coding module is divided into a plurality of image block with described gray scale image, and by finding out the stain candidate block close in the described image block with the white point number, by filtering out the high frequency block in the described candidate block of finding out, again described confidential information is hidden at random to described high frequency block, keep the described coding gray scale image of described confidential information with generation.

2. image data processing system as claimed in claim 1, it is characterized in that, described coding module comprises a high frequency region block analysis unit, described oscillometry unit judges more whether in the described image block each satisfies following equation, with by finding out the stain candidate block close in the described image block with the white point number:

|#black?pixel-#white?pixel|＜BW _Th，

Wherein #black pixel represents total number of stain in the block, and #white pixel represents total number of white point in the block, and BW _ThBe adjustable threshold parameter.

3. image data processing system as claimed in claim 1, it is characterized in that, described coding module comprises that more data embed the unit, in order to hide in desire into the place value of described confidential information be 1 o'clock, the place value counter-rotating of all pixels in the high frequency block that described desire is hidden, to produce the corresponding block in the described change bitmap images, and desire hide into the place value of confidential information be 0 o'clock, it is identical producing the corresponding block in this change bitmap images that the place value that described desire is hidden all pixels in the block keeps, described confidential information is hidden at random into to described high frequency block.

4. image data processing system as claimed in claim 1, it is characterized in that, described image data processing system more comprises a decoder module, in order to be decoded described confidential information and to be rebuild back described gray scale image by the described coding gray scale image that keeps described confidential information.

5. image data processing system as claimed in claim 1 is characterized in that described image comprises a coloured image, and described coloured image has plane of the same colour at least, and described image input module obtains described gray scale image according to described look plane.

6. a data-hiding method is characterized in that, described data-hiding method is applicable to a system in order to a confidential information is hidden in the image, and described system comprises an at least one bitmap generation module and a coding module, comprises the following steps:

Receive an image and described confidential information and obtain at least one gray scale image according to described image;

Described bitmap module produces an orderly shake block and blocks coded image, and obtain the bitmap images that corresponding described orderly shake block blocks coded image according to a described gray scale image and a halftoning array;

Described coding module is divided into a plurality of image block with described bitmap images, and by finding out the stain candidate block close with the white point number in the described image block;

Described coding module is by filtering out the high frequency block that belongs to HFS in the described candidate block of finding out;

Described coding module hides described confidential information at random into to described high frequency block, obtain changing the plan of transposition image, wherein if desire hide into the place value of described confidential information be 1 o'clock, the place value counter-rotating of all pixels in the high frequency block that described desire is hidden, to produce the corresponding block in the described change bitmap images, and if desire hide into the place value of confidential information be 0 o'clock, the place value of described desire being hidden all pixels in the block keeps identical to produce the corresponding block in the described change bitmap images; And

Described coding module obtains the maximum and the minimum value of each block in the described gray scale image, and the maximum of utilizing each block and minimum value replace the corresponding block of described change bitmap images, keeps a coding gray scale image of described confidential information with generation.

7. data-hiding method as claimed in claim 6 is characterized in that, it is to hide to described high frequency block after utilizing a golden at random key that described confidential information is broken up at random that described coding module hides described confidential information at random to the step of described high frequency block again.

8. data-hiding method, it is characterized in that described data-hiding method decodes described confidential information in order to comprise in the input coding gray scale image of a confidential information by one, is applicable to a system, described system comprises at least one decoder module, comprises the following steps:

Described decoder module utilizes described input coding gray scale image, obtains a bitmap images;

Described decoder module is divided into a plurality of image block with described bitmap images, and by finding out the stain candidate block close with the white point number in the described image block;

Described decoder module is by filtering out the high frequency block that belongs to HFS in the described candidate block of finding out;

Described decoder module utilizes a described high frequency block in the described bitmap images and an average gray scale image of corresponding described input coding gray scale image, determines the place value of hiding described high frequency block; And

Described decoder module utilizes the described Tibetan that determines to go into the place value of described high frequency block, obtains described confidential information,

Wherein said decoder module is to judge whether in the described image block each satisfies following equation by the step of finding out the stain candidate block close with the white point number in the described image block:

|#black?pixel-#white?pixel|＜BW _Th，

Wherein #black pixel represents total number of stain in the block, and #white pixel represents total number of white point in the block, and BW _ThBe adjustable threshold parameter.

9. data-hiding method as claimed in claim 8 is characterized in that, described data-hiding method more comprises:

Described decoder module utilizes the described Tibetan that determines to go into the place value and the described input coding gray scale image of described high frequency block, rebuilds back a gray scale image,

When wherein the place value of going into a wherein block of described high frequency block when the described Tibetan that determines is 1, with in the described input coding gray scale image corresponding to the counter-rotating of the pixel value in the block of described block, to produce described gray scale image.

10. data-hiding method as claimed in claim 8, it is characterized in that, described decoder module utilizes a described high frequency block in the described bitmap images and an average gray scale image of corresponding described input coding gray scale image, and the step that determines the place value of hiding described high frequency block more comprises:

According to described average gray scale image, obtain a corresponding bitmap images;

Calculate the Hamming distance between the corresponding block of each described high frequency block and described corresponding bitmap images;

If described Hamming distance is more than or equal to a half of all number of pixels of a block, determining the place value of hiding described high frequency block is 1; And

If described Hamming distance is less than a half of all number of pixels of a block, determining the place value of hiding described high frequency block is 0.

Images