Mercurial > libavcodec.hg
annotate ratecontrol.c @ 5374:eb7a01d0fe2c libavcodec
cosmetics: indentation
author | jbr |
---|---|
date | Thu, 19 Jul 2007 00:51:19 +0000 |
parents | d71791d72286 |
children | 20bea6a9950c |
rev | line source |
---|---|
329 | 1 /* |
428 | 2 * Rate control for video encoders |
3 * | |
1739
07a484280a82
copyright year update of the files i touched and remembered, things look annoyingly unmaintained otherwise
michael
parents:
1708
diff
changeset
|
4 * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at> |
428 | 5 * |
3947
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3789
diff
changeset
|
6 * This file is part of FFmpeg. |
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3789
diff
changeset
|
7 * |
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3789
diff
changeset
|
8 * FFmpeg is free software; you can redistribute it and/or |
428 | 9 * modify it under the terms of the GNU Lesser General Public |
10 * License as published by the Free Software Foundation; either | |
3947
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3789
diff
changeset
|
11 * version 2.1 of the License, or (at your option) any later version. |
428 | 12 * |
3947
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3789
diff
changeset
|
13 * FFmpeg is distributed in the hope that it will be useful, |
428 | 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
16 * Lesser General Public License for more details. | |
17 * | |
18 * You should have received a copy of the GNU Lesser General Public | |
3947
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3789
diff
changeset
|
19 * License along with FFmpeg; if not, write to the Free Software |
3036
0b546eab515d
Update licensing information: The FSF changed postal address.
diego
parents:
2981
diff
changeset
|
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
428 | 21 */ |
1106 | 22 |
23 /** | |
24 * @file ratecontrol.c | |
25 * Rate control for video encoders. | |
2967 | 26 */ |
1106 | 27 |
329 | 28 #include "avcodec.h" |
428 | 29 #include "dsputil.h" |
3789
730ad999e379
Move the ratecontrol related code from mpegvideo.h to a separate header file.
takis
parents:
3786
diff
changeset
|
30 #include "ratecontrol.h" |
329 | 31 #include "mpegvideo.h" |
3786
616a81d04758
Pull out the ff_eval* from the mpegvideo header, as it doesn't belong there and
takis
parents:
3775
diff
changeset
|
32 #include "eval.h" |
329 | 33 |
4795 | 34 #undef NDEBUG // Always check asserts, the speed effect is far too small to disable them. |
612 | 35 #include <assert.h> |
329 | 36 |
627 | 37 #ifndef M_E |
38 #define M_E 2.718281828 | |
39 #endif | |
40 | |
329 | 41 static int init_pass2(MpegEncContext *s); |
612 | 42 static double get_qscale(MpegEncContext *s, RateControlEntry *rce, double rate_factor, int frame_num); |
329 | 43 |
44 void ff_write_pass1_stats(MpegEncContext *s){ | |
3064 | 45 snprintf(s->avctx->stats_out, 256, "in:%d out:%d type:%d q:%d itex:%d ptex:%d mv:%d misc:%d fcode:%d bcode:%d mc-var:%d var:%d icount:%d skipcount:%d hbits:%d;\n", |
2967 | 46 s->current_picture_ptr->display_picture_number, s->current_picture_ptr->coded_picture_number, s->pict_type, |
47 s->current_picture.quality, s->i_tex_bits, s->p_tex_bits, s->mv_bits, s->misc_bits, | |
3064 | 48 s->f_code, s->b_code, s->current_picture.mc_mb_var_sum, s->current_picture.mb_var_sum, s->i_count, s->skip_count, s->header_bits); |
329 | 49 } |
50 | |
4084 | 51 static inline double qp2bits(RateControlEntry *rce, double qp){ |
52 if(qp<=0.0){ | |
53 av_log(NULL, AV_LOG_ERROR, "qp<=0.0\n"); | |
54 } | |
55 return rce->qscale * (double)(rce->i_tex_bits + rce->p_tex_bits+1)/ qp; | |
56 } | |
57 | |
58 static inline double bits2qp(RateControlEntry *rce, double bits){ | |
59 if(bits<0.9){ | |
60 av_log(NULL, AV_LOG_ERROR, "bits<0.9\n"); | |
61 } | |
62 return rce->qscale * (double)(rce->i_tex_bits + rce->p_tex_bits+1)/ bits; | |
63 } | |
64 | |
329 | 65 int ff_rate_control_init(MpegEncContext *s) |
66 { | |
67 RateControlContext *rcc= &s->rc_context; | |
612 | 68 int i; |
4084 | 69 char *error = NULL; |
70 static const char *const_names[]={ | |
71 "PI", | |
72 "E", | |
73 "iTex", | |
74 "pTex", | |
75 "tex", | |
76 "mv", | |
77 "fCode", | |
78 "iCount", | |
79 "mcVar", | |
80 "var", | |
81 "isI", | |
82 "isP", | |
83 "isB", | |
84 "avgQP", | |
85 "qComp", | |
86 /* "lastIQP", | |
87 "lastPQP", | |
88 "lastBQP", | |
89 "nextNonBQP",*/ | |
90 "avgIITex", | |
91 "avgPITex", | |
92 "avgPPTex", | |
93 "avgBPTex", | |
94 "avgTex", | |
95 NULL | |
96 }; | |
97 static double (*func1[])(void *, double)={ | |
98 (void *)bits2qp, | |
99 (void *)qp2bits, | |
100 NULL | |
101 }; | |
102 static const char *func1_names[]={ | |
103 "bits2qp", | |
104 "qp2bits", | |
105 NULL | |
106 }; | |
329 | 107 emms_c(); |
108 | |
4084 | 109 rcc->rc_eq_eval = ff_parse(s->avctx->rc_eq, const_names, func1, func1_names, NULL, NULL, &error); |
110 if (!rcc->rc_eq_eval) { | |
111 av_log(s->avctx, AV_LOG_ERROR, "Error parsing rc_eq \"%s\": %s\n", s->avctx->rc_eq, error? error : ""); | |
112 return -1; | |
113 } | |
114 | |
612 | 115 for(i=0; i<5; i++){ |
1505
010f76d07a27
use lagrange multipler instead of qp for ratecontrol, this may break some things, tell me ASAP if u notice anything broken
michaelni
parents:
1455
diff
changeset
|
116 rcc->pred[i].coeff= FF_QP2LAMBDA * 7.0; |
612 | 117 rcc->pred[i].count= 1.0; |
2967 | 118 |
612 | 119 rcc->pred[i].decay= 0.4; |
120 rcc->i_cplx_sum [i]= | |
121 rcc->p_cplx_sum [i]= | |
122 rcc->mv_bits_sum[i]= | |
123 rcc->qscale_sum [i]= | |
124 rcc->frame_count[i]= 1; // 1 is better cuz of 1/0 and such | |
1505
010f76d07a27
use lagrange multipler instead of qp for ratecontrol, this may break some things, tell me ASAP if u notice anything broken
michaelni
parents:
1455
diff
changeset
|
125 rcc->last_qscale_for[i]=FF_QP2LAMBDA * 5; |
612 | 126 } |
1683 | 127 rcc->buffer_index= s->avctx->rc_initial_buffer_occupancy; |
612 | 128 |
129 if(s->flags&CODEC_FLAG_PASS2){ | |
329 | 130 int i; |
612 | 131 char *p; |
329 | 132 |
612 | 133 /* find number of pics */ |
134 p= s->avctx->stats_in; | |
135 for(i=-1; p; i++){ | |
136 p= strchr(p+1, ';'); | |
329 | 137 } |
612 | 138 i+= s->max_b_frames; |
2422 | 139 if(i<=0 || i>=INT_MAX / sizeof(RateControlEntry)) |
140 return -1; | |
612 | 141 rcc->entry = (RateControlEntry*)av_mallocz(i*sizeof(RateControlEntry)); |
142 rcc->num_entries= i; | |
2967 | 143 |
2628
511e3afc43e1
Ministry of English Composition, reporting for duty (and the word is "skipped", not "skiped"; "skiped" would rhyme with "hyped")
melanson
parents:
2494
diff
changeset
|
144 /* init all to skipped p frames (with b frames we might have a not encoded frame at the end FIXME) */ |
612 | 145 for(i=0; i<rcc->num_entries; i++){ |
146 RateControlEntry *rce= &rcc->entry[i]; | |
147 rce->pict_type= rce->new_pict_type=P_TYPE; | |
1505
010f76d07a27
use lagrange multipler instead of qp for ratecontrol, this may break some things, tell me ASAP if u notice anything broken
michaelni
parents:
1455
diff
changeset
|
148 rce->qscale= rce->new_qscale=FF_QP2LAMBDA * 2; |
612 | 149 rce->misc_bits= s->mb_num + 10; |
150 rce->mb_var_sum= s->mb_num*100; | |
2967 | 151 } |
152 | |
612 | 153 /* read stats */ |
154 p= s->avctx->stats_in; | |
155 for(i=0; i<rcc->num_entries - s->max_b_frames; i++){ | |
329 | 156 RateControlEntry *rce; |
157 int picture_number; | |
158 int e; | |
612 | 159 char *next; |
160 | |
161 next= strchr(p, ';'); | |
162 if(next){ | |
5127 | 163 (*next)=0; //sscanf in unbelievably slow on looong strings //FIXME copy / do not write |
612 | 164 next++; |
165 } | |
166 e= sscanf(p, " in:%d ", &picture_number); | |
167 | |
168 assert(picture_number >= 0); | |
169 assert(picture_number < rcc->num_entries); | |
329 | 170 rce= &rcc->entry[picture_number]; |
612 | 171 |
3064 | 172 e+=sscanf(p, " in:%*d out:%*d type:%d q:%f itex:%d ptex:%d mv:%d misc:%d fcode:%d bcode:%d mc-var:%d var:%d icount:%d skipcount:%d hbits:%d", |
2967 | 173 &rce->pict_type, &rce->qscale, &rce->i_tex_bits, &rce->p_tex_bits, &rce->mv_bits, &rce->misc_bits, |
3064 | 174 &rce->f_code, &rce->b_code, &rce->mc_mb_var_sum, &rce->mb_var_sum, &rce->i_count, &rce->skip_count, &rce->header_bits); |
175 if(e!=14){ | |
1598
932d306bf1dc
av_log() patch by (Michel Bardiaux <mbardiaux at peaktime dot be>)
michael
parents:
1505
diff
changeset
|
176 av_log(s->avctx, AV_LOG_ERROR, "statistics are damaged at line %d, parser out=%d\n", i, e); |
329 | 177 return -1; |
178 } | |
3064 | 179 |
612 | 180 p= next; |
329 | 181 } |
3203 | 182 |
183 if(init_pass2(s) < 0) return -1; | |
184 | |
3200
646f6344472d
make ff_rate_control_init() bail out if rc_strategy==1 and lavc wasn't
corey
parents:
3065
diff
changeset
|
185 //FIXME maybe move to end |
646f6344472d
make ff_rate_control_init() bail out if rc_strategy==1 and lavc wasn't
corey
parents:
3065
diff
changeset
|
186 if((s->flags&CODEC_FLAG_PASS2) && s->avctx->rc_strategy == FF_RC_STRATEGY_XVID) { |
5203 | 187 #ifdef CONFIG_LIBXVID |
3064 | 188 return ff_xvid_rate_control_init(s); |
3200
646f6344472d
make ff_rate_control_init() bail out if rc_strategy==1 and lavc wasn't
corey
parents:
3065
diff
changeset
|
189 #else |
646f6344472d
make ff_rate_control_init() bail out if rc_strategy==1 and lavc wasn't
corey
parents:
3065
diff
changeset
|
190 av_log(s->avctx, AV_LOG_ERROR, "XviD ratecontrol requires libavcodec compiled with XviD support\n"); |
646f6344472d
make ff_rate_control_init() bail out if rc_strategy==1 and lavc wasn't
corey
parents:
3065
diff
changeset
|
191 return -1; |
3065 | 192 #endif |
3200
646f6344472d
make ff_rate_control_init() bail out if rc_strategy==1 and lavc wasn't
corey
parents:
3065
diff
changeset
|
193 } |
329 | 194 } |
2967 | 195 |
612 | 196 if(!(s->flags&CODEC_FLAG_PASS2)){ |
197 | |
198 rcc->short_term_qsum=0.001; | |
199 rcc->short_term_qcount=0.001; | |
2967 | 200 |
707 | 201 rcc->pass1_rc_eq_output_sum= 0.001; |
612 | 202 rcc->pass1_wanted_bits=0.001; |
2967 | 203 |
5087
6c7f4ece59ed
check qblur > 1 (prevent assert failure / segfault)
michael
parents:
4795
diff
changeset
|
204 if(s->avctx->qblur > 1.0){ |
6c7f4ece59ed
check qblur > 1 (prevent assert failure / segfault)
michael
parents:
4795
diff
changeset
|
205 av_log(s->avctx, AV_LOG_ERROR, "qblur too large\n"); |
6c7f4ece59ed
check qblur > 1 (prevent assert failure / segfault)
michael
parents:
4795
diff
changeset
|
206 return -1; |
6c7f4ece59ed
check qblur > 1 (prevent assert failure / segfault)
michael
parents:
4795
diff
changeset
|
207 } |
612 | 208 /* init stuff with the user specified complexity */ |
209 if(s->avctx->rc_initial_cplx){ | |
210 for(i=0; i<60*30; i++){ | |
211 double bits= s->avctx->rc_initial_cplx * (i/10000.0 + 1.0)*s->mb_num; | |
212 RateControlEntry rce; | |
213 double q; | |
2967 | 214 |
612 | 215 if (i%((s->gop_size+3)/4)==0) rce.pict_type= I_TYPE; |
216 else if(i%(s->max_b_frames+1)) rce.pict_type= B_TYPE; | |
217 else rce.pict_type= P_TYPE; | |
218 | |
219 rce.new_pict_type= rce.pict_type; | |
220 rce.mc_mb_var_sum= bits*s->mb_num/100000; | |
221 rce.mb_var_sum = s->mb_num; | |
1505
010f76d07a27
use lagrange multipler instead of qp for ratecontrol, this may break some things, tell me ASAP if u notice anything broken
michaelni
parents:
1455
diff
changeset
|
222 rce.qscale = FF_QP2LAMBDA * 2; |
612 | 223 rce.f_code = 2; |
224 rce.b_code = 1; | |
225 rce.misc_bits= 1; | |
329 | 226 |
612 | 227 if(s->pict_type== I_TYPE){ |
228 rce.i_count = s->mb_num; | |
229 rce.i_tex_bits= bits; | |
230 rce.p_tex_bits= 0; | |
231 rce.mv_bits= 0; | |
232 }else{ | |
233 rce.i_count = 0; //FIXME we do know this approx | |
234 rce.i_tex_bits= 0; | |
235 rce.p_tex_bits= bits*0.9; | |
236 rce.mv_bits= bits*0.1; | |
237 } | |
238 rcc->i_cplx_sum [rce.pict_type] += rce.i_tex_bits*rce.qscale; | |
239 rcc->p_cplx_sum [rce.pict_type] += rce.p_tex_bits*rce.qscale; | |
240 rcc->mv_bits_sum[rce.pict_type] += rce.mv_bits; | |
241 rcc->frame_count[rce.pict_type] ++; | |
329 | 242 |
612 | 243 bits= rce.i_tex_bits + rce.p_tex_bits; |
244 | |
707 | 245 q= get_qscale(s, &rce, rcc->pass1_wanted_bits/rcc->pass1_rc_eq_output_sum, i); |
2637 | 246 rcc->pass1_wanted_bits+= s->bit_rate/(1/av_q2d(s->avctx->time_base)); //FIXME missbehaves a little for variable fps |
612 | 247 } |
248 } | |
249 | |
250 } | |
2967 | 251 |
329 | 252 return 0; |
253 } | |
254 | |
255 void ff_rate_control_uninit(MpegEncContext *s) | |
256 { | |
257 RateControlContext *rcc= &s->rc_context; | |
258 emms_c(); | |
259 | |
4084 | 260 ff_eval_free(rcc->rc_eq_eval); |
396
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
388
diff
changeset
|
261 av_freep(&rcc->entry); |
3064 | 262 |
5203 | 263 #ifdef CONFIG_LIBXVID |
3064 | 264 if((s->flags&CODEC_FLAG_PASS2) && s->avctx->rc_strategy == FF_RC_STRATEGY_XVID) |
265 ff_xvid_rate_control_uninit(s); | |
3065 | 266 #endif |
329 | 267 } |
268 | |
1684 | 269 int ff_vbv_update(MpegEncContext *s, int frame_size){ |
612 | 270 RateControlContext *rcc= &s->rc_context; |
2637 | 271 const double fps= 1/av_q2d(s->avctx->time_base); |
1697 | 272 const int buffer_size= s->avctx->rc_buffer_size; |
612 | 273 const double min_rate= s->avctx->rc_min_rate/fps; |
274 const double max_rate= s->avctx->rc_max_rate/fps; | |
2967 | 275 |
1697 | 276 //printf("%d %f %d %f %f\n", buffer_size, rcc->buffer_index, frame_size, min_rate, max_rate); |
612 | 277 if(buffer_size){ |
1683 | 278 int left; |
279 | |
612 | 280 rcc->buffer_index-= frame_size; |
1683 | 281 if(rcc->buffer_index < 0){ |
282 av_log(s->avctx, AV_LOG_ERROR, "rc buffer underflow\n"); | |
283 rcc->buffer_index= 0; | |
612 | 284 } |
1683 | 285 |
286 left= buffer_size - rcc->buffer_index - 1; | |
4594 | 287 rcc->buffer_index += av_clip(left, min_rate, max_rate); |
1683 | 288 |
1697 | 289 if(rcc->buffer_index > buffer_size){ |
290 int stuffing= ceil((rcc->buffer_index - buffer_size)/8); | |
2967 | 291 |
1684 | 292 if(stuffing < 4 && s->codec_id == CODEC_ID_MPEG4) |
293 stuffing=4; | |
294 rcc->buffer_index -= 8*stuffing; | |
2967 | 295 |
1684 | 296 if(s->avctx->debug & FF_DEBUG_RC) |
297 av_log(s->avctx, AV_LOG_DEBUG, "stuffing %d bytes\n", stuffing); | |
298 | |
299 return stuffing; | |
1683 | 300 } |
612 | 301 } |
1684 | 302 return 0; |
612 | 303 } |
304 | |
305 /** | |
306 * modifies the bitrate curve from pass1 for one frame | |
307 */ | |
308 static double get_qscale(MpegEncContext *s, RateControlEntry *rce, double rate_factor, int frame_num){ | |
309 RateControlContext *rcc= &s->rc_context; | |
1687 | 310 AVCodecContext *a= s->avctx; |
612 | 311 double q, bits; |
312 const int pict_type= rce->new_pict_type; | |
2967 | 313 const double mb_num= s->mb_num; |
612 | 314 int i; |
315 | |
316 double const_values[]={ | |
317 M_PI, | |
318 M_E, | |
319 rce->i_tex_bits*rce->qscale, | |
320 rce->p_tex_bits*rce->qscale, | |
321 (rce->i_tex_bits + rce->p_tex_bits)*(double)rce->qscale, | |
322 rce->mv_bits/mb_num, | |
323 rce->pict_type == B_TYPE ? (rce->f_code + rce->b_code)*0.5 : rce->f_code, | |
324 rce->i_count/mb_num, | |
325 rce->mc_mb_var_sum/mb_num, | |
326 rce->mb_var_sum/mb_num, | |
327 rce->pict_type == I_TYPE, | |
328 rce->pict_type == P_TYPE, | |
329 rce->pict_type == B_TYPE, | |
330 rcc->qscale_sum[pict_type] / (double)rcc->frame_count[pict_type], | |
1687 | 331 a->qcompress, |
612 | 332 /* rcc->last_qscale_for[I_TYPE], |
333 rcc->last_qscale_for[P_TYPE], | |
334 rcc->last_qscale_for[B_TYPE], | |
335 rcc->next_non_b_qscale,*/ | |
336 rcc->i_cplx_sum[I_TYPE] / (double)rcc->frame_count[I_TYPE], | |
337 rcc->i_cplx_sum[P_TYPE] / (double)rcc->frame_count[P_TYPE], | |
338 rcc->p_cplx_sum[P_TYPE] / (double)rcc->frame_count[P_TYPE], | |
339 rcc->p_cplx_sum[B_TYPE] / (double)rcc->frame_count[B_TYPE], | |
340 (rcc->i_cplx_sum[pict_type] + rcc->p_cplx_sum[pict_type]) / (double)rcc->frame_count[pict_type], | |
341 0 | |
342 }; | |
343 | |
4084 | 344 bits= ff_parse_eval(rcc->rc_eq_eval, const_values, rce); |
3766 | 345 if (isnan(bits)) { |
4084 | 346 av_log(s->avctx, AV_LOG_ERROR, "Error evaluating rc_eq \"%s\"\n", s->avctx->rc_eq); |
3766 | 347 return -1; |
348 } | |
2967 | 349 |
707 | 350 rcc->pass1_rc_eq_output_sum+= bits; |
612 | 351 bits*=rate_factor; |
352 if(bits<0.0) bits=0.0; | |
353 bits+= 1.0; //avoid 1/0 issues | |
2967 | 354 |
612 | 355 /* user override */ |
356 for(i=0; i<s->avctx->rc_override_count; i++){ | |
357 RcOverride *rco= s->avctx->rc_override; | |
358 if(rco[i].start_frame > frame_num) continue; | |
359 if(rco[i].end_frame < frame_num) continue; | |
2967 | 360 |
361 if(rco[i].qscale) | |
612 | 362 bits= qp2bits(rce, rco[i].qscale); //FIXME move at end to really force it? |
363 else | |
364 bits*= rco[i].quality_factor; | |
365 } | |
366 | |
367 q= bits2qp(rce, bits); | |
2967 | 368 |
612 | 369 /* I/B difference */ |
370 if (pict_type==I_TYPE && s->avctx->i_quant_factor<0.0) | |
371 q= -q*s->avctx->i_quant_factor + s->avctx->i_quant_offset; | |
372 else if(pict_type==B_TYPE && s->avctx->b_quant_factor<0.0) | |
373 q= -q*s->avctx->b_quant_factor + s->avctx->b_quant_offset; | |
2967 | 374 |
679 | 375 return q; |
376 } | |
377 | |
378 static double get_diff_limited_q(MpegEncContext *s, RateControlEntry *rce, double q){ | |
379 RateControlContext *rcc= &s->rc_context; | |
380 AVCodecContext *a= s->avctx; | |
381 const int pict_type= rce->new_pict_type; | |
382 const double last_p_q = rcc->last_qscale_for[P_TYPE]; | |
383 const double last_non_b_q= rcc->last_qscale_for[rcc->last_non_b_pict_type]; | |
2967 | 384 |
679 | 385 if (pict_type==I_TYPE && (a->i_quant_factor>0.0 || rcc->last_non_b_pict_type==P_TYPE)) |
4001 | 386 q= last_p_q *FFABS(a->i_quant_factor) + a->i_quant_offset; |
679 | 387 else if(pict_type==B_TYPE && a->b_quant_factor>0.0) |
388 q= last_non_b_q* a->b_quant_factor + a->b_quant_offset; | |
389 | |
612 | 390 /* last qscale / qdiff stuff */ |
679 | 391 if(rcc->last_non_b_pict_type==pict_type || pict_type!=I_TYPE){ |
392 double last_q= rcc->last_qscale_for[pict_type]; | |
1505
010f76d07a27
use lagrange multipler instead of qp for ratecontrol, this may break some things, tell me ASAP if u notice anything broken
michaelni
parents:
1455
diff
changeset
|
393 const int maxdiff= FF_QP2LAMBDA * a->max_qdiff; |
930 | 394 |
1505
010f76d07a27
use lagrange multipler instead of qp for ratecontrol, this may break some things, tell me ASAP if u notice anything broken
michaelni
parents:
1455
diff
changeset
|
395 if (q > last_q + maxdiff) q= last_q + maxdiff; |
010f76d07a27
use lagrange multipler instead of qp for ratecontrol, this may break some things, tell me ASAP if u notice anything broken
michaelni
parents:
1455
diff
changeset
|
396 else if(q < last_q - maxdiff) q= last_q - maxdiff; |
679 | 397 } |
612 | 398 |
5127 | 399 rcc->last_qscale_for[pict_type]= q; //Note we cannot do that after blurring |
2967 | 400 |
679 | 401 if(pict_type!=B_TYPE) |
402 rcc->last_non_b_pict_type= pict_type; | |
403 | |
612 | 404 return q; |
405 } | |
406 | |
407 /** | |
408 * gets the qmin & qmax for pict_type | |
409 */ | |
410 static void get_qminmax(int *qmin_ret, int *qmax_ret, MpegEncContext *s, int pict_type){ | |
2967 | 411 int qmin= s->avctx->lmin; |
1505
010f76d07a27
use lagrange multipler instead of qp for ratecontrol, this may break some things, tell me ASAP if u notice anything broken
michaelni
parents:
1455
diff
changeset
|
412 int qmax= s->avctx->lmax; |
2967 | 413 |
1365 | 414 assert(qmin <= qmax); |
612 | 415 |
416 if(pict_type==B_TYPE){ | |
4001 | 417 qmin= (int)(qmin*FFABS(s->avctx->b_quant_factor)+s->avctx->b_quant_offset + 0.5); |
418 qmax= (int)(qmax*FFABS(s->avctx->b_quant_factor)+s->avctx->b_quant_offset + 0.5); | |
612 | 419 }else if(pict_type==I_TYPE){ |
4001 | 420 qmin= (int)(qmin*FFABS(s->avctx->i_quant_factor)+s->avctx->i_quant_offset + 0.5); |
421 qmax= (int)(qmax*FFABS(s->avctx->i_quant_factor)+s->avctx->i_quant_offset + 0.5); | |
612 | 422 } |
423 | |
4594 | 424 qmin= av_clip(qmin, 1, FF_LAMBDA_MAX); |
425 qmax= av_clip(qmax, 1, FF_LAMBDA_MAX); | |
612 | 426 |
1365 | 427 if(qmax<qmin) qmax= qmin; |
2967 | 428 |
612 | 429 *qmin_ret= qmin; |
430 *qmax_ret= qmax; | |
431 } | |
432 | |
433 static double modify_qscale(MpegEncContext *s, RateControlEntry *rce, double q, int frame_num){ | |
434 RateControlContext *rcc= &s->rc_context; | |
435 int qmin, qmax; | |
436 double bits; | |
437 const int pict_type= rce->new_pict_type; | |
438 const double buffer_size= s->avctx->rc_buffer_size; | |
2637 | 439 const double fps= 1/av_q2d(s->avctx->time_base); |
1683 | 440 const double min_rate= s->avctx->rc_min_rate / fps; |
441 const double max_rate= s->avctx->rc_max_rate / fps; | |
2967 | 442 |
612 | 443 get_qminmax(&qmin, &qmax, s, pict_type); |
444 | |
445 /* modulation */ | |
446 if(s->avctx->rc_qmod_freq && frame_num%s->avctx->rc_qmod_freq==0 && pict_type==P_TYPE) | |
447 q*= s->avctx->rc_qmod_amp; | |
448 | |
449 bits= qp2bits(rce, q); | |
678 | 450 //printf("q:%f\n", q); |
612 | 451 /* buffer overflow/underflow protection */ |
452 if(buffer_size){ | |
679 | 453 double expected_size= rcc->buffer_index; |
1697 | 454 double q_limit; |
612 | 455 |
456 if(min_rate){ | |
679 | 457 double d= 2*(buffer_size - expected_size)/buffer_size; |
612 | 458 if(d>1.0) d=1.0; |
678 | 459 else if(d<0.0001) d=0.0001; |
460 q*= pow(d, 1.0/s->avctx->rc_buffer_aggressivity); | |
679 | 461 |
1697 | 462 q_limit= bits2qp(rce, FFMAX((min_rate - buffer_size + rcc->buffer_index)*3, 1)); |
463 if(q > q_limit){ | |
464 if(s->avctx->debug&FF_DEBUG_RC){ | |
465 av_log(s->avctx, AV_LOG_DEBUG, "limiting QP %f -> %f\n", q, q_limit); | |
466 } | |
467 q= q_limit; | |
468 } | |
612 | 469 } |
470 | |
471 if(max_rate){ | |
472 double d= 2*expected_size/buffer_size; | |
473 if(d>1.0) d=1.0; | |
678 | 474 else if(d<0.0001) d=0.0001; |
475 q/= pow(d, 1.0/s->avctx->rc_buffer_aggressivity); | |
679 | 476 |
1697 | 477 q_limit= bits2qp(rce, FFMAX(rcc->buffer_index/3, 1)); |
478 if(q < q_limit){ | |
479 if(s->avctx->debug&FF_DEBUG_RC){ | |
480 av_log(s->avctx, AV_LOG_DEBUG, "limiting QP %f -> %f\n", q, q_limit); | |
481 } | |
482 q= q_limit; | |
483 } | |
612 | 484 } |
485 } | |
678 | 486 //printf("q:%f max:%f min:%f size:%f index:%d bits:%f agr:%f\n", q,max_rate, min_rate, buffer_size, rcc->buffer_index, bits, s->avctx->rc_buffer_aggressivity); |
615 | 487 if(s->avctx->rc_qsquish==0.0 || qmin==qmax){ |
612 | 488 if (q<qmin) q=qmin; |
489 else if(q>qmax) q=qmax; | |
490 }else{ | |
491 double min2= log(qmin); | |
492 double max2= log(qmax); | |
2967 | 493 |
612 | 494 q= log(q); |
495 q= (q - min2)/(max2-min2) - 0.5; | |
496 q*= -4.0; | |
497 q= 1.0/(1.0 + exp(q)); | |
498 q= q*(max2-min2) + min2; | |
2967 | 499 |
612 | 500 q= exp(q); |
501 } | |
2967 | 502 |
612 | 503 return q; |
504 } | |
505 | |
329 | 506 //---------------------------------- |
507 // 1 Pass Code | |
508 | |
612 | 509 static double predict_size(Predictor *p, double q, double var) |
329 | 510 { |
511 return p->coeff*var / (q*p->count); | |
512 } | |
513 | |
949 | 514 /* |
612 | 515 static double predict_qp(Predictor *p, double size, double var) |
516 { | |
517 //printf("coeff:%f, count:%f, var:%f, size:%f//\n", p->coeff, p->count, var, size); | |
518 return p->coeff*var / (size*p->count); | |
519 } | |
949 | 520 */ |
612 | 521 |
329 | 522 static void update_predictor(Predictor *p, double q, double var, double size) |
523 { | |
524 double new_coeff= size*q / (var + 1); | |
612 | 525 if(var<10) return; |
329 | 526 |
527 p->count*= p->decay; | |
528 p->coeff*= p->decay; | |
529 p->count++; | |
530 p->coeff+= new_coeff; | |
531 } | |
532 | |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
533 static void adaptive_quantization(MpegEncContext *s, double q){ |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
534 int i; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
535 const float lumi_masking= s->avctx->lumi_masking / (128.0*128.0); |
693
b6a7ff92df57
darkness masking (lumi masking does only bright stuff now)
michaelni
parents:
690
diff
changeset
|
536 const float dark_masking= s->avctx->dark_masking / (128.0*128.0); |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
537 const float temp_cplx_masking= s->avctx->temporal_cplx_masking; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
538 const float spatial_cplx_masking = s->avctx->spatial_cplx_masking; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
539 const float p_masking = s->avctx->p_masking; |
2493
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
540 const float border_masking = s->avctx->border_masking; |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
541 float bits_sum= 0.0; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
542 float cplx_sum= 0.0; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
543 float cplx_tab[s->mb_num]; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
544 float bits_tab[s->mb_num]; |
2494
36d70fbb31c5
mb_lmin/max to limit the per mb quality for the ratecontrol independant from the frame limits
michael
parents:
2493
diff
changeset
|
545 const int qmin= s->avctx->mb_lmin; |
36d70fbb31c5
mb_lmin/max to limit the per mb quality for the ratecontrol independant from the frame limits
michael
parents:
2493
diff
changeset
|
546 const int qmax= s->avctx->mb_lmax; |
903 | 547 Picture * const pic= &s->current_picture; |
2493
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
548 const int mb_width = s->mb_width; |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
549 const int mb_height = s->mb_height; |
2967 | 550 |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
551 for(i=0; i<s->mb_num; i++){ |
1180 | 552 const int mb_xy= s->mb_index2xy[i]; |
1505
010f76d07a27
use lagrange multipler instead of qp for ratecontrol, this may break some things, tell me ASAP if u notice anything broken
michaelni
parents:
1455
diff
changeset
|
553 float temp_cplx= sqrt(pic->mc_mb_var[mb_xy]); //FIXME merge in pow() |
1180 | 554 float spat_cplx= sqrt(pic->mb_var[mb_xy]); |
555 const int lumi= pic->mb_mean[mb_xy]; | |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
556 float bits, cplx, factor; |
2493
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
557 int mb_x = mb_xy % s->mb_stride; |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
558 int mb_y = mb_xy / s->mb_stride; |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
559 int mb_distance; |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
560 float mb_factor = 0.0; |
2967 | 561 #if 0 |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
562 if(spat_cplx < q/3) spat_cplx= q/3; //FIXME finetune |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
563 if(temp_cplx < q/3) temp_cplx= q/3; //FIXME finetune |
2967 | 564 #endif |
1505
010f76d07a27
use lagrange multipler instead of qp for ratecontrol, this may break some things, tell me ASAP if u notice anything broken
michaelni
parents:
1455
diff
changeset
|
565 if(spat_cplx < 4) spat_cplx= 4; //FIXME finetune |
010f76d07a27
use lagrange multipler instead of qp for ratecontrol, this may break some things, tell me ASAP if u notice anything broken
michaelni
parents:
1455
diff
changeset
|
566 if(temp_cplx < 4) temp_cplx= 4; //FIXME finetune |
010f76d07a27
use lagrange multipler instead of qp for ratecontrol, this may break some things, tell me ASAP if u notice anything broken
michaelni
parents:
1455
diff
changeset
|
567 |
2967 | 568 if((s->mb_type[mb_xy]&CANDIDATE_MB_TYPE_INTRA)){//FIXME hq mode |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
569 cplx= spat_cplx; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
570 factor= 1.0 + p_masking; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
571 }else{ |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
572 cplx= temp_cplx; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
573 factor= pow(temp_cplx, - temp_cplx_masking); |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
574 } |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
575 factor*=pow(spat_cplx, - spatial_cplx_masking); |
693
b6a7ff92df57
darkness masking (lumi masking does only bright stuff now)
michaelni
parents:
690
diff
changeset
|
576 |
b6a7ff92df57
darkness masking (lumi masking does only bright stuff now)
michaelni
parents:
690
diff
changeset
|
577 if(lumi>127) |
b6a7ff92df57
darkness masking (lumi masking does only bright stuff now)
michaelni
parents:
690
diff
changeset
|
578 factor*= (1.0 - (lumi-128)*(lumi-128)*lumi_masking); |
b6a7ff92df57
darkness masking (lumi masking does only bright stuff now)
michaelni
parents:
690
diff
changeset
|
579 else |
b6a7ff92df57
darkness masking (lumi masking does only bright stuff now)
michaelni
parents:
690
diff
changeset
|
580 factor*= (1.0 - (lumi-128)*(lumi-128)*dark_masking); |
2493
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
581 |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
582 if(mb_x < mb_width/5){ |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
583 mb_distance = mb_width/5 - mb_x; |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
584 mb_factor = (float)mb_distance / (float)(mb_width/5); |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
585 }else if(mb_x > 4*mb_width/5){ |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
586 mb_distance = mb_x - 4*mb_width/5; |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
587 mb_factor = (float)mb_distance / (float)(mb_width/5); |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
588 } |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
589 if(mb_y < mb_height/5){ |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
590 mb_distance = mb_height/5 - mb_y; |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
591 mb_factor = FFMAX(mb_factor, (float)mb_distance / (float)(mb_height/5)); |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
592 }else if(mb_y > 4*mb_height/5){ |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
593 mb_distance = mb_y - 4*mb_height/5; |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
594 mb_factor = FFMAX(mb_factor, (float)mb_distance / (float)(mb_height/5)); |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
595 } |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
596 |
258120c61eea
Border processing adaptive quant patch by (Christophe Massiot |cmassiot freebox fr)
michael
parents:
2423
diff
changeset
|
597 factor*= 1.0 - border_masking*mb_factor; |
2967 | 598 |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
599 if(factor<0.00001) factor= 0.00001; |
2967 | 600 |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
601 bits= cplx*factor; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
602 cplx_sum+= cplx; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
603 bits_sum+= bits; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
604 cplx_tab[i]= cplx; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
605 bits_tab[i]= bits; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
606 } |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
607 |
5127 | 608 /* handle qmin/qmax clipping */ |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
609 if(s->flags&CODEC_FLAG_NORMALIZE_AQP){ |
1806
2721e1859e19
normalize adaptive quantizatiuon fix (based upon a patch by (Jindrich Makovicka <makovick at kmlinux dot fjfi dot cvut dot cz>))
michael
parents:
1739
diff
changeset
|
610 float factor= bits_sum/cplx_sum; |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
611 for(i=0; i<s->mb_num; i++){ |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
612 float newq= q*cplx_tab[i]/bits_tab[i]; |
1806
2721e1859e19
normalize adaptive quantizatiuon fix (based upon a patch by (Jindrich Makovicka <makovick at kmlinux dot fjfi dot cvut dot cz>))
michael
parents:
1739
diff
changeset
|
613 newq*= factor; |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
614 |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
615 if (newq > qmax){ |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
616 bits_sum -= bits_tab[i]; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
617 cplx_sum -= cplx_tab[i]*q/qmax; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
618 } |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
619 else if(newq < qmin){ |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
620 bits_sum -= bits_tab[i]; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
621 cplx_sum -= cplx_tab[i]*q/qmin; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
622 } |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
623 } |
1806
2721e1859e19
normalize adaptive quantizatiuon fix (based upon a patch by (Jindrich Makovicka <makovick at kmlinux dot fjfi dot cvut dot cz>))
michael
parents:
1739
diff
changeset
|
624 if(bits_sum < 0.001) bits_sum= 0.001; |
2721e1859e19
normalize adaptive quantizatiuon fix (based upon a patch by (Jindrich Makovicka <makovick at kmlinux dot fjfi dot cvut dot cz>))
michael
parents:
1739
diff
changeset
|
625 if(cplx_sum < 0.001) cplx_sum= 0.001; |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
626 } |
2967 | 627 |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
628 for(i=0; i<s->mb_num; i++){ |
1180 | 629 const int mb_xy= s->mb_index2xy[i]; |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
630 float newq= q*cplx_tab[i]/bits_tab[i]; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
631 int intq; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
632 |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
633 if(s->flags&CODEC_FLAG_NORMALIZE_AQP){ |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
634 newq*= bits_sum/cplx_sum; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
635 } |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
636 |
1505
010f76d07a27
use lagrange multipler instead of qp for ratecontrol, this may break some things, tell me ASAP if u notice anything broken
michaelni
parents:
1455
diff
changeset
|
637 intq= (int)(newq + 0.5); |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
638 |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
639 if (intq > qmax) intq= qmax; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
640 else if(intq < qmin) intq= qmin; |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
641 //if(i%s->mb_width==0) printf("\n"); |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
642 //printf("%2d%3d ", intq, ff_sqrt(s->mc_mb_var[i])); |
1505
010f76d07a27
use lagrange multipler instead of qp for ratecontrol, this may break some things, tell me ASAP if u notice anything broken
michaelni
parents:
1455
diff
changeset
|
643 s->lambda_table[mb_xy]= intq; |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
644 } |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
645 } |
2981 | 646 |
647 void ff_get_2pass_fcode(MpegEncContext *s){ | |
648 RateControlContext *rcc= &s->rc_context; | |
649 int picture_number= s->picture_number; | |
650 RateControlEntry *rce; | |
651 | |
652 rce= &rcc->entry[picture_number]; | |
653 s->f_code= rce->f_code; | |
654 s->b_code= rce->b_code; | |
655 } | |
656 | |
1505
010f76d07a27
use lagrange multipler instead of qp for ratecontrol, this may break some things, tell me ASAP if u notice anything broken
michaelni
parents:
1455
diff
changeset
|
657 //FIXME rd or at least approx for dquant |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
658 |
2974 | 659 float ff_rate_estimate_qscale(MpegEncContext *s, int dry_run) |
329 | 660 { |
661 float q; | |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
662 int qmin, qmax; |
329 | 663 float br_compensation; |
664 double diff; | |
665 double short_term_q; | |
666 double fps; | |
612 | 667 int picture_number= s->picture_number; |
329 | 668 int64_t wanted_bits; |
612 | 669 RateControlContext *rcc= &s->rc_context; |
1687 | 670 AVCodecContext *a= s->avctx; |
612 | 671 RateControlEntry local_rce, *rce; |
672 double bits; | |
673 double rate_factor; | |
674 int var; | |
675 const int pict_type= s->pict_type; | |
903 | 676 Picture * const pic= &s->current_picture; |
329 | 677 emms_c(); |
678 | |
5203 | 679 #ifdef CONFIG_LIBXVID |
3064 | 680 if((s->flags&CODEC_FLAG_PASS2) && s->avctx->rc_strategy == FF_RC_STRATEGY_XVID) |
681 return ff_xvid_rate_estimate_qscale(s, dry_run); | |
3065 | 682 #endif |
3064 | 683 |
612 | 684 get_qminmax(&qmin, &qmax, s, pict_type); |
685 | |
2637 | 686 fps= 1/av_q2d(s->avctx->time_base); |
678 | 687 //printf("input_pic_num:%d pic_num:%d frame_rate:%d\n", s->input_picture_number, s->picture_number, s->frame_rate); |
329 | 688 /* update predictors */ |
2974 | 689 if(picture_number>2 && !dry_run){ |
612 | 690 const int last_var= s->last_pict_type == I_TYPE ? rcc->last_mb_var_sum : rcc->last_mc_mb_var_sum; |
691 update_predictor(&rcc->pred[s->last_pict_type], rcc->last_qscale, sqrt(last_var), s->frame_bits); | |
329 | 692 } |
693 | |
612 | 694 if(s->flags&CODEC_FLAG_PASS2){ |
695 assert(picture_number>=0); | |
696 assert(picture_number<rcc->num_entries); | |
697 rce= &rcc->entry[picture_number]; | |
698 wanted_bits= rce->expected_bits; | |
699 }else{ | |
700 rce= &local_rce; | |
701 wanted_bits= (uint64_t)(s->bit_rate*(double)picture_number/fps); | |
329 | 702 } |
703 | |
704 diff= s->total_bits - wanted_bits; | |
1687 | 705 br_compensation= (a->bit_rate_tolerance - diff)/a->bit_rate_tolerance; |
329 | 706 if(br_compensation<=0.0) br_compensation=0.001; |
612 | 707 |
903 | 708 var= pict_type == I_TYPE ? pic->mb_var_sum : pic->mc_mb_var_sum; |
2967 | 709 |
1455 | 710 short_term_q = 0; /* avoid warning */ |
612 | 711 if(s->flags&CODEC_FLAG_PASS2){ |
712 if(pict_type!=I_TYPE) | |
713 assert(pict_type == rce->new_pict_type); | |
714 | |
715 q= rce->new_qscale / br_compensation; | |
716 //printf("%f %f %f last:%d var:%d type:%d//\n", q, rce->new_qscale, br_compensation, s->frame_bits, var, pict_type); | |
717 }else{ | |
2967 | 718 rce->pict_type= |
612 | 719 rce->new_pict_type= pict_type; |
903 | 720 rce->mc_mb_var_sum= pic->mc_mb_var_sum; |
721 rce->mb_var_sum = pic-> mb_var_sum; | |
1505
010f76d07a27
use lagrange multipler instead of qp for ratecontrol, this may break some things, tell me ASAP if u notice anything broken
michaelni
parents:
1455
diff
changeset
|
722 rce->qscale = FF_QP2LAMBDA * 2; |
612 | 723 rce->f_code = s->f_code; |
724 rce->b_code = s->b_code; | |
725 rce->misc_bits= 1; | |
726 | |
727 bits= predict_size(&rcc->pred[pict_type], rce->qscale, sqrt(var)); | |
728 if(pict_type== I_TYPE){ | |
729 rce->i_count = s->mb_num; | |
730 rce->i_tex_bits= bits; | |
731 rce->p_tex_bits= 0; | |
732 rce->mv_bits= 0; | |
733 }else{ | |
734 rce->i_count = 0; //FIXME we do know this approx | |
735 rce->i_tex_bits= 0; | |
736 rce->p_tex_bits= bits*0.9; | |
2967 | 737 |
612 | 738 rce->mv_bits= bits*0.1; |
739 } | |
740 rcc->i_cplx_sum [pict_type] += rce->i_tex_bits*rce->qscale; | |
741 rcc->p_cplx_sum [pict_type] += rce->p_tex_bits*rce->qscale; | |
742 rcc->mv_bits_sum[pict_type] += rce->mv_bits; | |
743 rcc->frame_count[pict_type] ++; | |
744 | |
745 bits= rce->i_tex_bits + rce->p_tex_bits; | |
707 | 746 rate_factor= rcc->pass1_wanted_bits/rcc->pass1_rc_eq_output_sum * br_compensation; |
2967 | 747 |
612 | 748 q= get_qscale(s, rce, rate_factor, picture_number); |
3766 | 749 if (q < 0) |
750 return -1; | |
612 | 751 |
615 | 752 assert(q>0.0); |
612 | 753 //printf("%f ", q); |
679 | 754 q= get_diff_limited_q(s, rce, q); |
612 | 755 //printf("%f ", q); |
756 assert(q>0.0); | |
757 | |
4588
fc155ff94878
cosmetics: Fix another common typo, dependAnt --> dependEnt.
diego
parents:
4084
diff
changeset
|
758 if(pict_type==P_TYPE || s->intra_only){ //FIXME type dependent blur like in 2-pass |
1687 | 759 rcc->short_term_qsum*=a->qblur; |
760 rcc->short_term_qcount*=a->qblur; | |
612 | 761 |
762 rcc->short_term_qsum+= q; | |
763 rcc->short_term_qcount++; | |
764 //printf("%f ", q); | |
765 q= short_term_q= rcc->short_term_qsum/rcc->short_term_qcount; | |
766 //printf("%f ", q); | |
767 } | |
678 | 768 assert(q>0.0); |
2967 | 769 |
612 | 770 q= modify_qscale(s, rce, q, picture_number); |
771 | |
772 rcc->pass1_wanted_bits+= s->bit_rate/fps; | |
773 | |
615 | 774 assert(q>0.0); |
612 | 775 } |
930 | 776 |
777 if(s->avctx->debug&FF_DEBUG_RC){ | |
1598
932d306bf1dc
av_log() patch by (Michel Bardiaux <mbardiaux at peaktime dot be>)
michael
parents:
1505
diff
changeset
|
778 av_log(s->avctx, AV_LOG_DEBUG, "%c qp:%d<%2.1f<%d %d want:%d total:%d comp:%f st_q:%2.2f size:%d var:%d/%d br:%d fps:%d\n", |
1264 | 779 av_get_pict_type_char(pict_type), qmin, q, qmax, picture_number, (int)wanted_bits/1000, (int)s->total_bits/1000, |
930 | 780 br_compensation, short_term_q, s->frame_bits, pic->mb_var_sum, pic->mc_mb_var_sum, s->bit_rate/1000, (int)fps |
781 ); | |
782 } | |
612 | 783 |
2967 | 784 if (q<qmin) q=qmin; |
612 | 785 else if(q>qmax) q=qmax; |
786 | |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
787 if(s->adaptive_quant) |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
788 adaptive_quantization(s, q); |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
789 else |
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
790 q= (int)(q + 0.5); |
2967 | 791 |
2974 | 792 if(!dry_run){ |
793 rcc->last_qscale= q; | |
794 rcc->last_mc_mb_var_sum= pic->mc_mb_var_sum; | |
795 rcc->last_mb_var_sum= pic->mb_var_sum; | |
796 } | |
903 | 797 #if 0 |
798 { | |
799 static int mvsum=0, texsum=0; | |
800 mvsum += s->mv_bits; | |
801 texsum += s->i_tex_bits + s->p_tex_bits; | |
802 printf("%d %d//\n\n", mvsum, texsum); | |
803 } | |
804 #endif | |
690
a1c69cb685b3
adaptive quantization (lumi/temporal & spatial complexity masking)
michaelni
parents:
679
diff
changeset
|
805 return q; |
329 | 806 } |
807 | |
808 //---------------------------------------------- | |
809 // 2-Pass code | |
810 | |
811 static int init_pass2(MpegEncContext *s) | |
812 { | |
813 RateControlContext *rcc= &s->rc_context; | |
1687 | 814 AVCodecContext *a= s->avctx; |
3681 | 815 int i, toobig; |
2637 | 816 double fps= 1/av_q2d(s->avctx->time_base); |
329 | 817 double complexity[5]={0,0,0,0,0}; // aproximate bits at quant=1 |
4588
fc155ff94878
cosmetics: Fix another common typo, dependAnt --> dependEnt.
diego
parents:
4084
diff
changeset
|
818 uint64_t const_bits[5]={0,0,0,0,0}; // quantizer independent bits |
329 | 819 uint64_t all_const_bits; |
820 uint64_t all_available_bits= (uint64_t)(s->bit_rate*(double)rcc->num_entries/fps); | |
821 double rate_factor=0; | |
822 double step; | |
949 | 823 //int last_i_frame=-10000000; |
2967 | 824 const int filter_size= (int)(a->qblur*4) | 1; |
612 | 825 double expected_bits; |
3681 | 826 double *qscale, *blured_qscale, qscale_sum; |
329 | 827 |
828 /* find complexity & const_bits & decide the pict_types */ | |
829 for(i=0; i<rcc->num_entries; i++){ | |
830 RateControlEntry *rce= &rcc->entry[i]; | |
2967 | 831 |
915 | 832 rce->new_pict_type= rce->pict_type; |
612 | 833 rcc->i_cplx_sum [rce->pict_type] += rce->i_tex_bits*rce->qscale; |
834 rcc->p_cplx_sum [rce->pict_type] += rce->p_tex_bits*rce->qscale; | |
835 rcc->mv_bits_sum[rce->pict_type] += rce->mv_bits; | |
836 rcc->frame_count[rce->pict_type] ++; | |
329 | 837 |
838 complexity[rce->new_pict_type]+= (rce->i_tex_bits+ rce->p_tex_bits)*(double)rce->qscale; | |
839 const_bits[rce->new_pict_type]+= rce->mv_bits + rce->misc_bits; | |
840 } | |
841 all_const_bits= const_bits[I_TYPE] + const_bits[P_TYPE] + const_bits[B_TYPE]; | |
2967 | 842 |
329 | 843 if(all_available_bits < all_const_bits){ |
3674 | 844 av_log(s->avctx, AV_LOG_ERROR, "requested bitrate is too low\n"); |
329 | 845 return -1; |
846 } | |
2967 | 847 |
1031
19de1445beb2
use av_malloc() functions - added av_strdup and av_realloc()
bellard
parents:
977
diff
changeset
|
848 qscale= av_malloc(sizeof(double)*rcc->num_entries); |
19de1445beb2
use av_malloc() functions - added av_strdup and av_realloc()
bellard
parents:
977
diff
changeset
|
849 blured_qscale= av_malloc(sizeof(double)*rcc->num_entries); |
3681 | 850 toobig = 0; |
612 | 851 |
329 | 852 for(step=256*256; step>0.0000001; step*=0.5){ |
612 | 853 expected_bits=0; |
329 | 854 rate_factor+= step; |
2967 | 855 |
612 | 856 rcc->buffer_index= s->avctx->rc_buffer_size/2; |
857 | |
329 | 858 /* find qscale */ |
859 for(i=0; i<rcc->num_entries; i++){ | |
612 | 860 qscale[i]= get_qscale(s, &rcc->entry[i], rate_factor, i); |
861 } | |
862 assert(filter_size%2==1); | |
329 | 863 |
612 | 864 /* fixed I/B QP relative to P mode */ |
865 for(i=rcc->num_entries-1; i>=0; i--){ | |
866 RateControlEntry *rce= &rcc->entry[i]; | |
2967 | 867 |
679 | 868 qscale[i]= get_diff_limited_q(s, rce, qscale[i]); |
329 | 869 } |
870 | |
871 /* smooth curve */ | |
612 | 872 for(i=0; i<rcc->num_entries; i++){ |
873 RateControlEntry *rce= &rcc->entry[i]; | |
874 const int pict_type= rce->new_pict_type; | |
875 int j; | |
876 double q=0.0, sum=0.0; | |
2967 | 877 |
612 | 878 for(j=0; j<filter_size; j++){ |
879 int index= i+j-filter_size/2; | |
880 double d= index-i; | |
1687 | 881 double coeff= a->qblur==0 ? 1.0 : exp(-d*d/(a->qblur * a->qblur)); |
2967 | 882 |
612 | 883 if(index < 0 || index >= rcc->num_entries) continue; |
884 if(pict_type != rcc->entry[index].new_pict_type) continue; | |
885 q+= qscale[index] * coeff; | |
886 sum+= coeff; | |
887 } | |
888 blured_qscale[i]= q/sum; | |
889 } | |
2967 | 890 |
329 | 891 /* find expected bits */ |
892 for(i=0; i<rcc->num_entries; i++){ | |
893 RateControlEntry *rce= &rcc->entry[i]; | |
612 | 894 double bits; |
895 rce->new_qscale= modify_qscale(s, rce, blured_qscale[i], i); | |
616
0fe52ab8042c
forgot the const bits in 2pass curve matching (patch (with rounding removed) by Rmi Guyomarch <rguyom at pobox dot com>)
michaelni
parents:
615
diff
changeset
|
896 bits= qp2bits(rce, rce->new_qscale) + rce->mv_bits + rce->misc_bits; |
612 | 897 //printf("%d %f\n", rce->new_bits, blured_qscale[i]); |
1684 | 898 bits += 8*ff_vbv_update(s, bits); |
612 | 899 |
329 | 900 rce->expected_bits= expected_bits; |
612 | 901 expected_bits += bits; |
329 | 902 } |
903 | |
3681 | 904 /* |
905 av_log(s->avctx, AV_LOG_INFO, | |
906 "expected_bits: %f all_available_bits: %d rate_factor: %f\n", | |
907 expected_bits, (int)all_available_bits, rate_factor); | |
908 */ | |
909 if(expected_bits > all_available_bits) { | |
910 rate_factor-= step; | |
911 ++toobig; | |
912 } | |
329 | 913 } |
1031
19de1445beb2
use av_malloc() functions - added av_strdup and av_realloc()
bellard
parents:
977
diff
changeset
|
914 av_free(qscale); |
19de1445beb2
use av_malloc() functions - added av_strdup and av_realloc()
bellard
parents:
977
diff
changeset
|
915 av_free(blured_qscale); |
612 | 916 |
3681 | 917 /* check bitrate calculations and print info */ |
918 qscale_sum = 0.0; | |
919 for(i=0; i<rcc->num_entries; i++){ | |
920 /* av_log(s->avctx, AV_LOG_DEBUG, "[lavc rc] entry[%d].new_qscale = %.3f qp = %.3f\n", | |
921 i, rcc->entry[i].new_qscale, rcc->entry[i].new_qscale / FF_QP2LAMBDA); */ | |
4594 | 922 qscale_sum += av_clip(rcc->entry[i].new_qscale / FF_QP2LAMBDA, s->avctx->qmin, s->avctx->qmax); |
3681 | 923 } |
924 assert(toobig <= 40); | |
925 av_log(s->avctx, AV_LOG_DEBUG, | |
926 "[lavc rc] requested bitrate: %d bps expected bitrate: %d bps\n", | |
927 s->bit_rate, | |
928 (int)(expected_bits / ((double)all_available_bits/s->bit_rate))); | |
929 av_log(s->avctx, AV_LOG_DEBUG, | |
930 "[lavc rc] estimated target average qp: %.3f\n", | |
931 (float)qscale_sum / rcc->num_entries); | |
932 if (toobig == 0) { | |
933 av_log(s->avctx, AV_LOG_INFO, | |
934 "[lavc rc] Using all of requested bitrate is not " | |
935 "necessary for this video with these parameters.\n"); | |
936 } else if (toobig == 40) { | |
937 av_log(s->avctx, AV_LOG_ERROR, | |
938 "[lavc rc] Error: bitrate too low for this video " | |
939 "with these parameters.\n"); | |
940 return -1; | |
941 } else if (fabs(expected_bits/all_available_bits - 1.0) > 0.01) { | |
942 av_log(s->avctx, AV_LOG_ERROR, | |
943 "[lavc rc] Error: 2pass curve failed to converge\n"); | |
612 | 944 return -1; |
945 } | |
329 | 946 |
947 return 0; | |
948 } |