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
|
/*
* filters.c
*
* Image filtering
*
* Copyright © 2012 Deutsches Elektronen-Synchrotron DESY,
* a research centre of the Helmholtz Association.
*
* Authors:
* 2010-2012 Thomas White <taw@physics.org>
*
* This file is part of CrystFEL.
*
* CrystFEL 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 3 of the License, or
* (at your option) any later version.
*
* CrystFEL 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 CrystFEL. If not, see <http://www.gnu.org/licenses/>.
*
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <assert.h>
#include <gsl/gsl_statistics_int.h>
#include <gsl/gsl_blas.h>
#include "image.h"
static int compare_vals(const void *ap, const void *bp)
{
const signed int a = *(signed int *)ap;
const signed int b = *(signed int *)bp;
if ( a > b ) return 1;
if ( a < b ) return -1;
return 0;
}
static void clean_panel(struct image *image, int sx, int sy)
{
int x, y;
const int s = sizeof(signed int);
for ( x=0; x<512; x++ ) {
signed int vals[128];
double m;
for ( y=0; y<128; y++ ) {
vals[y] = image->data[(x+sx)+(y+sy)*image->width];
}
qsort(&vals[0], 128, s, compare_vals);
m = gsl_stats_int_median_from_sorted_data(vals, 1, 128);
for ( y=0; y<128; y++ ) {
image->data[(x+sx)+(y+sy)*image->width] -= m;
}
}
}
/* Pre-processing to make life easier */
void filter_cm(struct image *image)
{
int px, py;
if ( (image->width != 1024) || (image->height != 1024) ) return;
for ( px=0; px<2; px++ ) {
for ( py=0; py<8; py++ ) {
clean_panel(image, 512*px, 128*py);
}
}
}
void filter_noise(struct image *image)
{
int x, y;
for ( x=0; x<image->width; x++ ) {
for ( y=0; y<image->height; y++ ) {
int dx, dy;
int val = image->data[x+image->width*y];
/* FIXME: This isn't really the right thing to do
* at the edges. */
if ( (x==0) || (x==image->width-1)
|| (y==0) || (y==image->height-1) ) {
if ( val < 0 ) val = 0;
continue;
}
for ( dx=-1; dx<=+1; dx++ ) {
for ( dy=-1; dy<=+1; dy++ ) {
int val2;
val2 = image->data[(x+dx)+image->width*(y+dy)];
if ( val2 < 0 ) val = 0;
}
}
image->data[x+image->width*y] = val;
}
}
}
/* Force the linker to bring in CBLAS to make GSL happy */
void filters_fudge_gslcblas()
{
STATUS("%p\n", cblas_sgemm);
}
#define SWAP(a,b) { float t=(a);(a)=(b);(b)=t; }
static float kth_smallest(float *a, int n, int k)
{
long i, j, l, m;
float x;
l = 0;
m = n-1;
while ( l < m ) {
x=a[k];
i=l;
j=m;
do {
while (a[i]<x) i++;
while (x<a[j]) j--;
if ( i<=j ) {
SWAP(a[i],a[j]);
i++;
j--;
}
} while (i<=j);
if ( j<k ) l = i;
if ( k<i ) m = j;
}
return a[k];
}
#undef SWAP
void filter_median(struct image *image, int size)
{
int counter;
int nn;
float *buffer;
float *localBg;
int pn;
int i;
if ( size <= 0 ) return;
nn = 2*size+1;
nn = nn*nn;
buffer = calloc(nn, sizeof(float));
localBg = calloc(image->width*image->height, sizeof(float));
if ( (buffer == NULL) || (localBg == NULL) ) {
ERROR("Failed to allocate LB buffers.\n");
return;
}
/* Determine local background
* (median over window width either side of current pixel) */
for ( pn=0; pn<image->det->n_panels; pn++ ) {
int fs, ss;
struct panel *p;
int p_w, p_h;
p = &image->det->panels[pn];
p_w = (p->max_fs-p->min_fs)+1;
p_h = (p->max_ss-p->min_ss)+1;
for ( fs=0; fs<p_w; fs++ ) {
for ( ss=0; ss<p_h; ss++ ) {
int ifs, iss;
int e;
counter = 0;
e = fs+p->min_fs;
e += (ss+p->min_ss)*image->width;
// Loop over median window
for ( ifs=-size; ifs<=size; ifs++ ) {
for ( iss=-size; iss<=size; iss++ ) {
int idx;
if ( (fs+ifs) < 0 ) continue;
if ( (fs+ifs) >= p_w ) continue;
if ( (ss+iss) < 0 ) continue;
if ( (ss+iss) >= p_h ) continue;
idx = fs+ifs+p->min_fs;
idx += (ss+iss+p->min_ss)*image->width;
buffer[counter++] = image->data[idx];
}
}
// Find median value
localBg[e] = kth_smallest(buffer, counter, counter/2);
}
}
}
/* Do the background subtraction */
for ( i=0; i<image->width*image->height; i++ ) {
image->data[i] -= localBg[i];
}
free(localBg);
free(buffer);
}
|
