1 |
|
/***************************************************************************** |
2 |
|
* |
3 |
|
* XVID MPEG-4 VIDEO CODEC |
4 |
|
* - Deprecated code - |
5 |
|
* |
6 |
|
* Copyright(C) 2002 Peter Ross <pross@xvid.org> |
7 |
|
* 2002 Christoph Lampert <gruel@web.de> |
8 |
|
* |
9 |
|
* This program is free software ; you can redistribute it and/or modify |
10 |
|
* it under the terms of the GNU General Public License as published by |
11 |
|
* the Free Software Foundation ; either version 2 of the License, or |
12 |
|
* (at your option) any later version. |
13 |
|
* |
14 |
|
* This program is distributed in the hope that it will be useful, |
15 |
|
* but WITHOUT ANY WARRANTY ; without even the implied warranty of |
16 |
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
17 |
|
* GNU General Public License for more details. |
18 |
|
* |
19 |
|
* You should have received a copy of the GNU General Public License |
20 |
|
* along with this program ; if not, write to the Free Software |
21 |
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
22 |
|
* |
23 |
|
* $Id: adapt_quant.c,v 1.14.2.2 2003-06-09 13:55:10 edgomez Exp $ |
24 |
|
* |
25 |
|
****************************************************************************/ |
26 |
|
|
27 |
#include "../portab.h" |
#include "../portab.h" |
28 |
|
#include "../global.h" |
29 |
#include "adapt_quant.h" |
#include "adapt_quant.h" |
30 |
|
|
31 |
#define MAX(a,b) (((a) > (b)) ? (a) : (b)) |
#include <stdlib.h> /* free, malloc */ |
32 |
|
|
33 |
#define RDIFF(a,b) ((int)(a+0.5)-(int)(b+0.5)) |
#define RDIFF(a,b) ((int)(a+0.5)-(int)(b+0.5)) |
34 |
|
|
35 |
int normalize_quantizer_field(float *in, int *out, int num, int min_quant, int max_quant) |
int |
36 |
|
normalize_quantizer_field(float *in, |
37 |
|
int *out, |
38 |
|
int num, |
39 |
|
int min_quant, |
40 |
|
int max_quant) |
41 |
{ |
{ |
42 |
int i; |
int i; |
43 |
int finished; |
int finished; |
44 |
|
|
45 |
do |
do { |
|
{ |
|
46 |
finished = 1; |
finished = 1; |
47 |
for(i = 1; i < num; i++) |
for (i = 1; i < num; i++) { |
48 |
{ |
if (RDIFF(in[i], in[i - 1]) > 2) { |
|
if(RDIFF(in[i], in[i-1]) > 2) |
|
|
{ |
|
49 |
in[i] -= (float) 0.5; |
in[i] -= (float) 0.5; |
50 |
finished = 0; |
finished = 0; |
51 |
} |
} else if (RDIFF(in[i], in[i - 1]) < -2) { |
|
else if(RDIFF(in[i], in[i-1]) < -2) |
|
|
{ |
|
52 |
in[i-1] -= (float) 0.5; |
in[i-1] -= (float) 0.5; |
53 |
finished = 0; |
finished = 0; |
54 |
} |
} |
55 |
|
|
56 |
if(in[i] > max_quant) |
if (in[i] > max_quant) { |
|
{ |
|
57 |
in[i] = (float) max_quant; |
in[i] = (float) max_quant; |
58 |
finished = 0; |
finished = 0; |
59 |
} |
} |
60 |
if(in[i] < min_quant) |
if (in[i] < min_quant) { |
|
{ |
|
61 |
in[i] = (float) min_quant; |
in[i] = (float) min_quant; |
62 |
finished = 0; |
finished = 0; |
63 |
} |
} |
64 |
if(in[i-1] > max_quant) |
if (in[i - 1] > max_quant) { |
|
{ |
|
65 |
in[i-1] = (float) max_quant; |
in[i-1] = (float) max_quant; |
66 |
finished = 0; |
finished = 0; |
67 |
} |
} |
68 |
if(in[i-1] < min_quant) |
if (in[i - 1] < min_quant) { |
|
{ |
|
69 |
in[i-1] = (float) min_quant; |
in[i-1] = (float) min_quant; |
70 |
finished = 0; |
finished = 0; |
71 |
} |
} |
79 |
return (int) (in[0] + 0.5); |
return (int) (in[0] + 0.5); |
80 |
} |
} |
81 |
|
|
82 |
int adaptive_quantization(unsigned char* buf, int stride, int* intquant, |
int |
83 |
int framequant, int min_quant, int max_quant, |
adaptive_quantization(unsigned char *buf, |
84 |
int mb_width, int mb_height) // no qstride because normalization |
int stride, |
85 |
|
int *intquant, |
86 |
|
int framequant, |
87 |
|
int min_quant, |
88 |
|
int max_quant, |
89 |
|
int mb_width, |
90 |
|
int mb_height) /* no qstride because normalization */ |
91 |
{ |
{ |
92 |
int i,j,k,l; |
int i,j,k,l; |
93 |
|
|
94 |
static float *quant; |
float *quant; |
95 |
unsigned char *ptr; |
unsigned char *ptr; |
96 |
float *val; |
float *val; |
97 |
float global = 0.; |
float global = 0.; |
110 |
const float LowerLimit = 25; |
const float LowerLimit = 25; |
111 |
|
|
112 |
|
|
|
if(!quant) |
|
113 |
if(!(quant = (float *) malloc(mb_width*mb_height * sizeof(float)))) |
if(!(quant = (float *) malloc(mb_width*mb_height * sizeof(float)))) |
114 |
return -1; |
return(-1); |
115 |
|
|
116 |
val = (float *) malloc(mb_width*mb_height * sizeof(float)); |
if(!(val = (float *) malloc(mb_width * mb_height * sizeof(float)))) |
117 |
|
return(-1); |
118 |
|
|
119 |
for(k = 0; k < mb_height; k++) |
for (k = 0; k < mb_height; k++) { |
120 |
{ |
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 |
|
121 |
{ |
{ |
122 |
quant[k*mb_width+l] = (float) framequant; |
quant[k*mb_width+l] = (float) framequant; |
123 |
|
|
124 |
// calculate luminance-masking |
/* calculate luminance-masking */ |
125 |
ptr = &buf[16*k*stride+16*l]; // address of MB |
ptr = &buf[16 * k * stride + 16 * l]; /* address of MB */ |
126 |
|
|
127 |
val[k*mb_width+l] = 0.; |
val[k*mb_width+l] = 0.; |
128 |
|
|
132 |
val[k*mb_width+l] /= 256.; |
val[k*mb_width+l] /= 256.; |
133 |
global += val[k*mb_width+l]; |
global += val[k*mb_width+l]; |
134 |
|
|
135 |
if((val[k*mb_width+l] > LowerLimit) && (val[k*mb_width+l] < UpperLimit)) |
if ((val[k * mb_width + l] > LowerLimit) && |
136 |
|
(val[k * mb_width + l] < UpperLimit)) |
137 |
mid_range++; |
mid_range++; |
138 |
} |
} |
139 |
} |
} |
140 |
|
|
141 |
global /= mb_width*mb_height; |
global /= mb_width*mb_height; |
142 |
|
|
143 |
if((global < GlobalBrightThres) && (global > GlobalDarkThres) |
if (((global <GlobalBrightThres) &&(global >GlobalDarkThres)) |
144 |
|| (mid_range < MidRangeThres)) { |
|| (mid_range < MidRangeThres)) { |
145 |
for(k = 0; k < mb_height; k++) |
for (k = 0; k < mb_height; k++) { |
146 |
{ |
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 |
|
147 |
{ |
{ |
148 |
if(val[k*mb_width+l] < DarkThres) |
if(val[k*mb_width+l] < DarkThres) |
149 |
quant[k*mb_width+l] += DarkAmpl*(DarkThres-val[k*mb_width+l])/DarkThres; |
quant[k * mb_width + l] += |
150 |
|
DarkAmpl * (DarkThres - |
151 |
|
val[k * mb_width + l]) / DarkThres; |
152 |
else if (val[k*mb_width+l]>BrightThres) |
else if (val[k*mb_width+l]>BrightThres) |
153 |
quant[k*mb_width+l] += BrightAmpl*(val[k*mb_width+l]-BrightThres)/(255-BrightThres); |
quant[k * mb_width + l] += |
154 |
|
BrightAmpl * (val[k * mb_width + l] - |
155 |
|
BrightThres) / (255 - BrightThres); |
156 |
} |
} |
157 |
} |
} |
158 |
} |
} |
159 |
|
|
160 |
|
i = normalize_quantizer_field(quant, intquant, |
161 |
|
mb_width * mb_height, |
162 |
|
min_quant, max_quant); |
163 |
|
|
164 |
free(val); |
free(val); |
165 |
return normalize_quantizer_field(quant, intquant, mb_width*mb_height, min_quant, max_quant); |
free(quant); |
166 |
|
|
167 |
|
return(i); |
168 |
|
|
169 |
} |
} |