forked from MarianoJT88/Joint-VO-SF
-
Notifications
You must be signed in to change notification settings - Fork 0
/
structs_parallelization.h
329 lines (266 loc) · 11.4 KB
/
structs_parallelization.h
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
/*********************************************************************************
**Fast Odometry and Scene Flow from RGB-D Cameras based on Geometric Clustering **
**------------------------------------------------------------------------------**
** **
** Copyright(c) 2017, Mariano Jaimez Tarifa, University of Malaga & TU Munich **
** Copyright(c) 2017, Christian Kerl, TU Munich **
** Copyright(c) 2017, MAPIR group, University of Malaga **
** Copyright(c) 2017, Computer Vision group, TU Munich **
** **
** This program is free software: you can redistribute it and/or modify **
** it under the terms of the GNU General Public License (version 3) as **
** published by the Free Software Foundation. **
** **
** 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 structs_parallelization_H
#define structs_parallelization_H
#include <joint_vo_sf.h>
#include <dvo/normal_equation.hpp>
#include <dvo/opencv_ext.hpp>
#include <tbb/parallel_for.h>
#include <tbb/parallel_invoke.h>
#include <tbb/parallel_reduce.h>
#include <tbb/blocked_range2d.h>
typedef tbb::blocked_range2d<int> ImageDomain;
inline cv::Rect toRegion(ImageDomain const &domain)
{
int x = domain.cols().begin(), y = domain.rows().begin(), w = domain.cols().size(), h = domain.rows().size();
return cv::Rect(x, y, w, h);
}
template<void (VO_SF::*F1)(cv::Rect)>
class VO_SF_RegionFunctor
{
private:
VO_SF &self;
public:
VO_SF_RegionFunctor(VO_SF &new_self) : self(new_self) {}
void operator()(ImageDomain const &domain) const
{
cv::Rect r = toRegion(domain);
(self.*F1)(r);
}
};
typedef dvo::NormalEquation<float, 6, 2> NormalEquation;
struct NormalEquationAndChi2
{
NormalEquation nes;
float chi2;
NormalEquationAndChi2()
{
nes.setZero();
chi2 = 0.f;
}
struct Reduce
{
NormalEquationAndChi2 operator()(NormalEquationAndChi2 const& a, NormalEquationAndChi2 const& b) const
{
NormalEquationAndChi2 r;
r.chi2 = a.chi2 + b.chi2;
r.nes.add(a.nes);
r.nes.add(b.nes);
return r;
}
};
};
struct IrlsContext
{
float *A, *B;
float k_Cauchy, Cauchy_factor;
float sum_residuals;
unsigned int num_pixels;
Vector6f Var;
Eigen::VectorXf residuals;
inline void computeNewResiduals()
{
//A is sorted weirdly (Jc11, Jd11, Jc12, Jd12...Jc21, Jd21...), so I can't get it complete with:
//const MatrixXf J_aux = Map<Matrix<float, 6, Dynamic>>( A, 6, num_equations);
//residuals = Map<VectorXf>( B, 2*num_pixels, 1);
sum_residuals = 0.f;
for (size_t i = 0; i < num_pixels; ++i)
{
const JacobianT::MapType J(A + i*JacobianElements);
const ResidualT::MapType r(B + i*ResidualElements);
residuals.block<2,1>(2*i,0) = J*Var - r;
sum_residuals += std::abs(residuals(2*i)) + std::abs(residuals(2*i+1));
}
const float mean_res = std::max(1e-5f, sum_residuals/float(2*num_pixels));
k_Cauchy = Cauchy_factor/(mean_res*mean_res);
}
};
struct IrlsElementFn
{
typedef tbb::blocked_range<size_t> Range;
IrlsContext const &ctx;
IrlsElementFn(IrlsContext const &new_ctx) : ctx(new_ctx) {}
inline void update(NormalEquationAndChi2 &nes_and_chi2, Eigen::Matrix2f &info, size_t i) const
{
const float res_c = ctx.residuals(2*i);
const float res_d = ctx.residuals(2*i+1);
//Intensity and depth weights
const float res_weight_intensity = 1.f/(1.f + ctx.k_Cauchy*res_c*res_c);
const float res_weight_depth = 1.f/(1.f + ctx.k_Cauchy*res_d*res_d);
info(0,0) = res_weight_intensity;
info(1,1) = res_weight_depth;
//Update matrices
const float *A_elem = ctx.A + i*JacobianElements;
const float *B_elem = ctx.B + i*ResidualElements;
nes_and_chi2.nes.update(A_elem, B_elem, info.data());
//Update chi2
nes_and_chi2.chi2 += res_c*res_c*res_weight_intensity + res_d*res_d*res_weight_depth;
}
NormalEquationAndChi2 operator()(const Range& range, const NormalEquationAndChi2 &initial) const
{
NormalEquationAndChi2 r(initial);
Eigen::Matrix2f info = Eigen::Matrix2f::Identity();
for(Range::const_iterator it = range.begin(); it != range.end(); ++it)
{
update(r, info, it);
}
return r;
}
};
struct JacobianElementFn
{
typedef tbb::blocked_range<size_t> Range;
SolveForMotionWorkspace const &ws;
VO_SF const &self;
JacobianElementFn(SolveForMotionWorkspace const &new_ws, VO_SF const &new_self) : ws(new_ws), self(new_self) {}
NormalEquationAndChi2 operator()(const Range& range, const NormalEquationAndChi2 &initial) const
{
const float f_inv = float(self.cols_i)/(2.f*tan(0.5f*self.fovh));
NormalEquationAndChi2 result(initial);
Eigen::Matrix2f info = Eigen::Matrix2f::Identity();
Eigen::MatrixXf const& depth_inter_ = self.depth_inter[self.image_level];
Eigen::MatrixXf const& xx_inter_ = self.xx_inter[self.image_level];
Eigen::MatrixXf const& yy_inter_ = self.yy_inter[self.image_level];
for(Range::const_iterator it = range.begin(); it != range.end(); ++it)
{
JacobianT::MapType J(ws.A + it*JacobianElements);
ResidualT::MapType r(ws.B + it*ResidualElements);
const std::pair<int, int> &vu = ws.indices[it];
const int &v = vu.first;
const int &u = vu.second;
// Precomputed expressions
const float d = depth_inter_(v,u);
const float inv_d = 1.f/d;
const float x = xx_inter_(v,u);
const float y = yy_inter_(v,u);
// Intensity
//------------------------------------------------------------------------------------------------
const float dycomp_c = self.dcu(v,u)*f_inv*inv_d;
const float dzcomp_c = self.dcv(v,u)*f_inv*inv_d;
const float twc = self.weights_c(v,u)*self.k_photometric_res;
//Fill the matrix A
J(0,0) = twc*(dycomp_c*x*inv_d + dzcomp_c*y*inv_d);
J(0,1) = twc*(-dycomp_c);
J(0,2) = twc*(-dzcomp_c);
J(0,3) = twc*(dycomp_c*y - dzcomp_c*x);
J(0,4) = twc*(dycomp_c*inv_d*y*x + dzcomp_c*(y*y*inv_d + d));
J(0,5) = twc*(-dycomp_c*(x*x*inv_d + d) - dzcomp_c*inv_d*y*x);
r(0) = twc*(-self.dct(v,u));
// Geometry
//------------------------------------------------------------------------------------------------
const float dycomp_d = self.ddu(v,u)*f_inv*inv_d;
const float dzcomp_d = self.ddv(v,u)*f_inv*inv_d;
const float twd = self.weights_d(v,u);
//Fill the matrix A
J(1,0) = twd*(1.f + dycomp_d*x*inv_d + dzcomp_d*y*inv_d);
J(1,1) = twd*(-dycomp_d);
J(1,2) = twd*(-dzcomp_d);
J(1,3) = twd*(dycomp_d*y - dzcomp_d*x);
J(1,4) = twd*(y + dycomp_d*inv_d*y*x + dzcomp_d*(y*y*inv_d + d));
J(1,5) = twd*(-x - dycomp_d*(x*x*inv_d + d) - dzcomp_d*inv_d*y*x);
r(1) = twd*(-self.ddt(v,u));
result.nes.update(J.data(), r.data(), info.data());
}
return result;
}
};
struct JacobianElementForRobustOdometryFn
{
typedef tbb::blocked_range<size_t> Range;
SolveForMotionWorkspace const &ws;
VO_SF const &self;
JacobianElementForRobustOdometryFn(SolveForMotionWorkspace const &new_ws, VO_SF const &new_self) : ws(new_ws), self(new_self) {}
float operator()(const Range& range, const float &initial_mean_residual) const
{
const float f_inv = float(self.cols_i)/(2.f*tan(0.5f*self.fovh));
float result = initial_mean_residual;
Eigen::MatrixXf const& depth_inter_ = self.depth_inter[self.image_level];
Eigen::MatrixXf const& xx_inter_ = self.xx_inter[self.image_level];
Eigen::MatrixXf const& yy_inter_ = self.yy_inter[self.image_level];
Eigen::MatrixXi const& labels_ref = self.labels[self.image_level];
for(Range::const_iterator it = range.begin(); it != range.end(); ++it)
{
JacobianT::MapType J(ws.A + it*JacobianElements);
ResidualT::MapType r(ws.B + it*ResidualElements);
const std::pair<int, int> &vu = ws.indices[it];
const int &v = vu.first;
const int &u = vu.second;
// Precomputed expressions
const float d = depth_inter_(v,u);
const float inv_d = 1.f/d;
const float x = xx_inter_(v,u);
const float y = yy_inter_(v,u);
const float w_dinobj = std::max(0.f, 1.f - self.b_segm_warped[labels_ref(v,u)]);
// Intensity
//------------------------------------------------------------------------------------------------
const float dycomp_c = self.dcu(v,u)*f_inv*inv_d;
const float dzcomp_c = self.dcv(v,u)*f_inv*inv_d;
const float twc = w_dinobj*d*self.k_photometric_res;
//Fill the matrix A
J(0,0) = twc*(dycomp_c*x*inv_d + dzcomp_c*y*inv_d);
J(0,1) = twc*(-dycomp_c);
J(0,2) = twc*(-dzcomp_c);
J(0,3) = twc*(dycomp_c*y - dzcomp_c*x);
J(0,4) = twc*(dycomp_c*inv_d*y*x + dzcomp_c*(y*y*inv_d + d));
J(0,5) = twc*(-dycomp_c*(x*x*inv_d + d) - dzcomp_c*inv_d*y*x);
r(0) = twc*(-self.dct(v,u));
// Geometry
//------------------------------------------------------------------------------------------------
const float dycomp_d = self.ddu(v,u)*f_inv*inv_d;
const float dzcomp_d = self.ddv(v,u)*f_inv*inv_d;
const float twd = w_dinobj * d;
//Fill the matrix A
J(1,0) = twd*(1.f + dycomp_d*x*inv_d + dzcomp_d*y*inv_d);
J(1,1) = twd*(-dycomp_d);
J(1,2) = twd*(-dzcomp_d);
J(1,3) = twd*(dycomp_d*y - dzcomp_d*x);
J(1,4) = twd*(y + dycomp_d*inv_d*y*x + dzcomp_d*(y*y*inv_d + d));
J(1,5) = twd*(-x - dycomp_d*(x*x*inv_d + d) - dzcomp_d*inv_d*y*x);
r(1) = twd*(-self.ddt(v,u));
result += r.cwiseAbs().sum();
}
return result;
}
};
// unfortunately we don't have boost or modern c++ :(
template<class X, void (X::*p)()>
class MemberFunctor
{
X& _x;
public:
MemberFunctor(X& x) : _x( x ) {}
void operator()() const { (_x.*p)(); }
};
struct WarpImagesDelegate
{
typedef tbb::blocked_range2d<int> ImageDomain;
VO_SF &self;
WarpImagesDelegate(VO_SF &new_self) : self(new_self) {}
void operator()(ImageDomain const &domain) const
{
int x = domain.cols().begin(), y = domain.rows().begin(), w = domain.cols().size(), h = domain.rows().size();
cv::Rect region(x, y, w, h);
self.warpImages(region);
}
};
#endif