Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
Download
52866 views
1
/*****************************************************************************
2
* set.c: quantization init
3
*****************************************************************************
4
* Copyright (C) 2005-2016 x264 project
5
*
6
* Authors: Loren Merritt <[email protected]>
7
*
8
* This program is free software; you can redistribute it and/or modify
9
* it under the terms of the GNU General Public License as published by
10
* the Free Software Foundation; either version 2 of the License, or
11
* (at your option) any later version.
12
*
13
* This program is distributed in the hope that it will be useful,
14
* but WITHOUT ANY WARRANTY; without even the implied warranty of
15
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16
* GNU General Public License for more details.
17
*
18
* You should have received a copy of the GNU General Public License
19
* along with this program; if not, write to the Free Software
20
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111, USA.
21
*
22
* This program is also available under a commercial proprietary license.
23
* For more information, contact us at [email protected].
24
*****************************************************************************/
25
26
#define _ISOC99_SOURCE
27
#include "common.h"
28
29
#define SHIFT(x,s) ((s)<=0 ? (x)<<-(s) : ((x)+(1<<((s)-1)))>>(s))
30
#define DIV(n,d) (((n) + ((d)>>1)) / (d))
31
32
static const uint8_t dequant4_scale[6][3] =
33
{
34
{ 10, 13, 16 },
35
{ 11, 14, 18 },
36
{ 13, 16, 20 },
37
{ 14, 18, 23 },
38
{ 16, 20, 25 },
39
{ 18, 23, 29 }
40
};
41
static const uint16_t quant4_scale[6][3] =
42
{
43
{ 13107, 8066, 5243 },
44
{ 11916, 7490, 4660 },
45
{ 10082, 6554, 4194 },
46
{ 9362, 5825, 3647 },
47
{ 8192, 5243, 3355 },
48
{ 7282, 4559, 2893 },
49
};
50
51
static const uint8_t quant8_scan[16] =
52
{
53
0,3,4,3, 3,1,5,1, 4,5,2,5, 3,1,5,1
54
};
55
static const uint8_t dequant8_scale[6][6] =
56
{
57
{ 20, 18, 32, 19, 25, 24 },
58
{ 22, 19, 35, 21, 28, 26 },
59
{ 26, 23, 42, 24, 33, 31 },
60
{ 28, 25, 45, 26, 35, 33 },
61
{ 32, 28, 51, 30, 40, 38 },
62
{ 36, 32, 58, 34, 46, 43 },
63
};
64
static const uint16_t quant8_scale[6][6] =
65
{
66
{ 13107, 11428, 20972, 12222, 16777, 15481 },
67
{ 11916, 10826, 19174, 11058, 14980, 14290 },
68
{ 10082, 8943, 15978, 9675, 12710, 11985 },
69
{ 9362, 8228, 14913, 8931, 11984, 11259 },
70
{ 8192, 7346, 13159, 7740, 10486, 9777 },
71
{ 7282, 6428, 11570, 6830, 9118, 8640 }
72
};
73
74
int x264_cqm_init( x264_t *h )
75
{
76
int def_quant4[6][16];
77
int def_quant8[6][64];
78
int def_dequant4[6][16];
79
int def_dequant8[6][64];
80
int quant4_mf[4][6][16];
81
int quant8_mf[4][6][64];
82
int deadzone[4] = { 32 - h->param.analyse.i_luma_deadzone[1],
83
32 - h->param.analyse.i_luma_deadzone[0],
84
32 - 11, 32 - 21 };
85
int max_qp_err = -1;
86
int max_chroma_qp_err = -1;
87
int min_qp_err = QP_MAX+1;
88
int num_8x8_lists = h->sps->i_chroma_format_idc == CHROMA_444 ? 4
89
: h->param.analyse.b_transform_8x8 ? 2 : 0; /* Checkasm may segfault if optimized out by --chroma-format */
90
91
#define CQM_ALLOC( w, count )\
92
for( int i = 0; i < count; i++ )\
93
{\
94
int size = w*w;\
95
int start = w == 8 ? 4 : 0;\
96
int j;\
97
for( j = 0; j < i; j++ )\
98
if( !memcmp( h->pps->scaling_list[i+start], h->pps->scaling_list[j+start], size*sizeof(uint8_t) ) )\
99
break;\
100
if( j < i )\
101
{\
102
h-> quant##w##_mf[i] = h-> quant##w##_mf[j];\
103
h->dequant##w##_mf[i] = h->dequant##w##_mf[j];\
104
h->unquant##w##_mf[i] = h->unquant##w##_mf[j];\
105
}\
106
else\
107
{\
108
CHECKED_MALLOC( h-> quant##w##_mf[i], (QP_MAX_SPEC+1)*size*sizeof(udctcoef) );\
109
CHECKED_MALLOC( h->dequant##w##_mf[i], 6*size*sizeof(int) );\
110
CHECKED_MALLOC( h->unquant##w##_mf[i], (QP_MAX_SPEC+1)*size*sizeof(int) );\
111
}\
112
for( j = 0; j < i; j++ )\
113
if( deadzone[j] == deadzone[i] &&\
114
!memcmp( h->pps->scaling_list[i+start], h->pps->scaling_list[j+start], size*sizeof(uint8_t) ) )\
115
break;\
116
if( j < i )\
117
{\
118
h->quant##w##_bias[i] = h->quant##w##_bias[j];\
119
h->quant##w##_bias0[i] = h->quant##w##_bias0[j];\
120
}\
121
else\
122
{\
123
CHECKED_MALLOC( h->quant##w##_bias[i], (QP_MAX_SPEC+1)*size*sizeof(udctcoef) );\
124
CHECKED_MALLOC( h->quant##w##_bias0[i], (QP_MAX_SPEC+1)*size*sizeof(udctcoef) );\
125
}\
126
}
127
128
CQM_ALLOC( 4, 4 )
129
CQM_ALLOC( 8, num_8x8_lists )
130
131
for( int q = 0; q < 6; q++ )
132
{
133
for( int i = 0; i < 16; i++ )
134
{
135
int j = (i&1) + ((i>>2)&1);
136
def_dequant4[q][i] = dequant4_scale[q][j];
137
def_quant4[q][i] = quant4_scale[q][j];
138
}
139
for( int i = 0; i < 64; i++ )
140
{
141
int j = quant8_scan[((i>>1)&12) | (i&3)];
142
def_dequant8[q][i] = dequant8_scale[q][j];
143
def_quant8[q][i] = quant8_scale[q][j];
144
}
145
}
146
147
for( int q = 0; q < 6; q++ )
148
{
149
for( int i_list = 0; i_list < 4; i_list++ )
150
for( int i = 0; i < 16; i++ )
151
{
152
h->dequant4_mf[i_list][q][i] = def_dequant4[q][i] * h->pps->scaling_list[i_list][i];
153
quant4_mf[i_list][q][i] = DIV(def_quant4[q][i] * 16, h->pps->scaling_list[i_list][i]);
154
}
155
for( int i_list = 0; i_list < num_8x8_lists; i_list++ )
156
for( int i = 0; i < 64; i++ )
157
{
158
h->dequant8_mf[i_list][q][i] = def_dequant8[q][i] * h->pps->scaling_list[4+i_list][i];
159
quant8_mf[i_list][q][i] = DIV(def_quant8[q][i] * 16, h->pps->scaling_list[4+i_list][i]);
160
}
161
}
162
for( int q = 0; q <= QP_MAX_SPEC; q++ )
163
{
164
int j;
165
for( int i_list = 0; i_list < 4; i_list++ )
166
for( int i = 0; i < 16; i++ )
167
{
168
h->unquant4_mf[i_list][q][i] = (1ULL << (q/6 + 15 + 8)) / quant4_mf[i_list][q%6][i];
169
h->quant4_mf[i_list][q][i] = j = SHIFT(quant4_mf[i_list][q%6][i], q/6 - 1);
170
if( !j )
171
{
172
min_qp_err = X264_MIN( min_qp_err, q );
173
continue;
174
}
175
// round to nearest, unless that would cause the deadzone to be negative
176
h->quant4_bias[i_list][q][i] = X264_MIN( DIV(deadzone[i_list]<<10, j), (1<<15)/j );
177
h->quant4_bias0[i_list][q][i] = (1<<15)/j;
178
if( j > 0xffff && q > max_qp_err && (i_list == CQM_4IY || i_list == CQM_4PY) )
179
max_qp_err = q;
180
if( j > 0xffff && q > max_chroma_qp_err && (i_list == CQM_4IC || i_list == CQM_4PC) )
181
max_chroma_qp_err = q;
182
}
183
if( h->param.analyse.b_transform_8x8 )
184
for( int i_list = 0; i_list < num_8x8_lists; i_list++ )
185
for( int i = 0; i < 64; i++ )
186
{
187
h->unquant8_mf[i_list][q][i] = (1ULL << (q/6 + 16 + 8)) / quant8_mf[i_list][q%6][i];
188
j = SHIFT(quant8_mf[i_list][q%6][i], q/6);
189
h->quant8_mf[i_list][q][i] = (uint16_t)j;
190
191
if( !j )
192
{
193
min_qp_err = X264_MIN( min_qp_err, q );
194
continue;
195
}
196
h->quant8_bias[i_list][q][i] = X264_MIN( DIV(deadzone[i_list]<<10, j), (1<<15)/j );
197
h->quant8_bias0[i_list][q][i] = (1<<15)/j;
198
if( j > 0xffff && q > max_qp_err && (i_list == CQM_8IY || i_list == CQM_8PY) )
199
max_qp_err = q;
200
if( j > 0xffff && q > max_chroma_qp_err && (i_list == CQM_8IC || i_list == CQM_8PC) )
201
max_chroma_qp_err = q;
202
}
203
}
204
205
/* Emergency mode denoising. */
206
x264_emms();
207
CHECKED_MALLOC( h->nr_offset_emergency, sizeof(*h->nr_offset_emergency)*(QP_MAX-QP_MAX_SPEC) );
208
for( int q = 0; q < QP_MAX - QP_MAX_SPEC; q++ )
209
for( int cat = 0; cat < 3 + CHROMA444; cat++ )
210
{
211
int dct8x8 = cat&1;
212
if( !h->param.analyse.b_transform_8x8 && dct8x8 )
213
continue;
214
215
int size = dct8x8 ? 64 : 16;
216
udctcoef *nr_offset = h->nr_offset_emergency[q][cat];
217
/* Denoise chroma first (due to h264's chroma QP offset), then luma, then DC. */
218
int dc_threshold = (QP_MAX-QP_MAX_SPEC)*2/3;
219
int luma_threshold = (QP_MAX-QP_MAX_SPEC)*2/3;
220
int chroma_threshold = 0;
221
222
for( int i = 0; i < size; i++ )
223
{
224
int max = (1 << (7 + BIT_DEPTH)) - 1;
225
/* True "emergency mode": remove all DCT coefficients */
226
if( q == QP_MAX - QP_MAX_SPEC - 1 )
227
{
228
nr_offset[i] = max;
229
continue;
230
}
231
232
int thresh = i == 0 ? dc_threshold : cat >= 2 ? chroma_threshold : luma_threshold;
233
if( q < thresh )
234
{
235
nr_offset[i] = 0;
236
continue;
237
}
238
double pos = (double)(q-thresh+1) / (QP_MAX - QP_MAX_SPEC - thresh);
239
240
/* XXX: this math is largely tuned for /dev/random input. */
241
double start = dct8x8 ? h->unquant8_mf[CQM_8PY][QP_MAX_SPEC][i]
242
: h->unquant4_mf[CQM_4PY][QP_MAX_SPEC][i];
243
/* Formula chosen as an exponential scale to vaguely mimic the effects
244
* of a higher quantizer. */
245
double bias = (pow( 2, pos*(QP_MAX - QP_MAX_SPEC)/10. )*0.003-0.003) * start;
246
nr_offset[i] = X264_MIN( bias + 0.5, max );
247
}
248
}
249
250
if( !h->mb.b_lossless )
251
{
252
while( h->chroma_qp_table[SPEC_QP(h->param.rc.i_qp_min)] <= max_chroma_qp_err )
253
h->param.rc.i_qp_min++;
254
if( min_qp_err <= h->param.rc.i_qp_max )
255
h->param.rc.i_qp_max = min_qp_err-1;
256
if( max_qp_err >= h->param.rc.i_qp_min )
257
h->param.rc.i_qp_min = max_qp_err+1;
258
/* If long level-codes aren't allowed, we need to allow QP high enough to avoid them. */
259
if( !h->param.b_cabac && h->sps->i_profile_idc < PROFILE_HIGH )
260
while( h->chroma_qp_table[SPEC_QP(h->param.rc.i_qp_max)] <= 12 || h->param.rc.i_qp_max <= 12 )
261
h->param.rc.i_qp_max++;
262
if( h->param.rc.i_qp_min > h->param.rc.i_qp_max )
263
{
264
x264_log( h, X264_LOG_ERROR, "Impossible QP constraints for CQM (min=%d, max=%d)\n", h->param.rc.i_qp_min, h->param.rc.i_qp_max );
265
return -1;
266
}
267
}
268
return 0;
269
fail:
270
x264_cqm_delete( h );
271
return -1;
272
}
273
274
#define CQM_DELETE( n, max )\
275
for( int i = 0; i < (max); i++ )\
276
{\
277
int j;\
278
for( j = 0; j < i; j++ )\
279
if( h->quant##n##_mf[i] == h->quant##n##_mf[j] )\
280
break;\
281
if( j == i )\
282
{\
283
x264_free( h-> quant##n##_mf[i] );\
284
x264_free( h->dequant##n##_mf[i] );\
285
x264_free( h->unquant##n##_mf[i] );\
286
}\
287
for( j = 0; j < i; j++ )\
288
if( h->quant##n##_bias[i] == h->quant##n##_bias[j] )\
289
break;\
290
if( j == i )\
291
{\
292
x264_free( h->quant##n##_bias[i] );\
293
x264_free( h->quant##n##_bias0[i] );\
294
}\
295
}
296
297
void x264_cqm_delete( x264_t *h )
298
{
299
CQM_DELETE( 4, 4 );
300
CQM_DELETE( 8, CHROMA444 ? 4 : 2 );
301
x264_free( h->nr_offset_emergency );
302
}
303
304
static int x264_cqm_parse_jmlist( x264_t *h, const char *buf, const char *name,
305
uint8_t *cqm, const uint8_t *jvt, int length )
306
{
307
int i;
308
309
char *p = strstr( buf, name );
310
if( !p )
311
{
312
memset( cqm, 16, length );
313
return 0;
314
}
315
316
p += strlen( name );
317
if( *p == 'U' || *p == 'V' )
318
p++;
319
320
char *nextvar = strstr( p, "INT" );
321
322
for( i = 0; i < length && (p = strpbrk( p, " \t\n," )) && (p = strpbrk( p, "0123456789" )); i++ )
323
{
324
int coef = -1;
325
sscanf( p, "%d", &coef );
326
if( i == 0 && coef == 0 )
327
{
328
memcpy( cqm, jvt, length );
329
return 0;
330
}
331
if( coef < 1 || coef > 255 )
332
{
333
x264_log( h, X264_LOG_ERROR, "bad coefficient in list '%s'\n", name );
334
return -1;
335
}
336
cqm[i] = coef;
337
}
338
339
if( (nextvar && p > nextvar) || i != length )
340
{
341
x264_log( h, X264_LOG_ERROR, "not enough coefficients in list '%s'\n", name );
342
return -1;
343
}
344
345
return 0;
346
}
347
348
int x264_cqm_parse_file( x264_t *h, const char *filename )
349
{
350
char *p;
351
int b_error = 0;
352
353
h->param.i_cqm_preset = X264_CQM_CUSTOM;
354
355
char *buf = x264_slurp_file( filename );
356
if( !buf )
357
{
358
x264_log( h, X264_LOG_ERROR, "can't open file '%s'\n", filename );
359
return -1;
360
}
361
362
while( (p = strchr( buf, '#' )) != NULL )
363
memset( p, ' ', strcspn( p, "\n" ) );
364
365
b_error |= x264_cqm_parse_jmlist( h, buf, "INTRA4X4_LUMA", h->param.cqm_4iy, x264_cqm_jvt4i, 16 );
366
b_error |= x264_cqm_parse_jmlist( h, buf, "INTER4X4_LUMA", h->param.cqm_4py, x264_cqm_jvt4p, 16 );
367
b_error |= x264_cqm_parse_jmlist( h, buf, "INTRA4X4_CHROMA", h->param.cqm_4ic, x264_cqm_jvt4i, 16 );
368
b_error |= x264_cqm_parse_jmlist( h, buf, "INTER4X4_CHROMA", h->param.cqm_4pc, x264_cqm_jvt4p, 16 );
369
b_error |= x264_cqm_parse_jmlist( h, buf, "INTRA8X8_LUMA", h->param.cqm_8iy, x264_cqm_jvt8i, 64 );
370
b_error |= x264_cqm_parse_jmlist( h, buf, "INTER8X8_LUMA", h->param.cqm_8py, x264_cqm_jvt8p, 64 );
371
if( CHROMA444 )
372
{
373
b_error |= x264_cqm_parse_jmlist( h, buf, "INTRA8X8_CHROMA", h->param.cqm_8ic, x264_cqm_jvt8i, 64 );
374
b_error |= x264_cqm_parse_jmlist( h, buf, "INTER8X8_CHROMA", h->param.cqm_8pc, x264_cqm_jvt8p, 64 );
375
}
376
377
x264_free( buf );
378
return b_error;
379
}
380
381
382