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 program is an implementation of a part of one or more MPEG-4 |
10 |
|
* Video tools as specified in ISO/IEC 14496-2 standard. Those intending |
11 |
|
* to use this software module in hardware or software products are |
12 |
|
* advised that its use may infringe existing patents or copyrights, and |
13 |
|
* any such use would be at such party's own risk. The original |
14 |
|
* developer of this software module and his/her company, and subsequent |
15 |
|
* editors and their companies, will have no liability for use of this |
16 |
|
* software or modifications or derivatives thereof. |
17 |
|
* |
18 |
|
* This program is free software ; you can redistribute it and/or modify |
19 |
|
* it under the terms of the GNU General Public License as published by |
20 |
|
* the Free Software Foundation ; either version 2 of the License, or |
21 |
|
* (at your option) any later version. |
22 |
|
* |
23 |
|
* This program is distributed in the hope that it will be useful, |
24 |
|
* but WITHOUT ANY WARRANTY ; without even the implied warranty of |
25 |
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
26 |
|
* GNU General Public License for more details. |
27 |
|
* |
28 |
|
* You should have received a copy of the GNU General Public License |
29 |
|
* along with this program ; if not, write to the Free Software |
30 |
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
31 |
|
* |
32 |
|
* $Id$ |
33 |
|
* |
34 |
|
****************************************************************************/ |
35 |
|
|
36 |
#include "../portab.h" |
#include "../portab.h" |
37 |
#include "adapt_quant.h" |
#include "adapt_quant.h" |
38 |
|
|
39 |
|
#include <stdlib.h> /* free, malloc */ |
40 |
|
|
41 |
#define MAX(a,b) (((a) > (b)) ? (a) : (b)) |
#define MAX(a,b) (((a) > (b)) ? (a) : (b)) |
42 |
#define RDIFF(a,b) ((int)(a+0.5)-(int)(b+0.5)) |
#define RDIFF(a,b) ((int)(a+0.5)-(int)(b+0.5)) |
43 |
|
|
44 |
int normalize_quantizer_field(float *in, int *out, int num, int min_quant, int max_quant) |
/***************************************************************************** |
45 |
|
* Functions |
46 |
|
****************************************************************************/ |
47 |
|
|
48 |
|
int |
49 |
|
normalize_quantizer_field(float *in, |
50 |
|
int *out, |
51 |
|
int num, |
52 |
|
int min_quant, |
53 |
|
int max_quant) |
54 |
{ |
{ |
55 |
int i; |
int i; |
56 |
int finished; |
int finished; |
57 |
|
|
58 |
do |
do { |
|
{ |
|
59 |
finished = 1; |
finished = 1; |
60 |
for(i = 1; i < num; i++) |
for (i = 1; i < num; i++) { |
61 |
{ |
if (RDIFF(in[i], in[i - 1]) > 2) { |
|
if(RDIFF(in[i], in[i-1]) > 2) |
|
|
{ |
|
62 |
in[i] -= (float) 0.5; |
in[i] -= (float) 0.5; |
63 |
finished = 0; |
finished = 0; |
64 |
} |
} else if (RDIFF(in[i], in[i - 1]) < -2) { |
|
else if(RDIFF(in[i], in[i-1]) < -2) |
|
|
{ |
|
65 |
in[i-1] -= (float) 0.5; |
in[i-1] -= (float) 0.5; |
66 |
finished = 0; |
finished = 0; |
67 |
} |
} |
68 |
|
|
69 |
if(in[i] > max_quant) |
if (in[i] > max_quant) { |
|
{ |
|
70 |
in[i] = (float) max_quant; |
in[i] = (float) max_quant; |
71 |
finished = 0; |
finished = 0; |
72 |
} |
} |
73 |
if(in[i] < min_quant) |
if (in[i] < min_quant) { |
|
{ |
|
74 |
in[i] = (float) min_quant; |
in[i] = (float) min_quant; |
75 |
finished = 0; |
finished = 0; |
76 |
} |
} |
77 |
if(in[i-1] > max_quant) |
if (in[i - 1] > max_quant) { |
|
{ |
|
78 |
in[i-1] = (float) max_quant; |
in[i-1] = (float) max_quant; |
79 |
finished = 0; |
finished = 0; |
80 |
} |
} |
81 |
if(in[i-1] < min_quant) |
if (in[i - 1] < min_quant) { |
|
{ |
|
82 |
in[i-1] = (float) min_quant; |
in[i-1] = (float) min_quant; |
83 |
finished = 0; |
finished = 0; |
84 |
} |
} |
92 |
return (int) (in[0] + 0.5); |
return (int) (in[0] + 0.5); |
93 |
} |
} |
94 |
|
|
95 |
int adaptive_quantization(unsigned char* buf, int stride, int* intquant, |
int |
96 |
int framequant, int min_quant, int max_quant, |
adaptive_quantization(unsigned char *buf, |
97 |
int mb_width, int mb_height) // no qstride because normalization |
int stride, |
98 |
|
int *intquant, |
99 |
|
int framequant, |
100 |
|
int min_quant, |
101 |
|
int max_quant, |
102 |
|
int mb_width, |
103 |
|
int mb_height) // no qstride because normalization |
104 |
{ |
{ |
105 |
int i,j,k,l; |
int i,j,k,l; |
106 |
|
|
107 |
static float *quant; |
float *quant; |
108 |
unsigned char *ptr; |
unsigned char *ptr; |
109 |
float *val; |
float *val; |
110 |
float global = 0.; |
float global = 0.; |
123 |
const float LowerLimit = 25; |
const float LowerLimit = 25; |
124 |
|
|
125 |
|
|
|
if(!quant) |
|
126 |
if(!(quant = (float *) malloc(mb_width*mb_height * sizeof(float)))) |
if(!(quant = (float *) malloc(mb_width*mb_height * sizeof(float)))) |
127 |
return -1; |
return(-1); |
128 |
|
|
129 |
val = (float *) malloc(mb_width*mb_height * sizeof(float)); |
if(!(val = (float *) malloc(mb_width * mb_height * sizeof(float)))) { |
130 |
|
free(quant); |
131 |
|
return(-1); |
132 |
|
} |
133 |
|
|
134 |
for(k = 0; k < mb_height; k++) |
for (k = 0; k < mb_height; k++) { |
|
{ |
|
135 |
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 |
136 |
{ |
{ |
137 |
quant[k*mb_width+l] = (float) framequant; |
quant[k*mb_width+l] = (float) framequant; |
147 |
val[k*mb_width+l] /= 256.; |
val[k*mb_width+l] /= 256.; |
148 |
global += val[k*mb_width+l]; |
global += val[k*mb_width+l]; |
149 |
|
|
150 |
if((val[k*mb_width+l] > LowerLimit) && (val[k*mb_width+l] < UpperLimit)) |
if ((val[k * mb_width + l] > LowerLimit) && |
151 |
|
(val[k * mb_width + l] < UpperLimit)) |
152 |
mid_range++; |
mid_range++; |
153 |
} |
} |
154 |
} |
} |
155 |
|
|
156 |
global /= mb_width*mb_height; |
global /= mb_width*mb_height; |
157 |
|
|
158 |
if((global < GlobalBrightThres) && (global > GlobalDarkThres) |
if (((global <GlobalBrightThres) &&(global >GlobalDarkThres)) |
159 |
|| (mid_range < MidRangeThres)) { |
|| (mid_range < MidRangeThres)) { |
160 |
for(k = 0; k < mb_height; k++) |
for (k = 0; k < mb_height; k++) { |
|
{ |
|
161 |
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 |
162 |
{ |
{ |
163 |
if(val[k*mb_width+l] < DarkThres) |
if(val[k*mb_width+l] < DarkThres) |
164 |
quant[k*mb_width+l] += DarkAmpl*(DarkThres-val[k*mb_width+l])/DarkThres; |
quant[k * mb_width + l] += |
165 |
|
DarkAmpl * (DarkThres - |
166 |
|
val[k * mb_width + l]) / DarkThres; |
167 |
else if (val[k*mb_width+l]>BrightThres) |
else if (val[k*mb_width+l]>BrightThres) |
168 |
quant[k*mb_width+l] += BrightAmpl*(val[k*mb_width+l]-BrightThres)/(255-BrightThres); |
quant[k * mb_width + l] += |
169 |
|
BrightAmpl * (val[k * mb_width + l] - |
170 |
|
BrightThres) / (255 - BrightThres); |
171 |
} |
} |
172 |
} |
} |
173 |
} |
} |
174 |
|
|
175 |
|
i = normalize_quantizer_field(quant, intquant, |
176 |
|
mb_width * mb_height, |
177 |
|
min_quant, max_quant); |
178 |
|
|
179 |
free(val); |
free(val); |
180 |
return normalize_quantizer_field(quant, intquant, mb_width*mb_height, min_quant, max_quant); |
free(quant); |
181 |
|
|
182 |
|
return(i); |
183 |
|
|
184 |
} |
} |