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
|
// Copyright (c) 2015, UChicago Argonne, LLC. All rights reserved.
// Copyright 2015. UChicago Argonne, LLC. This software was produced
// under U.S. Government contract DE-AC02-06CH11357 for Argonne National
// Laboratory (ANL), which is operated by UChicago Argonne, LLC for the
// U.S. Department of Energy. The U.S. Government has rights to use,
// reproduce, and distribute this software. NEITHER THE GOVERNMENT NOR
// UChicago Argonne, LLC MAKES ANY WARRANTY, EXPRESS OR IMPLIED, OR
// ASSUMES ANY LIABILITY FOR THE USE OF THIS SOFTWARE. If software is
// modified to produce derivative works, such modified software should
// be clearly marked, so as not to confuse it with the version available
// from ANL.
// Additionally, redistribution and use in source and binary forms, with
// or without modification, are permitted provided that the following
// conditions are met:
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in
// the documentation and/or other materials provided with the
// distribution.
// * Neither the name of UChicago Argonne, LLC, Argonne National
// Laboratory, ANL, the U.S. Government, nor the names of its
// contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
// THIS SOFTWARE IS PROVIDED BY UChicago Argonne, LLC AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
// FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL UChicago
// Argonne, LLC OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
// INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
// BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
// ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
#include <assert.h>
#include <limits.h>
#include <math.h>
#include "libtomo/morph.h"
DLL void
downsample(const float* data, int dx, int dy, int dz, int level, int axis, float* out)
{
unsigned m, n, p, binsize;
unsigned long long i, j, k, ind;
binsize = pow(2, level);
// Ensure that largest array is small enough to be indexable
assert(ULLONG_MAX / dx / dy / dz > 0);
// Ensure safe comparison between unsigned (ijk) and signed (xyz)
assert(dx >= 0 && dy >= 0 && dz >= 0);
if(axis == 0)
{
dx /= binsize;
for(m = 0, ind = 0; m < (unsigned) dx; m++)
{
i = m * (dy * dz);
for(p = 0; p < binsize; p++)
{
for(n = 0; n < (unsigned) dy; n++)
{
j = n * dz;
for(k = 0; k < (unsigned) dz; k++)
{
out[i + j + k] += data[ind] / binsize;
ind++;
}
}
}
}
}
else if(axis == 1)
{
dy /= binsize;
for(m = 0, ind = 0; m < (unsigned) dx; m++)
{
i = m * (dy * dz);
for(n = 0; n < (unsigned) dy; n++)
{
j = n * dz;
for(p = 0; p < binsize; p++)
{
for(k = 0; k < (unsigned) dz; k++)
{
out[i + j + k] += data[ind] / binsize;
ind++;
}
}
}
}
}
else if(axis == 2)
{
dz /= binsize;
for(m = 0, ind = 0; m < (unsigned) dx; m++)
{
i = m * (dy * dz);
for(n = 0; n < (unsigned) dy; n++)
{
j = n * dz;
for(k = 0; k < (unsigned) dz; k++)
{
for(p = 0; p < binsize; p++)
{
out[i + j + k] += data[ind] / binsize;
ind++;
}
}
}
}
}
}
DLL void
upsample(const float* data, int dx, int dy, int dz, int level, int axis, float* out)
{
unsigned m, n, p, binsize;
unsigned long long k, i, j, ind;
binsize = pow(2, level);
// Ensure that largest array is small enough to be indexable
assert(ULLONG_MAX / binsize / dy / dz / dx > 0);
// Ensure safe comparison between unsigned (ijk) and signed (xyz)
assert(dx >= 0 && dy >= 0 && dz >= 0);
if(axis == 0)
{
for(m = 0, ind = 0; m < (unsigned) dx; m++)
{
i = m * (dy * dz);
for(p = 0; p < binsize; p++)
{
for(n = 0; n < (unsigned) dy; n++)
{
j = n * dz;
for(k = 0; k < (unsigned) dz; k++)
{
out[ind] = data[i + j + k];
ind++;
}
}
}
}
}
else if(axis == 1)
{
for(m = 0, ind = 0; m < (unsigned) dx; m++)
{
i = m * (dy * dz);
for(n = 0; n < (unsigned) dy; n++)
{
j = n * dz;
for(p = 0; p < binsize; p++)
{
for(k = 0; k < (unsigned) dz; k++)
{
out[ind] = data[i + j + k];
ind++;
}
}
}
}
}
else if(axis == 2)
{
for(m = 0, ind = 0; m < (unsigned) dx; m++)
{
i = m * (dy * dz);
for(n = 0; n < (unsigned) dy; n++)
{
j = n * dz;
for(k = 0; k < (unsigned) dz; k++)
{
for(p = 0; p < binsize; p++)
{
out[ind] = data[i + j + k];
ind++;
}
}
}
}
}
}
DLL void
sample(int mode, const float* data, int dx, int dy, int dz, int level, int axis,
float* out)
{
if(mode == 0)
{
downsample(data, dx, dy, dz, level, axis, out);
}
else if(mode == 1)
{
upsample(data, dx, dy, dz, level, axis, out);
}
}
|
