-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfast_filter.h
More file actions
438 lines (393 loc) · 12.5 KB
/
fast_filter.h
File metadata and controls
438 lines (393 loc) · 12.5 KB
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
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
/// @file fast_filter.h
/// @brief fast filter operations
/// @author Jeff Perry <jeffsp@gmail.com>
/// @version 1.0
/// @date 2014-09-02
#pragma once
#include <cassert>
#include <cmath>
#include <iostream>
#include <type_traits>
#include <vector>
namespace fast_filter_ops
{
/// @brief index into an image
///
/// @param i rows
/// @param j col
/// @param cols columns in the image
///
/// @return the 1d image index
size_t index (const size_t i, const size_t j, const size_t cols)
{
return i * cols + j;
}
/// @brief policy class for computing the average
class average
{
private:
size_t total;
double sum;
public:
/// @brief ctor
average ()
: total (0)
, sum (0)
{
}
/// @brief update the block totals
///
/// @tparam T pixel type
/// @param x pixel value
template<typename T>
void update (const T &x)
{
++total;
sum += x;
}
/// @brief get result for a block
///
/// @return the average
double result () const
{
return sum / total;
}
};
/// @brief policy class for computing the variance
class variance
{
private:
size_t total;
double sum;
double sum2;
public:
/// @brief ctor
variance ()
: total (0)
, sum (0)
, sum2 (0)
{
}
/// @brief update the block totals
///
/// @tparam T pixel type
/// @param x pixel value
template<typename T>
void update (const T &x)
{
++total;
sum += x;
sum2 += (x * x);
}
/// @brief get result for a block
///
/// @return the variance
double result () const
{
const double mean = sum / total;
return sum2 / total - mean * mean;
}
};
/// @brief policy class for computing the standard deviation
class stddev
{
private:
variance v;
public:
/// @brief update the block totals
///
/// @tparam T pixel type
/// @param x pixel value
template<typename T>
void update (const T &x)
{
v.update (x);
}
/// @brief get result for a block
///
/// @return the standard deviation
double result ()
{
return sqrt (v.result ());
}
};
/// @brief computation for rms contrast is the same as that for standard deviation
class rms_contrast : public stddev { };
/// @brief support for naive average, variance, stddev, rms_contrast
///
/// @tparam OP operation policy class
/// @tparam T image type
/// @param p input image
/// @param rows image rows
/// @param cols image cols
/// @param krows kernel rows
/// @param kcols kernel cols
///
/// @return image containing variances over each block
template<typename OP,typename T>
T slow_filter (const T &p, const size_t rows, const size_t cols, const size_t krows, const size_t kcols)
{
T q (p.size ());
for (size_t i = 0; i + krows < rows + 1; ++i)
{
for (size_t j = 0; j + kcols < cols + 1; ++j)
{
OP op;
for (size_t i2 = 0; i2 < krows; ++i2)
{
for (size_t j2 = 0; j2 < kcols; ++j2)
{
const size_t n = index (i + i2, j + j2, cols);
assert (n < p.size ());
op.update (p[n]);
}
}
const size_t n = index (i + krows / 2, j + kcols / 2, cols);
assert (n < q.size ());
const double y = op.result ();
if (std::is_integral<typename T::value_type>::value)
q[n] = ::round (y);
else
q[n] = y;
}
}
return q;
}
/// @brief helper function
template<typename OP,typename T>
T slow_filter (const T &p, const size_t rows, const size_t cols, const size_t k)
{
return slow_filter<OP,T> (p, rows, cols, k, k);
}
/// @brief helper function
template<typename T>
T slow_average (const T &p, const size_t rows, const size_t cols, const size_t krows, const size_t kcols)
{
return slow_filter<average> (p, rows, cols, krows, kcols);
}
/// @brief helper function
template<typename T>
T slow_average (const T &p, const size_t rows, const size_t cols, const size_t k)
{
return slow_average (p, rows, cols, k, k);
}
/// @brief helper function
template<typename T>
T slow_variance (const T &p, const size_t rows, const size_t cols, const size_t krows, const size_t kcols)
{
return slow_filter<variance> (p, rows, cols, krows, kcols);
}
/// @brief helper function
template<typename T>
T slow_variance (const T &p, const size_t rows, const size_t cols, const size_t k)
{
return slow_variance (p, rows, cols, k, k);
}
/// @brief helper function
template<typename T>
T slow_stddev (const T &p, const size_t rows, const size_t cols, const size_t krows, const size_t kcols)
{
return slow_filter<stddev> (p, rows, cols, krows, kcols);
}
/// @brief helper function
template<typename T>
T slow_stddev (const T &p, const size_t rows, const size_t cols, const size_t k)
{
return slow_stddev (p, rows, cols, k, k);
}
/// @brief helper function
template<typename T>
T slow_rms_contrast (const T &p, const size_t rows, const size_t cols, const size_t krows, const size_t kcols)
{
return slow_filter<rms_contrast> (p, rows, cols, krows, kcols);
}
/// @brief helper function
template<typename T>
T slow_rms_contrast (const T &p, const size_t rows, const size_t cols, const size_t k)
{
return slow_rms_contrast (p, rows, cols, k, k);
}
/// @brief support for fast block ops
///
/// @tparam T input image type
/// @tparam U output image type
/// @param row row over which to operate
/// @param p image image
/// @param q output image
/// @param cols input/output image cols
/// @param kcols kernel columns
/// @param exp exponent of sum
template<typename T,typename U>
void block_sum (const size_t row, const T &p, U &q, const size_t cols, const size_t kcols, const size_t exp)
{
double sum = 0;
for (size_t j = 0; j < cols; ++j)
{
const size_t n1 = index (row, j, cols);
assert (n1 < p.size ());
sum += pow (p[n1], exp);
// make sure we have enough in the sum
if (j + 1 < kcols)
continue;
// write to q's transposed location
const size_t n2 = index (j - kcols / 2, row, cols);
assert (n2 < q.size ());
q[n2] = sum;
// remove old pixel value
const size_t n3 = index (row, j - kcols + 1, cols);
assert (n3 < p.size ());
sum -= pow (p[n3], exp);
}
}
/// @brief get block averages
///
/// @tparam T image type
/// @param p input image
/// @param rows image rows
/// @param cols image cols
/// @param krows kernel rows
/// @param kcols kernel cols
///
/// @return output image
template<typename T>
T fast_average (const T &p, const size_t rows, const size_t cols, const size_t krows, const size_t kcols)
{
std::vector<double> tmp1 (p.size ());
// pass 1: block sum p's rows and write to tmp1
for (size_t i = 0; i < rows; ++i)
block_sum (i, p, tmp1, cols, kcols, 1);
std::vector<double> tmp2 (p.size ());
// pass 2: block sum tmp's rows and write to tmp2
for (size_t j = 0; j < cols; ++j)
block_sum (j, tmp1, tmp2, rows, krows, 1);
T q (p.size ());
// pass 3: compute average
for (size_t i = 0; i < q.size (); ++i)
{
const double y = tmp2[i] / (krows * kcols);
if (std::is_integral<typename T::value_type>::value)
q[i] = ::round (y);
else
q[i] = y;
}
return q;
}
/// @brief helper function
template<typename T>
T fast_average (const T &p, const size_t rows, const size_t cols, const size_t k)
{
return fast_average (p, rows, cols, k, k);
}
/// @brief get block variances
///
/// @tparam T image type
/// @param p input image
/// @param rows image rows
/// @param cols image cols
/// @param krows kernel rows
/// @param kcols kernel cols
///
/// @return output image
template<typename T>
T fast_variance (const T &p, const size_t rows, const size_t cols, const size_t krows, const size_t kcols)
{
std::vector<double> tmp1_1 (p.size ());
std::vector<double> tmp1_2 (p.size ());
// pass 1: block sum p's rows and write to tmp1
for (size_t i = 0; i < rows; ++i)
{
block_sum (i, p, tmp1_1, cols, kcols, 1);
block_sum (i, p, tmp1_2, cols, kcols, 2);
}
std::vector<double> tmp2_1 (p.size ());
std::vector<double> tmp2_2 (p.size ());
// pass 2: block sum tmp's rows and write to tmp2
for (size_t j = 0; j < cols; ++j)
{
block_sum (j, tmp1_1, tmp2_1, rows, krows, 1);
block_sum (j, tmp1_2, tmp2_2, rows, krows, 1);
}
T q (p.size ());
// pass 3: compute variance
for (size_t i = 0; i < q.size (); ++i)
{
const double y1 = tmp2_1[i] / (krows * kcols);
const double y2 = tmp2_2[i] / (krows * kcols);
// variance is E(x^2)-E(x)^2
const double y = y2 - y1 * y1;
if (std::is_integral<typename T::value_type>::value)
q[i] = ::round (y);
else
q[i] = y;
}
return q;
}
/// @brief helper function
template<typename T>
T fast_variance (const T &p, const size_t rows, const size_t cols, const size_t k)
{
return fast_variance (p, rows, cols, k, k);
}
/// @brief get block standard deviations
///
/// @tparam T image type
/// @param p input image
/// @param rows image rows
/// @param cols image cols
/// @param krows kernel rows
/// @param kcols kernel cols
///
/// @return output image
template<typename T>
T fast_stddev (const T &p, const size_t rows, const size_t cols, const size_t krows, const size_t kcols)
{
std::vector<double> tmp1_1 (p.size ());
std::vector<double> tmp1_2 (p.size ());
// pass 1: block sum p's rows and write to tmp1
for (size_t i = 0; i < rows; ++i)
{
block_sum (i, p, tmp1_1, cols, kcols, 1);
block_sum (i, p, tmp1_2, cols, kcols, 2);
}
std::vector<double> tmp2_1 (p.size ());
std::vector<double> tmp2_2 (p.size ());
// pass 2: block sum tmp's rows and write to tmp2
for (size_t j = 0; j < cols; ++j)
{
block_sum (j, tmp1_1, tmp2_1, rows, krows, 1);
block_sum (j, tmp1_2, tmp2_2, rows, krows, 1);
}
T q (p.size ());
// pass 3: compute variance
for (size_t i = 0; i < q.size (); ++i)
{
const double y1 = tmp2_1[i] / (krows * kcols);
const double y2 = tmp2_2[i] / (krows * kcols);
// variance is E(x^2)-E(x)^2
const double y = y2 - y1 * y1;
if (std::is_integral<typename T::value_type>::value)
q[i] = ::round (sqrt (y));
else
q[i] = sqrt (y);
}
return q;
}
/// @brief helper function
template<typename T>
T fast_stddev (const T &p, const size_t rows, const size_t cols, const size_t k)
{
return fast_stddev (p, rows, cols, k, k);
}
/// @brief helper function
template<typename T>
T fast_rms_contrast (const T &p, const size_t rows, const size_t cols, const size_t krows, const size_t kcols)
{
return fast_stddev (p, rows, cols, krows, kcols);
}
/// @brief helper function
template<typename T>
T fast_rms_contrast (const T &p, const size_t rows, const size_t cols, const size_t k)
{
return fast_rms_contrast (p, rows, cols, k, k);
}
}