33 const std::vector<int>& filter_dims,
35 const TReal* out_positions,
36 const TFeat* out_importance,
38 const TReal* inp_positions,
39 const TFeat* inp_features,
40 const TFeat* inp_neighbors_importance_sum,
41 const int64_t* inp_neighbors_row_splits,
42 size_t neighbors_index_size,
43 const TIndex* neighbors_index,
44 const TFeat* neighbors_importance,
45 const int64_t* neighbors_row_splits,
48 const TFeat* out_features_gradient) {
49 const bool NEIGHBOR_IMPORTANCE = neighbors_importance;
51 typedef Eigen::Array<TReal, VECSIZE, 1> Vec_t;
53 InterpolationVec_t interpolation;
55 const int in_channels = filter_dims[filter_dims.size() - 2];
56 const int out_channels = filter_dims[filter_dims.size() - 1];
58 int spatial_filter_size = 1;
59 for (
int i = 0; i < 3; ++i) spatial_filter_size *= filter_dims[i];
60 Eigen::Array<int, 3, 1> filter_size_xyz(filter_dims[2], filter_dims[1],
63 memset(filter_backprop, 0,
64 sizeof(TOut) * spatial_filter_size * in_channels * out_channels);
65 std::mutex filter_backprop_mutex;
68 tbb::blocked_range<size_t>(0, num_out, 32),
69 [&](
const tbb::blocked_range<size_t>& r) {
70 int range_length = r.end() - r.begin();
72 Eigen::Matrix<TFeat, Eigen::Dynamic, Eigen::Dynamic>
B(
73 in_channels * spatial_filter_size, range_length);
75 Eigen::Matrix<TFeat, Eigen::Dynamic, Eigen::Dynamic> C(
76 out_channels, range_length);
78 typedef Eigen::Array<TFeat, VECSIZE, Eigen::Dynamic> Matrix;
79 Matrix infeat(
VECSIZE, in_channels);
81 Eigen::Array<TReal, 3, 1> offsets_(offsets[0], offsets[1],
84 Eigen::Array<TReal, VECSIZE, 3> inv_extents;
85 if (INDIVIDUAL_EXTENT ==
false) {
86 if (ISOTROPIC_EXTENT) {
87 inv_extents = 1 / extents[0];
89 inv_extents.col(0) = 1 / extents[0];
90 inv_extents.col(1) = 1 / extents[1];
91 inv_extents.col(2) = 1 / extents[2];
95 for (
size_t out_idx = r.begin(); out_idx != r.end();
97 const int out_col = out_idx - r.begin();
98 const size_t neighbor_start = neighbors_row_splits[out_idx];
99 const size_t neighbor_end =
100 neighbors_row_splits[out_idx + 1];
102 C.col(out_col) = Eigen::Map<
103 const Eigen::Array<TFeat, Eigen::Dynamic, 1>>(
104 out_features_gradient + out_idx * out_channels,
107 typename InterpolationVec_t::Weight_t interp_weights;
108 typename InterpolationVec_t::Idx_t interp_indices;
110 int vec_valid_count = 0;
118 for (
size_t n = neighbor_start; n < neighbor_end; ++n) {
119 const size_t inp_idx = neighbors_index[n];
121 const int i = vec_valid_count;
122 x(i) = out_positions[out_idx * 3 + 0] -
123 inp_positions[inp_idx * 3 + 0];
124 y(i) = out_positions[out_idx * 3 + 1] -
125 inp_positions[inp_idx * 3 + 1];
126 z(i) = out_positions[out_idx * 3 + 2] -
127 inp_positions[inp_idx * 3 + 2];
129 if (INDIVIDUAL_EXTENT) {
130 if (ISOTROPIC_EXTENT) {
131 inv_extents.row(i) = 1 / extents[inp_idx];
134 1 / extents[3 * inp_idx + 0];
136 1 / extents[3 * inp_idx + 1];
138 1 / extents[3 * inp_idx + 2];
142 TFeat n_importance = NEIGHBOR_IMPORTANCE
143 ? neighbors_importance[n]
145 for (
int ic = 0; ic < in_channels; ++ic)
147 inp_features[inp_idx * in_channels + ic] *
152 if (NEIGHBOR_IMPORTANCE) {
153 if (inp_neighbors_importance_sum[inp_idx] !=
155 normalizer /= inp_neighbors_importance_sum
158 size_t num_inp_neighbors;
159 const size_t inp_neighbor_start =
160 inp_neighbors_row_splits[inp_idx];
161 const size_t inp_neighbor_end =
162 inp_neighbors_row_splits[inp_idx + 1];
164 inp_neighbor_end - inp_neighbor_start;
165 if (num_inp_neighbors > 0)
166 normalizer /= TFeat(num_inp_neighbors);
168 for (
int ic = 0; ic < in_channels; ++ic)
169 infeat(i, ic) *= normalizer;
173 if (vec_valid_count ==
VECSIZE ||
174 n + 1 == neighbor_end) {
175 ComputeFilterCoordinates<ALIGN_CORNERS, MAPPING>(
176 x, y, z, filter_size_xyz, inv_extents,
178 interpolation.Interpolate(
179 interp_weights, interp_indices, x, y, z,
180 filter_size_xyz, in_channels);
181 for (
int k = 0; k < vec_valid_count; ++k) {
182 for (
int j = 0; j < InterpolationVec_t::Size();
184 for (
int ic = 0; ic < in_channels; ++ic)
185 B(interp_indices(j, k) + ic, out_col) +=
186 TFeat(interp_weights(j, k)) *
196 if (out_importance) {
197 for (
size_t out_idx = r.begin(); out_idx != r.end();
199 const int out_col = out_idx - r.begin();
200 C.col(out_col) *= out_importance[out_idx];
204 Eigen::Matrix<TOut, Eigen::Dynamic, Eigen::Dynamic> A(
205 out_channels, spatial_filter_size * in_channels);
207 A = (C *
B.transpose()).
template cast<TOut>();
210 std::lock_guard<std::mutex> lock(filter_backprop_mutex);
212 for (
int j = 0; j < spatial_filter_size * in_channels; ++j)
213 for (
int i = 0; i < out_channels; ++i, ++linear_i) {
214 filter_backprop[linear_i] += A(i, j);
void _CConvTransposeBackpropFilterCPU(TOut *filter_backprop, const std::vector< int > &filter_dims, size_t num_out, const TReal *out_positions, const TFeat *out_importance, size_t num_inp, const TReal *inp_positions, const TFeat *inp_features, const TFeat *inp_neighbors_importance_sum, const int64_t *inp_neighbors_row_splits, 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)
Definition ContinuousConvTransposeBackpropFilter.h:32
void CConvTransposeBackpropFilterCPU(TOut *filter_backprop, const std::vector< int > &filter_dims, size_t num_out, const TReal *out_positions, const TFeat *out_importance, size_t num_inp, const TReal *inp_positions, const TFeat *inp_features, const TFeat *inp_neighbors_importance_sum, const int64_t *inp_neighbors_row_splits, 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 ContinuousConvTransposeBackpropFilter.h:303