32 const std::vector<int>& filter_dims,
34 const TReal* out_positions,
36 const TReal* inp_positions,
37 const TFeat* inp_features,
38 const TFeat* inp_importance,
39 size_t neighbors_index_size,
40 const TIndex* neighbors_index,
41 const TFeat* neighbors_importance,
42 const int64_t* neighbors_row_splits,
45 const TFeat* out_features_gradient,
47 const bool NEIGHBORS_IMPORTANCE = neighbors_importance;
49 typedef Eigen::Array<TReal, VECSIZE, 1> Vec_t;
51 InterpolationVec_t interpolation;
53 const int in_channels = filter_dims[filter_dims.size() - 2];
54 const int out_channels = filter_dims[filter_dims.size() - 1];
56 int spatial_filter_size = 1;
57 for (
int i = 0; i < 3; ++i) spatial_filter_size *= filter_dims[i];
58 const int total_filter_size =
59 spatial_filter_size * in_channels * out_channels;
60 Eigen::Array<int, 3, 1> filter_size_xyz(filter_dims[2], filter_dims[1],
63 memset(filter_backprop, 0,
sizeof(TOut) * total_filter_size);
64 std::mutex filter_backprop_mutex;
67 tbb::blocked_range<size_t>(0, num_out, 32),
68 [&](
const tbb::blocked_range<size_t>& r) {
69 int range_length = r.end() - r.begin();
71 Eigen::Matrix<TFeat, Eigen::Dynamic, Eigen::Dynamic>
B(
72 in_channels * spatial_filter_size, range_length);
74 Eigen::Matrix<TFeat, Eigen::Dynamic, Eigen::Dynamic> C(
75 out_channels, range_length);
77 typedef Eigen::Array<TFeat, VECSIZE, Eigen::Dynamic> Matrix;
78 Matrix infeat(
VECSIZE, in_channels);
80 Eigen::Array<TReal, 3, 1> offsets_(offsets[0], offsets[1],
83 Eigen::Array<TReal, VECSIZE, 3> inv_extents;
84 if (INDIVIDUAL_EXTENT ==
false) {
85 if (ISOTROPIC_EXTENT) {
86 inv_extents = 1 / extents[0];
88 inv_extents.col(0) = 1 / extents[0];
89 inv_extents.col(1) = 1 / extents[1];
90 inv_extents.col(2) = 1 / extents[2];
94 for (
size_t out_idx = r.begin(); out_idx != r.end();
96 const int out_col = out_idx - r.begin();
97 const size_t neighbor_start = neighbors_row_splits[out_idx];
98 const size_t neighbor_end =
99 neighbors_row_splits[out_idx + 1];
102 if (INDIVIDUAL_EXTENT) {
103 if (ISOTROPIC_EXTENT) {
104 inv_extents = 1 / extents[out_idx];
106 inv_extents.col(0) = 1 / extents[3 * out_idx + 0];
107 inv_extents.col(1) = 1 / extents[3 * out_idx + 1];
108 inv_extents.col(2) = 1 / extents[3 * out_idx + 2];
112 typename InterpolationVec_t::Weight_t interp_weights;
113 typename InterpolationVec_t::Idx_t interp_indices;
115 int vec_valid_count = 0;
123 for (
size_t n = neighbor_start; n < neighbor_end; ++n) {
124 const size_t inp_idx = neighbors_index[n];
125 const int i = vec_valid_count;
126 x(i) = inp_positions[inp_idx * 3 + 0] -
127 out_positions[out_idx * 3 + 0];
128 y(i) = inp_positions[inp_idx * 3 + 1] -
129 out_positions[out_idx * 3 + 1];
130 z(i) = inp_positions[inp_idx * 3 + 2] -
131 out_positions[out_idx * 3 + 2];
133 const TFeat n_importance =
134 (NEIGHBORS_IMPORTANCE ? neighbors_importance[n]
136 normalizer += TOut(n_importance);
138 for (
int ic = 0; ic < in_channels; ++ic)
140 inp_features[inp_idx * in_channels + ic];
142 TFeat importance = TFeat(1);
143 if (POINT_IMPORTANCE)
144 importance = inp_importance[inp_idx];
145 if (NEIGHBORS_IMPORTANCE) importance *= n_importance;
147 if (POINT_IMPORTANCE || NEIGHBORS_IMPORTANCE) {
148 for (
int ic = 0; ic < in_channels; ++ic)
149 infeat(i, ic) *= importance;
153 if (vec_valid_count ==
VECSIZE) {
154 ComputeFilterCoordinates<ALIGN_CORNERS, MAPPING>(
155 x, y, z, filter_size_xyz, inv_extents,
157 interpolation.Interpolate(
158 interp_weights, interp_indices, x, y, z,
159 filter_size_xyz, in_channels);
160 for (
int k = 0; k <
VECSIZE; ++k)
161 for (
int j = 0; j < InterpolationVec_t::Size();
163 for (
int ic = 0; ic < in_channels; ++ic)
164 B(interp_indices(j, k) + ic, out_col) +=
165 TFeat(interp_weights(j, k)) *
171 if (vec_valid_count) {
172 ComputeFilterCoordinates<ALIGN_CORNERS, MAPPING>(
173 x, y, z, filter_size_xyz, inv_extents,
175 interpolation.Interpolate(interp_weights,
176 interp_indices, x, y, z,
177 filter_size_xyz, in_channels);
178 for (
int k = 0; k < vec_valid_count; ++k)
179 for (
int j = 0; j < InterpolationVec_t::Size();
181 for (
int ic = 0; ic < in_channels; ++ic)
182 B(interp_indices(j, k) + ic, out_col) +=
183 TFeat(interp_weights(j, k)) *
188 C.col(out_col) = Eigen::Map<
189 const Eigen::Array<TFeat, Eigen::Dynamic, 1>>(
190 out_features_gradient + out_idx * out_channels,
193 if (normalize && normalizer != TOut(0))
194 C.col(out_col) /= TFeat(normalizer);
198 Eigen::Matrix<TOut, Eigen::Dynamic, Eigen::Dynamic> A(
199 out_channels, spatial_filter_size * in_channels);
201 A = (C *
B.transpose()).
template cast<TOut>();
204 std::lock_guard<std::mutex> lock(filter_backprop_mutex);
206 for (
int j = 0; j < spatial_filter_size * in_channels; ++j)
207 for (
int i = 0; i < out_channels; ++i, ++linear_i) {
208 filter_backprop[linear_i] += A(i, j);
void CConvBackpropFilterCPU(TOut *filter_backprop, const std::vector< int > &filter_dims, size_t num_out, const TReal *out_positions, size_t num_inp, const TReal *inp_positions, const TFeat *inp_features, const TFeat *inp_importance, size_t neighbors_index_size, const TIndex *neighbors_index, const TFeat *neighbors_importance, const int64_t *neighbors_row_splits, const TReal *extents, const TReal *offsets, const TFeat *out_features_gradient, InterpolationMode interpolation, CoordinateMapping coordinate_mapping, bool align_corners, bool individual_extent, bool isotropic_extent, bool normalize)
Definition ContinuousConvBackpropFilter.h:287