CN103024384B - A kind of Video coding, coding/decoding method and device - Google Patents

Abstract

The present invention is directed to the film source that illumination variation occurs, propose a kind of Video coding, coding/decoding method and device.The method carries out correction process in the same way by the monochrome information to reference frame, chrominance information, thus the correlation strengthened between reference frame and coded frame, finally reach, reduce the number of intra prediction mode of MB of prediction frame, reduce code check consumption, promote the performance of encoder on inter-frame information redundancy is eliminated.

Description

A kind of Video coding, coding/decoding method and device

Technical field

The present invention relates to coding and decoding video field, particularly relate to a kind of Video coding, coding/decoding method and device.

Background technology

When the change of video image generation global illumination, (such as mute is dark by bright turn, so that disappear completely to produce the image of monochrome information gradual change; Mute is by secretly brightening, finally completely clear).Now, on the one hand, can there is relatively large change in the monochrome information of consecutive frame image, and but then, because the body matter correlation of image still exists, the inter-frame information redundancy of video image is still very large.Now, according to the inter-frame prediction techniques of conventional coder, but cannot judge both correlations, thus in MB of prediction frame, produce the problem that intra prediction mode is uprushed, code check rises rapidly, cause the decline of conventional coder in inter-frame prediction techniques performance.Therefore need to propose a kind of novel encoding and decoding strategy, solve the problems referred to above.

Summary of the invention

The object of the embodiment of the present invention is to propose a kind of audio-video document decoding method and device.

The decode video files method that the present invention proposes comprises:

Obtain frame _t(current encoded frame), and note is set _t=0, note _tfor current sign variable;

Judge whether current encoded frame is I frame or scene switch frame; If not, then utilize the first coding method to frame _tencode;

Find next image to be encoded by coded sequence, if next image to be encoded exists, then image to be encoded for the next one is set to frame _t, continue to perform acquisition frame _t.

Wherein said " utilizes the first coding method to frame _tencode " be specially:

Arrange m=0, m represents relative to frame _tthrough the reference frame number of light gradient judgement;

Judge frame _trelative to picture _ref1(the first reference picture), picture _ref2whether (the second reference picture) there is monochrome information gradual change, if there is monochrome information gradual change, arranges and makes note _t=1; Arranging m is the first numerical value;

To the picture of non-NULL _ref1, non-NULL picture _ref2carry out the correction in the same way of monochrome information, obtain the correction parameter collection of a reference picture, the second reference picture;

Utilize the picture of corrected in the same way non-NULL _ref1and the picture of non-NULL _ref2replace reference frame corresponding in reference listing;

Judge that whether all reference frames of current encoded frame are all through the judgement of light gradient; If not, then continue execution and " judge frame _trelative to picture _ref1(the first reference picture), picture _ref2whether (the second reference picture) there is monochrome information gradual change ";

If so, then to frame _tin each macro block carry out conventional coded treatment; Judge whether " note _t=1 and optimum prediction mode is inter-frame forecast mode ", if not then perform " by coded sequence find next image to be encoded "; If so, the first reference picture that in the optimum prediction mode confirmed in " conventional coded treatment " described in then transmitting to decoding end, optimum reference frame is corresponding or the correction parameter collection of the second reference picture.

The present invention also provides a kind of decode video files method, and the method comprises:

Obtain the correction parameter collection of current decoded frame and the first reference picture or the second reference picture; Judge whether that current sign variable is 0, if not, then carried out the correction in the same way of monochrome information by the reference frame of the correction parameter set pair current decoded frame of the first described reference picture or the second reference picture;

The reference frame of corrected in the same way current decoded frame is utilized to carry out regular decode to current decoded frame;

Find next image to be decoded by decoding order, if next image to be decoded exists, then image to be decoded for the next one is set to current decoded frame, continue " finding next image to be decoded by decoding order ".

The present invention also provides a kind of video file code device, and this device comprises: the first acquiring unit, the first processing unit, the second processing unit;

First acquiring unit, for obtaining frame _t(current encoded frame), and note is set _t=0, note _tfor current sign variable;

First processing unit, comprises the first judging unit, the 3rd processing unit and the 11 processing unit;

Described first judging unit, for judging whether current encoded frame is I frame or scene switch frame;

Described 3rd processing unit, for when the first judging unit judged result is no, then utilizes the first coding method to frame _tencode;

11 processing unit, for when the judged result of the first judging unit is for being, utilizes the second coding method to frame _tencode;

Second processing unit, finding next image to be encoded for pressing coded sequence, if next image to be encoded exists, then image to be encoded for the next one being set to frame _t, notice execution first acquiring unit, if next image to be encoded does not exist, then process ends process.

The present invention also provides a kind of decode video files device, and this device comprises: decoding acquiring unit, the first codec processing unit, the second codec processing unit, the 3rd codec processing unit;

Decoding acquiring unit, for obtaining the correction parameter collection of current decoded frame and the first reference picture or the second reference picture;

First codec processing unit, comprises the first decoding judgement unit, decoded luminance information correction unit, regular decode unit;

The first described decoding judgement unit, for judging whether that current sign variable is 0;

Described decoded luminance information correction unit, for when the judged result of the first decoding judgement unit is no, the correction in the same way of monochrome information is carried out, notice execution second codec processing unit by the reference frame of the correction parameter set pair current decoded frame of the first described reference picture or the second reference picture;

Regular decode unit, for when the judged result of the first decoding judgement unit is for being, carries out regular decode process to described current decoded frame; Notice execution the 3rd codec processing unit;

Second codec processing unit, for utilizing the reference frame of corrected in the same way current decoded frame to carry out regular decode to current decoded frame, notice execution the 3rd codec processing unit;

3rd codec processing unit, finding next image to be decoded for pressing decoding order, if next image to be decoded exists, then image to be decoded for the next one being set to current decoded frame, notice decoding acquiring unit;

Wherein, described decoded luminance information correction unit " carries out the correction in the same way of monochrome information " method by the reference frame of the correction parameter set pair current decoded frame of the first described reference picture or the second reference picture is:

${\mathrm{ref}}_{t,m}^y(i,j)=k_T^y*({\mathrm{ref}}_t^y(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}}^y)+\min \_{\mathrm{frame}}_t^y$

Wherein, the span of i, j is: 1≤i≤height _yaMP.AMp.Amp & 1≤j≤width _y; for the pixel value that the monochrome information of the reference frame of current decoded frame arranges in the i-th row jth; the pixel value that the monochrome information correcting the reference frame of rear current decoded frame in the same way for monochrome information arranges in the i-th row jth; be respectively the monochrome information adjustment factor of the corresponding reference frame of the current decoded frame that passes over from coding side, the minimum luminance value of the corresponding reference frame of current decoded frame, the minimum luminance value of original coding frame that current decoded frame is corresponding.

The present invention is directed to the film source that illumination variation occurs, propose a kind of novel decoding method.This method carries out correction process in the same way by the monochrome information to reference frame, chrominance information, thus the correlation strengthened between reference frame and coded frame, finally reach, reduce the number of intra prediction mode of MB of prediction frame, reduce code check consumption, promote the performance of encoder on inter-frame information redundancy is eliminated.

Accompanying drawing explanation

Fig. 1 is the embodiment of the present invention 1 method for video coding flow chart;

Fig. 2 is that step 104 in the embodiment of the present invention 1 " utilizes the first coding method to frame _tencode " method flow diagram;

Fig. 3 is the embodiment of the present invention 2 video encoding/decoding method flow chart;

Fig. 4 is the embodiment of the present invention 3 video coding apparatus structural representation;

Fig. 5 is the structural representation of the 3rd processing unit in the embodiment of the present invention 3 video coding apparatus;

Fig. 6 is the embodiment of the present invention 4 video decoder structural representation.

Embodiment

In order to make object of the present invention, technical scheme and advantage clearly understand, below in conjunction with drawings and Examples, the present invention being further elaborated, for convenience of explanation, illustrate only the part relevant to the embodiment of the present invention.Should be appreciated that the specific embodiment that this place is described, only for explaining the present invention, not in order to limit the present invention.

The invention provides a kind of based on image generation monochrome information gradual change when, for a kind of novel coding strategy that illumination gradual change film source occurs.

The prerequisite of the method is: suppose that all images are the n bitmaps with identical resolution.

Conveniently represent, the n bitmap in full refers to that each pixel of image n bit unsigned integer represents.Suppose that current encoded frame and the first reference picture, the second reference picture are all n bitmaps, the brightness value of its all pixel forms the monochrome information of respective image, the U chromatic value of all pixels forms the U chrominance information of respective image, and the V chromatic value of all pixels forms the V chrominance information of respective image; Remember that line number, the columns of its monochrome information are respectively: height _y, width _y; Remember that line number, the columns of its U chrominance information are respectively: height _u, width _u; Remember that line number, the columns of its V chrominance information are respectively: height _v, width _v.

Embodiment 1, the invention provides a kind of method for video coding, and see Fig. 1, the method can be:

Step 101: obtain current encoded frame, and carry out initialization operation and note _t=0.

In the present invention, note _tfor current sign variable; When encoding, t is the coding sequence number of current encoded frame; When decoding, t then represents the Decoding Order Number of current decoded frame.

Step 102: judge whether current encoded frame is I frame or scene switch frame, if perform step 103; Then perform step 104 if not.

In the present invention, frame _tfor current encoded image; The decision method of this step Scene switch frame, belongs to prior art, is not repeated at this.

Step 103: utilize the second coding method (i.e. conventional I frame coding techniques) to frame _tencode, then perform step 105; Conventional I frame coding techniques described in this step refers to intra-frame coding techniques, does not have the concept of reference frame, does not carry out inter prediction, only carry out infra-frame prediction.

Step 104: utilize the first coding method to frame _tencode, then perform step 105.

Step 105: find next image to be encoded by coded sequence, judge whether next image to be encoded exists, then performs step 106 if not; If then, image to be encoded for the next one is set to current encoded image frame _t, re-execute step 101.

Step 106: process ends.

See Fig. 2, in said method, step 104 " utilizes the first coding method to frame _tencode " method can be:

Step 1041: initialization operation, namely arranges m=0, and m represents through the reference frame number of light gradient judgement.

Step 1042: judge frame _trelative to picture _ref1, picture _ref2whether there is monochrome information gradual change, if there is monochrome information gradual change, then perform step 1043; If there is not monochrome information gradual change, then perform step 1045.

Step 1043: make note _t=1;

In the present invention, picture _ref1be the first reference picture, picture _ref2it is the second reference picture.

Step 1044: arranging m is the first numerical value;

In step 1044, to arrange m be the method for the first numerical value can be:

Step 10441 judges whether picture _ref1coding sequence number and picture _ref2coding sequence number be all less than the coding sequence number of current encoded frame and picture _ref1, picture _ref2all encoded, if so, then perform step 10442; If not, then step 10443 is performed.

Step 10442: first make m=m+2, then performs step 1046.

Step 10443: judge whether picture _ref1coding sequence number and picture _ref2coding sequence number be all less than the coding sequence number of current encoded frame and picture _ref1, picture _ref2all uncoded, if so, then perform step 10444; If not, then step 10445 is performed.

Step 10444: first arrange m=m+2, then by picture _ref1, picture _ref2replace with the coding reconstructed image of its correspondence respectively, then perform step 1046.

Step 10445: first arrange m=m+1, is then less than the reference picture of current encoded frame coding sequence number, replaces with the coding reconstructed image of its correspondence by coding sequence number, another reference image setting is empty, then performs step 1046.

Step 1045: first arranging m is second value,

Namely to arrange m be the method for second value can be: m=m+sign (picture _ref1)+sign (picture _ref2), then perform step 1048

Wherein,

Sign (picture _ref1) represent picture _ref1be reference frame or be not reference frame time corresponding value;

Sign (picture _ref2) represent picture _ref2be reference frame or be not reference frame time corresponding value;

Step 1046: to the picture of non-NULL _ref1, non-NULL picture _ref2carry out the correction in the same way of monochrome information, obtain the correction parameter collection of the first reference picture, the second reference picture.

Step 1047: utilize the first reference picture of corrected in the same way non-NULL and the second reference picture of non-NULL to replace reference frame corresponding in reference listing.

Step 1048: judge that whether all reference frames of current encoded frame are all through the judgement of light gradient, namely determine whether

M>number _list0+ number _list1and frame _tfor B frame) or (m>number _list0and frame _tfor P frame), if so, then perform step 1049; If not, then execution step 1042 is reentered;

Wherein number _list0represent reference frame sum in forward direction reference listing; Number _list1represent reference frame sum in backward reference listing.

Step 1049: to frame _tin each macro block carry out conventional coded treatment flow process: carry out inter prediction, infra-frame prediction, rate-distortion optimization (RDO) model selection obtain optimum prediction mode, conversion, quantification and entropy code etc., finally complete frame _tcoding.

Conventional coded treatment flow process (refer to inter-frame coding techniques, have the concept of reference frame, predictive mode can be considered in interframe and frame) described in this step all belongs to the content of prior art, is not repeated at this.

Step 1050: judge whether " note _t=1 and optimum prediction mode is inter-frame forecast mode ", if then perform step 1051; As no execution step 105;

Step 1051: the first reference picture that in the optimum prediction mode confirmed in the conventional code processing method described in decoding end transmission step 1049, optimum reference frame is corresponding or the correction parameter collection of the second reference picture; Perform step 105;

Wherein, described " transmitting the correction parameter collection of the first reference picture corresponding to optimum reference frame in described optimum prediction mode or the second reference picture "; If the reference frame that namely the first reference picture is corresponding is optimum reference frame, then only transmit the correction parameter collection corresponding with the first reference picture, that is: if carried out U, V chrominance information in the method further to correct in the same way, so correction parameter collection has comprised further now decoding end $k_T^y=k_{T1}^y,\min \_{\mathrm{picture}}_{\mathrm{ref}}^y=\min \_{\mathrm{picture}}_{\mathrm{ref}1}^y,k_T^u=k_{T1}^u,$ $\min \_{\mathrm{picture}}_{\mathrm{ref}}^u={\min \_\mathrm{picture}}_{\mathrm{ref}1}^u,k_T^v=k_{T1}^v,{\min \_\mathrm{picture}}_{\mathrm{ref}}^v={\min \_\mathrm{picture}}_{\mathrm{ref}1}^v.$

Wherein, it is the first reference picture monochrome information adjustment factor; represent picture _ref1minimum luminance value; represent frame _tminimum luminance value;

it is the first reference picture U chrominance information adjustment factor; represent picture _ref1minimum U chromatic value; represent frame _tminimum U chromatic value;

it is the first reference picture V chrominance information degree adjustment factor; represent frame _tminimum V chromatic value; represent picture _ref1minimum V chromatic value; be respectively the monochrome information adjustment factor of the corresponding reference frame of the current decoded frame that passes over from coding side, the minimum luminance value of the corresponding reference frame of current decoded frame, the minimum luminance value of original coding frame that current decoded frame is corresponding.

" frame is judged in step 1042 _trelative to picture _ref1, picture _ref2whether there is monochrome information gradual change " method can be:

Step 10421: obtain the first reference picture and the second reference picture;

In this step, the method choosing the first reference picture and the second reference picture can be:

(1) choose satisfied sequence number of playing and be less than the image of current encoded frame broadcasting sequence number as the first reference picture;

(2) choose satisfied sequence number of playing and be greater than the image of current encoded frame broadcasting sequence number as the second reference picture.

(3) same current encoded frame frame _t, the first corresponding reference picture and the second reference picture can not be used to " judge frame simultaneously _trelative to picture _ref1, picture _ref2whether there is monochrome information gradual change " judgement.That is, for same current encoded frame, carry out " judging frame _trelative to picture _ref1, picture _ref2whether there is monochrome information gradual change " time, the first reference picture and the second reference picture can not simultaneously " being selected ".

Step 10422: whether the first reference picture described in judgement and the second reference picture meet reference picture standard; Then re-execute step 10421 if not; If then perform step 10423;

Above-mentioned determination methods can be:

Judge whether the first reference picture and the second reference picture meet following condition simultaneously:

(1) first reference picture has identical encoding state with the second reference picture, i.e. the first reference picture and the second reference picture or all encoded, or does not all encode;

The coding sequence number of (2) first reference pictures and the coding sequence number of the second reference picture can not be greater than the coding sequence number of current encoded frame simultaneously.

Step 10423: obtain current encoded frame frame _tthe probability distribution of monochrome information:

The probability distribution method of described acquisition current encoded frame monochrome information can be:

$p_t({\mathrm{frame}}_t^y,k)=\mathrm{cout}({\mathrm{frame}}_t^y,k)/({\mathrm{widty}}_y*{\mathrm{height}}_y),k=\mathrm{0,1,2},...,2^n-1$

Wherein,

$\mathrm{sign}({\mathrm{frame}}_t^y(i,j),k)=\left\{\begin{array}{cc}1,& {\mathrm{frame}}_t^y(i,j)=k\\ 0,& \mathrm{else}\end{array}\right.$

Wherein, y represents monochrome information; represent current encoded frame frame _tmonochrome information; represent the pixel value of the image luminance information being positioned at current encoded frame i-th row jth row; represent corresponding value when equaling k and be not equal to k; Sum (variable | condition) represent all variable summations satisfied condition; represent frame _tthe pixel value of middle monochrome information equals the pixel number of k; for probability distribution; The present invention supposes that all images are the n bitmaps with identical resolution.The monochrome information of the brightness value composing images of all pixels of image, line number, the columns of note image luminance information are respectively: height _y, width _y.N bitmap in the present invention refers to that each pixel of image n bit unsigned integer represents.

Step 10424: the probability distribution obtaining the first reference picture monochrome information, and the probability distribution of the second reference picture monochrome information.

In this step, the probability distribution method obtaining the first reference picture monochrome information can be:

$p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)=\mathrm{cout}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)/({\mathrm{widty}}_y*{\mathrm{height}}_y),k=\mathrm{0,1,2},...,2^n-1$

Wherein,

$\mathrm{sign}({\mathrm{picture}}_{\mathrm{ref}1}^y(i,j),k)=\left\{\begin{array}{cc}1,& {\mathrm{picture}}_{\mathrm{ref}1}^y(i,j)=k\\ 0,& \mathrm{else}\end{array}\right.$

Wherein, y represents monochrome information; represent the first reference picture picture _ref1monochrome information; represent the pixel value of the image luminance information being positioned at the first reference picture i-th row jth row; represent corresponding value when equaling k and be not equal to k; Sum (variable | condition) represent all variable summations satisfied condition; represent picture _ref1the pixel value of middle monochrome information equals the pixel number of k; for probability distribution; The present invention supposes that all images are the n bitmaps with identical resolution.The monochrome information of the brightness value composing images of all pixels of image, line number, the columns of note image luminance information are respectively: height _y, width _y.N bitmap in the present invention refers to that each pixel of image n bit unsigned integer represents.

In this step, the probability distribution method obtaining the second reference picture monochrome information can be:

$p_t({\mathrm{picture}}_{\mathrm{ref}2}^y,k)=\mathrm{cout}({\mathrm{picture}}_{\mathrm{ref}2}^y,k)/({\mathrm{widty}}_y*{\mathrm{height}}_y),k=\mathrm{0,1,2},...,2^n-1$

Wherein,

$\mathrm{sign}({\mathrm{picture}}_{\mathrm{ref}2}^y(i,j),k)=\left\{\begin{array}{cc}1,& {\mathrm{picture}}_{\mathrm{ref}2}^y(i,j)=k\\ 0,& \mathrm{else}\end{array}\right.$

Wherein, y represents monochrome information; represent the second reference picture picture _ref2monochrome information; represent the pixel value of the image luminance information being positioned at the second reference picture i-th row jth row; represent corresponding value when equaling k and be not equal to k; Sum (variable | condition) represent all variable summations satisfied condition; represent picture _ref2the pixel value of middle monochrome information equals the pixel number of k; for probability distribution; The present invention supposes that all images are the n bitmaps with identical resolution.The monochrome information of the brightness value composing images of all pixels of image, line number, the columns of note image luminance information are respectively: height _y, width _y.N bitmap in the present invention refers to that each pixel of image n bit unsigned integer represents.

Step 10425: whether the probability distribution determination current encoded frame according to the monochrome information of the current encoded frame obtained, the first reference picture, the second reference picture monochrome information gradual change occurs.

In this step, determine that the method whether current encoded frame monochrome information gradual change occurs can be:

Judge whether

$\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)\right)<\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^y,k)\right)<\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}(p_{\mathrm{ref}2}^y,k)\right)$

Or

$\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^y,k)\right)<\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^y,k)\right)<\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}(p_{\mathrm{ref}1}^y,k)\right)$

If so, then frame _trelative to picture _ref1, picture _ref2there is monochrome information gradual change;

If not, then frame _trelative to picture _ref1, picture _ref2there is not monochrome information gradual change.；

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; Y represents monochrome information; represent the second reference picture picture _ref2monochrome information; for probability distribution; represent the first reference picture picture _ref1monochrome information; for probability distribution.

" to the picture of non-NULL in above-mentioned steps 1046 _ref1, non-NULL picture _ref2carry out monochrome information, correction in the same way, obtain the correction parameter collection of the first reference picture, the second reference picture " method can be:

Step 10461: the first reference picture picture carrying out non-NULL _ref1, non-NULL the second reference picture picture _ref2monochrome information corrects in the same way, and bearing calibration is carried out as follows:

Step 104611: first, calculates current encoded frame frame _tmonochrome information be worth most:

$\max \_{\mathrm{frame}}_t^y=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^y,k)\right)\right)$

In full, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent frame _tmaximum brightness value; represent frame _tminimum luminance value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach maximum k value, namely

$p_t({\mathrm{frame}}_t^y,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^y,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^y,k)\right),\max \_{\mathrm{frame}}_t^y$ Represent frame _tmaximum brightness value; represent frame _tminimum luminance value;

Step 104612: then, calculates the first reference picture picture of non-NULL _ref1and the second reference picture picture of non-NULL _ref2monochrome information be worth most:

$\max \_{\mathrm{picture}}_{\mathrm{ref}1}^y=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)\right)\right)$

$\max \_{\mathrm{picture}}_{\mathrm{ref}2}^y=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^y,k)\right)\right)$

In full, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent picture _ref1maximum brightness value; represent picture _ref1minimum luminance value; represent picture _ref2maximum brightness value; represent picture _ref2minimum luminance value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum given, in other words 0≤k≤2 ⁿmake in-1 reach the k value of maximum, namely $p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^y,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)\right);$ represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach maximum k value, namely $p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^y,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^y,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^y,k)\right);$ represent picture _ref1maximum brightness value; represent picture _ref1minimum luminance value; represent picture _ref2maximum brightness value; represent picture _ref2minimum luminance value.

Step 104613: monochrome information is carried out to the brightness value of the first reference picture of non-NULL and each pixel of the second reference picture of non-NULL and corrects in the same way:

${\mathrm{picture}}_{\mathrm{ref}1,m}^y(i,j)=k_{T1}^y*({\mathrm{picture}}_{\mathrm{ref}1}^y(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^y)+\min \_{\mathrm{frame}}_t^y$

${\mathrm{picture}}_{\mathrm{ref}2,m}^y(i,j)=k_{T2}^y*({\mathrm{picture}}_{\mathrm{ref}2}^y(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^y)+\min \_{\mathrm{frame}}_t^y$

Wherein, $k_{T1}^y=\frac{\max \_{\mathrm{frame}}_t^y-\min \_{\mathrm{frame}}_t^y}{\max \_{\mathrm{picture}}_{\mathrm{ref}1}^y-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^y};k_{T2}^y=\frac{\max \_{\mathrm{frame}}_t^y-\min \_{\mathrm{frame}}_t^y}{\max \_{\mathrm{picture}}_{\mathrm{ref}2}^y-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^y};$ The span of i, j is: 1≤i≤height _yaMP.AMp.Amp & 1≤j≤width _y; it is the first reference picture monochrome information adjustment factor; it is the second reference picture monochrome information adjustment factor; T1, T2 represent the coding sequence number of the corresponding reference frame of the first reference picture, the coding sequence number of the corresponding reference frame of the second reference picture respectively; Correction parameter collection is:

After carrying out above-mentioned several step, the correction parameter collection of the first reference picture, the second reference picture can be obtained.

In full, be respectively the monochrome information of the first reference picture, pixel value that the monochrome information of the second reference picture arranges in the i-th row jth; be respectively the pixel value that monochrome information corrects the rear monochrome information of the first reference picture in the same way, the monochrome information of the second reference picture arranges in the i-th row jth.

In step 1046, in order to better realize the correction in the same way of reference picture, the first reference picture picture of non-NULL can also be carried out further _ref1, non-NULL the second reference picture picture _ref2u chrominance information correct in the same way and correct in the same way with V chrominance information; Correction parameter collection increases the correction parameter collection of U, V chrominance information accordingly.

Step 10462: carry out U chrominance information and correct in the same way, bearing calibration is carried out as follows:

Utilize the monochrome information bearing calibration in the same way of step step 10461 above, carry out U chrominance information and correct in the same way, only with the correlated variables correlated variables of all brightness being replaced to U colourity.

Step 104621: first, calculates current encoded frame frame _tu chrominance information be worth most:

$\max \_{\mathrm{frame}}_t^u=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^u,k)\right)\right)$

In full, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent frame _tmaximum U chromatic value; represent frame _tminimum U chromatic value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach maximum k value, namely

$p_t({\mathrm{frame}}_t^u,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^u,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^u,k)\right);$ represent frame _tmaximum U chromatic value; represent frame _tminimum U chromatic value;

Step 104622: then, calculates the first reference picture picture of non-NULL _ref1and the second reference picture picture of non-NULL _ref2u chrominance information be worth most:

$\max \_{\mathrm{picture}}_{\mathrm{ref}1}^u=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^u,k)\right)\right)$

$\max \_{\mathrm{picture}}_{\mathrm{ref}2}^u=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^u,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent picture _ref1maximum U chromatic value; represent picture _ref1minimum U chromatic value; represent picture _ref2maximum U chromatic value; represent picture _ref2minimum U chromatic value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach the k value of maximum, namely $p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^u,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^u,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^u,k)\right);$ represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach maximum k value, namely $p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^u,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^u,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}2}^u,k)\right);$ represent picture _ref1maximum U chromatic value; represent picture _ref1minimum U chromatic value; represent picture _ref2maximum U chromatic value; represent picture _ref2minimum U chromatic value;

Step 104623: U chrominance information is carried out to the U chrominance information of the first reference picture of non-NULL and each pixel of the second reference picture of non-NULL and corrects in the same way:

${\mathrm{picture}}_{\mathrm{ref}1,m}^u(i,j)=k_1^u*({\mathrm{picture}}_{\mathrm{ref}1}^u(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^u)+\min \_{\mathrm{frame}}_t^u$

${\mathrm{picture}}_{\mathrm{ref}2,m}^u(i,j)=k_2^u*({\mathrm{picture}}_{\mathrm{ref}2}^u(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^u)+\min \_{\mathrm{frame}}_t^u$ Wherein, $k_{T1}^u=\frac{\max \_{\mathrm{frame}}_t^u-\min \_{\mathrm{frame}}_t^u}{\max \_{\mathrm{picture}}_{\mathrm{ref}1}^u-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^u};k_{T2}^u=\frac{\max \_{\mathrm{frame}}_t^u-\min \_{\mathrm{frame}}_t^u}{\max \_{\mathrm{picture}}_{\mathrm{ref}2}^u-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^u};$ Wherein, the span of i, j is: 1≤i≤height _uaMP.AMp.Amp & 1≤j≤width _u; it is the first reference picture U chrominance information adjustment factor; it is the second reference picture U chrominance information adjustment factor; T1, T2 represent the coding sequence number of the corresponding reference frame of the first reference picture, the coding sequence number of the corresponding reference frame of the second reference picture respectively; Accordingly, described " correction parameter collection " comprises the correction parameter collection of U chrominance information further

In full, be respectively the U chrominance information of the first reference picture, pixel value that the U chrominance information of the second reference picture arranges in the i-th row jth; be respectively the pixel value that U chrominance information corrects the rear U chrominance information of the first reference picture in the same way, the U chrominance information of the second reference picture arranges in the i-th row jth.

Step 10463: then, carry out V chrominance information and correct in the same way, bearing calibration is carried out as follows:

Utilize the monochrome information bearing calibration in the same way of step 10461 above, carry out V chrominance information and correct in the same way, only with the correlated variables correlated variables of all brightness being replaced to V colourity.

Step 104631: first, calculates current encoded frame frame _tv chrominance information:

$\max \_{\mathrm{frame}}_t^v=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^v,k)\right)\right)$

In full, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent frame _tmaximum V chromatic value; represent frame _tminimum V chromatic value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach maximum k value, namely $p_t({\mathrm{frame}}_t^v,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^v,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^v,k)\right);$ represent frame _tmaximum V chromatic value; represent frame _tminimum V chromatic value.

Step 104632: then, calculates the first reference picture picture of non-NULL _ref1and the second reference picture picture of non-NULL _ref2v chrominance information be worth most:

$\max \_{\mathrm{picture}}_{\mathrm{ref}1}^v=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^v,k)\right)\right)$

$\max \_{\mathrm{picture}}_{\mathrm{ref}2}^v=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^v,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent picture _ref1maximum V chromatic value; represent picture _ref1minimum V chromatic value; represent picture _ref2maximum V chromatic value; represent picture _ref2minimum V chromatic value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach the k value of maximum, namely $p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^v,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^v,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^v,k)\right);$ represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach maximum k value, namely $p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^v,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^v,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}2}^v,k)\right);$ represent picture _ref1maximum V chromatic value; represent picture _ref1minimum V chromatic value; represent picture _ref2maximum V chromatic value; Represent picture _ref2minimum V chromatic value;

Step 104633: V chrominance information is carried out to the V chrominance information of the first reference picture of non-NULL and each pixel of the second reference picture of non-NULL and corrects in the same way:

${\mathrm{picture}}_{\mathrm{ref}1,m}^v(i,j)=k_1^v*({\mathrm{picture}}_{\mathrm{ref}1}^v(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^v)+\min \_{\mathrm{frame}}_t^v$

${\mathrm{picture}}_{\mathrm{ref}2,m}^v(i,j)=k_2^v*({\mathrm{picture}}_{\mathrm{ref}2}^v(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^v)+\min \_{\mathrm{frame}}_t^v$

Wherein, $k_{T1}^v=\frac{\max \_{\mathrm{frame}}_t^v-\min \_{\mathrm{frame}}_t^v}{\max \_{\mathrm{picture}}_{\mathrm{ref}1}^v-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^v};$

$k_{T2}^v=\frac{\max \_{\mathrm{frame}}_t^v-\min \_{\mathrm{frame}}_t^v}{\max \_{\mathrm{picture}}_{\mathrm{ref}2}^v-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^v};$ The span of i, j is: 1≤i≤height _vaMP.AMp.Amp & 1≤j≤width _v; it is the first reference picture V chrominance information degree adjustment factor; it is the second reference picture V chrominance information degree adjustment factor; T1, T2 represent the coding sequence number of the corresponding reference frame of the first reference picture, the coding sequence number of the corresponding reference frame of the second reference picture respectively; Accordingly, described correction parameter collection " comprise further: the correction parameter collection of V chrominance information represent frame _tmaximum V chromatic value; represent frame _tminimum V chromatic value. be respectively the V chrominance information of the first reference picture, pixel value that the monochrome information of the second reference picture arranges in the i-th row jth; be respectively the pixel value that V chrominance information corrects the rear V chrominance information of the first reference picture in the same way, the V chrominance information of the second reference picture arranges in the i-th row jth.

Embodiment 2, corresponding to above-mentioned method for video coding, the present invention also provides a kind of video encoding/decoding method, and see Fig. 3, the method is:

Step 201: the correction parameter collection obtaining current decoded frame and the first reference picture or the second reference picture;

Step 202: judge whether that described current sign variable is 0, if not, then performs step 204; If then perform step 203;

Step 203: carry out regular decode, then performs step 206;

Step 204: the correction in the same way being carried out monochrome information by the reference frame of the correction parameter set pair current decoded frame of the first described reference picture or the second reference picture;

Step 205: utilize the reference frame of corrected in the same way current decoded frame to carry out regular decode to current decoded frame;

Step 206: whether the current decoded frame described in judgement is last frame to be decoded of current video sequence, is then set to current decoded frame if not and performs step 201 by frame to be decoded for the next one; If then perform step 207;

Step 207: process ends.

Pass through the correction parameter collection of the first described reference picture or the second reference picture in step 204, the method corrected in the same way of the reference frame of current decoded frame being carried out to monochrome information can be:

${\mathrm{ref}}_{t,m}^y(i.j)=k_T^y*({\mathrm{ref}}_t^y(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}}^y)+\min \_{\mathrm{frame}}_t^y$

Wherein, the span of i, j is: 1≤i≤height _yaMP.AMp.Amp & 1≤j≤width _y; for the pixel value that the monochrome information of the reference frame of current decoded frame arranges in the i-th row jth; the pixel value that the monochrome information correcting the reference frame of rear current decoded frame in the same way for monochrome information arranges in the i-th row jth; be respectively the monochrome information adjustment factor of the corresponding reference frame of the current decoded frame that passes over from coding side, the minimum luminance value of the corresponding reference frame of current decoded frame, the minimum luminance value of original coding frame that current decoded frame is corresponding.

When having carried out U, V chrominance information timing in the same way in coding method, coding/decoding method adaptive increase should carry out to the reference frame of current decoded frame the process that U, V chrominance information corrects in the same way:

(1) reference frame to current decoded frame described in carries out the method that U chrominance information corrects in the same way and is specially:

${\mathrm{ref}}_{t,m}^u(i.j)=k_T^u*({\mathrm{ref}}_t^u(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}}^u)+\min \_{\mathrm{frame}}_t^u$

Wherein, the span of i, j is: 1≤i≤height _uaMP.AMp.Amp & 1≤j≤width _u; for the pixel value that the U chrominance information of the reference frame of current decoded frame arranges in the i-th row jth; the pixel value that the U chrominance information correcting the reference frame of rear current decoded frame in the same way for U chrominance information arranges in the i-th row jth; be respectively the U chrominance information degree adjustment factor of the corresponding reference frame of the current decoded frame that passes over from coding side, the minimum U chromatic value of the corresponding reference frame of current decoded frame, the minimum U chromatic value of original coding frame that current decoded frame is corresponding.

(2) described in " V chrominance information carried out to the reference frame of current decoded frame correct in the same way " method be specially:

${\mathrm{ref}}_{t,m}^v(i.j)=k_T^v*({\mathrm{ref}}_t^v(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}}^v)+\min \_{\mathrm{frame}}_t^v$

Wherein, the span of i, j is: 1≤i≤height _vaMP.AMp.Amp & 1≤j≤width _v; for the pixel value that the V chrominance information of the reference frame of current decoded frame arranges in the i-th row jth; the pixel value that the V chrominance information correcting the reference frame of rear current decoded frame in the same way for V chrominance information arranges in the i-th row jth; be respectively the V chrominance information degree adjustment factor of the corresponding reference frame of the current decoded frame that passes over from coding side, the minimum V chromatic value of the corresponding reference frame of current decoded frame, the minimum V chromatic value of original coding frame that current decoded frame is corresponding.

Embodiment 3, see Fig. 4; Corresponding to embodiment 1, the present invention also provides a kind of video decoder, and this device comprises: the first acquiring unit, the first processing unit, the second processing unit;

First acquiring unit, for obtaining frame _t(current encoded frame), and note is set _t=0, note _tfor current sign variable;

First processing unit, comprises the first judging unit and the 3rd processing unit and the 11 processing unit;

Described first judging unit, for judging whether current encoded frame is I frame or scene switch frame;

Described 3rd processing unit, for when the first judging unit judged result is no, then utilizes the first coding method to frame _tencode;

11 processing unit, for when the judged result of the first judging unit is for being, utilizes the second coding method to frame _tencode;

Second processing unit, finding next image to be encoded for pressing coded sequence, if next image to be encoded exists, then image to be encoded for the next one being set to frame _t, notice execution first acquiring unit, if next image to be encoded does not exist, then process ends process.

(1) see Fig. 5, the 3rd described processing unit comprises the first setting unit, fourth processing unit, correcting unit, replacement unit, the 5th processing unit;

Described first setting unit, arrange m=0, m represents relative to frame _tthrough the reference frame number of light gradient judgement;

Described fourth processing unit, comprises the second judging unit and the second setting unit;

Described second judging unit, for judging frame _trelative to picture _ref1(the first reference picture), picture _ref2whether (the second reference picture) there is monochrome information gradual change;

Described second setting unit, for making note when the second judging unit judged result for the gradual change of generation monochrome information is then arranged _t=1; Arranging m is the first numerical value;

Correcting unit, for the picture to non-NULL _ref1, non-NULL picture _ref2carry out the correction in the same way of monochrome information, obtain the correction parameter collection of a reference picture, the second reference picture;

Replacement unit, for utilizing the picture of corrected in the same way non-NULL _ref1and the picture of non-NULL _ref2replace reference frame corresponding in reference listing;

5th processing unit, comprises the 3rd judging unit, the 6th processing unit,

Described 3rd judging unit, for judging that whether all reference frames of current encoded frame are all through the judgement of light gradient, perform the second judging unit if not, if perform the 6th processing unit;

Described 6th processing unit, to frame _tin each macro block carry out conventional coded treatment; Judge whether " note _t=1 and optimum prediction mode is inter-frame forecast mode ", then perform the second processing unit if not; If so, the first reference picture that in the optimum prediction mode confirmed in " conventional coded treatment " described in then transmitting to video decoder, optimum reference frame is corresponding or the correction parameter collection of the second reference picture, perform the second processing unit;

If so, then to frame _tin each macro block carry out conventional coded treatment; Judge whether " note _t=1 and optimum prediction mode is inter-frame forecast mode ", then notify if not the second processing unit " by coded sequence find next image to be encoded "; If so, the correction parameter collection of the first reference picture that in the optimum prediction mode confirmed in described " conventional coded treatment ", optimum reference frame is corresponding or the second reference picture is then transmitted.

(2) described second judging unit comprises second acquisition unit, the 4th judging unit, the 7th processing unit, the first determining unit:

Second acquisition unit, for obtaining picture _ref1with picture _ref2;

4th judging unit, for judging described picture _ref1and picture _ref2whether meet reference picture standard;

7th processing unit comprises the 8th processing unit, the 9th processing unit;

8th processing unit is no for the judged result when the 4th judging unit, then notice performs second acquisition unit;

9th processing unit, is yes for the judged result when the 4th judging unit, then obtains frame _tthe probability distribution of monochrome information; Obtain picture _ref1the probability distribution of monochrome information, and picture _ref2the probability distribution of monochrome information;

First determining unit, whether the probability distribution determination current encoded frame for the monochrome information according to the current encoded frame obtained, the first reference picture, the second reference picture there is monochrome information gradual change.

(3) described second acquisition unit comprises: first chooses unit, second chooses unit, the 3rd and choose unit, the second determining unit;

First chooses unit, is less than the image of current encoded frame broadcasting sequence number as the first reference picture for choosing satisfied sequence number of playing;

Second chooses unit, is greater than the image of current encoded frame broadcasting sequence number as the second reference picture for choosing satisfied sequence number of playing.

3rd chooses unit, for same current encoded frame frame _t, the first corresponding reference picture and the second reference picture can not be used to " judge frame simultaneously _trelative to picture _ref1, picture _ref2whether there is monochrome information gradual change " judgement.

(4) described fourth processing unit comprises the 5th judging unit, the 6th judging unit, the 7th judging unit;

5th judging unit, for judging picture _ref1and picture _ref2whether meet the condition of the 6th judging unit and the 7th judging unit simultaneously:

6th judging unit, for determining picture _ref1with picture _ref2there is identical encoding state, i.e. the first reference picture and the second reference picture or all encoded, or all do not encode;

7th judging unit, for determining picture _ref1coding sequence number and picture _ref2coding sequence number can not be greater than frame simultaneously _tcoding sequence number.

(5) the 9th processing unit described in comprises the 3rd acquiring unit, the 4th acquiring unit, the 5th acquiring unit;

3rd acquiring unit, for " obtaining frame _tthe probability distribution of monochrome information " be:

$p_t({\mathrm{frame}}_t^y,k)=\mathrm{count}({\mathrm{frame}}_t^y,k)/({\mathrm{width}}_y*{\mathrm{height}}_y),k=\mathrm{0,1,2},...,2^n-1$

Wherein,

$\mathrm{sign}({\mathrm{frame}}_t^y(i,j),k)=\left\{\begin{array}{cc}1,& {\mathrm{frame}}_t^y(i,j)=k\\ 0,& \mathrm{else}\end{array}\right.$

Y represents monochrome information; represent current encoded frame frame _tmonochrome information; represent the pixel value of the image luminance information being positioned at current encoded frame i-th row jth row; represent corresponding value when equaling k and be not equal to k; Sum (variable | condition) represent all variable summations satisfied condition; represent frame _tthe pixel value of middle monochrome information equals the pixel number of k; for probability distribution; The monochrome information of the brightness value composing images of all pixels of image, line number, the columns of note image luminance information are respectively: height _y, width _y;

4th acquiring unit, for " obtaining the probability distribution of the first reference picture monochrome information ":

$p_{\mathrm{ref}1}({\mathrm{frame}}_{\mathrm{ref}1}^y,k)=\mathrm{count}({\mathrm{frame}}_{\mathrm{ref}1}^y,k)/({\mathrm{width}}_y*{\mathrm{height}}_y),k=\mathrm{0,1,2},...,2^n-1$

Wherein,

$\mathrm{sign}({\mathrm{picture}}_{\mathrm{ref}1}^y(i,j),k)=\left\{\begin{array}{cc}1,& {\mathrm{picture}}_{\mathrm{ref}1}^y(i,j)=k\\ 0,& \mathrm{else}\end{array}\right.$

Y represents monochrome information; represent the first reference picture picture _ref1monochrome information; represent the pixel value of the image luminance information being positioned at the first reference picture i-th row jth row; represent corresponding value when equaling k and be not equal to k; Sum (variable | condition) represent all variable summations satisfied condition; represent picture _ref1the pixel value of middle monochrome information equals the pixel number of k; for probability distribution; The monochrome information of the brightness value composing images of all pixels of image, line number, the columns of note image luminance information are respectively: height _y, width _y.N bitmap in the present invention refers to that each pixel of image n bit unsigned integer represents;

5th acquiring unit, for " obtaining the probability distribution of the second reference picture monochrome information ":

$p_t({\mathrm{picture}}_{\mathrm{ref}2}^y,k)=\mathrm{count}({\mathrm{picture}}_{\mathrm{ref}2}^y,k)/({\mathrm{width}}_y*{\mathrm{height}}_y),k=\mathrm{0,1,2},...,2^n-1$

Wherein,

$\mathrm{sign}({\mathrm{picture}}_{\mathrm{ref}2}^y(i,j),k)=\left\{\begin{array}{cc}1,& {\mathrm{picture}}_{\mathrm{ref}2}^y(i,j)=k\\ 0,& \mathrm{else}\end{array}\right.$

Wherein, y represents monochrome information; represent the second reference picture picture _ref2monochrome information; represent the pixel value of the image luminance information being positioned at the second reference picture i-th row jth row; represent corresponding value when equaling k and be not equal to k; Sum (variable | condition) represent all variable summations satisfied condition; represent picture _ref2the pixel value of middle monochrome information equals the pixel number of k; for probability distribution; The monochrome information of the brightness value composing images of all pixels of image, line number, the columns of note image luminance information are respectively: height _y, width _y.

(7) the first determining unit described in comprises the 8th judging unit, the second determining unit:

8th judging unit, for judging whether

$\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)\right)<\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^y,k)\right)<\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}(p_{\mathrm{ref}2}^y,k)\right)$

Or

$\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^y,k)\right)<\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^y,k)\right)<\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}(p_{\mathrm{ref}1}^y,k)\right)$

Second determining unit is yes for working as the 8th judging unit judged result, then frame _trelative to picture _ref1, picture _ref2there is monochrome information gradual change; Ruo Dang eight judging unit judged result is no, then frame _trelative to picture _ref1, picture _ref2there is not monochrome information gradual change;

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; Y represents monochrome information; represent the second reference picture picture _ref2monochrome information; for probability distribution; represent the first reference picture picture _ref1monochrome information; for probability distribution.

(8) correcting unit described in comprises monochrome information correcting unit, and wherein monochrome information correcting unit comprises: the first computing unit, the second computing unit, the 3rd computing unit;

First computing unit, for calculating current encoded frame frame _tmonochrome information be worth most;

$\max \_{\mathrm{frame}}_t^y=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^y,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given represent frame _tmaximum brightness value; represent frame _tminimum luminance value;

Second computing unit, for calculating the first reference picture picture of non-NULL _ref1and the second reference picture picture of non-NULL _ref2monochrome information be worth most;

$\max \_{\mathrm{picture}}_{\mathrm{ref}1}^y=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)\right)\right)$

$\max \_{\mathrm{picture}}_{\mathrm{ref}2}^y=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^y,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given represent picture _ref1maximum brightness value; represent picture _ref1minimum luminance value; represent picture _ref2maximum brightness value; represent picture _ref2minimum luminance value;

3rd computing unit, for calculating the first reference picture picture of non-NULL _ref1and the second reference picture picture of non-NULL _ref2monochrome information be worth most, obtain the correction parameter collection of a reference diagram or the second reference picture;

${\mathrm{picture}}_{\mathrm{ref}1,m}^y(i,j)=k_{T1}^y*({\mathrm{picture}}_{\mathrm{ref}1}^y(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^y)+\min \_{\mathrm{frame}}_t^y$

${\mathrm{picture}}_{\mathrm{ref}2,m}^y(i,j)=k_{T2}^y*({\mathrm{picture}}_{\mathrm{ref}2}^y(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^y)+\min \_{\mathrm{frame}}_t^y$

Wherein, $k_{T1}^y=\frac{\max \_{\mathrm{frame}}_t^y-\min \_{\mathrm{frame}}_t^y}{\max \_{\mathrm{picture}}_{\mathrm{ref}1}^y-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^y};k_{T2}^y=\frac{\max \_{\mathrm{frame}}_t^y-\min \_{\mathrm{frame}}_t^y}{\max \_{\mathrm{picture}}_{\mathrm{ref}2}^y-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^y};$ The span of i, j is: 1≤i≤height _yaMP.AMp.Amp & 1≤j≤width _y; it is the first reference picture monochrome information adjustment factor; it is the second reference picture monochrome information adjustment factor; T1, T2 represent the coding sequence number of the corresponding reference frame of the first reference picture, the coding sequence number of the corresponding reference frame of the second reference picture respectively; Correction parameter collection is: max (variable | condition) represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; be respectively the monochrome information of the first reference picture, pixel value that the monochrome information of the second reference picture arranges in the i-th row jth; be respectively the pixel value that monochrome information corrects the rear monochrome information of the first reference picture in the same way, the monochrome information of the second reference picture arranges in the i-th row jth.

(9), described correcting unit comprises U chrominance information correcting unit and V chrominance information correcting unit further;

U chrominance information correcting unit, for the picture to non-NULL _ref1, non-NULL picture _ref2carry out U chrominance information to correct in the same way

V chrominance information correcting unit, for the picture to non-NULL _ref1, non-NULL picture _ref2carry out V chrominance information to correct in the same way.

Described U chrominance information correcting unit comprises the 4th computing unit, the 5th computing unit, the 6th computing unit;

4th computing unit, for calculating frame _tu chrominance information be worth most:

$\max \_{\mathrm{frame}}_t^u=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^u,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given represent frame _tmaximum U chromatic value; represent frame _tminimum U chromatic value;

5th computing unit, for calculating the picture of non-NULL _ref1and the picture of non-NULL _ref2u chrominance information be worth most:

$\max \_{\mathrm{picture}}_{\mathrm{ref}1}^u=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^u,k)\right)\right)$

$\max \_{\mathrm{picture}}_{\mathrm{ref}2}^u=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^u,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach the k value of maximum, namely $p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^u,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^u,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^u,k)\right);$ represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach maximum k value, namely $p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^u,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^u,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^u,k)\right);$ represent picture _ref1maximum U chromatic value; represent picture _ref1minimum U chromatic value;

represent picture _ref2maximum U chromatic value; represent picture _ref2minimum U chromatic value;

6th computing unit, for the picture to non-NULL _ref1and the picture of non-NULL _ref2the U chrominance information of each pixel is carried out U chrominance information and is corrected in the same way:

${\mathrm{picture}}_{\mathrm{ref}1,m}^u(i,j)=k_1^u*({\mathrm{picture}}_{\mathrm{ref}1}^u(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^u)+\min \_{\mathrm{frame}}_t^u$

${\mathrm{picture}}_{\mathrm{ref}2,m}^u(i,j)=k_2^u*({\mathrm{picture}}_{\mathrm{ref}2}^u(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^u)+\min \_{\mathrm{frame}}_t^u;$

Wherein, $k_{T1}^u=\frac{\max \_{\mathrm{frame}}_t^u-\min \_{\mathrm{frame}}_t^u}{\max \_{\mathrm{picture}}_{\mathrm{ref}1}^u-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^u};$

$k_{T2}^u=\frac{\max \_{\mathrm{frame}}_t^u-\min \_{\mathrm{frame}}_t^u}{\max \_{\mathrm{picture}}_{\mathrm{ref}2}^u-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^u};$

The span of i, j is: 1≤i≤height _uaMP.AMp.Amp & 1≤j≤width _u; it is the first reference picture U chrominance information adjustment factor; it is the second reference picture U chrominance information adjustment factor; T1, T2 represent the coding sequence number of the corresponding reference frame of the first reference picture, the coding sequence number of the corresponding reference frame of the second reference picture respectively; Described correction parameter collection comprises further: the correction parameter collection of U chrominance information be respectively the U chrominance information of the first reference picture, pixel value that the U chrominance information of the second reference picture arranges in the i-th row jth; be respectively the pixel value that U chrominance information corrects the rear U chrominance information of the first reference picture in the same way, the U chrominance information of the second reference picture arranges in the i-th row jth).

(10) V chrominance information correcting unit comprises the 7th computing unit, the 8th computing unit, the 9th computing unit;

7th computing unit, for calculating frame _tv chrominance information:

$\max \_{\mathrm{frame}}_t^v=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^v,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent and first meet all ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach maximum k value, namely

$p_t({\mathrm{frame}}_t^v,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^v,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^v,k)\right);$ represent frame _tmaximum V chromatic value; represent frame _tminimum V chromatic value;

8th computing unit, for calculating the picture of non-NULL _ref1and the picture of non-NULL _ref2v chrominance information be worth most:

$\max \_{\mathrm{picture}}_{\mathrm{ref}1}^v=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^v,k)\right)\right)$

$\max \_{\mathrm{picture}}_{\mathrm{ref}2}^v=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^v,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach the k value of maximum, namely $p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^v,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^v,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^v,k)\right);$ represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach maximum k value, namely $p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^v,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^v,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}2}^v,k)\right);$ represent picture _ref1maximum V chromatic value; represent picture _ref1minimum V chromatic value; represent picture _ref2maximum V chromatic value; Represent picture _ref2minimum V chromatic value;

9th computing unit, for the picture to non-NULL _ref1and the picture of non-NULL _ref2the V chrominance information of each pixel is carried out V chrominance information and is corrected in the same way:

${\mathrm{picture}}_{\mathrm{ref}1,m}^v(i,j)=k_1^v*({\mathrm{picture}}_{\mathrm{ref}1}^v(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^v)+\min \_{\mathrm{frame}}_t^v$

${\mathrm{picture}}_{\mathrm{ref}2,m}^v(i,j)=k_2^v*({\mathrm{picture}}_{\mathrm{ref}2}^v(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^v)+\min \_{\mathrm{frame}}_t^v$

Wherein, $k_{T1}^v=\frac{\max \_{\mathrm{frame}}_t^v-\min \_{\mathrm{frame}}_t^v}{\max \_{\mathrm{picture}}_{\mathrm{ref}1}^v-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^v};$

$k_{T2}^v=\frac{\max \_{\mathrm{frame}}_t^v-\min \_{\mathrm{frame}}_t^v}{\max \_{\mathrm{picture}}_{\mathrm{ref}2}^v-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^v};$

The span of i, j is: 1≤i≤height _vaMP.AMp.Amp & 1≤j≤width _v; it is the first reference picture V chrominance information degree adjustment factor; it is the second reference picture V chrominance information degree adjustment factor; T1, T2 represent the coding sequence number of the corresponding reference frame of the first reference picture, the coding sequence number of the corresponding reference frame of the second reference picture respectively; Described correction parameter collection comprises further: the correction parameter collection of V chrominance information be respectively the V chrominance information of the first reference picture, pixel value that the monochrome information of the second reference picture arranges in the i-th row jth; be respectively the pixel value that V chrominance information corrects the rear V chrominance information of the first reference picture in the same way, the V chrominance information of the second reference picture arranges in the i-th row jth.

(11) the first setting unit described in comprises: the 9th judging unit, the tenth processing unit;

9th judging unit, for judging whether picture _ref1coding sequence number and picture _ref2coding sequence number be all less than the coding sequence number of current encoded frame and picture _ref1, picture _ref2all encoded;

First tenth processing unit, for being yes when the 9th judging unit judged result, then make m=m+2, then notifies that monochrome information correcting unit continues " to the picture of non-NULL _ref1, non-NULL picture _ref2carry out the correction in the same way of monochrome information ";

When the 9th judging unit judged result is no, then judge whether picture _ref1coding sequence number and picture _ref2coding sequence number be all less than the coding sequence number of current encoded frame and picture _ref1, picture _ref2all uncoded, if so, then first m=m+2 is set, then by picture _ref1, picture _ref2replace with the coding reconstructed image of its correspondence respectively, then continue " to the picture of non-NULL _ref1, non-NULL picture _ref2carry out the correction in the same way of monochrome information "; If not, then m=m+1 is set, then coding sequence number is less than the first or second reference picture of current encoded frame coding sequence number, replace with the coding reconstructed image of its correspondence, another first or second reference image setting is empty, then notifies that monochrome information correcting unit continues " to the picture of non-NULL _ref1, non-NULL picture _ref2carry out the correction in the same way of monochrome information ".

(12), described fourth processing unit comprises the 3rd setting unit further;

3rd setting unit comprises the 4th setting unit and the first notification unit;

4th setting unit, for when the second judging unit judged result is not for monochrome information gradual change occurs, then arranging m is second value;

m＝m+sign(picture _ref1)+sign(picture _ref2)，

Wherein,

Wherein, m represents relative to frame _tthrough the reference frame number of light gradient judgement; Sign (picture _ref1) represent picture _ref1be reference frame or be not reference frame time corresponding value; Sign (picture _ref2, k) represent picture _ref2be reference frame or be not reference frame time corresponding value;

First notification unit, for arranging after m is second value, notifies that the second judging unit continues " judging that whether all reference frames of current encoded frame are all through the judgement of light gradient ".

(13), the 3rd described judging unit, " judging that whether all reference frames of current encoded frame are all through the judgement of light gradient " is specially;

M>number _list0+ number _list1and frame _tfor B frame) or (m>number _list0and frame _tfor P frame);

Wherein, m represents relative to frame _tthrough the reference frame number of light gradient judgement; Number _list0represent reference frame sum in forward direction reference listing; Number _list1represent reference frame sum in backward reference listing.

Corresponding to embodiment 4, see Fig. 6, the present invention also provides a kind of video decoder, and described device comprises: decoding acquiring unit, the first codec processing unit, the second codec processing unit, the 3rd codec processing unit;

Decoding acquiring unit, for obtaining the correction parameter collection of current decoded frame and the first reference picture or the second reference picture;

First codec processing unit, comprises the first decoding judgement unit, decoded luminance information correction unit, regular decode unit;

The first described decoding judgement unit, for judging whether that current sign variable is 0;

Described decoded luminance information correction unit, for when the judged result of the first decoding judgement unit is no, the correction in the same way of monochrome information is carried out, notice execution second codec processing unit by the reference frame of the correction parameter set pair current decoded frame of the first described reference picture or the second reference picture;

Regular decode unit, for when the judged result of the first decoding judgement unit is for being, carries out regular decode process to described current decoded frame; Notice execution the 3rd codec processing unit;

Second codec processing unit, for utilizing the reference frame of corrected in the same way current decoded frame to carry out regular decode to current decoded frame, notice execution the 3rd codec processing unit;

3rd codec processing unit, finding next image to be decoded for pressing decoding order, if next image to be decoded exists, then image to be decoded for the next one being set to current decoded frame, notice decoding acquiring unit;

Wherein, described decoded luminance information correction unit " carries out the correction in the same way of monochrome information " method by the reference frame of the correction parameter set pair current decoded frame of the first described reference picture or the second reference picture is:

${\mathrm{ref}}_{t,m}^y(i.j)=k_T^y*({\mathrm{ref}}_t^y(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}}^y)+\min \_{\mathrm{frame}}_t^y$

Wherein, the span of i, j is: 1≤i≤height _yaMP.AMp.Amp & 1≤j≤width _y; for the pixel value that the monochrome information of the reference frame of current decoded frame arranges in the i-th row jth; the pixel value that the monochrome information correcting the reference frame of rear current decoded frame in the same way for monochrome information arranges in the i-th row jth; be respectively the monochrome information adjustment factor of the corresponding reference frame of the current decoded frame that passes over from coding side, the monochrome information of the original coding frame that monochrome information is worth most, current decoded frame is corresponding of the corresponding reference frame of current decoded frame is worth most.

When video decoder includes U chrominance information correcting unit and V chrominance information correcting unit, the first codec processing unit of this video decoder comprises decoding U chrominance information correcting unit, V chrominance information correcting unit further;

U chrominance information correcting unit, after the monochrome information for having carried out the reference frame of current decoded frame when decoded luminance information correction unit corrects, continues to carry out U chrominance information to the reference frame of current decoded frame and corrects in the same way:

${\mathrm{ref}}_{t,m}^u(i.j)=k_T^u*({\mathrm{ref}}_t^u(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}}^u)+\min \_{\mathrm{frame}}_t^u$

Wherein, the span of i, j is: 1≤i≤height _uaMP.AMp.Amp & 1≤j≤width _u; for the pixel value that the U chrominance information of the reference frame of current decoded frame arranges in the i-th row jth; the pixel value that the U chrominance information correcting the reference frame of rear current decoded frame in the same way for U chrominance information arranges in the i-th row jth; be respectively the U chrominance information degree adjustment factor of the corresponding reference frame of the current decoded frame that passes over from coding side, the U chrominance information of the original coding frame that U chrominance information is worth most, current decoded frame is corresponding of the corresponding reference frame of current decoded frame is worth most;

Decoding V chrominance information correcting unit, after the monochrome information for having carried out the reference frame of current decoded frame when decoded luminance information correction unit corrects, continues to carry out U chrominance information to the reference frame of current decoded frame and corrects in the same way:

${\mathrm{ref}}_{t,m}^v(i.j)=k_T^v*({\mathrm{ref}}_t^v(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}}^v)+\min \_{\mathrm{frame}}_t^v$

Wherein, the span of i, j is: 1≤i≤height _vaMP.AMp.Amp & 1≤j≤width _v; for the pixel value that the V chrominance information of the reference frame of current decoded frame arranges in the i-th row jth; the pixel value that the V chrominance information correcting the reference frame of rear current decoded frame in the same way for V chrominance information arranges in the i-th row jth; be respectively the V chrominance information degree adjustment factor of the corresponding reference frame of the current decoded frame that passes over from coding side, the V chrominance information of the original coding frame that V chrominance information is worth most, current decoded frame is corresponding of the corresponding reference frame of current decoded frame is worth most.

In sum, the present invention is directed to the film source that illumination variation occurs, propose a kind of novel decoding method.The method method carries out correction process in the same way by the monochrome information to reference frame, chrominance information, thus the correlation strengthened between reference frame and coded frame, finally reach, reduce the number of intra prediction mode of MB of prediction frame, reduce code check consumption, promote the performance of encoder on inter-frame information redundancy is eliminated.

Those having ordinary skill in the art will appreciate that, the all or part of step realized in above-described embodiment method can have been come by program command related hardware, described program can be stored in a computer read/write memory medium, and described storage medium can be ROM, RAM, disk, CD etc.

The foregoing is only preferred embodiment of the present invention, not in order to limit the present invention, all any amendments done within the spirit and principles in the present invention, equivalent replacement and improvement etc., all should be included within protection scope of the present invention.

Claims (30)

1. a method for video coding, is characterized in that, the method comprises:

Obtain current encoded frame frame _t, and note is set _t=0, note _tfor current sign variable;

Judge whether current encoded frame is I frame or scene switch frame; If so, then utilize conventional I frame coding techniques to frame _tencode; If not, then utilize the first coding method to frame _tencode;

Find next image to be encoded by coded sequence, if next image to be encoded exists, then image to be encoded for the next one is set to frame _t, continue to perform acquisition frame _t;

Described " utilizes the first coding method to frame _tencode " be specially:

Arrange m=0, m represents relative to frame _tthrough the reference frame number of light gradient judgement;

Judge frame _trelative to the first reference picture picture _ref1, the second reference picture picture _ref2whether there is monochrome information gradual change, if there is monochrome information gradual change, arrange and make note _t=1; Arranging m is the first numerical value;

To the picture of non-NULL _ref1, non-NULL picture _ref2carry out the correction in the same way of monochrome information, obtain the correction parameter collection of the first reference picture, the second reference picture;

Utilize the picture of corrected in the same way non-NULL _ref1and the picture of non-NULL _ref2replace reference frame corresponding in reference listing;

Judge that whether all reference frames of current encoded frame are all through the judgement of light gradient; If not, then continue execution and " judge frame _trelative to the first reference picture picture _ref1, the second reference picture picture _ref2whether there is monochrome information gradual change ";

If so, then to frame _tin each macro block carry out conventional coded treatment; Judge whether " note _t=1 and optimum prediction mode is inter-frame forecast mode ", if not then perform " by coded sequence find next image to be encoded "; If so, the first reference picture that in the optimum prediction mode confirmed in " conventional coded treatment " described in then transmitting to decoding end, optimum reference frame is corresponding or the correction parameter collection of the second reference picture;

Described " to the picture of non-NULL _ref1, non-NULL picture _ref2carry out the correction in the same way of monochrome information, obtain the correction parameter collection of the first reference picture, the second reference picture " be specially:

(1) current encoded frame frame is calculated _tmonochrome information be worth most;

$\max \_{\mathrm{frame}}_t^y=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^y,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent frame _tmaximum brightness value; represent frame _tminimum luminance value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given n is the number of bits that each pixel of image signless integer used represents, for probability distribution;

(2) the first reference picture picture of non-NULL is calculated _ref1and the second reference picture picture of non-NULL _ref2monochrome information be worth most;

$\max \_{\mathrm{picture}}_{\mathrm{ref}1}^y=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)\right)\right)$

$\max \_{\mathrm{picture}}_{\mathrm{ref}2}^y=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^y,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent picture _ref1maximum brightness value; represent picture _ref1minimum luminance value; represent picture _ref2maximum brightness value; represent picture _ref2minimum luminance value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given for probability distribution;

(3) the first reference picture picture of non-NULL is calculated _ref1and the second reference picture picture of non-NULL _ref2monochrome information be worth most, obtain the correction parameter collection of a reference diagram or the second reference picture;

$\begin{array}{c}{\mathrm{picture}}_{\mathrm{ref}1,m}^y(i,j)=k_{T1}^y*({\mathrm{picture}}_{\mathrm{ref}1}^y(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^y)+\min \_{\mathrm{frame}}_t^y\\ {\mathrm{picture}}_{\mathrm{ref}2,m}^y(i,j)=k_{T2}^y*({\mathrm{picture}}_{\mathrm{ref}2}^y(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^y)+\min \_{\mathrm{frame}}_t^y\end{array}$ Wherein, $k_{T1}^y=\frac{\max \_{\mathrm{frame}}_t^y-\min \_{\mathrm{frame}}_t^y}{\max \_{\mathrm{picture}}_{\mathrm{ref}1}^y-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^y};k_{T2}^y=\frac{\max \_{\mathrm{frame}}_t^y-\min \_{\mathrm{frame}}_t^y}{\max \_{\mathrm{picture}}_{\mathrm{ref}2}^y-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^y};$ The span of i, j is: 1≤i≤height _yaMP.AMp.Amp & 1≤j≤width _y, line number, the columns of image luminance information are respectively: height _y, width _y; it is the first reference picture monochrome information adjustment factor; it is the second reference picture monochrome information adjustment factor; T1, T2 represent the coding sequence number of the corresponding reference frame of the first reference picture, the coding sequence number of the corresponding reference frame of the second reference picture respectively; Correction parameter collection is: max (variable | condition) represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; be respectively the monochrome information of the first reference picture, pixel value that the monochrome information of the second reference picture arranges in the i-th row jth; be respectively the pixel value that monochrome information corrects the rear monochrome information of the first reference picture in the same way, the monochrome information of the second reference picture arranges in the i-th row jth.

2. method for video coding according to claim 1, is characterized in that, described " judges frame _trelative to picture _ref1, picture _ref2whether there is monochrome information gradual change " method be:

Obtain picture _ref1with picture _ref2;

Picture described in judgement _ref1and picture _ref2whether meet reference picture standard; If not, then " obtaining the first reference picture and the second reference picture " is continued; If so, then frame is obtained _tthe probability distribution of monochrome information; Obtain picture _ref1the probability distribution of monochrome information, and picture _ref2the probability distribution of monochrome information;

Whether the probability distribution determination current encoded frame according to the monochrome information of the current encoded frame obtained, the first reference picture, the second reference picture there is monochrome information gradual change.

3. method for video coding according to claim 2, is characterized in that, described " obtains picture _ref1with picture _ref2" method be:

(1) choose satisfied sequence number of playing and be less than the image of current encoded frame broadcasting sequence number as the first reference picture;

(2) choose satisfied sequence number of playing and be greater than the image of current encoded frame broadcasting sequence number as the second reference picture;

(3) same current encoded frame frame _t, the first corresponding reference picture and the second reference picture can not be used to " judge frame simultaneously _trelative to picture _ref1, picture _ref2whether there is monochrome information gradual change " judgement.

4. method for video coding according to claim 3, is characterized in that, the described " picture described in judgement _ref1and picture _ref2whether meet reference picture standard " method be:

Judge picture _ref1and picture _ref2whether meet following condition simultaneously:

(1) picture _ref1with picture _ref2there is identical encoding state, i.e. the first reference picture and the second reference picture or all encoded, or all do not encode;

(2) picture _ref1coding sequence number and picture _ref2coding sequence number can not be greater than frame simultaneously _tcoding sequence number.

5. method for video coding according to claim 4, is characterized in that, described " obtains frame _tthe probability distribution of monochrome information " method is specially:

$p_t({\mathrm{frame}}_t^y,k)=\mathrm{count}({\mathrm{frame}}_t^y,k)/({\mathrm{width}}_y*{\mathrm{height}}_y),k=\mathrm{0,1,2},...,2^n-1$

Wherein,

$\mathrm{sign}({\mathrm{frame}}_t^y(i,j),k)=\left\{\begin{array}{cc}1,& {\mathrm{frame}}_t^y(i,j)=k\\ 0,& \mathrm{else}\end{array}\right.$

Y represents monochrome information; N is the number of bits that each pixel of image signless integer used represents; represent current encoded frame frame _tmonochrome information; represent the pixel value of the image luminance information being positioned at current encoded frame i-th row jth row; represent corresponding value when equaling k and be not equal to k; Sum (variable | condition) represent all variable summations satisfied condition; represent frame _tthe pixel value of middle monochrome information equals the pixel number of k; for probability distribution; The monochrome information of the brightness value composing images of all pixels of image, line number, the columns of note image luminance information are respectively: height _y, width _y.

6. method for video coding according to claim 5, is characterized in that, described " obtains picture _ref1the probability distribution of monochrome information, and picture _ref2the probability distribution of monochrome information " be specially:

Described " obtaining the probability distribution of the first reference picture monochrome information " method is:

$p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)=\mathrm{count}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)/({\mathrm{width}}_y*{\mathrm{height}}_y),k=\mathrm{0,1,2},...{,2}^n-1$

Wherein,

$\mathrm{sign}({\mathrm{picture}}_{\mathrm{ref}1}^y(i,j),k)=\left\{\begin{array}{cc}1,& {\mathrm{picture}}_{\mathrm{ref}1}^y(i,j)=k\\ 0,& \mathrm{else}\end{array}\right.$

Y represents monochrome information; represent the first reference picture picture _ref1monochrome information; represent the pixel value of the image luminance information being positioned at the first reference picture i-th row jth row; represent corresponding value when equaling k and be not equal to k; Sum (variable | condition) represent all variable summations satisfied condition; represent picture _ref1the pixel value of middle monochrome information equals the pixel number of k; for probability distribution; The monochrome information of the brightness value composing images of all pixels of image, line number, the columns of note image luminance information are respectively: height _y, width _y;

Described " obtaining the probability distribution of the second reference picture monochrome information " method is:

$p_t({\mathrm{picture}}_{\mathrm{ref}2}^y,k)=\mathrm{count}({\mathrm{picture}}_{\mathrm{ref}2}^y,k)/({\mathrm{width}}_y*{\mathrm{height}}_y),k=\mathrm{0,1,2},...{,2}^n-1$

Wherein,

$\mathrm{sign}({\mathrm{picture}}_{\mathrm{ref}2}^y(i,j),k)=\left\{\begin{array}{cc}1,& {\mathrm{picture}}_{\mathrm{ref}2}^y(i,j)=k\\ 0,& \mathrm{else}\end{array}\right.$

Wherein, y represents monochrome information; represent the second reference picture Picture _ref2monochrome information; represent the pixel value of the image luminance information being positioned at the second reference picture i-th row jth row; represent corresponding value when equaling k and be not equal to k; Sum (variable | condition) represent all variable summations satisfied condition; represent picture _ref2the pixel value of middle monochrome information equals the pixel number of k; for probability distribution; The monochrome information of the brightness value composing images of all pixels of image, line number, the columns of note image luminance information are respectively: height _y, width _y.

7. method for video coding according to claim 6, it is characterized in that, described " whether the probability distribution determination current encoded frame according to the monochrome information of the current encoded frame obtained, the first reference picture, the second reference picture monochrome information gradual change occurs " is specially:

Judge whether

$\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)\right)<\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^y,k)\right)<\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^y,k)\right)$

Or

$\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^y,k)\right)<\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^y,k)\right)<\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)\right)$

If so, then frame _trelative to picture _ref1, picture _ref2there is monochrome information gradual change;

If not, then frame _trelative to picture _ref1, picture _ref2there is not monochrome information gradual change;

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; Y represents monochrome information; represent the second reference picture picture _ref2monochrome information; for probability distribution; represent the first reference picture picture _ref1monochrome information; for probability distribution.

8. method for video coding according to claim 1, is characterized in that, described " to the picture of non-NULL _ref1, non-NULL picture _ref2carry out the correction in the same way of monochrome information " after comprise further: the picture carrying out non-NULL _ref1, non-NULL picture _ref2u chrominance information correct in the same way and correct in the same way with V chrominance information.

9. method for video coding according to claim 8, is characterized in that, described " carry out the picture of non-NULL _ref1, non-NULL picture _ref2u chrominance information correct in the same way " be specially:

First, frame is calculated _tu chrominance information be worth most:

$\max \_{\mathrm{frame}}_t^u=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^u,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent frame _tmaximum U chromatic value; represent frame _tminimum U chromatic value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given

Then, the picture of non-NULL is calculated _ref1and the picture of non-NULL _ref2u chrominance information be worth most:

$\max \_{\mathrm{picture}}_{\mathrm{ref}1}^u=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^u,k)\right)\right)$

$\max \_{\mathrm{picture}}_{\mathrm{ref}2}^u=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^u,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent picture _ref1maximum U chromatic value; represent picture _ref1minimum U chromatic value; represent picture _ref2maximum U chromatic value; represent picture _ref2minimum U chromatic value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach the k value of maximum, namely $p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^u,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^u,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}(\mathrm{pictu}{e}_{\mathrm{ref}1}^u,k)\right);$ represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach the k value of maximum, namely $p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^u,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^u,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}(\mathrm{pictu}{e}_{\mathrm{ref}2}^u,k)\right);$

To the picture of non-NULL _ref1and the picture of non-NULL _ref2the U chrominance information of each pixel is carried out U chrominance information and is corrected in the same way:

${\mathrm{picture}}_{\mathrm{ref}1,m}^u(i,j)=k_1^u*({\mathrm{picture}}_{\mathrm{ref}1}^u(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^u)+\min \_{\mathrm{frame}}_t^u$

${\mathrm{picture}}_{\mathrm{ref}2,m}^u(i,j)=k_2^u*({\mathrm{picture}}_{\mathrm{ref}2}^u(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^u)+\min \_{\mathrm{frame}}_t^u;$

Wherein, $k_{T1}^u=\frac{\max \_{\mathrm{frame}}_t^u-\min \_{\mathrm{frame}}_t^u}{\max \_{\mathrm{picture}}_{\mathrm{ref}1}^u-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^u};$

$k_{T2}^u=\frac{\max \_{\mathrm{frame}}_t^u-\min \_{\mathrm{frame}}_t^u}{\max \_{\mathrm{picture}}_{\mathrm{ref}2}^u-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^u};$

The span of i, j is: 1≤i≤height _uaMP.AMp.Amp & 1≤j≤width _u; it is the first reference picture U chrominance information adjustment factor; it is the second reference picture U chrominance information adjustment factor; T1, T2 represent the coding sequence number of the corresponding reference frame of the first reference picture, the coding sequence number of the corresponding reference frame of the second reference picture respectively; Described correction parameter collection comprises further: the correction parameter collection of U chrominance information be respectively the U chrominance information of the first reference picture, pixel value that the U chrominance information of the second reference picture arranges in the i-th row jth; be respectively the pixel value that U chrominance information corrects the rear U chrominance information of the first reference picture in the same way, the U chrominance information of the second reference picture arranges in the i-th row jth.

10. method for video coding according to claim 8, is characterized in that, described " carry out the picture of non-NULL _ref1, non-NULL picture _ref2v chrominance information correct in the same way " be specially:

Calculate frame _tv chrominance information:

$\max \_{\mathrm{frame}}_t^v=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^v,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent frame _tmaximum V chromatic value; represent frame _tminimum V chromatic value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach the k value of maximum, namely $p_t({\mathrm{frame}}_t^v,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^v,k)\right))\right)=\underset{0\&le;k\&le;2^n-1}{\max }(p_t({\mathrm{frame}}_t^v,k));$

Then, the picture of non-NULL is calculated _ref1and the picture of non-NULL _ref2v chrominance information be worth most:

$\max \_{\mathrm{picture}}_{\mathrm{ref}1}^v=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^v,k)\right)\right)$

$\max \_{\mathrm{picture}}_{\mathrm{ref}2}^v=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^v,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent picture _ref1maximum V chromatic value; represent picture _ref1minimum V chromatic value; represent picture _ref2maximum V chromatic value; represent picture _ref2minimum V chromatic value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach the k value of maximum, namely $p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^v,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^v,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^v,k)\right);$ represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach the k value of maximum, namely $p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^v,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^v,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^v,k)\right);$

To the picture of non-NULL _ref1and the picture of non-NULL _ref2the V chrominance information of each pixel is carried out V chrominance information and is corrected in the same way:

${\mathrm{picture}}_{\mathrm{ref}1,m}^v(i,j)=k_1^v*({\mathrm{picture}}_{\mathrm{ref}1}^v(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^v)+\min \_{\mathrm{frame}}_t^v$

${\mathrm{picture}}_{\mathrm{ref}2,m}^v(i,j)=k_2^v*({\mathrm{picture}}_{\mathrm{ref}2}^v(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^v)+\min \_{\mathrm{frame}}_t^v$

Wherein, $k_{T1}^v=\frac{\max \_{\mathrm{frame}}_t^v-\min \_{\mathrm{frame}}_t^v}{\max \_{\mathrm{picture}}_{\mathrm{ref}1}^v-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^v};$

$k_{T2}^v=\frac{\max \_{\mathrm{frame}}_t^v-\min \_{\mathrm{frame}}_t^v}{\max \_{\mathrm{picture}}_{\mathrm{ref}2}^v-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^v};$

The span of i, j is: 1≤i≤height _vaMP.AMp.Amp & 1≤j≤width _v; it is the first reference picture V chrominance information degree adjustment factor; it is the second reference picture V chrominance information degree adjustment factor; T1, T2 represent the coding sequence number of the corresponding reference frame of the first reference picture, the coding sequence number of the corresponding reference frame of the second reference picture respectively; Described correction parameter collection comprises further: the correction parameter collection of V chrominance information be respectively the V chrominance information of the first reference picture, pixel value that the monochrome information of the second reference picture arranges in the i-th row jth; be respectively the pixel value that V chrominance information corrects the rear V chrominance information of the first reference picture in the same way, the V chrominance information of the second reference picture arranges in the i-th row jth.

11. method for video coding according to claim 1, is characterized in that, described " arranging m is the first numerical value " is specially:

Judge whether picture _ref1coding sequence number and picture _ref2coding sequence number be all less than the coding sequence number of current encoded frame and picture _ref1, picture _ref2all encoded, if so, then first make m=m+2, then continue " to the picture of non-NULL _ref1, non-NULL picture _ref2carry out the correction in the same way of monochrome information ";

If not, then picture is judged whether _ref1coding sequence number and picture _ref2coding sequence number be all less than the coding sequence number of current encoded frame and picture _ref1, picture _ref2all uncoded, if so, then first m=m+2 is set, then by picture _ref1, picture _ref2replace with the coding reconstructed image of its correspondence respectively, then continue " to the picture of non-NULL _ref1, non-NULL picture _ref2carry out the correction in the same way of monochrome information "; If not, then m=m+1 is set, then coding sequence number is less than the first or second reference picture of current encoded frame coding sequence number, replaces with the coding reconstructed image of its correspondence, another first or second reference image setting is empty, then continues " to the picture of non-NULL _ref1, non-NULL picture _ref2carry out the correction in the same way of monochrome information ".

12. method for video coding according to claim 1 or 11, it is characterized in that, described " judges frame _trelative to the first reference picture picture _ref1, the second reference picture picture _ref2whether there is monochrome information gradual change ", if there is not monochrome information gradual change, then arranging m is second value, then continues " judging that whether all reference frames of current encoded frame are all through the judgement of light gradient ".

13. method for video coding according to claim 12, is characterized in that, the method for described " arranging m is second value " is:

m＝m+sign(picture _ref1)+sign(picture _ref2)，

Wherein,

Wherein, m represents relative to frame _tthrough the reference frame number of light gradient judgement; Sign (picture _ref1) represent picture _ref1be reference frame or be not reference frame time corresponding value; Sign (picture _ref2, k) represent picture _ref2be reference frame or be not reference frame time corresponding value.

14. method for video coding according to claim 1 or 13, it is characterized in that, described " judging that whether all reference frames of current encoded frame are all through the judgement of light gradient " is specially;

M > number _list0+ number _list1and frame _tfor B frame, or, m > number _list0and frame _tfor P frame;

Wherein, m represents relative to frame _tthrough the reference frame number of light gradient judgement; Number _list0represent reference frame sum in forward direction reference listing; Number _list1represent reference frame sum in backward reference listing.

15. 1 kinds of video encoding/decoding methods, is characterized in that, described method comprises:

Obtain the correction parameter collection of current decoded frame and the first reference picture or the second reference picture; Judge whether that current sign variable is 0, if so, then carry out regular decode, if not, then carried out the correction in the same way of monochrome information by the reference frame of the correction parameter set pair current decoded frame of the first described reference picture or the second reference picture;

The reference frame of corrected in the same way current decoded frame is utilized to carry out regular decode to current decoded frame;

Find next image to be decoded by decoding order, if next image to be decoded exists, then image to be decoded for the next one is set to current decoded frame, continue " finding next image to be decoded by decoding order ";

The method of described " being carried out the correction in the same way of monochrome information by the reference frame of the correction parameter set pair current decoded frame of the first described reference picture or the second reference picture " is:

${\mathrm{ref}}_{t,m}^y(i,j)=k_T^y*({{\mathrm{ref}}_t}^y(i,j)-\min \_\mathrm{pictu}{\mathrm{re}}_{\mathrm{ref}}^y)+\min \_f{\mathrm{rame}}_t^y$

Wherein, the span of i, j is: 1≤i≤height _yaMP.AMp.Amp & 1≤j≤width _y, line number, the columns of image luminance information are respectively: height _y, width _y; ref _t ^ythe pixel value that the monochrome information of the reference frame that (i, j) is current decoded frame arranges in the i-th row jth; the pixel value that the monochrome information correcting the reference frame of rear current decoded frame in the same way for monochrome information arranges in the i-th row jth; be respectively the monochrome information adjustment factor of the corresponding reference frame of the current decoded frame that passes over from coding side, the minimum luminance value of the corresponding reference frame of current decoded frame, the minimum luminance value of original coding frame that current decoded frame is corresponding.

16. video encoding/decoding methods according to claim 15, it is characterized in that, comprise further after described " being carried out the correction in the same way of monochrome information by the reference frame of the correction parameter set pair current decoded frame of the first described reference picture or the second reference picture ": U, V chrominance information is carried out to the reference frame of current decoded frame and corrects in the same way;

Described " carrying out U chrominance information to the reference frame of current decoded frame to correct in the same way " method is:

${\mathrm{ref}}_{t,m}^u(i,j)=k_T^u*({{\mathrm{ref}}_t}^u(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}}^u)+\min \_{\mathrm{frame}}_t^u$

Wherein, the span of i, j is: 1≤i≤height _uaMP.AMp.Amp & 1≤j≤width _u; ref _t ^uthe pixel value that the U chrominance information of the reference frame that (i, j) is current decoded frame arranges in the i-th row jth; the pixel value that the U chrominance information correcting the reference frame of rear current decoded frame in the same way for U chrominance information arranges in the i-th row jth; be respectively the U chrominance information degree adjustment factor of the corresponding reference frame of the current decoded frame that passes over from coding side, the minimum U chromatic value of the corresponding reference frame of current decoded frame, the minimum U chromatic value of original coding frame that current decoded frame is corresponding;

Described " carrying out U chrominance information to the reference frame of current decoded frame to correct in the same way " method is:

${\mathrm{ref}}_{t,m}^v(i,j)=k_T^v*({\mathrm{ref}}_t^v(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}}^v)+\min \_{\mathrm{frame}}_t^v$

Wherein, the span of i, j is: 1≤i≤height _vaMP.AMp.Amp & 1≤j≤width _v; for the pixel value that the V chrominance information of the reference frame of current decoded frame arranges in the i-th row jth; the pixel value that the V chrominance information correcting the reference frame of rear current decoded frame in the same way for V chrominance information arranges in the i-th row jth; be respectively the V chrominance information degree adjustment factor of the corresponding reference frame of the current decoded frame that passes over from coding side, the minimum V chromatic value of the corresponding reference frame of current decoded frame, the minimum V chromatic value of original coding frame that current decoded frame is corresponding.

17. 1 kinds of video coding apparatus, is characterized in that, this device comprises: the first acquiring unit, the first processing unit and the second processing unit;

First acquiring unit, for obtaining current encoded frame frame _t, and note is set _t=0, note _tfor current sign variable;

First processing unit, comprises the first judging unit, the 3rd processing unit and the 11 processing unit;

Described first judging unit, for judging whether current encoded frame is I frame or scene switch frame;

Described 3rd processing unit, for when the first judging unit judged result is no, then utilizes the first coding method to frame _tencode;

11 processing unit, for when the judged result of the first judging unit is for being, utilizes conventional I frame coding techniques to frame _tencode;

Second processing unit, finding next image to be encoded for pressing coded sequence, if next image to be encoded exists, then image to be encoded for the next one being set to frame _t, notice execution first acquiring unit, if next image to be encoded does not exist, then process ends process;

The 3rd described processing unit comprises the first setting unit, fourth processing unit, correcting unit, replacement unit and the 5th processing unit;

Described first setting unit, arrange m=0, m represents relative to frame _tthrough the reference frame number of light gradient judgement;

Described fourth processing unit, comprises the second judging unit and the second setting unit;

Described second judging unit, for judging frame _trelative to the first reference picture picture _ref1, the second reference picture picture _ref2whether there is monochrome information gradual change;

Described second setting unit, for making note when the second judging unit judged result for the gradual change of generation monochrome information is then arranged _t=1; Arranging m is the first numerical value;

Correcting unit, for the picture to non-NULL _ref1, non-NULL picture _ref2carry out the correction in the same way of monochrome information, obtain the correction parameter collection of the first reference picture, the second reference picture;

Replacement unit, for utilizing the picture of corrected in the same way non-NULL _ref1and the picture of non-NULL _ref2replace reference frame corresponding in reference listing;

5th processing unit, comprises the 3rd judging unit and the 6th processing unit,

Described 3rd judging unit, for judging that whether all reference frames of current encoded frame are all through the judgement of light gradient, perform the second judging unit if not, if perform the 6th processing unit;

Described 6th processing unit, to frame _tin each macro block carry out conventional coded treatment; Judge whether " note _t=1 and optimum prediction mode is inter-frame forecast mode ", then perform the second processing unit if not; If so, the correction parameter collection of the first reference picture that in the optimum prediction mode confirmed in described " conventional coded treatment ", optimum reference frame is corresponding or the second reference picture is then transmitted to video decoder, notice execution second processing unit;

Described correcting unit comprises monochrome information correcting unit, and wherein monochrome information correcting unit comprises: the first computing unit, the second computing unit and the 3rd computing unit;

First computing unit, for calculating current encoded frame frame _tmonochrome information be worth most;

$\max \_{\mathrm{frame}}_t^y=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^y,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent frame _tmaximum brightness value; represent frame _tminimum luminance value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given n is the number of bits that each pixel of image signless integer used represents, for probability distribution;

Second computing unit, for calculating the first reference picture picture of non-NULL _ref1and the second reference picture picture of non-NULL _ref2monochrome information be worth most;

$\max \_{\mathrm{picture}}_{\mathrm{ref}1}^y=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)\right)\right)$

$\max \_{\mathrm{picture}}_{\mathrm{ref}2}^y=\arg \left(\underset{0\&le;k{\&le;2}^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^y,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent picture _ref1maximum brightness value; represent picture _ref1minimum luminance value; represent picture _ref2maximum brightness value; represent picture _ref2minimum luminance value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given for probability distribution;

3rd computing unit, for calculating the first reference picture picture of non-NULL _ref1and the second reference picture picture of non-NULL _ref2monochrome information be worth most, obtain the correction parameter collection of a reference diagram or the second reference picture;

$\begin{array}{c}{\mathrm{picture}}_{\mathrm{ref}1,m}^y(i,j)=k_{T1}^y*({\mathrm{picture}}_{\mathrm{ref}1}^y(i.j)-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^y)+\min \_{\mathrm{frame}}_t^y\\ {\mathrm{picture}}_{\mathrm{ref}2,m}^y(i,j)=k_{T2}^y*({\mathrm{picture}}_{\mathrm{ref}2}^y(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^y)+\min \_{\mathrm{frame}}_t^y\end{array}$ Wherein,

$k_{T1}^y=\frac{\max \_{\mathrm{frame}}_t^y-\min \_{\mathrm{frame}}_t^y}{\max \_{\mathrm{picture}}_{\mathrm{ref}1}^y-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^y};k_{T2}^y=\frac{\max \_{\mathrm{frame}}_t^y-\min \_{\mathrm{frame}}_t^y}{\max \_{\mathrm{picture}}_{\mathrm{ref}2}^y-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^y};$ The span of i, j is: 1≤i≤height _yaMP.AMp.Amp & 1≤j≤width _y, line number, the columns of image luminance information are respectively: height _y, width _y; it is the first reference picture monochrome information adjustment factor; it is the second reference picture monochrome information adjustment factor; T1, T2 represent the coding sequence number of the corresponding reference frame of the first reference picture, the coding sequence number of the corresponding reference frame of the second reference picture respectively; Correction parameter collection is: max (variable | condition) represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; be respectively the monochrome information of the first reference picture, pixel value that the monochrome information of the second reference picture arranges in the i-th row jth; be respectively the pixel value that monochrome information corrects the rear monochrome information of the first reference picture in the same way, the monochrome information of the second reference picture arranges in the i-th row jth.

18. video coding apparatus according to claim 17, is characterized in that, described second judging unit comprises second acquisition unit, the 4th judging unit, the 7th processing unit and the first determining unit:

Second acquisition unit, for obtaining picture _ref1with picture _ref2;

4th judging unit, for judging described picture _ref1and picture _ref2whether meet reference picture standard;

7th processing unit comprises the 8th processing unit and the 9th processing unit;

8th processing unit is no for the judged result when the 4th judging unit, then notice performs second acquisition unit;

9th processing unit, is yes for the judged result when the 4th judging unit, then obtains frame _tthe probability distribution of monochrome information; Obtain picture _ref1the probability distribution of monochrome information, and picture _ref2the probability distribution of monochrome information;

First determining unit, whether the probability distribution determination current encoded frame for the monochrome information according to the current encoded frame obtained, the first reference picture, the second reference picture there is monochrome information gradual change.

19. video coding apparatus according to claim 18, is characterized in that, described second acquisition unit comprises: first chooses unit, second chooses unit, the 3rd and choose unit and the second determining unit;

First chooses unit, is less than the image of current encoded frame broadcasting sequence number as the first reference picture for choosing satisfied sequence number of playing;

Second chooses unit, is greater than the image of current encoded frame broadcasting sequence number as the second reference picture for choosing satisfied sequence number of playing;

3rd chooses unit, for same current encoded frame frame _t, the first corresponding reference picture and the second reference picture can not be used to " judge frame simultaneously _trelative to picture _ref1, picture _ref2whether there is monochrome information gradual change " judgement.

20. video coding apparatus according to claim 19, is characterized in that, described fourth processing unit comprises the 5th judging unit, the 6th judging unit and the 7th judging unit;

5th judging unit, for judging picture _ref1and picture _ref2whether meet the condition of the 6th judging unit and the 7th judging unit simultaneously:

6th judging unit, for determining picture _ref1with picture _ref2there is identical encoding state, i.e. the first reference picture and the second reference picture or all encoded, or all do not encode;

7th judging unit, for determining picture _ref1coding sequence number and picture _ref2coding sequence number can not be greater than frame simultaneously _tcoding sequence number.

21. video coding apparatus according to claim 20, is characterized in that, the 9th described processing unit comprises the 3rd acquiring unit, the 4th acquiring unit and the 5th acquiring unit;

3rd acquiring unit, for " obtaining frame _tthe probability distribution of monochrome information " be:

$p_t({\mathrm{frame}}_t^y,k)=\mathrm{count}({\mathrm{frame}}_t^y,k)/({\mathrm{width}}_y*{\mathrm{height}}_y),k=\mathrm{0,1,2}...,2^n-1$

Wherein,

$\mathrm{sign}({\mathrm{frame}}_t^y(i,j),k)=\left\{\begin{array}{cc}1,& {\mathrm{frame}}_t^y(i,j)=k\\ 0,& \mathrm{else}\end{array}\right.$

Y represents monochrome information; represent current encoded frame frame _tmonochrome information; represent the pixel value of the image luminance information being positioned at current encoded frame i-th row jth row; represent corresponding value when equaling k and be not equal to k; Sum (variable | condition) represent all variable summations satisfied condition; represent frame _tthe pixel value of middle monochrome information equals the pixel number of k; for probability distribution; The monochrome information of the brightness value composing images of all pixels of image, line number, the columns of note image luminance information are respectively: height _y, width _y;

4th acquiring unit, for " obtaining the probability distribution of the first reference picture monochrome information ":

$p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)=\mathrm{count}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)/({\mathrm{width}}_y*{\mathrm{height}}_y),k=\mathrm{0,1,2}...{,2}^n-1$

Wherein,

$\mathrm{sign}({\mathrm{picture}}_{\mathrm{ref}1}^y(i,j),k)=\left\{\begin{array}{cc}1,& {\mathrm{picture}}_{\mathrm{ref}1}^y(i,j)=k\\ 0,& \mathrm{else}\end{array}\right.$

Y represents monochrome information; represent the first reference picture picture _ref1monochrome information; represent the pixel value of the image luminance information being positioned at the first reference picture i-th row jth row; represent corresponding value when equaling k and be not equal to k; Sum (variable | condition) represent all variable summations satisfied condition; represent picture _ref1the pixel value of middle monochrome information equals the pixel number of k; for probability distribution; The monochrome information of the brightness value composing images of all pixels of image, line number, the columns of note image luminance information are respectively: height _y, width _y;

5th acquiring unit, for " obtaining the probability distribution of the second reference picture monochrome information ":

$p_t({\mathrm{picture}}_{\mathrm{ref}2}^y,k)=\mathrm{count}({\mathrm{picture}}_{\mathrm{ref}2}^y,k)/({\mathrm{width}}_y*{\mathrm{height}}_y),k=\mathrm{0,1,2}...{,2}^n-1$

Wherein,

$\mathrm{sign}({\mathrm{picture}}_{\mathrm{ref}2}^y(i,j),k)=\left\{\begin{array}{cc}1,& {\mathrm{picture}}_{\mathrm{ref}2}^y(i,j)=k\\ 0,& \mathrm{else}\end{array}\right.$

Wherein, y represents monochrome information; N is the number of bits that each pixel of image signless integer used represents; represent the second reference picture picture _ref2monochrome information; represent the pixel value of the image luminance information being positioned at the second reference picture i-th row jth row; represent corresponding value when equaling k and be not equal to k; Sum (variable | condition) represent all variable summations satisfied condition; represent picture _ref2the pixel value of middle monochrome information equals the pixel number of k; for probability distribution; The monochrome information of the brightness value composing images of all pixels of image, line number, the columns of note image luminance information are respectively: height _y, width _y.

22. video coding apparatus according to claim 21, is characterized in that, the first described determining unit comprises the 8th judging unit and the second determining unit:

8th judging unit, for judging whether

$\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)\right)<\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^y,k)\right)<\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^y,k)\right)$

Or

$\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^y,k)\right)<\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^y,k)\right)<\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^y,k)\right)$

Second determining unit is yes for working as the 8th judging unit judged result, then frame _trelative to picture _ref1, picture _ref2there is monochrome information gradual change; Ruo Dang eight judging unit judged result is no, then frame _trelative to picture _ref1, picture _ref2there is not monochrome information gradual change;

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; Y represents monochrome information; represent the second reference picture picture _ref2monochrome information; for probability distribution; represent the first reference picture picture _ref1monochrome information; for probability distribution.

23. video coding apparatus according to claim 17, is characterized in that, described correcting unit comprises U chrominance information correcting unit and V chrominance information correcting unit further;

U chrominance information correcting unit, for the picture to non-NULL _ref1, non-NULL picture _ref2carry out U chrominance information to correct in the same way

V chrominance information correcting unit, for the picture to non-NULL _ref1, non-NULL picture _ref2carry out V chrominance information to correct in the same way.

24. video coding apparatus according to claim 23, is characterized in that, described U chrominance information correcting unit comprises the 4th computing unit, the 5th computing unit and the 6th computing unit;

4th computing unit, for calculating frame _tu chrominance information be worth most:

$\max \_{\mathrm{frame}}_t^u=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^u,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent frame _tmaximum U chromatic value; represent frame _tminimum U chromatic value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given

5th computing unit, for calculating the picture of non-NULL _ref1and the picture of non-NULL _ref2u chrominance information be worth most:

$\max \_{\mathrm{picture}}_{\mathrm{ref}1}^u=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^u,k)\right)\right)$

$\max \_{\mathrm{picture}}_{\mathrm{ref}2}^u=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^u,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent picture _ref1minimum U chromatic value; represent picture _ref2maximum U chromatic value; represent picture _ref2minimum U chromatic value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach the k value of maximum, namely $p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^u,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^u,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^u,k)\right);$ represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach the k value of maximum, namely $p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^u,\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^u,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^u,k)\right);$ represent picture _ref1maximum U chromatic value;

6th computing unit, for the picture to non-NULL _ref1and the picture of non-NULL _ref2the U chrominance information of each pixel is carried out U chrominance information and is corrected in the same way:

${\mathrm{picture}}_{\mathrm{ref}1,m}^u(i,j)=k_1^u*({\mathrm{picture}}_{\mathrm{ref}1}^u(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^u)+\min \_{\mathrm{frame}}_t^u$

${\mathrm{picture}}_{\mathrm{ref}2,m}^u(i,j)=k_2^u*({\mathrm{picture}}_{\mathrm{ref}2}^u(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^u)+\min \_{\mathrm{frame}}_t^u;$

Wherein, $k_{T1}^u=\frac{\max \_{\mathrm{frame}}_t^u-\min \_{\mathrm{frame}}_t^u}{\max \_{\mathrm{picture}}_{\mathrm{ref}1}^u-\min \_{\mathrm{pictrue}}_{\mathrm{ref}1}^u};$

$k_{T2}^u=\frac{\max \_{\mathrm{frame}}_t^u-\min \_{\mathrm{frame}}_t^u}{\max \_{\mathrm{picture}}_{\mathrm{ref}2}^u-\min \_{\mathrm{pictrue}}_{\mathrm{ref}2}^u};$

The span of i, j is: 1≤i≤height _uaMP.AMp.Amp & 1≤j≤width _u; it is the first reference picture U chrominance information adjustment factor; it is the second reference picture U chrominance information adjustment factor; T1, T2 represent the coding sequence number of the corresponding reference frame of the first reference picture, the coding sequence number of the corresponding reference frame of the second reference picture respectively; Described correction parameter collection comprises further: the correction parameter collection of U chrominance information be respectively the U chrominance information of the first reference picture, pixel value that the U chrominance information of the second reference picture arranges in the i-th row jth; be respectively the pixel value that U chrominance information corrects the rear U chrominance information of the first reference picture in the same way, the U chrominance information of the second reference picture arranges in the i-th row jth.

25. video coding apparatus according to claim 24, is characterized in that, V chrominance information correcting unit comprises the 7th computing unit, the 8th computing unit and the 9th computing unit;

7th computing unit, for calculating frame _tv chrominance information:

$\max \_{\mathrm{frame}}_t^v=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^v,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent frame _tmaximum V chromatic value; represent frame _tminimum V chromatic value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach the k value of maximum, namely $p_t({\mathrm{frame}}_t^v,\arg \left(\underset{0\&le;k{\&le;2}^n-1}{\max }\left(p_t({\mathrm{farame}}_t^v,k)\right)\right))=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_t({\mathrm{frame}}_t^v,k)\right);$

8th computing unit, for calculating the picture of non-NULL _ref1and the picture of non-NULL _ref2v chrominance information be worth most:

$\max \_{\mathrm{frame}}_{\mathrm{ref}1}^v=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{frame}}_{\mathrm{ref}1}^v,k)\right)\right)$

$\max \_{\mathrm{pictre}}_{\mathrm{ref}2}^v=\arg \left(\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{fef},2}^v,k)\right)\right)$

Wherein, represent all variable maximizings satisfied condition; Min (variable | condition) represent and all variablees satisfied condition are minimized; represent picture _ref1minimum V chromatic value; represent picture _ref2maximum V chromatic value; represent picture _ref2minimum V chromatic value; represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ^wmake in-1 reach the k value of maximum, namely $p_{\mathrm{raf}1}({\mathrm{picture}}_{\mathrm{ref}1}^v,\arg (\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref},1}^v,k)\right)\left)\right)=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}1}({\mathrm{picture}}_{\mathrm{ref}1}^v,k)\right);$ represent and first meet 0≤k≤2 to all ⁿ-1 ask for maximum, then k assignment corresponding for maximum is given in other words 0≤k≤2 ⁿmake in-1 reach the k value of maximum, namely $p_{\mathrm{raf}2}({\mathrm{picture}}_{\mathrm{ref}2}^v,\arg (\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref},2}^v,k)\right)\left)\right)=\underset{0\&le;k\&le;2^n-1}{\max }\left(p_{\mathrm{ref}2}({\mathrm{picture}}_{\mathrm{ref}2}^v,k)\right);$ represent picture _ref1maximum V chromatic value;

9th computing unit, for the picture to non-NULL _ref1and the picture of non-NULL _ref2the V chrominance information of each pixel is carried out V chrominance information and is corrected in the same way:

${\mathrm{picture}}_{\mathrm{ref}1,m}^u(i,j)=k_1^v*({\mathrm{picture}}_{\mathrm{ref}1}^v(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}1}^v)+\min \_{\mathrm{frame}}_t^v$

${\mathrm{picture}}_{\mathrm{ref}2,m}^v(i,j)=k_2^v*({\mathrm{picture}}_{\mathrm{ref}2}^v(i,j)-\min \_{\mathrm{picture}}_{\mathrm{ref}2}^v)+\min \_{\mathrm{frame}}_t^v$

Wherein, $k_{T1}^v=\frac{\max \_{\mathrm{frame}}_t^v-\min \_{\mathrm{frame}}_t^v}{\max \_{\mathrm{picture}}_{\mathrm{ref}1}^v-\min \_{\mathrm{pictrue}}_{\mathrm{ref}1}^v};$

$k_{T2}^v=\frac{\max \_{\mathrm{frame}}_t^v-\min \_{\mathrm{frame}}_t^v}{\max \_{\mathrm{picture}}_{\mathrm{ref}2}^v-\min \_{\mathrm{pictrue}}_{\mathrm{ref}2}^v};$

The span of i, j is: 1≤i≤height _vaMP.AMp.Amp & 1≤j≤width _v; it is the first reference picture V chrominance information degree adjustment factor; it is the second reference picture V chrominance information degree adjustment factor; T1, T2 represent the coding sequence number of the corresponding reference frame of the first reference picture, the coding sequence number of the corresponding reference frame of the second reference picture respectively; Described correction parameter collection comprises further: the correction parameter collection of V chrominance information be respectively the V chrominance information of the first reference picture, pixel value that the monochrome information of the second reference picture arranges in the i-th row jth; be respectively the pixel value that V chrominance information corrects the rear V chrominance information of the first reference picture in the same way, the V chrominance information of the second reference picture arranges in the i-th row jth.

26. video coding apparatus according to claim 17, is characterized in that, the first described setting unit comprises: the 9th judging unit and the tenth processing unit;

9th judging unit, for judging whether picture _ref1coding sequence number and picture _ref2coding sequence number be all less than the coding sequence number of current encoded frame and picture _ref1, picture _ref2all encoded;

Tenth processing unit, for being yes when the 9th judging unit judged result, then first make m=m+2, then notice performs monochrome information correcting unit;

When the 9th judging unit judged result is no, then judge whether picture _ref1coding sequence number and picture _ref2coding sequence number be all less than the coding sequence number of current encoded frame and picture _ref1, picture _ref2all uncoded, if so, then first m=m+2 is set, then by picture _ref1, picture _ref2replace with the coding reconstructed image of its correspondence respectively, then continue " to the picture of non-NULL _ref1, non-NULL picture _ref2carry out the correction in the same way of monochrome information "; If not, then m=m+1 is set, then coding sequence number is less than the first or second reference picture of current encoded frame coding sequence number, replace with the coding reconstructed image of its correspondence, another first or second reference image setting is empty, then notifies that monochrome information correcting unit continues " to the picture of non-NULL _ref1, non-NULL picture _ref2carry out the correction in the same way of monochrome information ".

27. video coding apparatus according to claim 17 or 26, it is characterized in that, described fourth processing unit comprises the 3rd setting unit further;

3rd setting unit comprises the 4th setting unit and the first notification unit;

4th setting unit, for when the second judging unit judged result is not for monochrome information gradual change occurs, then arranging m is second value;

m＝m+sign(picture _ref1)+sign(picture _ref2)，

Wherein,

Wherein, m represents relative to frame _tthrough the reference frame number of light gradient judgement; Sign (picture _ref1) represent picture _ref1be reference frame or be not reference frame time corresponding value; Sign (picture _ref2, k) represent picture _ref2be reference frame or be not reference frame time corresponding value;

First notification unit, for arranging after m is second value, notice execution second judging unit.

28. video coding apparatus according to claim 17, is characterized in that, the 3rd described judging unit, and " judging that whether all reference frames of current encoded frame are all through the judgement of light gradient " is specially;

M > number _list0+ number _list1and frame _tfor B frame, or, m > number _list0and frame _tfor P frame;

Wherein, m represents relative to frame _tthrough the reference frame number of light gradient judgement; Number _list0represent reference frame sum in forward direction reference listing; Number _list1represent reference frame sum in backward reference listing.

29. 1 kinds of video decoders, is characterized in that, described device comprises: decoding acquiring unit, the first codec processing unit, the second codec processing unit and the 3rd codec processing unit;

Decoding acquiring unit, for obtaining the correction parameter collection of current decoded frame and the first reference picture or the second reference picture;

First codec processing unit, comprises the first decoding judgement unit, decoded luminance information correction unit and regular decode unit;

The first described decoding judgement unit, for judging whether that current sign variable is 0;

Described decoded luminance information correction unit, for when the judged result of the first decoding judgement unit is no, the correction in the same way of monochrome information is carried out, notice execution second codec processing unit by the reference frame of the correction parameter set pair current decoded frame of the first described reference picture or the second reference picture;

Regular decode unit, for when the judged result of the first decoding judgement unit is for being, carries out regular decode process to described current decoded frame; Notice execution the 3rd codec processing unit;

Second codec processing unit, for utilizing the reference frame of corrected in the same way current decoded frame to carry out regular decode to current decoded frame, notice execution the 3rd codec processing unit;

3rd codec processing unit, finding next image to be decoded for pressing decoding order, if next image to be decoded exists, then image to be decoded for the next one being set to current decoded frame, notice decoding acquiring unit;

Wherein, described decoded luminance information correction unit " carries out the correction in the same way of monochrome information " method by the reference frame of the correction parameter set pair current decoded frame of the first described reference picture or the second reference picture is:

${\mathrm{ref}}_{t,m}^y(i,j)=k_T^y*({\mathrm{ref}}_t^y(i,j)-\min \_\mathrm{pictu}{\mathrm{re}}_{\mathrm{ref}}^y)+\min \_{\mathrm{frame}}_t^y$

Wherein, the span of i, j is: 1≤i≤height _yaMP.AMp.Amp & 1≤j≤width _y, line number, the columns of image luminance information are respectively: height _y, width _y; for the pixel value that the monochrome information of the reference frame of current decoded frame arranges in the i-th row jth; the pixel value that the monochrome information correcting the reference frame of rear current decoded frame in the same way for monochrome information arranges in the i-th row jth; be respectively the monochrome information adjustment factor of the corresponding reference frame of the current decoded frame that passes over from coding side, the minimum luminance value of the corresponding reference frame of current decoded frame, the minimum luminance value of original coding frame that current decoded frame is corresponding.

30. video decoders according to claim 29, is characterized in that, the first described codec processing unit comprises decoding U chrominance information correcting unit and V chrominance information correcting unit further;

U chrominance information correcting unit, after the monochrome information for having carried out the reference frame of current decoded frame when decoded luminance information correction unit corrects, continues to carry out U chrominance information to the reference frame of current decoded frame and corrects in the same way:

${\mathrm{ref}}_{t,m}^u(i,j)=k_T^u*({\mathrm{ref}}_t^u(i,j)-\min \_\mathrm{pictu}{\mathrm{re}}_{\mathrm{ref}}^u)+\min \_{\mathrm{frame}}_t^u$

Wherein, the span of i, j is: 1≤i≤height _uaMP.AMp.Amp & 1≤j≤width _u; for the pixel value that the U chrominance information of the reference frame of current decoded frame arranges in the i-th row jth; the pixel value that the U chrominance information correcting the reference frame of rear current decoded frame in the same way for U chrominance information arranges in the i-th row jth; be respectively the U chrominance information degree adjustment factor of the corresponding reference frame of the current decoded frame that passes over from coding side, the minimum U chromatic value of the corresponding reference frame of current decoded frame, the minimum U chromatic value of original coding frame that current decoded frame is corresponding;

Decoding V chrominance information correcting unit, after monochrome information for having carried out the reference frame of current decoded frame when decoded luminance information correction unit corrects, continue to carry out U chrominance information to the reference frame of current decoded frame to correct in the same way, notice execution the 3rd codec processing unit:

${\mathrm{ref}}_{t,m}^v(i,j)=k_T^v*({\mathrm{ref}}_t^v(i,j)-\min \_\mathrm{pictu}{\mathrm{re}}_{\mathrm{ref}}^v)+\min \_{\mathrm{frame}}_t^v$

Wherein, the span of i, j is: 1≤i≤height _vaMP.AMp.Amp & 1≤j≤width _v; for the pixel value that the V chrominance information of the reference frame of current decoded frame arranges in the i-th row jth; the pixel value that the V chrominance information correcting the reference frame of rear current decoded frame in the same way for V chrominance information arranges in the i-th row jth; be respectively the V chrominance information degree adjustment factor of the corresponding reference frame of the current decoded frame that passes over from coding side, the minimum V chromatic value of the corresponding reference frame of current decoded frame, the minimum V chromatic value of original coding frame that current decoded frame is corresponding.