forked from seung-lab/znn-release
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbf_conv.hpp
372 lines (297 loc) · 10.8 KB
/
bf_conv.hpp
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
//
// Copyright (C) 2014 Aleksandar Zlateski <[email protected]>
// ----------------------------------------------------------
//
// 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 3 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, see <http://www.gnu.org/licenses/>.
//
#ifndef ZNN_BF_CONV_HPP_INCLUDED
#define ZNN_BF_CONV_HPP_INCLUDED
#include "types.hpp"
#include "volume_pool.hpp"
namespace zi {
namespace znn {
inline double3d_ptr bf_conv(double3d_ptr ap, double3d_ptr bp)
{
double3d& a = *ap;
double3d& b = *bp;
std::size_t ax = a.shape()[0];
std::size_t ay = a.shape()[1];
std::size_t az = a.shape()[2];
std::size_t bx = b.shape()[0];
std::size_t by = b.shape()[1];
std::size_t bz = b.shape()[2];
std::size_t rx = ax - bx + 1;
std::size_t ry = ay - by + 1;
std::size_t rz = az - bz + 1;
double3d_ptr rp = volume_pool.get_double3d(rx,ry,rz);
double3d& r = *rp;
for ( std::size_t x = 0; x < rx; ++x )
for ( std::size_t y = 0; y < ry; ++y )
for ( std::size_t z = 0; z < rz; ++z )
{
r[x][y][z] = 0;
for ( std::size_t dx = x, wx = bx - 1; dx < bx + x; ++dx, --wx )
for ( std::size_t dy = y, wy = by - 1; dy < by + y; ++dy, --wy )
for ( std::size_t dz = z, wz = bz - 1; dz < bz + z; ++dz, --wz )
{
r[x][y][z] +=
a[dx][dy][dz] *
b[wx][wy][wz];
}
}
return rp;
}
inline double3d_ptr bf_conv_old(double3d_ptr ap, double3d_ptr bp)
{
double3d& a = *ap;
double3d& b = *bp;
std::size_t ax = a.shape()[0];
std::size_t ay = a.shape()[1];
std::size_t az = a.shape()[2];
std::size_t bx = b.shape()[0];
std::size_t by = b.shape()[1];
std::size_t bz = b.shape()[2];
std::size_t rx = ax - bx + 1;
std::size_t ry = ay - by + 1;
std::size_t rz = az - bz + 1;
double3d_ptr rp = volume_pool.get_double3d(rx,ry,rz);
double3d& r = *rp;
for ( std::size_t x = 0; x < rx; ++x )
for ( std::size_t y = 0; y < ry; ++y )
for ( std::size_t z = 0; z < rz; ++z )
{
r[x][y][z] = 0;
for ( std::size_t dx = 0; dx < bx; ++dx )
for ( std::size_t dy = 0; dy < by; ++dy )
for ( std::size_t dz = 0; dz < bz; ++dz )
{
r[x][y][z] +=
a[x+dx][y+dy][z+dz] *
b[bx-1-dx][by-1-dy][bz-1-dz];
}
}
return rp;
}
inline double3d_ptr bf_conv_flipped(double3d_ptr ap, double3d_ptr bp)
{
double3d& a = *ap;
double3d& b = *bp;
std::size_t ax = a.shape()[0];
std::size_t ay = a.shape()[1];
std::size_t az = a.shape()[2];
std::size_t bx = b.shape()[0];
std::size_t by = b.shape()[1];
std::size_t bz = b.shape()[2];
std::size_t rx = ax - bx + 1;
std::size_t ry = ay - by + 1;
std::size_t rz = az - bz + 1;
double3d_ptr rp = volume_pool.get_double3d(rx,ry,rz);
double3d& r = *rp;
for ( std::size_t x = 0; x < rx; ++x )
for ( std::size_t y = 0; y < ry; ++y )
for ( std::size_t z = 0; z < rz; ++z )
{
r[x][y][z] = 0;
for ( std::size_t dx = 0; dx < bx; ++dx )
for ( std::size_t dy = 0; dy < by; ++dy )
for ( std::size_t dz = 0; dz < bz; ++dz )
{
r[x][y][z] +=
a[ax-1-x-dx][ay-1-y-dy][az-1-z-dz] *
b[bx-1-dx][by-1-dy][bz-1-dz];
}
}
return rp;
}
inline double3d_ptr bf_conv_inverse(double3d_ptr ap, double3d_ptr bp)
{
double3d& a = *ap;
double3d& b = *bp;
std::size_t ax = a.shape()[0];
std::size_t ay = a.shape()[1];
std::size_t az = a.shape()[2];
std::size_t bx = b.shape()[0];
std::size_t by = b.shape()[1];
std::size_t bz = b.shape()[2];
std::size_t rx = ax + bx - 1;
std::size_t ry = ay + by - 1;
std::size_t rz = az + bz - 1;
double3d_ptr rp = volume_pool.get_double3d(rx,ry,rz);
double3d& r = *rp;
std::fill_n(r.data(), rx*ry*rz, 0);
for ( std::size_t dx = 0; dx < bx; ++dx )
for ( std::size_t dy = 0; dy < by; ++dy )
for ( std::size_t dz = 0; dz < bz; ++dz )
{
std::size_t fx = bx - 1 - dx;
std::size_t fy = by - 1 - dy;
std::size_t fz = bz - 1 - dz;
for ( std::size_t x = 0; x < ax; ++x )
for ( std::size_t y = 0; y < ay; ++y )
for ( std::size_t z = 0; z < az; ++z )
{
r[x+fx][y+fy][z+fz] += a[x][y][z] * b[dx][dy][dz];
}
}
return rp;
}
inline double3d_ptr bf_conv_constant(const double3d_ptr& ap,
double b)
{
double3d& a = *ap;
std::size_t ax = a.shape()[0];
std::size_t ay = a.shape()[1];
std::size_t az = a.shape()[2];
double3d_ptr rp = volume_pool.get_double3d(ax,ay,az);
double3d& r = *rp;
for ( std::size_t x = 0; x < ax; ++x )
for ( std::size_t y = 0; y < ay; ++y )
for ( std::size_t z = 0; z < az; ++z )
{
r[x][y][z] = a[x][y][z] * b;
}
return rp;
}
inline double bf_conv_flipped_constant(const double3d_ptr& ap,
const double3d_ptr& bp)
{
ASSERT_SAME_SIZE(ap,bp);
std::size_t n = ap->num_elements();
double r = 0;
double3d& a = *ap;
double3d& b = *bp;
for ( std::size_t i = 0; i < n; ++i )
{
r += a.data()[i] * b.data()[i];
}
return r;
}
inline double3d_ptr bf_conv_inverse_constant(const double3d_ptr& ap,
double b)
{
double3d& a = *ap;
std::size_t ax = a.shape()[0];
std::size_t ay = a.shape()[1];
std::size_t az = a.shape()[2];
double3d_ptr rp = volume_pool.get_double3d(ax,ay,az);
double3d& r = *rp;
std::size_t n = ap->num_elements();
for ( std::size_t i = 0; i < n; ++i )
{
r.data()[i] = a.data()[i] * b;
}
return rp;
}
inline double3d_ptr bf_conv_sparse(const double3d_ptr& ap,
const double3d_ptr& bp,
const vec3i& s)
{
double3d& a = *ap;
double3d& b = *bp;
std::size_t ax = a.shape()[0];
std::size_t ay = a.shape()[1];
std::size_t az = a.shape()[2];
std::size_t bx = b.shape()[0];
std::size_t by = b.shape()[1];
std::size_t bz = b.shape()[2];
std::size_t rx = ax - bx + 1;
std::size_t ry = ay - by + 1;
std::size_t rz = az - bz + 1;
double3d_ptr rp = volume_pool.get_double3d(rx,ry,rz);
double3d& r = *rp;
for ( std::size_t x = 0; x < rx; ++x )
for ( std::size_t y = 0; y < ry; ++y )
for ( std::size_t z = 0; z < rz; ++z )
{
r[x][y][z] = 0;
for ( std::size_t dx = x, wx = bx-1; dx < bx + x; dx += s[0], wx -= s[0] )
for ( std::size_t dy = y, wy = by-1; dy < by + y; dy += s[1], wy -= s[1] )
for ( std::size_t dz = z, wz = bz-1; dz < bz + z; dz += s[2], wz -= s[2] )
{
r[x][y][z] +=
a[dx][dy][dz] *
b[wx][wy][wz];
}
}
return rp;
}
inline double3d_ptr bf_conv_flipped_sparse(const double3d_ptr& ap,
const double3d_ptr& bp,
const vec3i& s)
{
double3d& a = *ap;
double3d& b = *bp;
std::size_t ax = a.shape()[0];
std::size_t ay = a.shape()[1];
std::size_t az = a.shape()[2];
std::size_t bx = b.shape()[0];
std::size_t by = b.shape()[1];
std::size_t bz = b.shape()[2];
std::size_t rx = ax - bx + 1;
std::size_t ry = ay - by + 1;
std::size_t rz = az - bz + 1;
double3d_ptr rp = volume_pool.get_double3d(rx,ry,rz);
double3d& r = *rp;
for ( std::size_t x = 0; x < rx; x += s[0])
for ( std::size_t y = 0; y < ry; y += s[1] )
for ( std::size_t z = 0; z < rz; z += s[2] )
{
r[x][y][z] = 0;
for ( std::size_t dx = 0; dx < bx; ++dx )
for ( std::size_t dy = 0; dy < by; ++dy )
for ( std::size_t dz = 0; dz < bz; ++dz )
{
r[x][y][z] +=
a[ax-1-x-dx][ay-1-y-dy][az-1-z-dz] *
b[bx-1-dx][by-1-dy][bz-1-dz];
}
}
return rp;
}
inline double3d_ptr bf_conv_inverse_sparse(const double3d_ptr& ap,
const double3d_ptr& bp,
const vec3i& s)
{
double3d& a = *ap;
double3d& b = *bp;
std::size_t ax = a.shape()[0];
std::size_t ay = a.shape()[1];
std::size_t az = a.shape()[2];
std::size_t bx = b.shape()[0];
std::size_t by = b.shape()[1];
std::size_t bz = b.shape()[2];
std::size_t rx = ax + bx - 1;
std::size_t ry = ay + by - 1;
std::size_t rz = az + bz - 1;
double3d_ptr rp = volume_pool.get_double3d(rx,ry,rz);
double3d& r = *rp;
std::fill_n(r.data(), rx*ry*rz, 0);
for ( std::size_t dx = 0; dx < bx; dx += s[0] )
for ( std::size_t dy = 0; dy < by; dy += s[1])
for ( std::size_t dz = 0; dz < bz; dz += s[2] )
{
std::size_t fx = bx - 1 - dx;
std::size_t fy = by - 1 - dy;
std::size_t fz = bz - 1 - dz;
for ( std::size_t x = 0; x < ax; ++x )
for ( std::size_t y = 0; y < ay; ++y )
for ( std::size_t z = 0; z < az; ++z )
{
r[x+fx][y+fy][z+fz] += a[x][y][z] * b[dx][dy][dz];
}
}
return rp;
}
}} // namespace zi::znn
#endif // ZNN_BF_CONV_HPP_INCLUDED