3D-HEVC inter-frame information hiding method based on visual perception

Abstract

A 3D-HEVC inter-frame information hiding method based on visual perception includes steps of information embedding and information extraction. In the step of information embedding, the human visual perception characteristic is considered, stereo salient images are obtained by a stereo image salient model, and the stereo salient images are divided into salient blocks and non-salient blocks with an otsu threshold. The coding quantization parameters are modified according to different modulation rules for different regions. Then, based on the modified quantization parameters, the coding-tree-units are coded to complete the information embedding. In the step of information extraction, no original video is needed, no any side information needs to be transmitted, and the secret information can be blindly extracted. The present invention combines with the human visual perception characteristic, and selects P frames and B frames as embedded frames for effectively reducing the decrease of the stereo video subjective quality.

Claims

1. A 3D-HEVC (Three Dimensional High Efficiency Video Coding) inter-frame information hiding method based on visual perception comprising steps of information embedding and information extraction, wherein: the step of information embedding comprises: (1A) at an information embedding terminal, taking S.sub.org as an original stereo video, recording a left view color video of the S.sub.org as L.sub.org, recording a right view color video of the S.sub.org as R.sub.org, and taking W as secret information to be embedded, wherein: W is a binary number which contains n.sub.W bits, W=w.sub.n.sub.W w.sub.n.sub.W.sub.-1 . . . w.sub.i . . . w.sub.2w.sub.1, a width of both a left view color image of the L.sub.org and a right view color image of the R.sub.org is M, a height thereof is N, both the M and the N can be divisible by 64, a total frame number of both all left view color images of the L.sub.org and all right view color images of the R.sub.org is F, here, F≧1, is a integer and $n_W\in \left[2,\frac{2\times M\times N\times F}{64\times 64}\right],$ w.sub.n.sub.W w.sub.n.sub.W.sub.-1 . . . w.sub.i . . . w.sub.2w.sub.1 respectively represent a value of (n.sub.W).sup.th bit, a value of a (n.sub.W−1).sup.th bit, . . . , a value of an i.sup.th bit, a value of a second bit and a value of a first bit, each of the w.sub.n.sub.W w.sub.n.sub.W.sub.−1 . . . w.sub.i . . . w.sub.2w.sub.1 is 0 or 1, 1≦i≦n.sub.W; (1B) obtaining a stereo saliency image of each left view color image of the L.sub.org through a stereo image saliency model, recording a stereo saliency image of a j.sup.th left view color image of the L.sub.org as L.sub.org,j.sup.u, calculating an otsu threshold of the stereo saliency image of each left view color image of the L.sub.org, and recording the otsu threshold of the L.sub.org,j.sup.u as y.sub.j.sup.L, wherein 1≦j≦F, also, obtaining a stereo saliency image of each right view color image of the R.sub.org through the stereo image saliency model, recording a stereo saliency image of a j.sup.th right view color image of the R.sub.org as R.sub.org,j,.sup.u, calculating an otsu threshold of the stereo saliency image of each right view color image of the R.sub.org, and recording the otsu threshold of the R.sub.org,j.sup.u as y.sub.j.sup.R; (1C) dividing the stereo saliency image of each left view color image of the L.sub.org into non-overlapped $\left(\frac{M}{64}\times \frac{N}{64}\right)$ image blocks each of which has a size of 64×64, recording a k.sup.th image block of the L.sub.org,j.sup.u as B.sub.org,j,k.sup.L, calculating a mean value of pixel values of all pixels of each image block of the stereo saliency image of each left view color image of the L.sub.org recording the mean value of the pixel values of all the pixels of the B.sub.org,j,k.sup.L as q.sub.j,k.sup.L, determining whether each image block of the stereo saliency image of each left view color image of the L.sub.org is a salient block or a non-salient block according to the mean value of the pixel values of all the pixels of each image block of the stereo saliency image of each left view color image of the L.sub.org and the otsu threshold of the stereo saliency image of each left view color image of the L.sub.org, wherein: if the q.sub.j,k.sup.L is larger than or equal to the y.sub.j.sup.L, the B.sub.org,j,k.sup.L is determined to be the salient block, if the q.sub.j,k.sup.L is smaller than the y.sub.j.sup.L, the B.sub.org,j,k.sup.L is determined to be the non-salient block, here, $1\le k\le \frac{M}{64}\times \frac{N}{64},$ also, dividing the stereo saliency image of each right view color image of the R.sub.org into non-overlapped $\left(\frac{M}{64}\times \frac{N}{64}\right)$ image blocks each of which has a size of 64×64, recording a k.sup.th image block of the R.sub.org,j.sup.u as R.sub.org,j,k.sup.R, calculating a mean value of pixel values of all pixels of each image block of the stereo saliency image of each right view color image of the R.sub.org, recording the mean value of the pixel values of all the pixels of the B.sub.org,j,k.sup.R as q.sub.j,k.sup.R, determining whether each image block of the stereo saliency image of each right view color image of the R.sub.org is a salient block or a non-salient block according to the mean value of the pixel values of all the pixels of each image block of the stereo saliency image of each right view color image of the R.sub.org and the otsu threshold of the stereo saliency image of each right view color image of the R.sub.org, wherein: if the q.sub.j,k.sup.R is larger than or equal to the y.sub.j.sup.R, the B.sub.org,j,k.sup.R is determined to be the salient block, if the q.sub.j,k.sup.R is smaller than the y.sub.j.sup.R, the B.sub.org,j,k.sup.R is determined to be the non-salient block; (1D) generating a binary pseudorandom sequence which contains n.sub.W bits through logistics chaotic mapping, taking the binary pseudorandom sequence as a secret key and recording the secret key as E, here, E=e.sub.n.sub.W e.sub.n.sub.W.sub.-1 . . . e.sub.i . . . e.sub.2e.sub.1, perform an XOR (exclusive OR) operation on a value of each bit of the W and a value of each corresponding bit of the E, obtaining an XOR result, taking the XOR result as encrypted information and recording the encrypted information as W′, here, W′=w′.sub.n.sub.W w′.sub.n.sub.W.sub.-1 . . . w′.sub.i . . . w′.sub.2 w′.sub.1, wherein: the e.sub.n.sub.W e.sub.n.sub.W.sub.-1 . . . e.sub.i . . . e.sub.2e.sub.1 respectively represent a value of the (n.sub.W).sup.th bit, a value of the (n.sub.W−1).sup.th bit, . . . , a value of the (i).sup.th bit, . . . a value of the second bit and a value of the first bit of the E, each of the e.sub.n.sub.W e.sub.n.sub.W.sub.-1 . . . e.sub.i . . . e.sub.2e.sub.1 is 0 or 1, w′.sub.n.sub.W w′.sub.n.sub.W.sub.-1 . . . w′.sub.i . . . w′.sub.2 w′.sub.1 respectively represent a value of the (n.sub.W).sup.th bit, a value of the (n.sub.W−1).sup.th bit, . . . , a value of the (i).sup.th bit, . . . a value of the second bit and a value of the first bit of the W′, each of the w′.sub.n.sub.W w′.sub.n.sub.W.sub.-1 . . . w′.sub.i . . . w′.sub.2 w′.sub.1 is 0 or 1, w is an XOR value of the w.sub.i and the e.sub.i; (1E) coding the L.sub.org and the R.sub.org in frame through a 3D-HEVC standard coding platform, defining a j.sup.th left view color image of the L.sub.org to be coded or a j.sup.th right view color image of the R.sub.org to be coded as a current frame and recording the current frame as P.sub.j, wherein an initial value of the j is 1; (1F) judging whether the P.sub.j is a P-frame or a B-frame, wherein if it is, step (1G) is executed, if it is not, step (11) is executed; (1G) coding the P.sub.j in coding-tree-unit, defining a k.sup.th coding-tree-unit to be coded of the P.sub.j as a current coding block and recording the current coding block as B.sub.org,j,k, wherein $1\le k\le \frac{M}{64}\times \frac{N}{64},$ here an initial value of the k is 1; (1H-a) reading coding quantization parameter of the B.sub.org,j,k and recording the coding quantization parameter as QP.sub.org,j,k, reading a value w′.sub.i′ of a i′.sup.th bit of the W′ and a value w′.sub.i′+1 of a (i′+1).sup.th bit of the W′, transforming the w′.sub.i′+1 and the w′.sub.i′ into decimal values and recording the decimal value as d.sub.i′, here, $d_{i^{\prime }}=\{\begin{array}{cc}0& w_{i^{\prime }+1}^{\prime }.Math.w_{i^{\prime }}^{\prime }=00\\ 1& w_{i^{\prime }+1}^{\prime }.Math.w_{i^{\prime }}^{\prime }=01\\ 2& w_{i^{\prime }+1}^{\prime }.Math.w_{i^{\prime }}^{\prime }=10\\ 3& w_{i^{\prime }+1}^{\prime }.Math.w_{i^{\prime }}^{\prime }=11\end{array},$ wherein an initial value of the i′ is 1, 1≦i′≦n.sub.W−1, and each of w′.sub.i′ and w′.sub.i′+1 is 0 or 1; (1H-b) when the P.sub.j is the j.sup.th left view color image of the L.sub.org, judging whether a remainder result of the QP.sub.org,j,k to 4 is equal to the d.sub.i′, wherein if the remainder result is not equal to the d.sub.i′, when the B.sub.org,j,k.sup.L is a salient block, the QP.sub.org,j,k is downwardly modulated by the w′.sub.i′ and the w′.sub.i′+1, so that coding quantization parameter embedded with secret information of the B.sub.org,j,k is obtained and recorded as QP′.sub.org,j,k, and then step (1H-c) is executed; when the B.sub.org,j,k.sup.L is a non-salient block, the QP.sub.org,j,k is upwardly modulated by the w′.sub.i′ and the w′.sub.i′+1, so that the coding quantization parameter embedded with secret information of the B.sub.org,j,k is obtained and recorded as the QP′.sub.org,j,k, and then the step (1H-c) is executed; if the remainder result is equal to the d.sub.i′, the QP.sub.org,j,k is directly recorded as the coding quantization parameter embedded with secret information of the B.sub.org,j,k which is denoted as the QP′.sub.org,j,k, QP′.sub.org,j,k=QP.sub.org,j,k, and then the step (1H-c) is executed, here, “=” is an assignment symbol in the QP′.sub.org,j,k=QP.sub.org,j,k; when the P.sub.j is the j.sup.th right view color image of the R.sub.org, judging whether a remainder result of the QP.sub.org,j,k to 4 is equal to the d.sub.i′, wherein if the remainder result is not equal to the d.sub.i′, when the B.sub.org,j,k.sup.R is a salient block, the QP.sub.org,j,k is downwardly modulated by the w′.sub.i′ and the w′.sub.i′+1, so that coding quantization parameter embedded with secret information of the B.sub.org,j,k is obtained and recorded as QP′.sub.org,j,k, and then the step (1H-c) is executed; when the B.sub.org,j,k.sup.R is a non-salient block, the QP.sub.org,j,k is upwardly modulated by the w′.sub.i′ and the w′.sub.i′+1, so that the coding quantization parameter embedded with secret information of the B.sub.org,j,k is obtained and recorded as the QP′.sub.org,j,k, and then the step (1H-c) is executed; if the remainder result is equal to the d.sub.i′, the QP.sub.org,j,k is directly recorded as the coding quantization parameter embedded with secret information of the B.sub.org,j,k which is denoted as the QP′.sub.org,j,k, QP′.sub.org,j,k=QP.sub.org,j,k, and then the step (1H-c) is executed; (1H-c) judging whether the QP′.sub.org,j,k is in a range of [0, 51], wherein if it is, step (1H-d) is executed; otherwise, when QP′.sub.org,j,k>51, the QP.sub.org,j,k is downwardly modulated by the w′.sub.i′ and the w′.sub.i′+1, the coding quantization parameter embedded with secret information QP′.sub.org,j,k of the B.sub.org,j,k is obtained again, and then the step (1H-d) is executed; when QP′.sub.org,j,k<0, the QP.sub.org,j,k is upwardly modulated by the w′.sub.i′ and the w′.sub.i′+1, the coding quantization parameter embedded with secret information QP′.sub.org,j,k of the B.sub.org,j,k is obtained again, and then the step (1H-d) is executed; (1H-d) coding the B.sub.org,j,k with the QP′.sub.org,j,k, completing a secret information embedded process of the B.sub.org,j,k, after completing coding of the B.sub.org,j,k, judging whether the B.sub.org,j,k is a skip block, wherein if it is, step (1H-e) is directly executed, otherwise, i′=i′+2 is set, the step (1H-e) is executed, here, “=” is an assignment symbol in the i′=i′+2; (1H-e) setting k=k+1, regarding a next coding-tree-unit to be coded of the P.sub.j as a current coding block and recording the next coding-tree-unit to be coded as B.sub.org,j,k, returning to the step (1H-a) to continue till all coding-tree-units of the P.sub.j are completely coded, executing step (1I), wherein “=” is an assignment symbol in the k=k+1; (11) setting j=j+1, regarding a next left view color image to be coded of the L.sub.org or a next right view color image to be coded of the R.sub.org as a current frame and recording the current frame as P.sub.j, returning to the step (1F) and continuing till all left view color images in the L.sub.org and all right view color images in the R.sub.org are completely coded, and obtaining video stream embedded with secret information, wherein “=” is an assignment symbol in the j=j+1; and (1J) sending initial value information which generates the secret key E to an information extraction terminal; the step of information extraction comprises: (2A) defining the video stream embedded with secret information received at an information extraction terminal as a target video stream and recording the target video stream as str.bin.sub.dec; (2B) according to the initial value information which generates the secret key E sent from an information embedding terminal, through the logistics chaotic mapping, generating a secret key E which is same as that of the information embedding terminal; (2C) parsing the str.bin.sub.dec frame by frame, and defining a frame to be parsed in the str.bin.sub.dec as a current frame; (2D) judging the current frame is a P-frame or B-frame, wherein if it is, step (2E) is executed, otherwise, step (2H) is executed; (2E) parsing the current frame coding-tree-unit by coding-tree-unit, and defining a coding-tree-unit to be parsed in the current frame as a current parsing block; (2F) judging whether the current parsing block is a skip block, wherein if it is, step (2G) is executed, otherwise, coding quantization parameter embedded with secret information of the current parsing block are parsed and recorded as QP′.sub.dec and then a remainder result of QP′.sub.dec to 4 is calculated and recorded as d′.sub.dec, wherein the d′.sub.dec is 0, 1, 2 or 3, and then the decimal d′.sub.dec is transformed to binary number, values of two bits extracted from the current parsing block are obtained, such that a secret information extraction process of the current parsing block is completed, and then the step (2G) is executed; (2G) regarding a next coding-tree-unit to be parsed of the current frame as a current parsing block, and then returning to the step (2F) till all coding-tree-units of the current frame are completely processed, and then step (2H) is executed; (2H) regarding a next frame to be parsed of the str.bin.sub.dec as a current frame, and then returning to the step (2D) till all frames of the str.bin.sub.dec are completely processed, such that secret information extraction is completed; and (21) defining extracted values of n.sub.W, bits as encrypted information and recording the encrypted information as W′.sub.dec, here, W′.sub.dec=w′.sub.dec,n.sub.W w′.sub.dec,n.sub.W.sub.-1 . . . w′.sub.dec,i . . . w′.sub.dec,2 w′.sub.dec,1, and then perform an XOR (exclusive OR) operation on a value of each bit of the W′.sub.dec and a value of each corresponding bit of the E, obtaining an XOR result, taking the XOR result as decrypt secret information and recording the decrypt secret information as W.sub.dec, here, wherein: the W.sub.dec=w.sub.dec,n.sub.W w.sub.dec,n.sub.W.sub.-1 . . . w.sub.dec,i . . . w.sub.dec,2w.sub.dec,1, wherein: the w′.sub.dec,n.sub.W w′.sub.dec,n.sub.W.sub.-1 . . . w′.sub.dec,i . . . w′.sub.dec,2 w′.sub.dec,1 respectively represent a value of the (n.sub.W).sup.th bit, a value of the (n.sub.W−1).sup.th bit, . . . , a value of the (i).sup.th bit, . . . a value of the second bit and a value of the first bit of the W′.sub.dec, each of the w′.sub.dec,n.sub.W w′.sub.dec,n.sub.W.sub.-1 . . . w′.sub.dec,i . . . w′.sub.dec,2 w′.sub.dec,1 is 0 or 1, w.sub.dec,n.sub.W w.sub.dec,n.sub.W.sub.-1 . . . w.sub.dec,i . . . w.sub.dec,2w.sub.dec,1 respectively represent a value of the (n.sub.W).sup.th bit, a value of the (n.sub.W−1).sup.th bit, . . . , a value of the (i).sup.th bit, . . . a value of the second bit and a value of the first bit of the W.sub.dec, each of the w.sub.dec,n.sub.W w.sub.dec,n.sub.W.sub.-1 . . . w.sub.dec,i . . . w.sub.dec,2w.sub.dec,1 is 0 or 1.

2. The 3D-HEVC inter-frame information hiding method based on visual perception, as recited in claim 1, wherein in the step (1H-b), through the w′.sub.i′ and the w′.sub.i′+1, the QP.sub.org,j,k is downwardly modulated to obtain the QP′.sub.org,j,k which comprises: (b1) finding out all values in an interval of [−3,QP.sub.org,j,k] which meet a condition that a remainder result of an absolute value of each of all the values to 4 is equal to d.sub.i′; (b2) calculating an absolute value of a difference value of each of all the values found out in the step (b1) and the QP.sub.org,j,k; and (b3) finding out a minimum absolute value of all absolute values calculated in the step (b2), and assigning a value found out in the step (b1), which is corresponding to the minimum absolute value, to the QP.sub.org,j,k; in the step (1H-b), through the w′.sub.i′ and the w′.sub.i′+1, the QP.sub.org,j,k is upwardly modulated to obtain the QP.sub.org,j,k which comprises: (b1′) finding out all values in an interval of [QP.sub.org,j,k,54] which meet a condition that a remainder result of an absolute value of each of all the values to 4 is equal to d.sub.i′; (b2′) calculating an absolute value of a difference value of each of all the values found out in the step (b1′) and the QP.sub.org,j,k; and (b3′) finding out a minimum absolute value of all absolute values calculated in the step (b2′), and assigning a value found out in the step (b1′), which is corresponding to the minimum absolute value, to the QP′.sub.org,j,k.

3. The 3D-HEVC inter-frame information hiding method based on visual perception, as recited in claim 1, wherein in the step (1H-c), through the w′.sub.i′, and the w′.sub.i′+1, the QP.sub.org,j,k is downwardly modulated to regain the QP′.sub.org,j,k, which comprises: (c1) finding out all values in an interval of [0,QP.sub.org,j,k] which meet a condition that a remainder result of an absolute value of each of all the values to 4 is equal to d.sub.i′; (c2) calculating an absolute value of a difference value of each of all the values found out in the step (c1) and the QP.sub.org,j,k; and (c3) finding out a minimum absolute value of all absolute values calculated in the step (c2), and assigning a value found out in the step (c1), which is corresponding to the minimum absolute value, to the QP′.sub.org,j,k; in the step (1H-c), through the w′.sub.i′ and the w′.sub.i′+1, the QP.sub.org,j,k is upwardly modulated to regain the QP′.sub.org,j,k, which comprises: (c1′) finding out all values in an interval of [QP.sub.org,j,k,51] which meet a condition that a remainder result of an absolute value of each of all the values to 4 is equal to d.sub.i′; (c2′) calculating an absolute value of a difference value of each of all the values found out in the step (c1′) and the QP.sub.org,j,k; and (c3′) finding out a minimum absolute value of all absolute values calculated in the step (c2′), and assigning a value found out in the step (c1′), which is corresponding to the minimum absolute value, to the QP′.sub.org,j,k.

4. The 3D-HEVC inter-frame information hiding method based on visual perception, as recited in claim 2, wherein in the step (1H-c), through the w′.sub.i′, and the w′.sub.i′+1, the QP.sub.org,j,k is downwardly modulated to regain the QP′.sub.org,j,k, which comprises: (c1) finding out all values in an interval of [0,QP.sub.org,j,k] which meet a condition that a remainder result of an absolute value of each of all the values to 4 is equal to d.sub.i′; (c2) calculating an absolute value of a difference value of each of all the values found out in the step (c1) and the QP.sub.org,j,k; and (c3) finding out a minimum absolute value of all absolute values calculated in the step (c2), and assigning a value found out in the step (c1), which is corresponding to the minimum absolute value, to the QP.sub.org,j,k; in the step (1H-c), through the w′.sub.i′ and the w′.sub.i′+1, the QP.sub.org,j,k is upwardly modulated to regain the QP′.sub.org,j,k which comprises: (c1′) finding out all values in an interval of [QP.sub.org,j,k,51] which meet a condition that a remainder result of an absolute value of each of all the values to 4 is equal to d.sub.i′; (c2′) calculating an absolute value of a difference value of each of all the values found out in the step (c1′) and the QP.sub.org,j,k; and (c3′) finding out a minimum absolute value of all absolute values calculated in the step (c2′), and assigning a value found out in the step (c1′), which is corresponding to the minimum absolute value, to the QP′.sub.org,j,k.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0043] FIG. 1a is a general block diagram of an information embedding step of a method provided by the present invention.

[0044] FIG. 1b is a general block diagram of an information extraction step of the method provided by the present invention.

[0045] FIG. 2a is a second frame of a second viewpoint of a stereo video sequence reconstructed from an encoded Newspaper stereo video stream without using a method provided by the present invention.

[0046] FIG. 2b is a second frame of a fourth viewpoint of a stereo video sequence reconstructed from an encoded Newspaper stereo video stream without using a method provided by the present invention.

[0047] FIG. 2c is a second frame of a first viewpoint of a stereo video sequence reconstructed from an encoded Shark stereo video stream without using a method provided by the present invention.

[0048] FIG. 2d is a second frame of a ninth viewpoint of a stereo video sequence reconstructed from an encoded Shark stereo video stream without using a method provided by the present invention.

[0049] FIG. 2e is a second frame of a second viewpoint of a stereo video sequence reconstructed from a Newspaper stereo video stream encoded through a method provided by the present invention.

[0050] FIG. 2f is a second frame of a fourth viewpoint of a stereo video sequence reconstructed from a Newspaper stereo video stream encoded through a method provided by the present invention.

[0051] FIG. 2g is a second frame of a first viewpoint of a stereo video sequence reconstructed from a Shark stereo video stream encoded through a method provided by the present invention.

[0052] FIG. 2h is a second frame of a ninth viewpoint of a stereo video sequence reconstructed from a Shark stereo video stream encoded through a method provided by the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

[0053] The present invention is further explained in detail with accompanying with drawings and embodiments.

[0054] A 3D-HEVC inter-frame information hiding method based on visual perception, provided by the present invention, comprises steps of information embedding and information extraction, wherein FIG. 1a shows a general block diagram of the step of information embedding which is specifically embodied as:

[0055] (1A) at an information embedding terminal (for example an encoder of stereo video signal), taking S.sub.org as an original stereo video, recording a left view color video of the S.sub.org as L.sub.org, recording a right view color video of the S.sub.org as R.sub.org, and taking W as secret information to be embedded, wherein: W is a binary number which contains bits, W=w.sub.n.sub.W w.sub.n.sub.W.sub.-1 . . . w.sub.i . . . w.sub.2w.sub.1, a width of both a left view color image of the L.sub.org and a right view color image of the R.sub.org is M, a height thereof is N, both the M and the N can be divisible by 64, a total frame number of both all left view color images of the L.sub.org and all right view color images of the R.sub.org is F, here, F≧1, n.sub.W is a integer and

[00007]$n_W\in \left[2,\frac{2\times M\times N\times F}{64\times 64}\right],$

w.sub.n.sub.W w.sub.n.sub.W.sub.-1 . . . w.sub.i . . . w.sub.2w.sub.1 respectively represent a value of a (n.sub.W).sup.th bit, a value of a (n.sub.W−1).sup.th bit, . . . , a value of an i.sup.th bit, . . . , a value of a second bit and a value of a first bit, each of the w.sub.n.sub.W w.sub.n.sub.W.sub.-1 . . . w.sub.i . . . w.sub.2w.sub.1 is 0 or 1, 1≦i≦n.sub.W;

[0056] (1B) obtaining a stereo saliency image of each left view color image of the L.sub.org through an existing stereo image saliency model, recording a stereo saliency image of a j.sup.th left view color image of the L.sub.org as P.sub.org,j.sup.u, calculating an otsu threshold of the stereo saliency image of each left view color image of the L.sub.org and recording the otsu threshold of the L.sub.org,j.sup.u as y.sub.j.sup.L, wherein 1≦j≦F,

[0057] also, obtaining a stereo saliency image of each right view color image of the R.sub.org through the existing stereo image saliency model, recording a stereo saliency image of a j.sup.th right view color image of the R.sub.org as R.sub.org,j.sup.u, calculating an otsu threshold of the stereo saliency image of each right view color image of the R.sub.org, and recording the otsu threshold of the R.sub.org,j.sup.u as y.sub.j.sup.R;

[0058] (1C) dividing the stereo saliency image of each left view color image of the L.sub.org into non-overlapped

[00008]$\left(\frac{M}{64}\times \frac{N}{64}\right)$

image blocks each of which has a size of 64×64, recording a k.sup.th image block of the L.sub.org,j.sup.u as B.sub.org,j,k.sup.L, calculating a mean value of pixel values of all pixels of each image block of the stereo saliency image of each left view color image of the L.sub.org, recording the mean value of the pixel values of all the pixels of the B.sub.org,j,k.sup.L as q.sub.j,k.sup.L, determining whether each image block of the stereo saliency image of each left view color image of the L.sub.org is a salient block or a non-salient block according to the mean value of the pixel values of all the pixels of each image block of the stereo saliency image of each left view color image of the L.sub.org and the otsu threshold of the stereo saliency image of each left view color image of the L.sub.org , wherein: if the q.sub.j,k.sup.L is larger than or equal to the y.sub.j.sup.L, the B.sub.org,j,k.sup.L is determined to be the salient block, if the q.sub.j,k.sup.L is smaller than the y.sub.j.sup.L, the B.sub.org,j,k.sup.L is determined to be the non-salient block, here,

[00009]$1\le k\le \frac{M}{64}\times \frac{N}{64},$

[0059] also, dividing the stereo saliency image of each right view color image of the R.sub.org into non-overlapped

[00010]$\left(\frac{M}{64}\times \frac{N}{64}\right)$

image blocks each of which has a size of 64×64, recording a k.sup.th image block of the R.sub.org,j.sup.u as B.sub.org,j,k.sup.R, calculating a mean value of pixel values of all pixels of each image block of the stereo saliency image of each right view color image of the R.sub.org, recording the mean value of the pixel values of all the pixels of the B.sub.org,j,k.sup.R as q.sub.j,k.sup.R, determining whether each image block of the stereo saliency image of each right view color image of the R.sub.org is a salient block or a non-salient block according to the mean value of the pixel values of all the pixels of each image block of the stereo saliency image of each right view color image of the R.sub.org and the otsu threshold of the stereo saliency image of each right view color image of the R.sub.org, wherein: if the q.sub.j,k.sup.R is larger than or equal to the y.sub.j.sup.R, the B.sub.org,j,k.sup.R is determined to be the salient block, if the q.sub.j,k.sup.R is smaller than the y.sub.j.sup.R, the B.sub.org,j,k.sup.R is determined to be the non-salient block;

[0060] (1D) generating a binary pseudorandom sequence which contains n.sub.W bits through logistics chaotic mapping, taking the binary pseudorandom sequence as a secret key and recording the secret key as E, here, E=e.sub.n.sub.W e.sub.n.sub.W.sub.-1 . . . e.sub.i . . . e.sub.2e.sub.1, perform an XOR (exclusive OR) operation on a value of each bit of the W and a value of each corresponding bit of the E, obtaining an XOR result, taking the XOR result as encrypted information and recording the encrypted information as W′, here, W′=w′.sub.n.sub.W w′.sub.n.sub.W.sub.-1 . . . w′.sub.i . . . w′.sub.2 w′.sub.1, wherein: the e.sub.n.sub.W e.sub.n.sub.W.sub.-1 . . . e.sub.i . . . e.sub.2e.sub.1 respectively represent a value of the (n.sub.W).sup.th bit, a value of the (n.sub.W1).sup.th bit, . . . , a value of the (i).sup.th bit, . . . a value of the second bit and a value of the first bit of the E, each of the e.sub.n.sub.W e.sub.n.sub.W.sub.-1 . . . e.sub.i . . . e.sub.2e.sub.1 is 0 or 1, w′.sub.n.sub.W w′.sub.n.sub.W.sub.-1 . . . w′.sub.2 w′.sub.1 respectively represent a value of the (n.sub.W).sup.th bit, a value of the (n.sub.W−1).sup.th bit, . . . , a value of the (i).sup.th bit, . . . a value of the second bit and a value of the first bit of the W′, each of the w′.sub.n.sub.W w′.sub.n.sub.W.sub.-1 . . . w′.sub.i . . . w′.sub.2 w′.sub.1 is 0 or 1, w′.sub.i is an XOR value of the w.sub.i and the e.sub.i;

[0061] (1E) coding the L.sub.org and the R.sub.org in frame through a 3D-HEVC standard coding platform, defining a j.sup.th left view color image of the L.sub.org to be coded or a j.sup.th right view color image of the R.sub.org to be coded as a current frame and recording the current frame as P.sub.j wherein an initial value of the j is 1,

[0062] while encoding the L.sub.org and the B.sub.org, a 1.sup.st left view color image of the L.sub.org and a 1.sup.st right view color image of the R.sub.org are in turn, and so on, till a F.sup.th left view color image of the L.sub.org and a F.sup.th right view color image of the R.sub.org are encoded, and an entire encoding process is completed;

[0063] (1F) judging whether the P.sub.j is a P-frame or a B-frame, wherein if it is, step (1G) is executed, if it is not, step (1I) is executed;

[0064] (1G) coding the P.sub.j in coding-tree-unit (CTU), defining a k.sup.th coding-tree-unit to be coded of the P.sub.j as a current coding block and recording the current coding block as B.sub.org,j,k, wherein

[00011]$1\le k\le \frac{M}{64}\times \frac{N}{64},$

here an initial value of the k is 1;

[0065] (1H-a) reading coding quantization parameter of the B.sub.org,j,k and recording the coding quantization parameter as QP.sub.org,j,k reading a value w′.sub.i′ of a i′.sup.th bit of the W′ and a value w′.sub.i′+1 of a (i′+1).sup.th bit of the W′, transforming the w′.sub.i′+1 and the w′.sub.i′ into decimal value and recording the decimal values as d.sub.i′, here,

[00012]$d_{i^{\prime }}=\{\begin{array}{cc}0& w_{i^{\prime }+1}^{\prime }.Math.w_{i^{\prime }}^{\prime }=00\\ 1& w_{i^{\prime }+1}^{\prime }.Math.w_{i^{\prime }}^{\prime }=01\\ 2& w_{i^{\prime }+1}^{\prime }.Math.w_{i^{\prime }}^{\prime }=10\\ 3& w_{i^{\prime }+1}^{\prime }.Math.w_{i^{\prime }}^{\prime }=11\end{array},$

wherein an initial value of the i′ is 1, 1≦i′≦n.sub.W−1, and each of w′.sub.i′ and w′.sub.i′+1 is 0 or 1;

[0066] (1H-b) when the P.sub.j is the j.sup.th left view color image of the L.sub.org, judging whether a remainder result of the QP.sub.org,j,k to 4 is equal to the d.sub.i′, wherein if the remainder result is not equal to the d.sub.i′, when the B.sub.org,j,k.sup.L is a salient block, the QP.sub.org,j,k is downwardly modulated by the w′.sub.i′ and the w′.sub.i′+1, so that coding quantization parameter embedded with secret information of the B.sub.org,j,k is obtained and recorded as QP′.sub.org,j,k, and then step (1H-c) is executed; when the B.sub.org,j,k.sup.L is a non-salient block, the QP.sub.org,j,k is upwardly modulated by the w′.sub.i′ and the w′.sub.i′+1, so that the coding quantization parameter embedded with secret information of the B.sub.org,j,k k is obtained and recorded as the QP′.sub.org,j,k, and then the step (1H-c) is executed; if the remainder result is equal to the d.sub.i′, the QP.sub.org,j,k is directly recorded as the coding quantization parameter embedded with secret information of the B.sub.org,j,k which is denoted as the QP′.sub.org,j,k, QP′.sub.org,j,k=QP.sub.org,j,k, and then the step (1H-c) is executed, here, “=” is an assignment symbol in the QP′.sub.org,j,k=QP.sub.org,j,k;

[0067] when the P.sub.j is the j.sup.th right view color image of the R.sub.org, judging whether a remainder result of the QP.sub.org,j,k to 4 is equal to the d.sub.i′, wherein if the remainder result is not equal to the d.sub.i′, when the B.sub.org,j,k.sup.R is a salient block, the QP.sub.org,j,k downwardly modulated by the w′.sub.i′ and the w′.sub.i′+1, so that coding quantization parameter embedded with secret information of the B.sub.org,j,k is obtained and recorded as QP′.sub.org,j,k, and then the step (1H-c) is executed; when the B.sub.org,j,k.sup.R is a non-salient block, the QP.sub.org,j,k upwardly modulated by the w′.sub.i′ and the w′.sub.i′+1, so that the coding quantization parameter embedded with secret information of the B.sub.org,j,k is obtained and recorded as the QP′.sub.org,j,k, and then the step (1H-c) is executed; if the remainder result is equal to the d.sub.i′, the QP.sub.org,j,k is directly recorded as the coding quantization parameter embedded with secret information of the B.sub.org,j,k which is denoted as the QP′.sub.org,j,k, QP′.sub.org,j,k=QP.sub.org,j,k, and then the step (1H-c) is executed;

[0068] (1H-c) judging whether the QP′.sub.org,j,k is in a range of [0, 51], wherein if it is, step (1H-d) is executed; otherwise, when QP′.sub.org,j,k>51, the QP.sub.org,j,k is downwardly modulated by the w′.sub.i′ and the w′.sub.i′+1 the coding quantization parameter embedded with secret information QP′.sub.org,j,k of the B.sub.org,j,k is obtained again, and then the step (1H-d) is executed; when QP′.sub.org,j,k<0, the QP.sub.org,j,k is upwardly modulated by the w′.sub.i′ and the w′.sub.i′+1, the coding quantization parameter embedded with secret information QP′.sub.org,j,k of the B.sub.org,j,k is obtained again, and then the step (1H-d) is executed;

[0069] (1H-d) coding the B.sub.org,j,k with the QP′.sub.org,j,k, completing a secret information embedded process of the B.sub.org,j,k, after completing coding of the B.sub.org,j,k, judging whether the B.sub.org,j,k is a skip block, wherein if it is, step (1H-e) is directly executed, otherwise, i′=i′+2 is set, the step (1H-e) is executed, here, “=” is an assignment symbol in the i′=i′+2;

[0070] (1H-e) setting k=k+1, regarding a next coding-tree-unit to be coded of the P.sub.j as a current coding block and recording the next coding-tree-unit to be coded as B.sub.org,j,k, returning to the step (1H-a) to continue till all coding-tree-units of the P.sub.j are completely coded, executing step (1I), wherein “=” is an assignment symbol in the k=k+1;

[0071] (1I) setting j=j+1, regarding a next left view color image to be coded of the L.sub.org or a next right view color image to be coded of the R.sub.org as a current frame and recording the current frame as P.sub.j, returning to the step (1F) and continuing till all left view color images in the L.sub.org and all right view color images in the R.sub.org are completely coded, and obtaining video stream embedded with secret information, wherein “=” is an assignment symbol in the j=j+1; and

[0072] (1J) sending initial value information which generates the secret key E to an information extraction terminal.

[0073] FIG. 1b shows a general block diagram of the step of information extraction, which is specifically embodied as:

[0074] (2A) defining the video stream embedded with secret information received at an information extraction terminal (for example, a decoder of stereo video signal) as a target video stream and recording the target video stream as str.bin.sub.dec; (2B) according to the initial value information which generates the secret key E sent from an information embedding terminal, through the logistics chaotic mapping, generating a secret key E which is same as that of the information embedding terminal, wherein if the secret key E is directly transmitted to the information extraction terminal, then side information is too big, due to the process of generating the secret key is relatively simple, the secret key can be reproduced only by giving an initial value, and therefore, based on the initial value information which generates the secret key E sent from the information embedding terminal, it is only necessary to re-generate for obtaining the secret key at the information extraction terminal as same as the secret key at the information embedding terminal;

[0075] (2C) parsing the str.bin.sub.dec frame by frame, and defining a frame to be parsed in the str.bin.sub.dec as a current frame;

[0076] (2D) judging the current frame is a P-frame or B-frame, wherein if it is, step (2E) is executed, otherwise, step (2H) is executed;

[0077] (2E) parsing the current frame coding-tree-unit (CTU) by coding-tree-unit, and defining a coding-tree-unit to be parsed in the current frame as a current parsing block;

[0078] (2F) judging whether the current parsing block is a skip block, wherein if it is, step (2G) is executed, otherwise, coding quantization parameter embedded with secret information of the current parsing block are parsed and recorded as QP′.sub.dec, and then a remainder result of QP′.sub.dec to 4 is calculated and recorded as d′.sub.dec, wherein the d′.sub.dec is 0, 1, 2 or 3, and then the decimal d′.sub.dec is transformed to binary number, values of two bits extracted from the current parsing block are obtained, such that a secret information extraction process of the current parsing block is completed, and then the step (2G) is executed;

[0079] (2G) regarding a next coding-tree-unit to be parsed of the current frame as a current parsing block, and then returning to the step (2F) till all coding-tree-units of the current frame are completely processed, and then step (2H) is executed;

[0080] (2H) regarding a next frame to be parsed of the str.bin.sub.dec as a current frame, and then returning to the step (2D) till all frames of the str.bin.sub.dec are completely processed, such that secret information extraction is completed; and (21) defining extracted values of n.sub.W bits as encrypted information and recording the encrypted information as W′.sub.dec, here, W′.sub.dec=w′.sub.dec,n.sub.W w′.sub.dec,n.sub.W.sub.-1 . . . w′.sub.dec,i . . . w′.sub.dec,2 w′.sub.dec,1, and then perform an XOR (exclusive OR) operation on a value of each bit of the W′.sub.dec and a value of each corresponding bit of the E, obtaining an XOR result, taking the XOR result as decrypt secret information and recording the decrypt secret information as W.sub.dec, here, W.sub.dec=w.sub.dec,n.sub.W w.sub.dec,n.sub.W.sub.-1 . . . w.sub.dec,i . . . w.sub.dec,2w.sub.dec,1, wherein: the w′.sub.dec,n.sub.W w′.sub.dec,n.sub.W.sub.-1 . . . w′.sub.dec,i . . . w′.sub.dec,2 w′.sub.dec,1, respectively represent a value of the (n.sub.W).sup.th bit, a value of the (n.sub.W−1).sup.th bit, . . . , a value of the (i).sup.th bit, . . . a value of the second bit and a value of the first bit of the W′.sub.dec, each of the w′.sub.dec,n.sub.W w′.sub.dec,n.sub.W.sub.-1 . . . w′.sub.dec,i . . . w′.sub.dec,2 w′.sub.dec,1 is 0 or 1, w.sub.dec,n.sub.W w.sub.dec,n.sub.W.sub.-1 . . . w.sub.dec,i . . . w.sub.dec,2w.sub.dec,1 respectively represent a value of the (n.sub.W).sup.th bit, a value of the (n.sub.W−1).sup.th bit, . . . , a value of the (i).sup.th bit, . . . a value of the second bit and a value of the first bit of the W.sub.dec, each of the w.sub.dec,n.sub.W w.sub.dec,n.sub.W.sub.-1 . . . w.sub.dec,i . . . w.sub.dec,2w.sub.dec,1 is 0 or 1.

[0081] In the step (1H-b) of the method according to this specific embodiment, through the w′.sub.i′, and the w′.sub.i′+1, the QP.sub.org,j,k is downwardly modulated to obtain the QP′.sub.org,j,k, which is specifically embodied as: (b1) finding out all values in an interval of [−3,QP.sub.org,j,k] which meet a condition that a remainder result of an absolute value of each of all the values to 4 is equal to d.sub.i′; (b2) calculating an absolute value of a difference value of each of all the values found out in the step (b1) and the QP.sub.org,j,k; and (b3) finding out a minimum absolute value of all absolute values calculated in the step (b2), and assigning a value found out in the step (b1), which is corresponding to the minimum absolute value, to the QP′.sub.org,j,k, that is, QP.sub.org,j,k meets a condition of

[00013]$\{\begin{array}{c}{\mathrm{QP}}_{\mathrm{org},j,k}^{\prime }\in \left[-3,{\mathrm{QP}}_{\mathrm{org},j,k}\right]\\ .Math.{\mathrm{QP}}_{\mathrm{org},j,k}^{\prime }.Math..Math.\mathrm{mod}.Math..Math.4=d_{i^{\prime }}\\ \min \left(.Math.{\mathrm{QP}}_{\mathrm{org},j,k}^{\prime }-{\mathrm{QP}}_{\mathrm{org},j,k}.Math.\right)\end{array},$

wherein mod is a mathematical symbol for taking a remainder, and min( ) is a function for taking a minimum.

[0082] In the step (1H-b) of the method according to this specific embodiment, through the w′.sub.i′ and the w′.sub.i′+1, the QP.sub.org,j,k is upwardly modulated to obtain the QP′.sub.org,j,k, which is specifically embodied as: (b1′) finding out all values in an interval of [QP.sub.org,j,k,54] which meet a condition that a remainder result of an absolute value of each of all the values to 4 is equal to d.sub.i′; (b2′) calculating an absolute value of a difference value of each of all the values found out in the step (b1′) and the QP.sub.org,j,k; and (b3′) finding out a minimum absolute value of all absolute values calculated in the step (b2′), and assigning a value found out in the step (b1′), which is corresponding to the minimum absolute value, to the QP′.sub.org,j,k, that is, QP′.sub.org,j,k meets a condition of

[00014]$\{\begin{array}{c}{\mathrm{QP}}_{\mathrm{org},j,k}^{\prime }\in \left[{\mathrm{QP}}_{\mathrm{org},j,k},54\right]\\ {\mathrm{QP}}_{\mathrm{org},j,k}^{\prime }.Math..Math.\mathrm{mod}.Math..Math.4=d_{i^{\prime }}\\ \min \left(.Math.{\mathrm{QP}}_{\mathrm{org},j,k}^{\prime }-{\mathrm{QP}}_{\mathrm{org},j,k}.Math.\right)\end{array}.$

[0083] In the step (1H-c) of the method according to this specific embodiment, through the w′.sub.i, and the w′.sub.i′+1, the QP.sub.org,j,k is downwardly modulated to regain the QP′.sub.org,j,k, which is specifically embodied as: (c1) finding out all values in an interval of [0,QP.sub.org,j,k] which meet a condition that a remainder result of an absolute value of each of all the values to 4 is equal to d.sub.i′; (c2) calculating an absolute value of a difference value of each of all the values found out in the step (c1) and the QP.sub.org,j,k; and (c3) finding out a minimum absolute value of all absolute values calculated in the step (c2), and assigning a value found out in the step (c1), which is corresponding to the minimum absolute value, to the QP′.sub.org,j,k, that is, QP′.sub.org,j,k meets a condition of

[00015]$\{\begin{array}{c}{\mathrm{QP}}_{\mathrm{org},j,k}^{\prime }\in \left[0,{\mathrm{QP}}_{\mathrm{org},j,k}\right]\\ {\mathrm{QP}}_{\mathrm{org},j,k}^{\prime }.Math..Math.\mathrm{mod}.Math..Math.4=d_{i^{\prime }}\\ \min \left(.Math.{\mathrm{QP}}_{\mathrm{org},j,k}^{\prime }-{\mathrm{QP}}_{\mathrm{org},j,k}.Math.\right)\end{array}.$

[0084] In the step (1H-c) of the method according to this specific embodiment, through the w′.sub.i′ and the w′.sub.i′+1, the QP.sub.org,j,k is upwardly modulated to regain the QP′.sub.org,j,k, which is specifically embodied as: (c1′) finding out all values in an interval of [QP.sub.org,j,k,51] which meet a condition that a remainder result of an absolute value of each of all the values to 4 is equal to d.sub.i′; (c2′) calculating an absolute value of a difference value of each of all the values found out in the step (c1′) and the QP.sub.org,j,k; and (c3′) finding out a minimum absolute value of all absolute values calculated in the step (c2′), and assigning a value found out in the step (c1′), which is corresponding to the minimum absolute value, to the QP′.sub.org,j,k that is, QP′.sub.org,j,k meets a condition of

[00016]$\{\begin{array}{c}{\mathrm{QP}}_{\mathrm{org},j,k}^{\prime }\in \left[{\mathrm{QP}}_{\mathrm{org},j,k},51\right]\\ {\mathrm{QP}}_{\mathrm{org},j,k}^{\prime }.Math.\mathrm{mod}.Math..Math.4=d_{i^{\prime }}\\ \min \left(.Math.{\mathrm{QP}}_{\mathrm{org},j,k}^{\prime }-{\mathrm{QP}}_{\mathrm{org},j,k}.Math.\right)\end{array}.$

[0085] In order to verify the effectiveness and the feasibility of the method provided by the present invention, the method provided by the present invention is tested.

[0086] Adopted test sequences are as follows: a 3.sup.rd and 5.sup.th viewpoint of a Balloons stereo video sequence, a 2.sup.nd and 4.sup.th viewpoint of a Newspaper stereo video sequence, a 1.sup.st and 9.sup.th viewpoint of a Shark stereo video sequence and a 1.sup.st and 9.sup.th viewpoint of a UndoDancer stereo video sequence. A resolution of the former two stereo video sequences is 1024×768, and a resolution of the latter two stereo video sequences is 1920×1088. Test software is a coding platform HTM13.0 based on 3D-HEVC standard which codes 100 frames under random access, given target bit rates are respectively 2000, 4000, 5000 and 6000 kbps, and other configuration parameters are platform defaults. The performance of the method provided by the present invention will be respectively evaluated from the imperceptibility, the embedding capacity and the bit rate change of the stereo video sequence.

[0087] 1) The Imperceptibility of the Stereo Video Sequence

[0088] To verify the effect of the method provided by the present invention on the subjective quality of the stereo video sequence, here, the Newspaper stereo video sequence and the Shark stereo video sequence are selected to explain. FIG. 2a is a second frame of a second viewpoint of a stereo video sequence reconstructed from an encoded Newspaper stereo video stream without using the method provided by the present invention. FIG. 2b is a second frame of a fourth viewpoint of a stereo video sequence reconstruceted from an encoded Newspaper stereo video stream without using the method provided by the present invention. FIG. 2c is a second frame of a first viewpoint of a stereo video sequence reconstruceted from an encoded Shark stereo video stream without using the method provided by the present invention. FIG. 2d is a second frame of a ninth viewpoint of a stereo video sequence reconstruceted from an encoded Shark stereo video stream without using the method provided by the present invention. In other words, the frames in FIG. 2a, FIG. 2b, FIG. 2c and FIG. 2d are normally encoded through the coding platform HTM13.0 based on 3D-HEVC standard, therefore, these frames do not contain any secret information. By contrast, FIG. 2e is a second frame of a second viewpoint of a stereo video sequence reconstructed from a Newspaper stereo video stream encoded through a method provided by the present invention. FIG. 2f is a second frame of a fourth viewpoint of a stereo video sequence reconstructed from a Newspaper stereo video stream encoded through a method provided by the present invention. FIG. 2g is a second frame of a first viewpoint of a stereo video sequence reconstructed from a Shark stereo video stream encoded through a method provided by the present invention. FIG. 2h is a second frame of a ninth viewpoint of a stereo video sequence reconstructed from a Shark stereo video stream encoded through a method provided by the present invention. That is to say, the frames in FIG. 2e, FIG. 2f, FIG. 2g and FIG. 2h have been embedded in secret information. Compared FIG. 2a with FIG. 2e, FIG. 2b with FIG. 2f, FIG. 2c with FIG. 2g, and FIG. 2d with FIG. 2h, it can be seen that after secret information is embedded, the quality of the viewpoint of the stereo video sequence is not obviously distorted, which shows that the method provided by the present invention has a better stereo video imperceptibility.

[0089] To further evaluate the quality of the stereo video sequence, a representative index such as PSNR (peak signal-to-noise ratio) is introduced into the experiment to explain. Table 1 shows the quality of the stereo video sequences which are respectively obtained by performing normal encoding on an original Balloons stereo video sequence, an original Newspaper stereo video sequence, an original Shark stereo video sequence and an original UndoDancer stereo video sequence, and then decoding the encoded video stream, and also shows the quality of the stereo video sequences which are respectively obtained by performing encoding on an original Balloons stereo video sequence, an original Newspaper stereo video sequence, an original Shark stereo video sequence and an original UndoDancer stereo video sequence through the method provided by the present invention, and then decoding the encoded video stream. A computational formula of a variation ΔPSNR of the PSNR before and after inserting the secret information is ΔPSNR=PSNR.sub.pro−PSNR.sub.org, wherein the PSNR.sub.pro represent a mean PSNR of two viewpoints of the stereo video sequence obtained by performing encoding on an original stereo video sequence through the method provided by the present invention, and then decoding the encoded video stream, and PSNR.sub.org represents a mean PSNR of two viewpoints of the stereo video sequence obtained by performing normal encoding on an original stereo video sequence, and then decoding the encoded video stream. In this experiment, the imperceptibility of the stereo video sequence is explained through the ΔPSNR.

[0090] It can be seen from Table 1 that after being performed the encoding at different target bit rates, the stereo video sequence has different qualities. The reason is that the smaller the given target bit rate, the less the bits allocated to the viewpoint, the poor the quality of the reconstructed stereo video sequence. Simultaneously, in Table 1, the absolute value of ΔPSNR is in a range of 0.0014-0.0524 dB, and the average of ΔPSNR is −0.03139 dB, which shows that the method provided by the present invention has a slight impact on the quality of the encoded stereo video sequence. The method provided by the present invention combines with the stereo image salient model to guide the embedding of the secret information, and only finely tunes the coding quantization parameters, so that the method provided by the present invention has a smaller impact on the quality of the stereo video sequence.

TABLE-US-00001 TABLE 1 The impact of the method provided by the present invention on the quality of encoded stereo video sequences Stereo video Target bit PSNR (dB) sequence Resolution rate PSNR.sub.org PSNR.sub.pro ΔPSNR Balloons 1024 × 768  2000 43.3970 43.3490 −0.0480 4000 44.5928 44.5620 −0.0308 5000 44.9503 44.9126 −0.0377 6000 45.2222 45.1847 −0.0375 Newspaper 1024 × 768  2000 41.8957 41.8433 −0.0524 4000 43.7668 43.7223 −0.0445 5000 44.2632 44.2175 −0.0457 6000 44.7029 44.6653 −0.0376 Shark 1920 × 1088 2000 35.2779 35.2452 −0.0327 4000 38.3170 38.3011 −0.0159 5000 39.3162 39.2982 −0.0180 6000 40.1200 40.0972 −0.0228 UndoDancer 1920 × 1088 2000 34.2069 34.1915 −0.0154 4000 36.4754 36.4579 −0.0175 5000 37.1667 37.1681 0.0014 6000 37.7911 37.7440 −0.0471

[0091] 2) Embedded Capacity and Bit Rate Change of the Stereo Video Sequence

[0092] Generally speaking, in the encoding process of the stereo video sequence, embedding the secret information through the coding quantization parameters causes a change in the coding bit rate. Table 2 shows test results of the embedded capacity and the bit rate change of the Balloons stereo video sequence, the Newspaper stereo video sequence, the Shark stereo video sequence and the UndoDancer stereo video sequence through the method provided by the present invention. In Table 2, the embedded capacity is a total sum of the embedded capacities of the stereo video sequences, and the bit rate change is defined as

[00017]$B.Math..Math.R.Math..Math.I=\frac{R_{\mathrm{pro}}-R_{\mathrm{org}}}{R_{\mathrm{org}}}\times 100.Math.\%,$

here, the R.sub.pro represents a bit rate of an original stereo video sequence after being processed through the method provided by the present invention and then performed the compression coding, and the R.sub.org represents a bit rate of an original stereo video sequence after being performed the compression coding.

[0093] It can be seen from Table 2 that with the increase of the resolution of the stereo video sequence, the embedded capacity is increased, the reason is that the greater the resolution, the more the allocated coding-tree-units, the more the embedded vectors. An average embedded capacity of the stereo video sequence at different target bit rates is 47236 bits, and the bit rate is average increased by 0.0741%, which shows that the method provided by the present invention can provide high embedded capacity and has less effect on the bit rate of the coding, due to the method provided by the present invention finely tunes the coding quantization parameters, simultaneously starts the bit rate control module to effectively restrain the change of the bit rate.

TABLE-US-00002 TABLE 2 Test results of the embedded capacity and the bit rate change of the method provided by the present invention Target Embedded Bit rate (kbps) Stereo video bit capacity Original Present Change sequence Resolution rate (bit) coding invention rate Balloons 1024 × 768  2000 33760 2036.950 2036.928 −0.0011% 4000 46058 4013.657 4013.998 0.0085% 5000 52696 5004.686 5005.380 0.0139% 6000 56538 6004.975 6005.556 0.0097% Newspaper 1024 × 768  2000 26772 2048.866 2049.118 0.0123% 4000 38038 4056.552 4057.445 0.0220% 5000 44332 5048.395 5048.206 −0.0037% 6000 49170 6027.574 6027.962 0.0064% Shark 1920 × 1088 2000 40864 2002.462 2002.202 −0.0130% 4000 56782 4010.378 4012.063 0.0420% 5000 63356 5008.946 5012.633 0.0736% 6000 69100 6007.138 6006.845 −0.0049% UndoDancer 1920 × 1088 2000 29438 2016.056 2014.082 −0.0979% 4000 43588 4074.594 4104.764 0.7404% 5000 49358 5063.886 5098.290 0.6794% 6000 55924 6120.974 6102.510 −0.3017%

[0094] One skilled in the art will understand that the embodiment of the present invention as shown in the drawings and described above is exemplary only and not intended to be limiting.

[0095] It will thus be seen that the objects of the present invention have been fully and effectively accomplished. Its embodiments have been shown and described for the purposes of illustrating the functional and structural principles of the present invention and is subject to change without departure from such principles. Therefore, this invention includes all modifications encompassed within the spirit and scope of the following claims.