-
Notifications
You must be signed in to change notification settings - Fork 274
/
grad.c
257 lines (228 loc) · 10.5 KB
/
grad.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
// 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
// Laboratongridx (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 binangridx 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 binangridx 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
// Laboratongridx, 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, EXEMPLAngridx, 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 THEOngridx 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 "utils.h"
void
grad(const float* data, int dy, int dt, int dx, const float* center,
const float* theta, float* recon, int ngridx, int ngridy, int num_iter,
const float* reg_pars)
{
float* gridx = (float*) malloc((ngridx + 1) * sizeof(float));
float* gridy = (float*) malloc((ngridy + 1) * sizeof(float));
float* coordx = (float*) malloc((ngridy + 1) * sizeof(float));
float* coordy = (float*) malloc((ngridx + 1) * sizeof(float));
float* ax = (float*) malloc((ngridx + ngridy) * sizeof(float));
float* ay = (float*) malloc((ngridx + ngridy) * sizeof(float));
float* bx = (float*) malloc((ngridx + ngridy) * sizeof(float));
float* by = (float*) malloc((ngridx + ngridy) * sizeof(float));
float* coorx = (float*) malloc((ngridx + ngridy) * sizeof(float));
float* coory = (float*) malloc((ngridx + ngridy) * sizeof(float));
float* dist = (float*) malloc((ngridx + ngridy) * sizeof(float));
int* indi = (int*) malloc((ngridx + ngridy) * sizeof(int));
float* simdata = (float*) malloc((dy * dt * dx) * sizeof(float));
float* sum_dist = (float*) malloc((ngridx * ngridy) * sizeof(float));
float* prox1 = (float*) malloc((dy * dt * dx) * sizeof(float));
float* grad = (float*) malloc((dy * ngridx * ngridy) * sizeof(float));
float* grad0 = (float*) malloc((dy * ngridx * ngridy) * sizeof(float));
float* recon0 = (float*) malloc((dy * ngridx * ngridy) * sizeof(float));
float* lambda = (float*) malloc((dy) * sizeof(float));
assert(coordx != NULL && coordy != NULL && ax != NULL && ay != NULL &&
by != NULL && bx != NULL && coorx != NULL && coory != NULL &&
dist != NULL && indi != NULL && simdata != NULL &&
sum_dist != NULL && grad != NULL && grad0 != NULL &&
recon0 != NULL && lambda != NULL);
int s, p, d, i, n;
int quadrant;
float theta_p, sin_p, cos_p;
float mov, xi, yi;
int asize, bsize, csize;
double upd;
int ind_data, ind_recon;
float sum_dist2;
int ix, iy;
// scaling constant r such that r*R(r*R^*(data)) ~ data
float r;
r = 1 / sqrt(dx * dt / 2.0);
// scale initial guess
for(s = 0; s < dy; s++)
{
ind_recon = s * ngridx * ngridy;
for(iy = 0; iy < ngridy; iy++)
for(ix = 0; ix < ngridx; ix++)
recon[ind_recon + iy * ngridx + ix] /= r;
}
memset(grad0, 0, dy * ngridx * ngridy * sizeof(float));
memset(prox1, 0, dy * dt * dx * sizeof(float));
memcpy(recon0, recon, dy * ngridx * ngridy * sizeof(float));
// Iterations
for(i = 0; i < num_iter; i++)
{
// initialize simdata and grad to 0
memset(simdata, 0, dy * dt * dx * sizeof(float));
memset(grad, 0, dy * ngridx * ngridy * sizeof(float));
// compute gradient, grad = 2*R^*(R(recon)-data)
// For each slice
for(s = 0; s < dy; s++)
{
ind_recon = s * ngridx * ngridy;
// compute proximal of the projections
preprocessing(ngridx, ngridy, dx, center[s], &mov, gridx,
gridy); // Outputs: mov, gridx, gridy
// initialize sum_dist and update to zero
memset(sum_dist, 0, (ngridx * ngridy) * sizeof(float));
// For each projection angle
for(p = 0; p < dt; p++)
{
// Calculate the sin and cos values
// of the projection angle and find
// at which quadrant on the cartesian grid.
theta_p = fmodf(theta[p], 2.0f * (float) M_PI);
quadrant = calc_quadrant(theta_p);
sin_p = sinf(theta_p);
cos_p = cosf(theta_p);
// For each detector pixel
for(d = 0; d < dx; d++)
{
// Calculate coordinates
xi = -ngridx - ngridy;
yi = 0.5f * (1 - dx) + d + mov;
calc_coords(ngridx, ngridy, xi, yi, sin_p, cos_p, gridx,
gridy, coordx, coordy);
// Merge the (coordx, gridy) and (gridx, coordy)
trim_coords(ngridx, ngridy, coordx, coordy, gridx, gridy,
&asize, ax, ay, &bsize, bx, by);
// Sort the array of intersection points (ax, ay) and
// (bx, by). The new sorted intersection points are
// stored in (coorx, coory). Total number of points
// are csize.
sort_intersections(quadrant, asize, ax, ay, bsize, bx, by,
&csize, coorx, coory);
// Calculate the distances (dist) between the
// intersection points (coorx, coory). Find the
// indices of the pixels on the reconstruction grid.
calc_dist(ngridx, ngridy, csize, coorx, coory, indi, dist);
// Calculate simdata
calc_simdata(s, p, d, ngridx, ngridy, dt, dx, csize, indi,
dist, recon,
simdata); // Output: simdata
ind_data = d + p * dx + s * dt * dx;
prox1[ind_data] = simdata[ind_data] * r - data[ind_data];
// Calculate dist*dist
sum_dist2 = 0.0f;
for(n = 0; n < csize - 1; n++)
{
sum_dist2 += dist[n] * dist[n];
sum_dist[indi[n]] += dist[n];
}
if(sum_dist2 != 0.0f)
for(n = 0; n < csize - 1; n++)
grad[ind_recon + indi[n]] +=
2 * r * prox1[ind_data] * dist[n];
}
}
}
// compute the gradient step
for(s = 0; s < dy; s++)
{
if(reg_pars[0] < 0)
{
if(i == 0)
// first gradient step (small)
lambda[s] = 1e-3;
else
{
upd = 0;
lambda[s] = 0;
ind_recon = s * ngridx * ngridy;
for(iy = 0; iy < ngridy; iy++)
for(ix = 0; ix < ngridx; ix++)
{
lambda[s] +=
(recon[ind_recon + iy * ngridx + ix] -
recon0[ind_recon + iy * ngridx + ix]) *
(grad[ind_recon + iy * ngridx + ix] -
grad0[ind_recon + iy * ngridx + ix]);
upd += (grad[ind_recon + iy * ngridx + ix] -
grad0[ind_recon + iy * ngridx + ix]) *
(grad[ind_recon + iy * ngridx + ix] -
grad0[ind_recon + iy * ngridx + ix]);
}
lambda[s] /= upd;
}
}
else
lambda[s] = reg_pars[0];
}
// save previous iterations
memcpy(grad0, grad, dy * ngridx * ngridy * sizeof(float));
memcpy(recon0, recon, dy * ngridx * ngridy * sizeof(float));
// update, recon = recon - lambda*grad
for(s = 0; s < dy; s++)
{
ind_recon = s * ngridx * ngridy;
for(iy = 0; iy < ngridy; iy++)
for(ix = 0; ix < ngridx; ix++)
recon[ind_recon + iy * ngridx + ix] -=
lambda[s] * grad[ind_recon + iy * ngridx + ix];
}
}
// scale result
for(s = 0; s < dy; s++)
{
ind_recon = s * ngridx * ngridy;
for(iy = 0; iy < ngridy; iy++)
for(ix = 0; ix < ngridx; ix++)
recon[ind_recon + iy * ngridx + ix] *= r;
}
free(gridx);
free(gridy);
free(coordx);
free(coordy);
free(ax);
free(ay);
free(bx);
free(by);
free(coorx);
free(coory);
free(dist);
free(indi);
free(simdata);
free(sum_dist);
free(prox1);
free(recon0);
free(grad0);
free(grad);
}