CN104581155A - Scenario-analysis-based coding method and system - Google Patents
Scenario-analysis-based coding method and system Download PDFInfo
- Publication number
- CN104581155A CN104581155A CN201410720005.1A CN201410720005A CN104581155A CN 104581155 A CN104581155 A CN 104581155A CN 201410720005 A CN201410720005 A CN 201410720005A CN 104581155 A CN104581155 A CN 104581155A
- Authority
- CN
- China
- Prior art keywords
- frame
- note
- present frame
- prev
- parameter
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Abstract
The invention discloses a scenario-analysis-based coding method and system. According to the method, by the priori analysis of a coded film source and the posteriori correction of coding information, the rate-distortion performance of a coder in complicated scenarios of scenario change, light sudden change, fade-in fade-out and the like is improved, and meanwhile, the calculated amount for coding is reduced.
Description
Technical field
The present invention relates to coding and decoding video field, particularly relate to a kind of coding method based on scene analysis and system.
Background technology
In prior art, actual coding film source has diversity, adopts the coding method of conventional fixing I frame period often can not reach optimal performance.Under the complex scenes such as simple scene detection then can not solve light sudden change completely, be fade-in fade-out, coding efficiency declines, the problem of amount of calculation waste.
For the problems referred to above, the present invention proposes a kind of coding method based on scene analysis.The method utilizes the posteriority of the coding priori analysis of film source and coded message to correct, and reaches encoder under scene switchings, light sudden change, the complex scene such as to be fade-in fade-out, while enhancing rate distortion performance, reduces the amount of calculation of encoding.
Summary of the invention
The object of the embodiment of the present invention is to propose a kind of coding method based on scene analysis, and be intended to solve prior art encoder under scene switchings, light sudden change, the complex scene such as to be fade-in fade-out, coding efficiency declines, and amount of calculation wastes problem.
The embodiment of the present invention is achieved in that a kind of coding method based on scene analysis, said method comprising the steps of:
Step1: if judge abs (note_prev
t)=4, then change present frame classification and carry out present frame into I frame
Coding, then enters Step5; Otherwise, ask for the running parameter of present frame and consecutive frame;
Step2: if
((abs (par
t-par
t-1)-Thres
1) * (abs (par
t-par
t+1)-Thres
1) <0) or
(note_prev
t%2=0 and note_prev
t≠ 0 and (abs (par
t-par
t+1)-Thres
1) <0) or,
(note_prev
t%2=1 and (abs (par
t-par
t+1)-Thres
1) >0)
Then enter step Step3; Otherwise, enter Step4.
Step3: enter incorgruous tupe;
Step4: enter tupe in the same way;
Step5: whether next coded frame exists, if existed, then enters Step6; Otherwise, terminate;
Step6: if present frame is I frame or note_prev
t+1=3, then directly make temporary mark parameter be 0;
Else if, note_prev
t+1=4, then directly make temporary mark parameter be 1; Otherwise, calculate current
The broad sense I basic block quantity of frame, and obtain temporary mark parameter;
Step7: the next coded frame arranging present frame is present frame, and the posteriority identification parameter arranging present frame equals to represent parameter and note_next temporarily
t=note, then reenters Step1;
Wherein, abs (variable) expression asks absolute value to variable; Note_prev
trepresent the priori analysis identification parameter of present frame; % represents and asks modular arithmetic; Thres
1be the first decision threshold, Thres
1>=10*25/fps, fps represent frame per second; par
code_trepresent code_t two field picture frame
code_trunning parameter, code_t=t-1, t, t+1, code_t is frame
code_tbroadcasting sequence number; Note_prev
t+1represent frame
t+1priori test analysis identification parameter; Note is temporary mark parameter; Note_prev
trepresent the priori analysis identification parameter of present frame, note_next
trepresent the posterior analysis identification parameter of present frame; All priori and posterior analysis identification parameter value before non-assignment is 0.
Further, the running parameter asking for present frame and consecutive frame described in is specially:
par
code_t＝mean(y
code_t(i,j)|y
code_t(i,j)∈region)，
Wherein code_t=t-1, t, t+1; Mean (variable | condition) represent and the variable satisfied condition is averaged; y
code_t(i, j) represents frame
code_tthe monochrome information value of the i-th row jth row; Region represents the spatial dimension that running parameter is asked for, and rounds the region of two field picture or a two field picture certain selected.
Further, further comprising the steps of before step Step1:
Step0: encode to the first frame, then arranging next coded frame is present frame.
Another object of the embodiment of the present invention is to propose a kind of coded system based on scene analysis, and described system comprises:
First judge module, for judging whether abs (note_prev
t)=4, if then enter frame category conversion and coding module; Otherwise, enter running parameter and ask for module;
Running parameter asks for module, for asking for the running parameter of present frame and consecutive frame;
Frame category conversion and coding module, encoding to present frame into I frame for then changing present frame classification, then entering next frame judge module;
Second judge module, for judging whether
((abs (par
t-par
t-1)-Thres
1) * (abs (par
t-par
t+1)-Thres
1) <0) or
(note_prev
t%2=0 and note_prev
t≠ 0 and (abs (par
t-par
t+1)-Thres
1) <0) or
(note_prev
t%2=1 and (abs (par
t-par
t+1)-Thres
1) >0), if then
Enter incorgruous processing unit; Otherwise, enter processing unit in the same way;
Incorgruous processing unit, for whether setting up according to incorgruous decision condition, enters corresponding direction tupe;
Processing unit in the same way, for whether setting up according to decision condition in the same way, enters corresponding direction tupe;
Next frame judge module, for judging whether next coded frame exists, if existed, then enters the 3rd judge module; Otherwise, terminate;
3rd judge module, for judging whether that present frame is I frame or note_prev
t+1=3, if then enter temporary mark parameter setting module; If not, then the 4th judge module is entered;
4th judge module, for judging whether note_prev
t+1=4, if so, then enter temporary mark parameter setting module; Otherwise, then broad sense I basic block number calculating section is entered;
Temporary mark parameter setting module, for the judged result according to the 3rd judge module, if present frame is I frame or note_prev
t+1=3, then make temporary mark parameter be 0; And for the judged result according to the 4th judge module, if note_prev
t+1=4, then make temporary mark parameter be 1, then enter present frame and present frame posteriority identification parameter arranges module;
Broad sense I basic block number calculating section, for calculating the broad sense I basic block quantity of present frame, and obtaining temporary mark parameter, then entering temporary mark parameter acquisition module;
Temporary mark parameter acquisition module, for judging whether that broad sense I basic block quantity is greater than Thres
2* K, if then note=0; Otherwise note=1;
Present frame and present frame posteriority identification parameter arrange module, are present frame for arranging the next coded frame of present frame, and the posteriority identification parameter arranging present frame equals to represent parameter temporarily, then reenters the first judge module;
Wherein, abs (variable) expression asks absolute value to variable; Note_prev
trepresent the priori analysis identification parameter of present frame; % represents and asks modular arithmetic; Thres
1be the first decision threshold, Thres
1>=10*25/fps, fps represent frame per second; par
code_trepresent code_t two field picture frame
code_trunning parameter, code_t=t-1, t, t+1, code_t is frame
code_tbroadcasting sequence number; Note_prev
t+1represent frame
t+1priori test analysis identification parameter, its value before non-assignment is 0; Thres
2be the second decision threshold, 0.8≤Thres
2≤ 1; K represents the basic block number that present frame comprises; Note is temporary mark parameter; Note_prev
trepresent the priori analysis identification parameter of present frame, note_next
trepresent the posterior analysis identification parameter of present frame, first checking and posterior analysis identification parameter value before non-assignment are 0.
Further, described system also comprises:
Present frame arranges module, is connected with the first judge module, and for encoding to the first frame, then arranging next coded frame is present frame.
Beneficial effect of the present invention
The present invention utilizes the posteriority of the coding priori analysis of film source and coded message to correct, and reaches encoder under scene switchings, light sudden change, the complex scene such as to be fade-in fade-out, while enhancing rate distortion performance, reduces the amount of calculation of encoding.
Accompanying drawing explanation
Fig. 1 is a kind of coding method flow chart based on scene analysis of the preferred embodiment of the present invention;
Fig. 2 is incorgruous tupe flow chart in Fig. 1;
Fig. 3 is tupe flow chart in the same way in Fig. 1;
Fig. 4 is a kind of coded system structure chart based on scene analysis of the preferred embodiment of the present invention;
Fig. 5 is incorgruous processing unit structure chart in Fig. 4;
Fig. 6 is the first incorgruous processing module structure chart in Fig. 5;
Fig. 7 is the second incorgruous processing module structure chart in Fig. 5;
Fig. 8 is processing unit structure chart in the same way in Fig. 4;
Fig. 9 is the first processing module structure chart in the same way in Fig. 8;
Figure 10 is the second processing module structure chart in the same way in Fig. 8.
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.
Embodiment of the present invention method utilizes the posteriority of the coding priori analysis of film source and coded message to correct, and reaches encoder under scene switchings, light sudden change, the complex scene such as to be fade-in fade-out, while enhancing rate distortion performance, reduces the amount of calculation of encoding.
Embodiment one
Fig. 1 is a kind of coding method flow chart based on scene analysis of the preferred embodiment of the present invention; Said method comprising the steps of:
Step0: encode to the first frame, then arranging next coded frame is present frame.
Step1: if abs is (note_prev
t)=4, then change present frame classification and encode to present frame into I frame,
Then Step5 is entered; Otherwise, ask for the running parameter of present frame and consecutive frame.
Par
code_t=mean (y
code_t(i, j) | y
code_t(i, j) ∈ region), wherein code_t=t-1, t, t+1;
Wherein, abs (variable) expression asks absolute value to variable; Mean (variable | condition) represent and the variable satisfied condition is averaged; par
code_trepresent code_t two field picture frame
code_trunning parameter, wherein code_t is frame
code_tbroadcasting sequence number, frame
trepresent present frame; Note_prev
trepresent the priori analysis identification parameter of present frame, note_next
trepresent the posterior analysis identification parameter of present frame, first checking and posterior analysis identification parameter value before non-assignment are 0; y
code_t(i, j) represents frame
code_tthe monochrome information value of the i-th row jth row; Region represents the spatial dimension that running parameter is asked for, and generally can round the region of two field picture or a two field picture certain selected.
Step2: if
((abs (par
t-par
t-1)-Thres
1) * (abs (par
t-par
t+1)-Thres
1) <0) or
(note_prev
t%2=0 and note_prev
t≠ 0 and (abs (par
t-par
t+1)-Thres
1) <0) or, then enter
(note_prev
t%2=1 and (abs (par
t-par
t+1)-Thres
1) >0)
Step Step3; Otherwise, enter Step4.
Wherein, % represents and asks modular arithmetic; Thres
1be the first decision threshold, usual Thres
1>=10*25/fps; Fps represents frame per second.
Step3: enter incorgruous tupe (namely whether set up according to incorgruous decision condition, enter corresponding direction tupe).
Be specially: judge whether (abs (par
t-par
t+1)-Thres
1) >0, if so, then enter the first incorgruous tupe (i.e. Step31); Otherwise enter the second incorgruous tupe (i.e. Step32).Fig. 2 is incorgruous tupe flow chart in Fig. 1;
Step31 (the first incorgruous tupe): if note_prev
t≠ 1 or (note_prev
t=1 and accelerate variable equal 1) or present frame be I frame, then enter step Step311; Otherwise enter step Step312.
Step311: first, if carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1; Then conventional rate control operation is carried out to present frame; Then quantization parameter QP is revised
t m=QP
t+ 4+ (note_prev
t==-4? 2:0); Then with amended quantization parameter, present frame is encoded again; And note_prev is set
t+1=4, then enter Step5.
Wherein, (variable==judgment value? value 1: value 2) be conditional operation statement, if represent that variable equals judgment value, then make variable equal value 1 otherwise make variable equal value 2; QP
t, QP
t mthe quantization parameter of present frame, the quantization parameter of amended present frame of representation rate control output respectively.
Step312: first, if carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1, wherein present frame uses frame
t-1when carrying out inter prediction, first to frame
t-1carry out brightness to correct in the same way, make the brightness maxima of present frame, minimum value and frame
t-1brightness maxima, minimum value identical; Then conventional rate control operation is carried out to present frame; Then quantization parameter is revised
QP
t m=QP
t+ 4+ (note_prev
t==-4? 2:0); Then with amended quantization parameter, present frame is encoded again; And note_prev is set
t+1=4, then enter Step5.
Wherein, the method that brightness corrects in the same way can adopt disclosed image brightness process in the industry
Any one method.
Step32 (the second incorgruous tupe): note_prev
t=2 and accelerate variable and equal 0 and present frame is not I frame, then enter Step321; Otherwise enter Step322.
Step321: first, if carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1, wherein, present frame uses frame
t-1when carrying out inter prediction, first to frame
t-1carry out brightness histogram coupling, make frame
t-1luminance Distribution identical with the Luminance Distribution of present frame; Then in the usual way present frame is encoded, note_prev is set
t+1=3, then enter Step5.
Wherein, the method for brightness histogram coupling can adopt disclosed image brightness process any one method in the industry.
Step322: first, restriction predicted current frame pattern is SKIP pattern and intra prediction mode; If carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1; In the usual way present frame is encoded, and note_prev is set
t+1=3, then enter Step5.
Wherein, QP
t, QP
t mrepresent present frame quantization parameter, amended present frame quantization parameter that conventional rate control operation exports respectively; Note_prev
t-1, note_prev
t+1represent frame respectively
t-1, frame
t+1priori test analysis identification parameter, its value before non-assignment is 0; Frame
t-1, frame
t+1represent the previous frame of present frame on playing sequence, the next frame of present frame on playing sequence respectively.
Step4: enter tupe (whether set up according to decision condition in the same way, enter corresponding direction tupe) in the same way.
Be specially: judge whether
if so, the first tupe (i.e. Step41) in the same way is then entered; Otherwise enter the second tupe (i.e. Step42) in the same way.Fig. 3 is tupe flow chart in the same way in Fig. 1;
Step41 (first in the same way tupe): if (abs (par
t-1-par
t+1)-Thres
1* ratio) <0, then enter Step411; Otherwise enter Step412.Wherein, ratio is proportion adjustment parameter, general optional 0<ratio<1.
Step411: if accelerate variable equal 1 or present frame be I frame, then enter step Step412; Otherwise present frame uses frame
t-1(or frame
t+1) when carrying out inter prediction, first to frame
t-1(or frame
t+1) carry out brightness histogram coupling, make frame
t-1(or frame
t+1) Luminance Distribution identical with the Luminance Distribution of present frame, then in the usual way present frame is encoded; And note_prev is set
t-1=2, note_prev
t+1=2; Then Step5 is entered.
Step412: first, restriction predicted current frame pattern is SKIP pattern and intra prediction mode; If carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1; Then conventional rate control operation is carried out to present frame, more then revise quantization parameter QP
t m=QP
t+ 4+ (note_prev
t==-4? 2:0), more then with amended quantization parameter, present frame is encoded, and note_prev is set
t+1=4, note_prev
t-1=-4, then enter Step5.
Step42 (second in the same way tupe): first computation schema critical parameter; Then according to mode decision parameter value, corresponding tupe is entered.If namely mode decision parameter equals 1, then enter step Step421; Otherwise, then Step422 is entered.
Wherein, mode decision calculation method of parameters is as follows:
Steps A: if par
t-1, par
t, par
t+1monotone decreasing or monotonic increase, then enter step B; Otherwise mode decision parameter equals 0.
Step B: calculate localized variation parameter p ar
code_t m=mean (y
code_t(i, j) | y
code_t(i, j) ∈ region
centrt), code_t=t-1, t, t+1 wherein, region
centrtfor localized variation parameter asks for scope, requirement
par
code_t mrepresent code_t two field picture frame
code_tlocalized variation parameter.
Step C: if par
t-1 m, par
t m, par
t+1 mwith par
t-1, par
t, par
t+1monotonicity is consistent, then mode decision parameter equals 1; Otherwise mode decision parameter equals 0.
Step421: if accelerate variable equal 1 or present frame be I frame, then enter step Step422; Otherwise, first, if carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1, wherein, present frame uses frame
t-1(or frame
t+1) when carrying out inter prediction, first to frame
t-1(or frame
t+1) carry out brightness and correct in the same way, make the brightness maxima of present frame, minimum value and frame
t-1(or frame
t+1) brightness maxima, minimum value identical; Then in the usual way present frame is encoded; And note_prev is set
t-1=1, note_prev
t+1=1; Then Step5 is entered.
Step422: encode to present frame, then enters Step5.
Step5: whether next coded frame exists, if existed, then enters Step6; Otherwise, terminate.
Step6: if present frame is I frame or note_prev
t+1=3, then directly make temporary mark parameter be 0;
Else if, note_prev
t+1=4, then directly make temporary mark parameter be 1; Otherwise, calculate the broad sense I basic block quantity of present frame, and obtain temporary mark parameter.
Described " calculating the broad sense I basic block quantity of present frame " is specially:
Number
i=sum (sign (block
k, I)) wherein,
Wherein, sum (variable) expression is sued for peace to variable; Basic sub-block represents that size is less than the block of basic block;
Number
irepresent present frame broad sense I basic block quantity.
Described " obtain temporary mark parameter " be specially into:
If broad sense I basic block quantity is greater than Thres
2* K, then note=0; Otherwise note=1.
Wherein, Thres
2be the second decision threshold, usual 0.8≤Thres
2≤ 1; K represents the basic block number that present frame comprises; Note is temporary mark parameter.
Step7: the next coded frame arranging present frame is present frame, and the posteriority identification parameter arranging present frame equals to represent parameter and note_next temporarily
t=note, then reenters Step1.
Embodiment two
Fig. 4 is a kind of coded system structure chart based on scene analysis of the preferred embodiment of the present invention, and described system comprises:
Present frame arranges module, and for encoding to the first frame, then arranging next coded frame is present frame.
First judge module, for judging whether abs (note_prev
t)=4, if then enter frame category conversion and coding module; Otherwise, enter running parameter and ask for module;
Par
code_t=mean (y
code_t(i, j) | y
code_t(i, j) ∈ region), wherein code_t=t-1, t, t+1;
Wherein, abs (variable) expression asks absolute value to variable; Mean (variable | condition) represent and the variable satisfied condition is averaged; par
code_trepresent code_t two field picture frame
code_trunning parameter, wherein code_t is frame
code_tbroadcasting sequence number, frame
trepresent present frame; Note_prev
trepresent the priori analysis identification parameter of present frame, note_next
trepresent the posterior analysis identification parameter of present frame, above-mentioned value value before non-assignment is 0; y
code_t(i, j) represents frame
code_tthe monochrome information value of the i-th row jth row; Region represents the spatial dimension that running parameter is asked for, and generally can round the region of two field picture or a two field picture certain selected.
Running parameter asks for module, for asking for the running parameter of present frame and consecutive frame.
Frame category conversion and coding module, encoding to present frame into I frame for then changing present frame classification, then entering next frame judge module;
Second judge module, for judging whether
((abs (par
t-par
t-1)-Thres
1) * (abs (par
t-par
t+1)-Thres
1) <0) or
(note_prev
t%2=0 and note_prev
t≠ 0 and (abs (par
t-par
t+1)-Thres
1) <0) or
(note_prev
t%2=1 and (abs (par
t-par
t+1)-Thres
1) >0), if then enter incorgruous processing unit; Otherwise, enter processing unit in the same way.
Wherein, % represents and asks modular arithmetic; Thres
1be the first decision threshold, usual Thres
1>=10*25/fps; Fps represents frame per second.
Incorgruous processing unit, for whether setting up according to incorgruous decision condition, enters corresponding direction tupe;
Processing unit in the same way, for whether setting up according to decision condition in the same way, enters corresponding direction tupe;
Next frame judge module, for judging whether next coded frame exists, if existed, then enters the 3rd judge module; Otherwise, terminate.
3rd judge module, for judging whether that present frame is I frame or note_prev
t+1=3, if then enter temporary mark parameter setting module; If not, then the 4th judge module is entered;
4th judge module, for judging whether note_prev
t+1=4, if so, then enter temporary mark parameter setting module; Otherwise, then broad sense I basic block number calculating section is entered;
Temporary mark parameter setting module, for the judged result according to the 3rd judge module, if present frame is I frame or note_prev
t+1=3, then make temporary mark parameter be 0; And for the judged result according to the 4th judge module, if note_prev
t+1=4, then make temporary mark parameter be 1, then enter present frame and present frame posteriority identification parameter arranges module;
Broad sense I basic block number calculating section, for calculating the broad sense I basic block quantity of present frame, then enters temporary mark parameter acquisition module;
Temporary mark parameter acquisition module, for judging whether that broad sense I basic block quantity is greater than Thres
2* K, if then note=0; Otherwise note=1, then enters present frame and present frame posteriority identification parameter arranges module;
Wherein, Thres
2be the second decision threshold, usual 0.8≤Thres
2≤ 1; K represents the basic block number that present frame comprises; Note is temporary mark parameter.
Present frame and present frame posteriority identification parameter arrange module, are present frame for arranging the next coded frame of present frame, and the posteriority identification parameter arranging present frame equals to represent parameter and note_next temporarily
t=note, then reenters the first judge module.
Further, described incorgruous processing unit also comprises: the 5th judge module, the first incorgruous processing module, the second incorgruous processing module, and Fig. 5 is incorgruous processing unit structure chart in Fig. 4;
5th judge module, for judging whether (abs (par
t-par
t+1)-Thres
1) >0, if then enter the first incorgruous processing module, otherwise enter the second incorgruous processing module;
First incorgruous processing module, comprises the 6th judge module, the first incorgruous process first submodule, the first incorgruous process second submodule, and Fig. 6 is the first incorgruous processing module structure chart in Fig. 5;
6th judge module, for judging whether note_prev
t≠ 1 or (note_prev
t=1 and accelerate variable equal 1) or present frame be I frame, if so, then enter the first incorgruous process first submodule; Otherwise enter the first incorgruous process second submodule;
First incorgruous process first submodule, for first, if carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1; Then conventional rate control operation is carried out to present frame; Then quantization parameter is revised
QP
t m=QP
t+ 4+ (note_prev
t==-4? 2:0); Then with amended quantization parameter, present frame is encoded again; And note_prev is set
t+1=4, then enter next frame judge module.
Wherein, (variable==judgment value? value 1: value 2) be conditional operation statement, if represent that variable equals judgment value, then make variable equal value 1 otherwise make variable equal value 2; QP
t, QP
t mthe quantization parameter of present frame, the quantization parameter of amended present frame of representation rate control output respectively.
First incorgruous process second submodule, for first, if carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1, wherein present frame uses frame
t-1when carrying out inter prediction, first to frame
t-1carry out brightness to correct in the same way, make the brightness maxima of present frame, minimum value and frame
t-1brightness maxima, minimum value identical; Then conventional rate control operation is carried out to present frame; Then quantization parameter QP is revised
t m=QP
t+ 4+ (note_prev
t==-4? 2:0); Then with amended quantization parameter, present frame is encoded again; And note_prev is set
t+1=4, then enter next frame judge module.
Wherein, the method that brightness corrects in the same way can adopt disclosed image brightness process any one method in the industry.
Second incorgruous processing module, comprises the 7th judge module, the second incorgruous process first submodule, the second incorgruous process second submodule, and Fig. 7 is the second incorgruous processing module structure chart in Fig. 5;
7th judge module, for judging whether note_prev
t=2 and accelerate variable and equal 0 and present frame is not I frame, if then enter the second incorgruous process first submodule; Otherwise enter the second incorgruous process second submodule;
Second incorgruous process first submodule, for first, if carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1, wherein, present frame uses frame
t-1when carrying out inter prediction, first to frame
t-1carry out brightness histogram coupling, make frame
t-1luminance Distribution identical with the Luminance Distribution of present frame; Then in the usual way present frame is encoded, note_prev is set
t+1=3, then enter next frame judge module.
Wherein, the method for brightness histogram coupling can adopt disclosed image brightness process any one method in the industry.
Second incorgruous process second submodule, for first, restriction predicted current frame pattern is SKIP pattern and intra prediction mode; If carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1; In the usual way present frame is encoded, and note_prev is set
t+1=3, then enter next frame judge module.
Wherein, QP
t, QP
t mrepresent present frame quantization parameter, amended present frame quantization parameter that conventional rate control operation exports respectively; Note_prev
t-1, note_prev
t+1represent frame respectively
t-1, frame
t+1priori test analysis identification parameter, its value before non-assignment is 0; Frame
t-1, frame
t+1represent the previous frame of present frame on playing sequence, the next frame of present frame on playing sequence respectively.
Further, described processing unit in the same way also comprises: the 8th judge module, first is processing module, second processing module in the same way in the same way, is illustrated in figure 8 processing unit structure chart in the same way;
(abs (par
t-par
t+1)-Thres
1) >0 or
8th judge module, for judging whether (note_prev
t%2=0 and note_prev
t≠ 0) the first processing module in the same way, is if so, then entered; Otherwise enter the second processing module in the same way.
First processing module in the same way, it comprises the 9th judge module, first process in the same way the first submodule,
First processes the second submodule in the same way, and Fig. 9 is the first processing module structure chart in the same way in Fig. 8;
9th judge module, if for judging (abs (par
t-1-par
t+1)-Thres
1* ratio) <0, then enter first and process the first submodule in the same way; Otherwise enter first and process the second submodule in the same way.Wherein, ratio is proportion adjustment parameter, general optional 0<ratio<1.
First processes the first submodule in the same way, if for judge accelerate variable equal 1 or present frame be I frame, then enter first and process the second submodule in the same way; Otherwise present frame uses frame
t-1(or frame
t+1) when carrying out inter prediction, first to frame
t-1(or frame
t+1) carry out brightness histogram coupling, make frame
t-1(or frame
t+1) Luminance Distribution identical with the Luminance Distribution of present frame, then in the usual way present frame is encoded; And note_prev is set
t-1=2, note_prev
t+1=2; Then next frame judge module is entered.
First processes the second submodule in the same way, and first, restriction predicted current frame pattern is SKIP pattern and intra prediction mode; If carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1; Then conventional rate control operation is carried out to present frame, more then revise quantization parameter QP
t m=QP
t+ 4+ (note_prev
t==-4? 2:0), more then with amended quantization parameter, present frame is encoded, and note_prev is set
t+1=4, note_prev
t-1=-4, then enter next frame judge module.
Second processing module in the same way, it comprises mode decision parameter calculating module, the tenth judge module, and second processes the first submodule, second in the same way processes the second submodule in the same way, and Figure 10 is the second processing module structure chart in the same way in Fig. 8;
Mode decision parameter calculating module, for computation schema critical parameter;
Mode decision calculation method of parameters is as follows:
Steps A: if par
t-1, par
t, par
t+1monotone decreasing or monotonic increase, then enter step
Two; Otherwise mode decision parameter equals 0.
Step B: calculate localized variation parameter
Par
code_t m=mean (y
code_t(i, j) | y
code_t(i, j) ∈ region
centrt), code_t=t-1, t, t+1 wherein, region
centrtfor localized variation parameter asks for scope, requirement
par
code_t mrepresent code_t two field picture frame
code_tlocalized variation parameter.
Step C: if par
t-1 m, par
t m, par
t+1 mwith par
t-1, par
t, par
t+1monotonicity is consistent, then mode decision parameter equals 1; Otherwise mode decision parameter equals 0.
Tenth judge module, for judging whether that mode decision parameter equals 1, if then enter second to process the first submodule in the same way; Otherwise, then enter second and process the second submodule in the same way.
Second processes the first submodule in the same way, if for judge accelerate variable equal 1 or present frame be I frame, then enter second and process the second submodule in the same way; Otherwise, first, if carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1, wherein, present frame uses frame
t-1(or frame
t+1) when carrying out inter prediction, first to frame
t-1(or frame
t+1) carry out brightness and correct in the same way, make the brightness maxima of present frame, minimum value and frame
t-1(or frame
t+1) brightness maxima, minimum value identical; Then in the usual way present frame is encoded; And note_prev is set
t-1=1, note_prev
t+1=1; Then next frame judge module is entered.
Second processes the second submodule in the same way, for encoding to present frame, then enters next frame judge module.
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 (17)
1. based on a coding method for scene analysis, it is characterized in that, said method comprising the steps of:
Step1: if judge abs (note_prev
t)=4, then change present frame classification and encode to present frame into I frame, then enter Step5; Otherwise, ask for the running parameter of present frame and consecutive frame;
Step2: if
((abs (par
t-par
t-1)-Thres
1) * (abs (par
t-par
t+1)-Thres
1) <0) or
(note_prev
t%2=0 and note_prev
t≠ 0 and (abs (par
t-par
t+1)-Thres
1) <0) or,
(note_prev
t%2=1 and (abs (par
t-par
t+1)-Thres
1) >0)
Then enter step Step3; Otherwise, enter Step4.
Step3: enter incorgruous tupe;
Step4: enter tupe in the same way;
Step5: whether next coded frame exists, if existed, then enters Step6; Otherwise, terminate;
Step6: if present frame is I frame or note_prev
t+1=3, then directly make temporary mark parameter be 0; Else if, note_prev
t+1=4, then directly make temporary mark parameter be 1; Otherwise, calculate the broad sense I basic block quantity of present frame, and obtain temporary mark parameter;
Step7: the next coded frame arranging present frame is present frame, and the posteriority identification parameter arranging present frame equals to represent parameter and note_next temporarily
t=note, then reenters Step1;
Wherein, abs (variable) expression asks absolute value to variable; Note_prev
trepresent the priori analysis identification parameter of present frame; % represents and asks modular arithmetic; Thres
1be the first decision threshold, Thres
1>=10*25/fps, fps represent frame per second; par
code_trepresent code_t two field picture frame
code_trunning parameter, code_t=t-1, t, t+1, code_t is frame
code_tbroadcasting sequence number; Note_prev
t+1represent frame
t+1priori test analysis identification parameter; Note is temporary mark parameter; Note_prev
trepresent the priori analysis identification parameter of present frame, note_next
trepresent the posterior analysis identification parameter of present frame; All priori and posterior analysis identification parameter value before non-assignment is 0.
2., as claimed in claim 1 based on the coding method of scene analysis, it is characterized in that, described in ask for present frame and consecutive frame running parameter be specially:
par
code_t＝mean(y
code_t(i,j)|y
code_t(i,j)∈region)，
Wherein code_t=t-1, t, t+1; Mean (variable | condition) represent and the variable satisfied condition is averaged; y
code_t(i, j) represents frame
code_tthe monochrome information value of the i-th row jth row; Region represents the spatial dimension that running parameter is asked for, and rounds the region of two field picture or a two field picture certain selected.
3., as claimed in claim 1 based on the coding method of scene analysis, it is characterized in that, further comprising the steps of before step Step1:
Step0: encode to the first frame, then arranging next coded frame is present frame.
4., as claimed in claim 3 based on the coding method of scene analysis, it is characterized in that, described incorgruous tupe is specially:
Judge whether (abs (par
t-par
t+1)-Thres
1) >0, if so, then enter the first incorgruous tupe; Otherwise enter the second incorgruous tupe.
5., as claimed in claim 3 based on the coding method of scene analysis, it is characterized in that, described tupe is in the same way specially: judge whether
if so, the first tupe in the same way is then entered; Otherwise enter the second tupe in the same way.
6., as claimed in claim 4 based on the coding method of scene analysis, it is characterized in that, described first incorgruous tupe is specially:
Judge whether note_prev
t≠ 1 or (note_prev
t=1 and accelerate variable equal 1) or present frame be I frame, if then enter step Step311; Otherwise enter step Step312.
Step311: first, carries out reference frame process, if note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1; Then conventional rate control operation is carried out to present frame; Then quantization parameter QP is revised
t m=QP
t+ 4+ (note_prev
t==-4? 2:0); Then with amended quantization parameter, present frame is encoded again; And note_prev is set
t+1=4, then enter Step5.
Wherein, (variable==judgment value? value 1: value 2) be conditional operation statement, if represent that variable equals judgment value, then make variable equal value 1 otherwise make variable equal value 2; QP
t, QP
t mthe quantization parameter of present frame, the quantization parameter of amended present frame of representation rate control output respectively.
Step312: first, carries out reference frame process, if note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1, wherein present frame uses frame
t-1when carrying out inter prediction, first to frame
t-1carry out brightness to correct in the same way, make the brightness maxima of present frame, minimum value and frame
t-1brightness maxima, minimum value identical; Then conventional rate control operation is carried out to present frame; Then quantization parameter QP is revised
t m=QP
t+ 4+ (note_prev
t==-4? 2:0); Then with amended quantization parameter, present frame is encoded again; And note_prev is set
t+1=4, then enter Step5;
Wherein, QP
t, QP
t mrepresent present frame quantization parameter, amended present frame quantization parameter that conventional rate control operation exports respectively; Note_prev
t-1represent frame
t-1priori test analysis identification parameter, its value before non-assignment is 0; Frame
t-1, frame
t+1represent the previous frame of present frame on playing sequence, the next frame of present frame on playing sequence respectively.
7., as claimed in claim 4 based on the coding method of scene analysis, it is characterized in that, described second incorgruous tupe is specially:
Judge whether note_prev
t=2 and accelerate variable and equal 0 and present frame is not I frame, if then enter Step321; Otherwise enter Step322.
Step321: first, carries out reference frame process, if note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1, wherein, present frame uses frame
t-1when carrying out inter prediction, first to frame
t-1carry out brightness histogram coupling, make frame
t-1luminance Distribution identical with the Luminance Distribution of present frame; Then in the usual way present frame is encoded, note_prev is set
t+1=3, then enter Step5.
Step322: first, restriction predicted current frame pattern is SKIP pattern and intra prediction mode; If carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1; In the usual way present frame is encoded, and note_prev is set
t+1=3, then enter Step5.
8., as claimed in claim 5 based on the coding method of scene analysis, it is characterized in that, described first in the same way tupe be specially:
Judge whether (abs (par
t-1-par
t+1)-Thres
1* ratio) <0, if then enter Step411; Otherwise enter Step412;
Step411: if accelerate variable equal 1 or present frame be I frame, then enter step Step412; Otherwise present frame uses frame
t-1or frame
t+1when carrying out inter prediction, first to frame
t-1or frame
t+1carry out brightness histogram coupling, make frame
t-1or frame
t+1luminance Distribution identical with the Luminance Distribution of present frame, then in the usual way present frame is encoded; And note_prev is set
t-1=2, note_prev
t+1=2; Then Step5 is entered;
Step412: first, restriction predicted current frame pattern is SKIP pattern and intra prediction mode; If carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1; Then conventional rate control operation is carried out to present frame, more then revise quantization parameter QP
t m=QP
t+ 4+ (note_prev
t==-4? 2:0), more then with amended quantization parameter, present frame is encoded, and note_prev is set
t+1=4, note_prev
t-1=-4, then enter Step5;
Wherein, frame
trepresent present frame; Ratio is proportion adjustment parameter, 0<ratio<1.
9., as claimed in claim 5 based on the coding method of scene analysis, it is characterized in that, described second in the same way tupe be specially:
First computation schema critical parameter; Then judge whether that mode decision parameter equals 1, if then enter step Step421; Otherwise, then Step422 is entered.
Step421: if accelerate variable equal 1 or present frame be I frame, then enter step Step422; Otherwise, first, if carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1, wherein, present frame uses frame
t-1or frame
t+1when carrying out inter prediction, first to frame
t-1or frame
t+1carry out brightness to correct in the same way, make the brightness maxima of present frame, minimum value and frame
t-1or frame
t+1brightness maxima, minimum value identical; Then in the usual way present frame is encoded; And note_prev is set
t-1=1, note_prev
t+1=1; Then step Step5 is entered.
Step422: encode to present frame, then enters Step5.
10., as claimed in claim 9 based on the coding method of scene analysis, it is characterized in that,
Described mode decision calculation method of parameters is as follows:
Steps A: if par
t-1, par
t, par
t+1monotone decreasing or monotonic increase, then enter step B; Otherwise mode decision parameter equals 0;
Step B: calculate localized variation parameter
par
code_t m＝mean(y
code_t(i,j)|y
code_t(i,j)∈region
centrt)，code_t＝t-1、t、t+1
Wherein, region
centrtfor localized variation parameter asks for scope, ask
par
code_t mrepresent code_t two field picture frame
code_tlocalized variation parameter;
Step C: if par
t-1 m, par
t m, par
t+1 mwith par
t-1, par
t, par
t+1monotonicity is consistent, then mode decision parameter equals 1; Otherwise mode decision parameter equals 0.
11., as claimed in claim 3 based on the coding method of scene analysis, is characterized in that,
Described " otherwise, calculate the broad sense I basic block quantity of present frame, and obtain temporary mark parameter " in, the computational methods of described " broad sense I basic block quantity " are:
Number
i=sum (sign (block
k, I)) wherein,
Described " otherwise, calculate the broad sense I basic block quantity of present frame, and obtain temporary mark parameter " in, the computational methods of described " and obtaining temporary mark parameter " are:
If broad sense I basic block quantity is greater than Thres
2* K, then note=0; Otherwise note=1.
Wherein, sum (variable) expression is sued for peace to variable; Basic sub-block represents that size is less than the block of basic block; Number
irepresent present frame broad sense I basic block quantity; Thres
2be the second decision threshold, 0.8≤Thres
2≤ 1; K represents the basic block number that present frame comprises; Note is temporary mark parameter.
12. 1 kinds, based on the coded system of scene analysis, is characterized in that, described system comprises:
First judge module, for judging whether abs (note_prev
t)=4, if then enter frame category conversion and coding module; Otherwise, enter running parameter and ask for module;
Running parameter asks for module, for asking for the running parameter of present frame and consecutive frame;
Frame category conversion and coding module, encoding to present frame into I frame for then changing present frame classification, then entering next frame judge module;
Second judge module, for judging whether
((abs (par
t-par
t-1)-Thres
1) * (abs (par
t-par
t+1)-Thres
1) <0) or
(note_prev
t%2=0 and note_prev
t≠ 0 and (abs (par
t-par
t+1)-Thres
1) <0) or
(note_prev
t%2=1 and (abs (par
t-par
t+1)-Thres
1) >0), if then enter incorgruous processing unit; Otherwise, enter processing unit in the same way;
Incorgruous processing unit, for whether setting up according to incorgruous decision condition, enters corresponding direction tupe;
Processing unit in the same way, for whether setting up according to decision condition in the same way, enters corresponding direction tupe;
Next frame judge module, for judging whether next coded frame exists, if existed, then enters the 3rd judge module; Otherwise, terminate;
3rd judge module, for judging whether that present frame is I frame or note_prev
t+1=3, if then enter temporary mark parameter setting module; If not, then the 4th judge module is entered;
4th judge module, for judging whether note_prev
t+1=4, if so, then enter temporary mark parameter setting module; Otherwise, then broad sense I basic block number calculating section is entered;
Temporary mark parameter setting module, for the judged result according to the 3rd judge module, if present frame is I frame or note_prev
t+1=3, then make temporary mark parameter be 0; And for the judged result according to the 4th judge module, if note_prev
t+1=4, then make temporary mark parameter be 1, then enter present frame and present frame posteriority identification parameter arranges module;
Broad sense I basic block number calculating section, for calculating the broad sense I basic block quantity of present frame, and obtaining temporary mark parameter, then entering temporary mark parameter acquisition module;
Temporary mark parameter acquisition module, for judging whether that broad sense I basic block quantity is greater than Thres
2* K, if then note=0; Otherwise note=1;
Present frame and present frame posteriority identification parameter arrange module, are present frame for arranging the next coded frame of present frame, and the posteriority identification parameter arranging present frame equals to represent parameter temporarily, then reenters the first judge module;
Wherein, abs (variable) expression asks absolute value to variable; Note_prev
trepresent the priori analysis identification parameter of present frame; % represents and asks modular arithmetic; Thres
1be the first decision threshold, Thres
1>=10*25/fps, fps represent frame per second; par
code_trepresent code_t two field picture frame
code_trunning parameter, code_t=t-1, t, t+1, code_t is frame
code_tbroadcasting sequence number; Note_prev
t+1represent frame
t+1priori test analysis identification parameter, its value before non-assignment is 0; Thres
2be the second decision threshold, 0.8≤Thres
2≤ 1; K represents the basic block number that present frame comprises; Note is temporary mark parameter; Note_prev
trepresent the priori analysis identification parameter of present frame, note_next
trepresent the posterior analysis identification parameter of present frame, first checking and posterior analysis identification parameter value before non-assignment are 0.
13. as claimed in claim 12 based on the coded system of scene analysis, and it is characterized in that, described system also comprises:
Present frame arranges module, is connected with the first judge module, and for encoding to the first frame, then arranging next coded frame is present frame.
14., as claimed in claim 13 based on the coded system of scene analysis, is characterized in that,
Incorgruous processing unit also comprises: the 5th judge module, the first incorgruous processing module, the second incorgruous processing module,
5th judge module, for judging whether (abs (par
t-par
t+1)-Thres
1) >0, if then enter the first incorgruous processing module, otherwise enter the second incorgruous processing module.
15., as claimed in claim 13 based on the coded system of scene analysis, is characterized in that,
Described processing unit in the same way also comprises: the 8th judge module, first is processing module, second processing module in the same way in the same way,
8th judge module, for judging whether
if so, the first processing module in the same way is then entered; Otherwise enter the second processing module in the same way.
16., as claimed in claim 14 based on the coded system of scene analysis, is characterized in that,
First incorgruous processing module, comprises the 6th judge module, the first incorgruous process first submodule, the first incorgruous process second submodule,
6th judge module, for judging whether note_prev
t≠ 1 or (note_prev
t=1 and accelerate variable equal 1) or present frame be I frame, if so, then enter the first incorgruous process first submodule; Otherwise enter the first incorgruous process second submodule;
First incorgruous process first submodule, for first, carries out reference frame process, if note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1; Then conventional rate control operation is carried out to present frame; Then quantization parameter QP is revised
t m=QP
t+ 4+ (note_prev
t==-4? 2:0); Then with amended quantization parameter, present frame is encoded again; And note_prev is set
t+1=4, then enter next frame judge module;
First incorgruous process second submodule, for first, carries out reference frame process, if note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1, wherein present frame uses frame
t-1when carrying out inter prediction, first to frame
t-1carry out brightness to correct in the same way, make the brightness maxima of present frame, minimum value and frame
t-1brightness maxima, minimum value identical; Then conventional rate control operation is carried out to present frame; Then quantization parameter QP is revised
t m=QP
t+ 4+ (note_prev
t==-4? 2:0); Then with amended quantization parameter, present frame is encoded again; And note_prev is set
t+1=4, then enter next frame judge module;
Wherein, (variable==judgment value? value 1: value 2) be conditional operation statement, if represent that variable equals judgment value, then make variable equal value 1 otherwise make variable equal value 2; QP
t, QP
t mthe quantization parameter of present frame, the quantization parameter of amended present frame of representation rate control output respectively;
Second incorgruous processing module, comprises the 7th judge module, the second incorgruous process first submodule, the second incorgruous process second submodule,
7th judge module, for judging whether note_prev
t=2 and accelerate variable and equal 0 and present frame is not I frame, if then enter the second incorgruous process first submodule; Otherwise enter the second incorgruous process second submodule;
Second incorgruous process first submodule, for first, carries out reference frame process, if note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1, wherein, present frame uses frame
t-1when carrying out inter prediction, first to frame
t-1carry out brightness histogram coupling, make frame
t-1luminance Distribution identical with the Luminance Distribution of present frame; Then in the usual way present frame is encoded, note_prev is set
t+1=3, then enter next frame judge module;
Second incorgruous process second submodule is SKIP pattern and intra prediction mode for first limiting predicted current frame pattern; If carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1; In the usual way present frame is encoded, and note_prev is set
t+1=3, then enter next frame judge module;
Wherein, QP
t, QP
t mrepresent present frame quantization parameter, amended present frame quantization parameter that conventional rate control operation exports respectively; Note_prev
t-1, note_prev
t+1represent frame respectively
t-1, frame
t+1priori test analysis identification parameter, its value before non-assignment is 0; Frame
t-1, frame
t+1represent the previous frame of present frame on playing sequence, the next frame of present frame on playing sequence respectively.
17., as claimed in claim 15 based on the coded system of scene analysis, is characterized in that,
First processing module in the same way, it comprises the 9th judge module, and first processes the first submodule, first in the same way processes the second submodule in the same way,
9th judge module, if for judging (abs (par
t-1-par
t+1)-Thres
1* ratio) <0, then enter first and process the first submodule in the same way; Otherwise enter first and process the second submodule in the same way; Wherein, ratio is proportion adjustment parameter, 0<ratio<1;
First processes the first submodule in the same way, if for judge accelerate variable equal 1 or present frame be I frame, then enter first and process the second submodule in the same way; Otherwise present frame uses frame
t-1or frame
t+1when carrying out inter prediction, first to frame
t-1or frame
t+1carry out brightness histogram coupling, make frame
t-1or frame
t+1luminance Distribution identical with the Luminance Distribution of present frame, then in the usual way present frame is encoded; And note_prev is set
t-1=2, note_prev
t+1=2; Then next frame judge module is entered;
First processes the second submodule in the same way, is SKIP pattern and intra prediction mode for first limiting predicted current frame pattern; If carry out reference frame process i.e. note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1; Then conventional rate control operation is carried out to present frame, more then revise quantization parameter QP
t m=QP
t+ 4+ (note_prev
t==-4? 2:0), more then with amended quantization parameter, present frame is encoded, and note_prev is set
t+1=4, note_prev
t-1=-4, then enter next frame judge module;
Second processing module in the same way, it comprises mode decision parameter calculating module, the tenth judge module, and second processes the first submodule, second in the same way processes the second submodule in the same way,
Mode decision parameter calculating module, for computation schema critical parameter;
Tenth judge module, for judging whether that mode decision parameter equals 1, if then enter second to process the first submodule in the same way; Otherwise, then enter second and process the second submodule in the same way;
Second processes the first submodule in the same way, if for judge accelerate variable equal 1 or present frame be I frame, then enter second and process the second submodule in the same way; Otherwise, first, carry out reference frame process, if note_next
tdelete all broadcasting sequence numbers in reference listing for=0 and be less than the reference frame of t-1, wherein, present frame uses frame
t-1or frame
t+1when carrying out inter prediction, first to frame
t-1or frame
t+1carry out brightness to correct in the same way, make the brightness maxima of present frame, minimum value and frame
t-1or frame
t+1brightness maxima, minimum value identical; Then in the usual way present frame is encoded; And note_prev is set
t-1=1, note_prev
t+1=1; Then next frame judge module is entered
Second processes the second submodule in the same way, for encoding to present frame, then enters next frame judge module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410720005.1A CN104581155A (en) | 2014-12-02 | 2014-12-02 | Scenario-analysis-based coding method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410720005.1A CN104581155A (en) | 2014-12-02 | 2014-12-02 | Scenario-analysis-based coding method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104581155A true CN104581155A (en) | 2015-04-29 |
Family
ID=53096223
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410720005.1A Pending CN104581155A (en) | 2014-12-02 | 2014-12-02 | Scenario-analysis-based coding method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104581155A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105657424A (en) * | 2015-12-30 | 2016-06-08 | 深圳市云宙多媒体技术有限公司 | Method and system for coding chroma of movie scene |
| CN106683047A (en) * | 2016-11-16 | 2017-05-17 | 深圳百科信息技术有限公司 | Panoramic image illumination compensation method and system |
| CN112019849A (en) * | 2020-09-11 | 2020-12-01 | 深圳市梦网视讯有限公司 | Method, system and equipment for rapidly analyzing prediction mode |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6094457A (en) * | 1996-12-31 | 2000-07-25 | C-Cube Microsystems, Inc. | Statistical multiplexed video encoding using pre-encoding a priori statistics and a priori and a posteriori statistics |
| CN1902938A (en) * | 2004-01-05 | 2007-01-24 | 皇家飞利浦电子股份有限公司 | Processing method and device using scene change detection |
| CN101742319A (en) * | 2010-01-15 | 2010-06-16 | 北京大学 | Background modeling-based static camera video compression method and background modeling-based static camera video compression system |
| CN102055977A (en) * | 2009-11-06 | 2011-05-11 | 三星电子株式会社 | Fast motion estimation methods using multiple reference frames |
-
2014
- 2014-12-02 CN CN201410720005.1A patent/CN104581155A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6094457A (en) * | 1996-12-31 | 2000-07-25 | C-Cube Microsystems, Inc. | Statistical multiplexed video encoding using pre-encoding a priori statistics and a priori and a posteriori statistics |
| CN1902938A (en) * | 2004-01-05 | 2007-01-24 | 皇家飞利浦电子股份有限公司 | Processing method and device using scene change detection |
| CN102055977A (en) * | 2009-11-06 | 2011-05-11 | 三星电子株式会社 | Fast motion estimation methods using multiple reference frames |
| CN101742319A (en) * | 2010-01-15 | 2010-06-16 | 北京大学 | Background modeling-based static camera video compression method and background modeling-based static camera video compression system |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105657424A (en) * | 2015-12-30 | 2016-06-08 | 深圳市云宙多媒体技术有限公司 | Method and system for coding chroma of movie scene |
| CN106683047A (en) * | 2016-11-16 | 2017-05-17 | 深圳百科信息技术有限公司 | Panoramic image illumination compensation method and system |
| CN106683047B (en) * | 2016-11-16 | 2020-05-22 | 深圳市梦网视讯有限公司 | Illumination compensation method and system for panoramic image |
| CN112019849A (en) * | 2020-09-11 | 2020-12-01 | 深圳市梦网视讯有限公司 | Method, system and equipment for rapidly analyzing prediction mode |
| CN112019849B (en) * | 2020-09-11 | 2022-10-04 | 深圳市梦网视讯有限公司 | Method, system and equipment for rapidly analyzing prediction mode |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7031387B2 (en) | B picture mode determining method and apparatus in video coding system | |
| CN101321287B (en) | Video encoding method based on movement object detection | |
| CN1926863B (en) | Multi-pass video encoding method | |
| JP2008504750A5 (en) | ||
| US20200007872A1 (en) | Video decoding method, video decoder, video encoding method and video encoder | |
| CN101779469A (en) | Image processing device, and image processing method | |
| US20120207219A1 (en) | Picture encoding apparatus, picture encoding method, and program | |
| CN100574447C (en) | Fast intraframe predicting mode selecting method based on the AVS video coding | |
| US20140334541A1 (en) | Video compression device | |
| CN104052998A (en) | GOP layer ratio control and adjustment method and system based on exercise intensity | |
| CN103747258A (en) | Encryption processing method for high-performance video coding standard | |
| CN104581155A (en) | Scenario-analysis-based coding method and system | |
| CN107105240B (en) | HEVC-SCC complexity control method and system | |
| CN105049853A (en) | SAO coding method and system based on fragment source analysis | |
| CN103327329B (en) | Method and system for quantitative adjustment of image quality jump | |
| CN104104947B (en) | A kind of method for video coding and device | |
| CN101742323B (en) | Method and device for coding and decoding re-loss-free video | |
| CN103002284B (en) | A kind of video coding-decoding method based on model of place adaptive updates | |
| CN101651831B (en) | Method and apparatus for improved coding mode selection | |
| CN103281532A (en) | Quantification adjustment method and system based on exercise intensity detection | |
| CN100531377C (en) | Image processing device and image processing method | |
| CN110636330B (en) | Film source scene complexity analysis method and system based on compressed information | |
| CN102300096A (en) | Frame type detection method and frame type detection system | |
| CN116762339A (en) | Illumination compensation method, encoder, decoder and storage medium | |
| CN103237225B (en) | YUV is utilized to combine the method revising coding and decoding video error with rgb space |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20150429 |