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
|
/*
* Copyright (c) 2017-2020 Arm Limited.
*
* SPDX-License-Identifier: MIT
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include "Scale.h"
#include "Utils.h"
#include "arm_compute/core/utils/misc/Rounding.h"
#include "arm_compute/core/utils/misc/Utility.h"
#include "src/core/utils/ScaleUtils.h"
namespace arm_compute
{
namespace test
{
namespace validation
{
namespace reference
{
template <typename T>
SimpleTensor<T> scale_core(const SimpleTensor<T> &in, float scale_x, float scale_y, InterpolationPolicy policy, BorderMode border_mode, T constant_border_value,
SamplingPolicy sampling_policy, bool ceil_policy_scale, bool align_corners)
{
// Add 1 if ceil_policy_scale is true
const size_t round_value = ceil_policy_scale ? 1U : 0U;
TensorShape shape_scaled(in.shape());
shape_scaled.set(0, (in.shape()[0] + round_value) * scale_x, /* apply_dim_correction = */ false);
shape_scaled.set(1, (in.shape()[1] + round_value) * scale_y, /* apply_dim_correction = */ false);
SimpleTensor<T> out(shape_scaled, in.data_type());
// Compute the ratio between source width/height and destination width/height
const auto wr = arm_compute::scale_utils::calculate_resize_ratio(in.shape()[0], out.shape()[0], align_corners);
const auto hr = arm_compute::scale_utils::calculate_resize_ratio(in.shape()[1], out.shape()[1], align_corners);
const auto width = static_cast<int>(in.shape().x());
const auto height = static_cast<int>(in.shape().y());
// Determine border size
const int border_size = (border_mode == BorderMode::UNDEFINED) ? 0 : 1;
// Area interpolation behaves as Nearest Neighbour in case of up-sampling
if(policy == InterpolationPolicy::AREA && wr <= 1.f && hr <= 1.f)
{
policy = InterpolationPolicy::NEAREST_NEIGHBOR;
}
const uint32_t num_elements = out.num_elements();
for(uint32_t element_idx = 0, count = 0; element_idx < num_elements; ++element_idx, ++count)
{
Coordinates id = index2coord(out.shape(), element_idx);
int idx = id.x();
int idy = id.y();
float x_src = 0;
float y_src = 0;
switch(policy)
{
case InterpolationPolicy::NEAREST_NEIGHBOR:
{
switch(sampling_policy)
{
case SamplingPolicy::TOP_LEFT:
x_src = align_corners ? arm_compute::utils::rounding::round_half_away_from_zero(idx * wr) : std::floor(idx * wr);
y_src = align_corners ? arm_compute::utils::rounding::round_half_away_from_zero(idy * hr) : std::floor(idy * hr);
break;
case SamplingPolicy::CENTER:
//Calculate the source coords without -0.5f is equivalent to round the x_scr/y_src coords
x_src = (idx + 0.5f) * wr;
y_src = (idy + 0.5f) * hr;
break;
default:
ARM_COMPUTE_ERROR("Unsupported sampling policy.");
}
id.set(0, x_src);
id.set(1, y_src);
// If coordinates in range of tensor's width or height
if(is_valid_pixel_index(x_src, y_src, width, height, border_size))
{
out[element_idx] = tensor_elem_at(in, id, border_mode, constant_border_value);
}
break;
}
case InterpolationPolicy::BILINEAR:
{
switch(sampling_policy)
{
case SamplingPolicy::TOP_LEFT:
x_src = idx * wr;
y_src = idy * hr;
break;
case SamplingPolicy::CENTER:
x_src = (idx + 0.5f) * wr - 0.5f;
y_src = (idy + 0.5f) * hr - 0.5f;
break;
default:
ARM_COMPUTE_ERROR("Unsupported sampling policy.");
}
id.set(0, std::floor(x_src));
id.set(1, std::floor(y_src));
if(is_valid_pixel_index(x_src, y_src, width, height, border_size))
{
out[element_idx] = bilinear_policy(in, id, x_src, y_src, border_mode, constant_border_value);
}
else
{
if(border_mode == BorderMode::CONSTANT)
{
out[element_idx] = constant_border_value;
}
else if(border_mode == BorderMode::REPLICATE)
{
id.set(0, utility::clamp<int>(x_src, 0, width - 1));
id.set(1, utility::clamp<int>(y_src, 0, height - 1));
out[element_idx] = in[coord2index(in.shape(), id)];
}
}
break;
}
case InterpolationPolicy::AREA:
{
int x_from = std::floor(idx * wr - 0.5f - x_src);
int y_from = std::floor(idy * hr - 0.5f - y_src);
int x_to = std::ceil((idx + 1) * wr - 0.5f - x_src);
int y_to = std::ceil((idy + 1) * hr - 0.5f - y_src);
const int xi = std::floor(x_src);
const int yi = std::floor(y_src);
// Clamp position to borders
x_src = std::max(-static_cast<float>(border_size), std::min(x_src, static_cast<float>(width - 1 + border_size)));
y_src = std::max(-static_cast<float>(border_size), std::min(y_src, static_cast<float>(height - 1 + border_size)));
// Clamp bounding box offsets to borders
x_from = ((x_src + x_from) < -border_size) ? -border_size : x_from;
y_from = ((y_src + y_from) < -border_size) ? -border_size : y_from;
x_to = ((x_src + x_to) >= (width + border_size)) ? (width - 1 + border_size) : x_to;
y_to = ((y_src + y_to) >= (height + border_size)) ? (height - 1 + border_size) : y_to;
ARM_COMPUTE_ERROR_ON((x_to - x_from + 1) == 0 || (y_to - y_from + 1) == 0);
float sum = 0;
for(int j = yi + y_from, je = yi + y_to; j <= je; ++j)
{
for(int i = xi + x_from, ie = xi + x_to; i <= ie; ++i)
{
id.set(0, static_cast<int>(i));
id.set(1, static_cast<int>(j));
sum += tensor_elem_at(in, id, border_mode, constant_border_value);
}
}
out[element_idx] = sum / ((x_to - x_from + 1) * (y_to - y_from + 1));
break;
}
default:
ARM_COMPUTE_ERROR("Unsupported interpolation mode");
}
}
return out;
}
template <typename T>
SimpleTensor<T> scale(const SimpleTensor<T> &src, float scale_x, float scale_y, InterpolationPolicy policy, BorderMode border_mode, T constant_border_value,
SamplingPolicy sampling_policy, bool ceil_policy_scale, bool align_corners)
{
return scale_core<T>(src, scale_x, scale_y, policy, border_mode, constant_border_value, sampling_policy, ceil_policy_scale, align_corners);
}
template <>
SimpleTensor<uint8_t> scale(const SimpleTensor<uint8_t> &src, float scale_x, float scale_y, InterpolationPolicy policy, BorderMode border_mode, uint8_t constant_border_value,
SamplingPolicy sampling_policy, bool ceil_policy_scale, bool align_corners)
{
SimpleTensor<uint8_t> dst;
if(src.quantization_info().uniform().scale != 0.f)
{
SimpleTensor<float> src_tmp = convert_from_asymmetric(src);
float constant_border_value_f = dequantize_qasymm8(constant_border_value, src.quantization_info());
SimpleTensor<float> dst_tmp = scale_core<float>(src_tmp, scale_x, scale_y, policy, border_mode, constant_border_value_f, sampling_policy, ceil_policy_scale, align_corners);
dst = convert_to_asymmetric<uint8_t>(dst_tmp, src.quantization_info());
}
else
{
dst = scale_core<uint8_t>(src, scale_x, scale_y, policy, border_mode, constant_border_value, sampling_policy, ceil_policy_scale, align_corners);
}
return dst;
}
template <>
SimpleTensor<int8_t> scale(const SimpleTensor<int8_t> &src, float scale_x, float scale_y, InterpolationPolicy policy, BorderMode border_mode, int8_t constant_border_value,
SamplingPolicy sampling_policy, bool ceil_policy_scale, bool align_corners)
{
SimpleTensor<int8_t> dst;
if(src.quantization_info().uniform().scale != 0.f)
{
SimpleTensor<float> src_tmp = convert_from_asymmetric(src);
float constant_border_value_f = dequantize_qasymm8_signed(constant_border_value, src.quantization_info());
SimpleTensor<float> dst_tmp = scale_core<float>(src_tmp, scale_x, scale_y, policy, border_mode, constant_border_value_f, sampling_policy, ceil_policy_scale, align_corners);
dst = convert_to_asymmetric<int8_t>(dst_tmp, src.quantization_info());
}
else
{
dst = scale_core<int8_t>(src, scale_x, scale_y, policy, border_mode, constant_border_value, sampling_policy, ceil_policy_scale, align_corners);
}
return dst;
}
template SimpleTensor<int16_t> scale(const SimpleTensor<int16_t> &src, float scale_x, float scale_y, InterpolationPolicy policy, BorderMode border_mode, int16_t constant_border_value,
SamplingPolicy sampling_policy, bool ceil_policy_scale, bool align_corners);
template SimpleTensor<half> scale(const SimpleTensor<half> &src, float scale_x, float scale_y, InterpolationPolicy policy, BorderMode border_mode, half constant_border_value,
SamplingPolicy sampling_policy, bool ceil_policy_scale, bool align_corners);
template SimpleTensor<float> scale(const SimpleTensor<float> &src, float scale_x, float scale_y, InterpolationPolicy policy, BorderMode border_mode, float constant_border_value,
SamplingPolicy sampling_policy, bool ceil_policy_scale, bool align_corners);
} // namespace reference
} // namespace validation
} // namespace test
} // namespace arm_compute
|
