1 |
|
/***************************************************************************** |
2 |
|
* |
3 |
|
* XVID MPEG-4 VIDEO CODEC |
4 |
|
* - Adaptive quantization functions - |
5 |
|
* |
6 |
|
* Copyright(C) 2002 Peter Ross <pross@xvid.org> |
7 |
|
* 2002 Christoph Lampert <gruel@web.de> |
8 |
|
* |
9 |
|
* This file is part of XviD, a free MPEG-4 video encoder/decoder |
10 |
|
* |
11 |
|
* XviD is free software; you can redistribute it and/or modify it |
12 |
|
* under the terms of the GNU General Public License as published by |
13 |
|
* the Free Software Foundation; either version 2 of the License, or |
14 |
|
* (at your option) any later version. |
15 |
|
* |
16 |
|
* This program is distributed in the hope that it will be useful, |
17 |
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
18 |
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
19 |
|
* GNU General Public License for more details. |
20 |
|
* |
21 |
|
* You should have received a copy of the GNU General Public License |
22 |
|
* along with this program; if not, write to the Free Software |
23 |
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
24 |
|
* |
25 |
|
* Under section 8 of the GNU General Public License, the copyright |
26 |
|
* holders of XVID explicitly forbid distribution in the following |
27 |
|
* countries: |
28 |
|
* |
29 |
|
* - Japan |
30 |
|
* - United States of America |
31 |
|
* |
32 |
|
* Linking XviD statically or dynamically with other modules is making a |
33 |
|
* combined work based on XviD. Thus, the terms and conditions of the |
34 |
|
* GNU General Public License cover the whole combination. |
35 |
|
* |
36 |
|
* As a special exception, the copyright holders of XviD give you |
37 |
|
* permission to link XviD with independent modules that communicate with |
38 |
|
* XviD solely through the VFW1.1 and DShow interfaces, regardless of the |
39 |
|
* license terms of these independent modules, and to copy and distribute |
40 |
|
* the resulting combined work under terms of your choice, provided that |
41 |
|
* every copy of the combined work is accompanied by a complete copy of |
42 |
|
* the source code of XviD (the version of XviD used to produce the |
43 |
|
* combined work), being distributed under the terms of the GNU General |
44 |
|
* Public License plus this exception. An independent module is a module |
45 |
|
* which is not derived from or based on XviD. |
46 |
|
* |
47 |
|
* Note that people who make modified versions of XviD are not obligated |
48 |
|
* to grant this special exception for their modified versions; it is |
49 |
|
* their choice whether to do so. The GNU General Public License gives |
50 |
|
* permission to release a modified version without this exception; this |
51 |
|
* exception also makes it possible to release a modified version which |
52 |
|
* carries forward this exception. |
53 |
|
* |
54 |
|
* $Id$ |
55 |
|
* |
56 |
|
****************************************************************************/ |
57 |
|
|
58 |
#include "../portab.h" |
#include "../portab.h" |
59 |
#include "adapt_quant.h" |
#include "adapt_quant.h" |
60 |
|
|
63 |
#define MAX(a,b) (((a) > (b)) ? (a) : (b)) |
#define MAX(a,b) (((a) > (b)) ? (a) : (b)) |
64 |
#define RDIFF(a,b) ((int)(a+0.5)-(int)(b+0.5)) |
#define RDIFF(a,b) ((int)(a+0.5)-(int)(b+0.5)) |
65 |
|
|
66 |
|
/***************************************************************************** |
67 |
|
* Functions |
68 |
|
****************************************************************************/ |
69 |
|
|
70 |
int |
int |
71 |
normalize_quantizer_field(float *in, |
normalize_quantizer_field(float *in, |
72 |
int *out, |
int *out, |
126 |
{ |
{ |
127 |
int i, j, k, l; |
int i, j, k, l; |
128 |
|
|
129 |
static float *quant; |
float *quant; |
130 |
unsigned char *ptr; |
unsigned char *ptr; |
131 |
float *val; |
float *val; |
132 |
float global = 0., maxval = 0.; |
float global = 0.; |
133 |
|
uint32_t mid_range = 0; |
|
const float DarkThres = 0.25; |
|
|
const float DarkAmpl = 7.0; |
|
|
|
|
|
const float BrightThres = 4.0; |
|
|
const float BrightAmpl = 5.0; |
|
134 |
|
|
135 |
const char LowestVal = 10; |
const float DarkAmpl = 14 / 2; |
136 |
|
const float BrightAmpl = 10 / 2; |
137 |
|
const float DarkThres = 70; |
138 |
|
const float BrightThres = 200; |
139 |
|
|
140 |
|
const float GlobalDarkThres = 60; |
141 |
|
const float GlobalBrightThres = 170; |
142 |
|
|
143 |
|
const float MidRangeThres = 20; |
144 |
|
const float UpperLimit = 200; |
145 |
|
const float LowerLimit = 25; |
146 |
|
|
|
const float GlobalBrightThres = 220.0; |
|
|
const float GlobalDarkThres = 20.0; |
|
|
float global_quant = 1.0; |
|
147 |
|
|
|
if (!quant) |
|
148 |
if (!(quant = (float *) malloc(mb_width * mb_height * sizeof(float)))) |
if (!(quant = (float *) malloc(mb_width * mb_height * sizeof(float)))) |
149 |
return -1; |
return(-1); |
150 |
|
|
151 |
val = (float *) malloc(mb_width * mb_height * sizeof(float)); |
if(!(val = (float *) malloc(mb_width * mb_height * sizeof(float)))) { |
152 |
|
free(quant); |
153 |
|
return(-1); |
154 |
|
} |
155 |
|
|
156 |
for (k = 0; k < mb_height; k++) { |
for (k = 0; k < mb_height; k++) { |
157 |
for (l = 0; l < mb_width; l++) // do this for all macroblocks individually |
for (l = 0; l < mb_width; l++) // do this for all macroblocks individually |
165 |
|
|
166 |
for (i = 0; i < 16; i++) |
for (i = 0; i < 16; i++) |
167 |
for (j = 0; j < 16; j++) |
for (j = 0; j < 16; j++) |
|
{ |
|
|
if( ptr[i * stride + j] < LowestVal ) |
|
|
ptr[i * stride + j] = 0; |
|
168 |
val[k * mb_width + l] += ptr[i * stride + j]; |
val[k * mb_width + l] += ptr[i * stride + j]; |
|
} |
|
169 |
val[k * mb_width + l] /= 256.; |
val[k * mb_width + l] /= 256.; |
170 |
global += val[k * mb_width + l]; |
global += val[k * mb_width + l]; |
171 |
if( val[k * mb_width + l] > maxval ) |
|
172 |
maxval = val[k * mb_width + l]; |
if ((val[k * mb_width + l] > LowerLimit) && |
173 |
|
(val[k * mb_width + l] < UpperLimit)) |
174 |
|
mid_range++; |
175 |
} |
} |
176 |
} |
} |
177 |
|
|
178 |
global /= mb_width * mb_height; |
global /= mb_width * mb_height; |
|
maxval /= global; |
|
|
if( global < GlobalDarkThres ) |
|
|
global_quant *= -1.0; |
|
|
else if ( global < GlobalBrightThres ) |
|
|
global_quant = 0.0; |
|
179 |
|
|
180 |
|
if (((global <GlobalBrightThres) &&(global >GlobalDarkThres)) |
181 |
|
|| (mid_range < MidRangeThres)) { |
182 |
for (k = 0; k < mb_height; k++) { |
for (k = 0; k < mb_height; k++) { |
183 |
for (l = 0; l < mb_width; l++) // do this for all macroblocks individually |
for (l = 0; l < mb_width; l++) // do this for all macroblocks individually |
184 |
{ |
{ |
|
val[k * mb_width + l] /= global; |
|
185 |
if (val[k * mb_width + l] < DarkThres) |
if (val[k * mb_width + l] < DarkThres) |
186 |
quant[k * mb_width + l] += global_quant + |
quant[k * mb_width + l] += |
187 |
DarkAmpl * (DarkThres - val[k * mb_width + l]) / DarkThres; |
DarkAmpl * (DarkThres - |
188 |
|
val[k * mb_width + l]) / DarkThres; |
189 |
else if (val[k * mb_width + l] > BrightThres) |
else if (val[k * mb_width + l] > BrightThres) |
190 |
quant[k * mb_width + l] += global_quant + |
quant[k * mb_width + l] += |
191 |
BrightAmpl * (val[k * mb_width + l] - BrightThres) / (maxval - BrightThres); |
BrightAmpl * (val[k * mb_width + l] - |
192 |
|
BrightThres) / (255 - BrightThres); |
193 |
} |
} |
194 |
} |
} |
195 |
free(val); |
} |
196 |
return normalize_quantizer_field(quant, intquant, mb_width * mb_height, |
|
197 |
|
i = normalize_quantizer_field(quant, intquant, |
198 |
|
mb_width * mb_height, |
199 |
min_quant, max_quant); |
min_quant, max_quant); |
200 |
|
|
201 |
|
free(val); |
202 |
|
free(quant); |
203 |
|
|
204 |
|
return(i); |
205 |
|
|
206 |
} |
} |