/
yuvbilateral.c
339 lines (257 loc) · 8.53 KB
/
yuvbilateral.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
/*
* yuvbilateral.c
* Mark Heath <mjpeg0 at silicontrip.org>
* http://silicontrip.net/~mark/lavtools/
*
**<h3>Bilateral spacial filter</h3>
**
**<p> performs a bilateral filter over the video. Is horribly slow, and a little
**too agressive.</p>
**
**<p>Based on code from <a href="http://user.cs.tu-berlin.de/~eitz/bilateral_filtering/">m.eitz</a> </p>
**
**<h4>EXAMPLE</h4>
**<p>Useful options are:</p>
**<pre>
**-D 3
**-R 3
**</pre>
**<p>
**Higher values of R cause more smearing. Higher values of D increase the
**search radius, and increase processing time.
**</p>
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*
*/
#include <stdio.h>
#include <sys/types.h>
#include <stdlib.h>
#include <unistd.h>
#include <signal.h>
#include <string.h>
#include <math.h>
#include <yuv4mpeg.h>
#include <mpegconsts.h>
#include "utilyuv.h"
#define VERSION "0.1"
#define PRECISION 256
struct parameters {
unsigned int sigmaD;
unsigned int sigmaR;
unsigned int kernelRadius;
unsigned int *kernelD;
unsigned int *kernelR;
unsigned int *gaussSimilarity;
unsigned int twoSigmaRSquared;
int direction;
};
static struct parameters this;
static void print_usage()
{
fprintf (stderr,
"usage: yuvbilateral -r sigmaR -d sigmaD [-v 0..2]\n"
"\t -r sigmaR set the similarity distance\n"
"\t -r sigmaD set the search radius\n"
);
}
unsigned int gauss (unsigned int sigma, int x, int y) {
return exp(-((x * x + y * y) / (2.0 * (1.0* sigma/PRECISION) * (1.0*sigma/PRECISION)))) * PRECISION;
}
unsigned int similarity(int p, int s) {
// this equals: Math.exp(-(( Math.abs(p-s)) / 2 * this.sigmaR * this.sigmaR));
// but is precomputed to improve performance
if (this.direction == 0)
return this.gaussSimilarity[abs(p-s)];
return this.gaussSimilarity[255-abs(p-s)];
}
static void filterinitialize () {
int kernelSize, center;
int x,y,i;
this.kernelRadius = this.sigmaD>this.sigmaR?this.sigmaD * 2:this.sigmaR * 2;
this.kernelRadius = this.kernelRadius / PRECISION;
this.twoSigmaRSquared = (2 * (1.0 *this.sigmaR/PRECISION) * (1.0 *this.sigmaR/PRECISION)) * PRECISION;
kernelSize = this.kernelRadius * 2 + 1;
center = (kernelSize - 1) / 2;
this.kernelD = (unsigned int*) malloc( sizeof (unsigned int) * kernelSize * kernelSize);
if (this.kernelD == NULL ){
mjpeg_error_exit1("Cannot allocate memory for filter kernel");
}
for ( x = -center; x < -center + kernelSize; x++) {
for ( y = -center; y < -center + kernelSize; y++) {
this.kernelD[x + center + (y + center) * kernelSize] = gauss(this.sigmaD, x, y);
//fprintf(stderr,"x: %d y: %d = %d\n",x,y,this.kernelD[x + center + (y + center) * kernelSize]);
}
}
this.gaussSimilarity = (unsigned int*) malloc(sizeof (unsigned int) * 256);
if (this.gaussSimilarity == NULL ){
free(this.kernelD);
mjpeg_error_exit1("Cannot allocate memory for gaussian curve");
}
// precomute all possible similarity values for
// performance reasons
for ( i = 0; i < 256; i++) {
this.gaussSimilarity[i] = exp(-((i) / (1.0 * this.twoSigmaRSquared/PRECISION))) * PRECISION;
}
}
static void filterpixel(uint8_t *o, uint8_t *p, int i, int j, int w, int h) {
unsigned int sum =0;
unsigned int totalWeight = 0;
int weight;
int m,n;
uint8_t intensityCenter = p[j * w + i];
int mMax = i + this.kernelRadius;
int nMax = j + this.kernelRadius;
for ( m = i-this.kernelRadius; m < mMax; m++) {
for ( n = j-this.kernelRadius; n < nMax; n++) {
if (m>=0 && n>=0 && m < w && n < h) {
int intensityKernelPos = p[m + n * w];
weight = this.kernelD[(i-m + this.kernelRadius) + (j-n + this.kernelRadius) * (this.kernelRadius*2)] * similarity(intensityKernelPos,intensityCenter);
totalWeight += weight;
sum += (weight * intensityKernelPos);
}
}
}
if (totalWeight > 0 )
o[j * w + i] = (sum / totalWeight);
else
o[j * w + i] = intensityCenter;
}
static void filterframe (uint8_t *m[3], uint8_t *n[3], y4m_stream_info_t *si)
{
int x,y;
int height,width,height2,width2;
height=y4m_si_get_plane_height(si,0);
width=y4m_si_get_plane_width(si,0);
// I'll assume that the chroma subsampling is the same for both u and v channels
height2=y4m_si_get_plane_height(si,1);
width2=y4m_si_get_plane_width(si,1);
for (y=0; y < height; y++) {
for (x=0; x < width; x++) {
filterpixel(m[0],n[0],x,y,width,height);
if (x<width2 && y<height2) {
filterpixel(m[1],n[1],x,y,width2,height2);
filterpixel(m[2],n[2],x,y,width2,height2);
}
}
}
}
static void filter(int fdIn, int fdOut, y4m_stream_info_t *inStrInfo )
{
y4m_frame_info_t in_frame ;
uint8_t *yuv_data[3];
uint8_t *yuv_odata[3];
int read_error_code ;
int write_error_code ;
// Allocate memory for the YUV channels
if (chromalloc(yuv_data,inStrInfo))
mjpeg_error_exit1 ("Could'nt allocate memory for the YUV4MPEG data!");
if (chromalloc(yuv_odata,inStrInfo)){
chromafree(yuv_data);
mjpeg_error_exit1 ("Could'nt allocate memory for the YUV4MPEG data!");
}
/* Initialize counters */
write_error_code = Y4M_OK ;
y4m_init_frame_info( &in_frame );
read_error_code = y4m_read_frame(fdIn, inStrInfo,&in_frame,yuv_data );
while( Y4M_ERR_EOF != read_error_code && write_error_code == Y4M_OK ) {
// do work
if (read_error_code == Y4M_OK) {
filterframe(yuv_odata,yuv_data,inStrInfo);
write_error_code = y4m_write_frame( fdOut, inStrInfo, &in_frame, yuv_odata );
}
y4m_fini_frame_info( &in_frame );
y4m_init_frame_info( &in_frame );
read_error_code = y4m_read_frame(fdIn, inStrInfo,&in_frame,yuv_data );
}
// Clean-up regardless an error happened or not
y4m_fini_frame_info( &in_frame );
chromafree( yuv_data );
chromafree( yuv_odata);
if( read_error_code != Y4M_ERR_EOF )
mjpeg_error_exit1 ("Error reading from input stream!");
}
// *************************************************************************************
// MAIN
// *************************************************************************************
int main (int argc, char *argv[])
{
int verbose = 4; // LOG_ERROR ;
int fdIn = 0 ;
int fdOut = 1 ;
y4m_stream_info_t in_streaminfo ;
int c ;
const static char *legal_flags = "v:hr:d:i";
float sigma;
this.sigmaR = 0;
this.sigmaD = 0;
this.direction = 0;
while ((c = getopt (argc, argv, legal_flags)) != -1) {
switch (c) {
case 'v':
verbose = atoi (optarg);
if (verbose < 0 || verbose > 2)
mjpeg_error_exit1 ("Verbose level must be [0..2]");
break;
case 'h':
case '?':
print_usage (argv);
return 0 ;
break;
case 'r':
sigma = atof(optarg);
this.sigmaR = sigma * PRECISION;
break;
case 'd':
sigma = atof(optarg);
this.sigmaD = sigma * PRECISION;
break;
case 'i':
this.direction = 1;
break;
}
}
if (this.sigmaR == 0 || this.sigmaD == 0) {
print_usage();
mjpeg_error_exit1("Sigma D and R must be set");
}
// mjpeg tools global initialisations
mjpeg_default_handler_verbosity (verbose);
// Initialize input streams
y4m_init_stream_info (&in_streaminfo);
// ***************************************************************
// Get video stream informations (size, framerate, interlacing, aspect ratio).
// The streaminfo structure is filled in
// ***************************************************************
// INPUT comes from stdin, we check for a correct file header
if (y4m_read_stream_header (fdIn, &in_streaminfo) != Y4M_OK)
mjpeg_error_exit1 ("Could'nt read YUV4MPEG header!");
// Information output
mjpeg_info ("yuvbilateral (version " VERSION ") is a spatial bilateral filter for yuv streams");
mjpeg_info ("(C) 2010 Mark Heath <mjpeg0 at silicontrip.org>");
mjpeg_info ("yuvbilateral -h for help");
/* in that function we do all the important work */
filterinitialize ();
y4m_write_stream_header(fdOut,&in_streaminfo);
filter(fdIn,fdOut, &in_streaminfo);
y4m_fini_stream_info (&in_streaminfo);
//filteruninitialize();
return 0;
}
/*
* Local variables:
* tab-width: 8
* indent-tabs-mode: nil
* End:
*/