CN103984932A - Anti-light face recognition method based on transform domain robust watermark under big data - Google Patents

Abstract

The invention discloses an anti-light face recognition method based on transform domain robust watermarks under big data. The anti-light face recognition method mainly includes a watermark embedding process and a watermark extraction process, wherein face recognition is realized in the watermark extraction process. The anti-light face recognition method mainly comprises the following steps that in the watermark embedding process, firstly, global DCT is conducted on all original faces so that feature vectors can be worked out, and secondly, the watermark of each face is associated with the feature vector of the corresponding face through a hash function in cryptology; in the watermark extraction process, thirdly, the feature vector of the face to be tested is obtained, the correlation coefficient maximum value of the feature vector of the face to be tested and the original face feature vector is worked out, face recognition is completed according to a serial number corresponding to the correlation coefficient maximum value, and the corresponding embedded watermark is obtained, and fourthly, the feature vector of the face to be tested is used for watermark extraction, and the correlation coefficient of the watermark is calculated. The anti-light face recognition method has the advantages of being applicable to the big data because sampling training is not needed, and has high resistance to light, occlusion and other attacks.

Description

Anti-light photograph based on transform domain robust watermarking under large data attacked face identification method

Technical field

The present invention relates to a kind of field of multimedia signal processing, be specifically related to anti-light photograph the based on transform domain robust watermarking under large data and attack face identification method.

Technical background

Face recognition technology, as the effective biometrics identification technology of one, obtains the attention of industry member and academia day by day over nearly 40 years.Can accept because face recognition technology has height, naturality, is difficult for by advantages such as people discover, and therefore it has larger purposes at aspects such as amusement, crime survey, gate control system, military affairs.

The method of recognition of face is at present mainly based on machine learning methods such as PCA, neural network, SVM, owing to will carrying out training study, sample for identification is larger, under large data environment, the time of study is longer, and current face identification method is for illumination variation, and expression shape change or shade etc. are more responsive, therefore how to solve under large data environment, the face identification method that anti-illumination variation, expression shape change or shade etc. are attacked is significant.

Digital watermark technology is the copyright protection for the Digital Media on internet at first, and its key property is robustness and invisibility; The present invention can be hidden in using people's signature or ID etc. as watermark in its corresponding facial image, utilizes the robust property of watermark to realize face recognition algorithms, especially to illumination, the attack such as block and there is good robustness.At present for based under large data environment, anti-light photograph, block Face Recognition less of attack, also do not see at present disclosed report.Therefore the robust watermarking technology of studying based on transform domain realizes the anti-light face identification method according to attacking under large data, has larger meaning.

Summary of the invention

Goal of the invention: technical matters to be solved by this invention is for the deficiencies in the prior art, provides at a high speed, the face recognition algorithms of high robust.Specifically disclosing under a kind of large data is a kind of zero watermarking project based on the anti-light of transform domain robust watermarking according to attacking face identification method, and the embedding of watermark does not affect original facial image.

Ultimate principle of the present invention is: first all people's face image is carried out to overall dct transform; Choose front 8x8 coefficient of low frequency part, then in this coefficient, find an anti-light proper vector according to attacking, and watermark sequence is associated and realizes the embedding of watermark with this proper vector; Then for testing image, first calculate its proper vector, then calculate the related coefficient of the proper vector of testing image and original image, utilize related coefficient maximal value, realize the detection of face; And realize the extraction of watermark.

Now be elaborated as follows to method of the present invention:

First select a significant binary sequence will embed in facial image as watermark, be designated as W={w (j) | w (j)=0,1; 1≤i≤L}; Meanwhile, choosing and establishing F is original facial image, represents: F={f (i, j) | f (i, j) ∈ R; 1≤i≤M1,1≤j≤N1}.Wherein, f (i, j) represents the pixel value of original face.

Part I: the embedding of watermark

1), by all original facial image F (n) are carried out to overall dct transform, obtain the proper vector set V (n) of original image;

First original facial image F (n) is carried out to overall dct transform, in the low frequency coefficient matrix F D (i, j) of frequency field, choose front 8 × 8 coefficient FD ₈(i, j), and then to the matrix of coefficients FD selecting ₈(i, j) carries out binary conversion treatment, gets 1 in the time that coefficient is more than or equal to zero, and being less than 0 is to get zero, obtains proper vector V, and main process is described below:

FD ₈(i,j)＝DCT2(F(i,j))

V(n)＝BINARY(FD ₈(i,j))

2) utilize cryptography HASH function, generate two-value key sequence Key (n) with watermarked information, realize the embedding of zero watermark;

Key(n)＝V(n)⊕W(n)

Key (n) is by the proper vector V (n) of all original images and corresponding n digital watermarking W (n), and the Hash function conventional by cryptography generates; Here the random series that W (n) is 64bit by length forms; Preserve Key (n), while extracting watermark below, will use; By Key (n) is applied for to third party as key, to obtain the right to use and the entitlement of facial image;

Part II: the identification of face and the extraction of watermark

3) obtain the proper vector V' of face F' to be measured;

If face to be measured is F', after overall two-dimensional dct transform, obtaining low frequency coefficient matrix is FD ' (i, j), by step 1) low frequency coefficient matrix is carried out to binary conversion treatment, obtain the proper vector V' of face to be measured;

FD ₈'(i,j)＝DCT2(F'(i,j))

V'＝BINARY(FID'(i,j))

4) calculate the related coefficient NC (n) of the proper vector V' of face to be measured and the V of original face (n), carry out the identification of face;

Calculate the corresponding n value of related coefficient maximal value of V' and V (n), establish n=k; Can obtain key K ey (k), identify original facial image according to k value is F (k) and the watermark value W (k) that is embedded in F (k), and the normalized correlation coefficient formula of calculated characteristics vector is as follows:

$\mathrm{NC}=\frac{\underset{i}{\mathrm{\Σ}}V\left(i\right)V^{\′}\left(i\right)}{\underset{i}{\mathrm{\Σ}}{V}^2\left(i\right)}$

5) utilize the proper vector V ' that is present in third-party two-valued function key sequence Key (k) and face to be measured, extract the watermark W'(k in testing image);

W'(k)＝Key(k)⊕V'

6) calculate the related coefficient between W' and W (k); Calculate the related coefficient of the watermark of extraction and the watermark of embedding, and can differentiate according to watermark the content of testing image.

The present invention and existing face recognition technology relatively have following advantage:

First: preferably the identification of the robustness of watermark and invisibility and face has been carried out to organic combination; Utilize the Robust Algorithms of watermark, realized the attacks such as the anti-light photograph, shade, face's distortion of face algorithm, and the embedding of watermark does not affect the pixel value of original image; Secondly: watermark can also be protected individual privacy, only has the user of mandate just can carry out the identification of face; Finally, and due to this face recognition technology, do not need the study of sample, so be suitable for a large amount of recognitions of face, be suitable for the identification of large data human face.

Below from theoretical foundation and experimental data explanation:

1) discrete cosine transform

DCT is the standard of now widely used JPEG compression and MPEG-1/2 for Image Coding.DCT is in the little suboptimum orthogonal transformation that is only second to Karhunen-Loeve transformation drawing of Minimum Mean Square Error condition, is a kind of harmless chief of a tribe conversion.Its fast operation, precision is high, to extract optimum balance between ability and the arithmetic speed of characteristic component and famous.

2-D discrete cosine direct transform (DCT) formula is as follows:

$F(u,v)=c\left(u\right)c\left(v\right)\underset{x=0}{\overset{M-1}{\mathrm{\Σ}}}\underset{y=0}{\overset{N-1}{\mathrm{\Σ}}}f(x,y)\cos \frac{\mathrm{\π}(2x+1)u}{2M}\cos \frac{\mathrm{\π}(2y+1)v}{2N}$

u＝0,1,…,M-1；v＝0,1,…,N-1；

In formula

$c\left(u\right)=\left\{\begin{array}{cc}\sqrt{1/M}& u=0\\ \sqrt{2/M}& u=\mathrm{1,2},\·\·\·,M-1\end{array}\right.$ $c\left(v\right)=\left\{\begin{array}{cc}\sqrt{1/N}& v=0\\ \sqrt{2/N}& v=\mathrm{1,2},\·\·\·,N-1\end{array}\right.$

2-D discrete cosine inverse transformation (IDCT) formula is as follows:

$f(x,y)=\underset{u=0}{\overset{M-1}{\mathrm{\Σ}}}\underset{v=0}{\overset{N-1}{\mathrm{\Σ}}}c\left(u\right)c\left(v\right)F(u,v)\cos \frac{\mathrm{\π}(2x+1)u}{2M}\cos \frac{\mathrm{\π}(2y+1)v}{2N}$

x＝0,1,…,M-1；y＝0,1,…,N-1

Wherein x, y is spatial domain sampled value; U, v is frequency field sampled value, digital picture represents by pixel square formation conventionally, i.e. M=N

From formula above, the coefficient symbols of DCT is relevant with the phase place of component.

2) choosing method of the visual feature vector of facial image robust

Current most of face recognizer to illumination, shade, the poor reason of expression shape change anti-attack ability be when these attack implement be that under spatial domain, larger variation has occurred pixel value, particularly the impact of indoor and outdoor illumination; Can the proper vector that find an anti-light photograph, shade etc. to attack significant.If can find the proper vector of a reflection facial image geometrical feature, in the time there is little geometric transformation and illumination variation in facial image, can there is not obvious sudden change in this proper vector, so according to this proper vector, utilize the maximal value of related coefficient, we try to achieve corresponding original image, and extract corresponding watermark.

For this reason, choose some illumination and attack, the experimental data of the conventional attacks such as shade attack and filtering is shown in Table 1.The original image that is used as test in table 1 is Fig. 1, is the first width face of ORL face database, by the AT & T of Cambridge University establishment of laboratory; What in table 1, " the 1st row " showed is the attack type that face recognition algorithms is subject to, and this facial image after the illumination that is subject to varying strength is attacked is shown in Fig. 2 to Fig. 4, and intensity of illumination is ascending; Block to attack and see Fig. 5 to Fig. 7; Comprise, study that common glasses block, mouth mask blocks with cap and blocks; Fig. 8 is that extruding is attacked, and this attack is similar to expression shape change and attacks; The conventional attacks such as Gaussian noise, JPEG compression, medium filtering are shown in Fig. 9 to Figure 12.Y-PSNR (PSNR) after what " the 2nd row " of table 1 represented is facial image is under attack; " the 10th is listed as " arrive in " the 3rd row " of table 1, is the low frequency coefficient after dct transform, choose here " D (1,1), D (1,2) ... D (2,4) " etc. eight low frequency variations domain coefficients." the 11st row " of table 1 are the symbol sebolic addressings for feature extraction.We find data by this table, for the attacks such as illumination, shade bird caging, the low frequency value D (1 of these dct transform domains, 1), may there are some conversion in D (2,4) etc., but its coefficient symbols is still constant, we,, by the coefficient that is more than or equal to 0, are designated as 1; Be less than 0 be designated as 0, so for original face data, coefficient value D (1,1), D (1,2) ... the symbol binary sequence of the correspondences such as D (2,4) is: " 1,100 0011 ", in the 11st row of table 1, observing these row can find, no matter illumination is attacked, and shade is attacked, distortion attack or conventional attack, the maintenance of its symbol sebolic addressing and raw data is similar, and all larger with the symbol sebolic addressing normalized correlation coefficient of raw data, in table the 12 row.The related coefficient that result shows is all greater than 0.5, and this is the facies relationship numerical value that 64 bit sign sequences are tried to achieve before low frequency coefficient is got.

Table 1 facial image DCT coefficient and part coefficient are subject to the changing value after different attack

* the 1.0e+002 of the DCT unit of number

In order to further illustrate the proper vector that symbol sebolic addressing is facial image, different facial images is obtained its visual feature vector by we, then calculates the related coefficient between them; Here getting the face of front 10 normal expressions of ORL face database tests; Figure 13-Figure 22, from angle of statistics, has got front 8 × 8 64 DCT coefficients of DCT territory low frequency part here.And obtain the related coefficient between each proper vector, result of calculation is as shown in table 2.

Related coefficient (vector length 64bit) between a table 2.10 different face image feature vector

?

V1

V2

V3

V4

V5

V6

V7

V8

V9

V10

V1	1.00	0.226	0.452	0.30	0.436	0.254	0.007	0.373	0.07	0.134
											V2	0.226	1.00	0.029	0.09	0.095	-0.03	0.21	0.283	0.029	0.029
V3	0.452	0.029	1.00	0.254	0.38	0.25	0.058	0.192	0.247	0.059
											V4	0.30	0.09	0.254	1.00	0.309	0.251	0.004	0.435	0.192	0.317
V5	0.436	0.095	0.38	0.309	1.00	0.188	0.129	0.184	0.066	0.192
											V6	0.254	-0.03	0.25	0.251	0.188	1.00	0.375	0.125	0.50	0.187
V7	0.007	0.21	0.058	0.004	0.129	0.375	1.00	0.004	0.310	0.059
											V8	0.373	0.283	0.192	0.435	0.184	0.125	0.004	1.00	0.310	0.129
V9	0.07	0.029	0.247	0.192	0.066	0.50	0.310	0.310	1.00	0.059
											V10	0.134	0.029	0.059	0.317	0.192	0.187	0.059	0.129	0.059	1.00

As can be seen from Table 2, first, the related coefficient maximum between facial image self, is 1.00; Secondly, the related coefficient of the characteristics of image of different faces is all not more than 0.5; This with our human eye actual observation to be consistent, the proper vector that this explanation is extracted by the method for this invention, reflected main resemblance and the main profile of face, and face profile is more similar, the similarity degree of proper vector is higher.

3) relation of the robustness of the length of proper vector and face algorithm

According to human visual system (HVS), Low Medium Frequency signal is larger to people's visual impact, is image outline for two dimensional image.Therefore, we choose the Low Medium Frequency coefficient of facial image in the time that facial image is chosen to proper transformation coefficient, the number of Low Medium Frequency coefficient is selected and the original facial image size of carrying out overall dct transform, and the quantity of information of the watermark of disposable embedding and require relevant, the length L of the proper vector of choosing is less, the quantity of information of disposable embedding is fewer, but the robustness of watermark is higher.Consider experiment below, the length that we choose L in the time of specific experiment is 64.

Brief description of the drawings

Fig. 1 is original facial image.

Fig. 2 is the facial image after illumination is attacked, and intensity of illumination is S.

Fig. 3 is the facial image after illumination is attacked, and intensity of illumination is M.

Fig. 4 is the facial image after illumination is attacked, and intensity of illumination is L.

Fig. 5 is the facial image blocking through glasses.

Fig. 6 is the facial image blocking through mouth mask.

Fig. 7 is the facial image blocking through cap.

Fig. 8 is the facial image through extruding.

Fig. 9 is the facial image disturbing through Gauss, and gaussian intensity is 3%.

Figure 10 is the facial image disturbing through Gauss, and gaussian intensity is 5%.

Figure 11 is that compression quality is 5% through the facial image of JPEG compression.

Figure 12 is the facial image through medium filtering, and filtering parameter is [3x3], and filter times is 20.

The facial image of the 1st people in Figure 13 ORL face database.

The facial image of the 2nd people in Figure 14 ORL face database.

The facial image of the 3rd people in Figure 15 ORL face database.

The facial image of the 4th people in Figure 16 ORL face database.

The facial image of the 5th people in Figure 17 ORL face database.

The facial image of the 6th people in Figure 18 ORL face database.

The facial image of the 7th people in Figure 19 ORL face database.

The facial image of the 8th people in Figure 20 ORL face database.

The facial image of the 9th people in Figure 21 ORL face database.

The facial image of the 10th people in Figure 22 ORL face database.

The facial image that Figure 23 is to be measured, noiseless attack.

Figure 24 without attack time, the original image detecting.

Figure 25 without attack time, the watermark extracting.

Figure 26 is that intensity of illumination is-100% facial image.

When Figure 27 intensity of illumination is-100%, the original facial image detecting.Figure 28 intensity of illumination is-100% watermark extracting.

The facial image that Figure 29 glasses block, blocks size for M.

When Figure 30 glasses block, the facial image detecting.

When Figure 31 glasses block, the watermark of extraction.

The facial image that Figure 32 mouth mask blocks, blocks size for M.

Figure 33 mouth mask blocks and is, the facial image detecting.

When Figure 34 mouth mask blocks, the digital watermarking of extraction.

The facial image that Figure 35 cap blocks, blocks size for M.

When Figure 36 cap blocks, the facial image detecting.

When Figure 37 cap blocks, the digital watermarking of extraction.

The facial image of Figure 38 face extruding, crushing strength is 60%.

Figure 39 in the time that crushing strength is 60%, the facial image of identification.

Figure 40 in the time that crushing strength is 60%, the digital watermarking extracting.

The facial image of Figure 41 sphere distortion, distortion quantity is 40%.

Figure 42 in the time that sphere distortion quantity is 40%, the facial image detecting.

Figure 43 in the time that sphere distortion quantity is 40%, the watermark of extraction.

The facial image that Figure 44 Gaussian noise is attacked, Gaussian noise intensity is 5%.

Figure 45 is 5% in Gaussian noise intensity, the facial image recognizing.

Figure 46 is in Gaussian noise intensity 5%, the watermark of extraction.

The facial image of Figure 47 JPEG compression, compression quality is 5%.

Figure 48 at JPEG boil down to 5% is, the original image of identification.

Figure 49 in the time of JPEG boil down to 5%, the watermark information of extraction.

The facial image of Figure 50 medium filtering, filtering parameter is: [3x3], filter times is 10.

Figure 51 is [3x3] at medium filtering, the original image detecting.

Figure 52 is in medium filtering parameter [3x3], the watermark of extraction.

Embodiment

Below in conjunction with accompanying drawing, the invention will be further described, emulation platform is Matlab2010a, produces 1000 groups of independently binary pseudo-random (value+1 or 0), and every group of sequence length is 64bit, corresponding these 1000 groups of data 1000 digital watermarkings, W (n).Each watermark correspondence an original image, establishes the piece image of the corresponding ORL of the 500th group of watermark here, sees Fig. 1, and its size is 92x112, and this figure is in this as original image be subject to the test pattern of zero attack.

In order to test the experiment convenience of anti-light photograph, shade attack, the other 1000 groups of two-value random seriess of regeneration (value is+1, or 0), every group of sequence length is 64bit, these 1000 groups of proper vectors as 1000 original images, V (n); The 500th unit deposited to the original feature vector of the first width face figure in ORL face database;

Its basic ideas are, establish F ' and be a facial image to be measured while not disturbing, see Figure 23, obtain its proper vector V', then, by asking the related coefficient of V (n) of V' and all original images, obtain its maximal value; Then determine corresponding sequence number k, make in the time of n=k, the related coefficient maximum of V' and V (k), according to sequence number k value, try to achieve the original image F (k) of identification, with watermark W (k) and the key K ey (k) of the embedding of corresponding original image F (k), wherein Key (k)=W (k) ⊕ V (k); According to V' and Key (k), obtain the watermark information W ' in testing image F', W'=V' ⊕ Key (k), and obtain the related coefficient of W and W ', be worth size to determine the degree of correlation of watermark and the owner of testing image according to NC.

Figure 23 is the facial image to be measured not adding while interference;

Figure 24 is the original facial image detecting;

Figure 25 is the watermark of extracting, and can see NC=1.00, can accurately extract watermark.

We are judged the anti-light photograph of this face recognition algorithms based on robust watermarking, are blocked and the abilities such as conventional attack by specific experiment below.

First test the anti-light photograph of this face recognition algorithms, block with distortion and attack.

(1) experiment is attacked in illumination

Table 3 is anti-light experimental datas according to attacking.Therefrom can see, when testing image reduces intensity of illumination, when intensity of illumination is-100%, the signal to noise ratio (S/N ratio) of testing image is 7.21dB, by asking the related coefficient maximal value of proper vector, corresponding original image correctly detected, and can accurately extract digital watermarking, related coefficient NC=0.81; And adopt google to scheme to search figure function, work as testing image, when intensity of illumination is-100%, cannot search correct original image.As can be seen from Table 3, in the time that intensity of illumination is 100%, at this moment the signal to noise ratio (S/N ratio) of testing image is 9.34dB, correct original image still can be detected and extract watermark, and watermark related coefficient is 0.94; Illustrate that this face recognition algorithms based on watermark has good anti-light according to attacking ability.

Figure 26 is that intensity of illumination is-100% testing image; Visually dark images, signal to noise ratio (S/N ratio) PSNR is 7.21dB;

Figure 27 is the facial image recognizing, and the proper vector related coefficient of the proper vector of this figure and testing image is maximal value;

Figure 28 is the watermark of extracting, and NC=0.81, is easy to extract watermark.

Table 3 is anti-light according to attacking experimental data

(2) block and attack experiment

Blocking is in face recognition process, and insoluble problem, but recognition of face based on robust watermarking are utilized the watermarking algorithm of robust, preferably resolve this problem.Table 4 is anti-experimental datas of blocking attack.Comprise that glasses block, mouth mask blocks with cap and blocks; In table, S, M, L represents respectively the relative size of the area blocking; From table 4, can see, when glasses block when more, block size for L, the PSNR=13.30dB of shielded image, signal to noise ratio (S/N ratio) is lower, but still can correctly identify original image, and extracts watermark, NC=0.62; When mouth mask blocks morely, block size when the L, the PSNR=16.20dB of shielded image, still can extract watermark, NC=0.59; When cap blocks, shielded area is larger, and during for L, at this moment signal to noise ratio (S/N ratio) is PSNR=10.38dB, still can extract watermark, NC=0.56

Figure 29 is that glasses block, and blocks the testing image of size for M; At this moment existing certain occlusion effect, signal to noise ratio (S/N ratio) PSNR is 14.78dB;

Figure 30 is the original facial image detecting; Can correctly identify corresponding original image;

Figure 31 is the watermark of extracting, NC=0.75, can be correct extract watermark.

Figure 32 is that mouth mask blocks, and blocks size for M, and at this moment occlusion effect is obvious, and signal to noise ratio (S/N ratio) is lower, and PSNR is 17.31dB;

Figure 33 is the original image of identification, can find out and can correctly identify original image;

Figure 34 is the watermark of extracting, and NC=0.78, can correctly extract the watermark of testing image.

Figure 35 is that cap blocks, and blocks the testing image of size for M; At this moment occlusion effect is obvious, and signal to noise ratio (S/N ratio) PSNR is 10.64dB;

Figure 36 is the facial image of identification; Can correctly identify corresponding original image;

Figure 37 is the watermark of extracting, and NC=0.62, is easy to detect watermark.

Table 4 is anti-blocks attack

(3) experiment is attacked in face's extruding

The experimental data that the extruding of table 5 Shi Kang face is attacked, the variation of expression sometimes can be reflected in facial extruding.Therefrom can see, when testing image face extruding degree is larger, when extruding quantity is 100%, at this moment the signal to noise ratio (S/N ratio) of image is lower is 16.60dB, but still original image can be detected and extract watermark, NC=0.59;

Figure 38 is that crushing strength is 60% testing image; Facial expression changes more obvious, and signal to noise ratio (S/N ratio) is 18.12dB;

Figure 39 is the facial image recognizing, and can correctly recognize facial image;

Figure 40 is the watermark of extracting, and NC=0.81, is easy to detect watermark.

The extruding of table 5 face is attacked

Extruding quantity (%)	-100	-80	-60	-40	-20	0	20	40	60	80	100
												PSNR(dB)	19.10	19.30	19.61	20.01	21.02	?	20.32	19.03	18.12	16.36	16.60
NC	0.68	0.72	0.74	0.81	0.94	1	0.96	0.90	0.77	0.62	0.59

(4) sphere distortion is attacked

Table 6 is experimental datas that the sphere distortion of the anti-face of watermarking algorithm is attacked.From table, can see, when the distortion of testing image sphere is larger, when distortion quantity is 60%, at this moment the signal to noise ratio (S/N ratio) of testing image is lower is 17.61dB, but still original image can be detected, and can extract watermark, NC=0.53;

Figure 41 is that sphere distortion is attacked, the testing image that distortion quantity is 40%; The distortion of face is more obvious, and signal to noise ratio (S/N ratio) is 18.68dB;

Figure 42 is the facial image recognizing, and original face can be detected;

Figure 43 is the watermark of extracting, and NC=0.62, can correctly extract watermark.

The distortion of table 6 sphere is attacked

Above-mentioned mainly to illumination, the attack such as block and test, below the conventional attacks such as filtering are tested;

(1) attacked by noise experiment

Use imnoise () function in testing image, to add Gaussian noise.

Table 7 is experimental datas of anti-Gauusian noise jammer.Therefrom can see, when testing image Gaussian noise intensity is up to 30% time, the PSNR of testing image is down to 7.94dB, and at this moment testing image is second-rate; Original image still can correctly be detected, can extract watermark, NC=0.60.And use google to scheme to search figure function, in the time that the Gaussian noise intensity of testing image is only 5%, just cannot carry out the identification of normal original image.The anti-Gaussian noise ability that this explanation adopts this invention to have.

Figure 44 is the testing image of Gaussian noise intensity 5%, visually very fuzzy, PSNR=12.98dB;

Figure 45 is the face original image recognizing, and can correctly identify;

Figure 46 is the watermark of extracting, and can accurately must extract watermark, NC=0.81.

Table 7 is anti-Gauss disturb

Noise intensity (%)	1	2	3	5	10	20	30
								PSNR	19.36	16.35	14.9	12.98	10.67	8.83	7.94
NC	1.0	0.90	0.90	0.81	0.87	0.62	0.60

(2) JPEG compression attack experiment

Adopt image compression quality percentage, as parameter, testing image is carried out to certificate and carry out JPEG compression; Table 8 is testing image JPEG compression experiment data.When compression quality is only 2%, at this moment compression quality is lower, and PSNR=22.21dB still can extract watermark, NC=0.75.

Figure 47 is that compression quality is 5% testing image, and blocking artifact has appearred in this figure,

PSNR＝25.12dB；

Figure 48 is the original image of identification, can correctly identify;

Figure 49 is the watermark of extracting in testing image, and NC=0.90 can accurately extract watermark.

Table 8JPEG attacks experiment

Compression quality	2	5	10	20	30	40
							PSNR	22.21	25.12	27.7	29.86	31.15	32.08
NC	0.75	0.90	1.00	0.87	1.0	1.0

(3) medium filtering is attacked experiment

Table 9 is that anti-medium filtering is attacked experiment, and it can be seen from the table, when medium filtering parameter is [7x7], filtering multiplicity is 10 o'clock, the lower PSNR=20.92dB of signal to noise ratio (S/N ratio) of image, but still can record the existence of watermark, NC=0.87.

Figure 50 is that medium filtering parameter is [3x3], the testing image that filtering multiplicity is 10, and it is fuzzy that image has occurred, PSNR=29.18dB;

Figure 51 is the in the situation that of above-mentioned filtering, the original image detecting, at this moment can be correct original image detected;

Figure 52 is the watermark of extracting in testing image, and NC=0.96 can accurately extract watermark.

Table 9 medium filtering is attacked experiment

Claims (1)

1. under large data, anti-light photograph the based on transform domain robust watermarking attacked face identification method, it is characterized in that: first original face is carried out to overall dct transform, before domain of variation is chosen, 8x8 coefficient, as proper vector, is then associated watermark information and proper vector, realizes the embedding of watermark; Then for face to be measured, obtain its proper vector, then calculate the related coefficient of face to be measured and all face proper vectors, obtain related coefficient maximal value, obtain the facial image of identification, the watermark of embedding according to this value; Then according to the proper vector of testing image, extract watermark, obtain watermark related coefficient; Realize the embedding of digital watermarking and the identification of extraction and face; This invention comprises that watermark embeds and extract two large divisions, amounts to six steps:

Part I: the embedding of watermark

1), by all original facial image F (n) are carried out to overall dct transform, obtain the proper vector set V (n) of original image;

First original facial image F (n) is carried out to overall dct transform, in the low frequency coefficient matrix F D (i, j) of frequency field, choose front 8 × 8 coefficient FD ₈(i, j), and then to the matrix of coefficients FD selecting ₈(i, j) carries out binary conversion treatment, gets 1 in the time that coefficient is more than or equal to zero, and being less than 0 is to get zero, obtains proper vector V, and main process is described below:

FD ₈(i,j)＝DCT2(F(i,j))

V(n)＝BINARY(FD ₈(i,j))

2) utilize cryptography HASH function, generate two-value key sequence Key (n) with watermarked information, complete the embedding of zero watermark;

Key(n)＝V(n)⊕W(n)

Key (n) is by the proper vector V (n) of all original images and corresponding n digital watermarking W (n), and the Hash function conventional by cryptography generates; Here the random series that W (n) is 64bit by length forms; Preserve Key (n), while extracting watermark below, will use; By Key (n) is applied for to third party as key, to obtain the right to use and the entitlement of facial image;

Part II: the identification of face and the extraction of watermark

3) obtain the proper vector V' of face to be measured;

If face to be measured is F', after overall two-dimensional dct transform, obtaining low frequency coefficient matrix is FD ' (i, j), by step 1) low frequency coefficient matrix is carried out to binary conversion treatment, obtain the proper vector V' of face to be measured;

FD ₈'(i,j)＝DCT2(F'(i,j))

V'＝BINARY(FID'(i,j))

4) calculate the related coefficient NC (n) of the proper vector V' of face to be measured and the V of original face (n), carry out the identification of face;

Calculate the corresponding n value of related coefficient maximal value of V' and V (n), establish n=k; Can obtain key K ey (k), identify original facial image according to k value is F (k) and the watermark value W (k) that is embedded in F (k), and the normalized correlation coefficient formula of calculated characteristics vector is as follows:

$\mathrm{NC}=\frac{\underset{i}{\mathrm{\Σ}}V\left(i\right)V^{\′}\left(i\right)}{\underset{i}{\mathrm{\Σ}}{V}^2\left(i\right)}$

5) utilize the proper vector V ' that is present in third-party two-valued function key sequence Key (k) and face to be measured, extract the watermark W' in testing image;

W'＝Key(k)⊕V'

6) calculate the related coefficient between W' and W (k); Calculate watermark W and W'(K) related coefficient, try to achieve the content of testing image.