blob: f0dab3baac40c9559873f26364a9816e1101f634 [file] [log] [blame]
Moritz Pflanzer3ce3ff42017-07-21 17:41:02 +01001/*
Pablo Tello54e98d92019-02-05 16:16:19 +00002 * Copyright (c) 2017-2019 ARM Limited.
Moritz Pflanzer3ce3ff42017-07-21 17:41:02 +01003 *
4 * SPDX-License-Identifier: MIT
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to
8 * deal in the Software without restriction, including without limitation the
9 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
10 * sell copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
12 *
13 * The above copyright notice and this permission notice shall be included in all
14 * copies or substantial portions of the Software.
15 *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
22 * SOFTWARE.
23 */
24#include "DepthConcatenateLayer.h"
25
Moritz Pflanzera09de0c2017-09-01 20:41:12 +010026#include "tests/validation/Helpers.h"
Moritz Pflanzer3ce3ff42017-07-21 17:41:02 +010027
28namespace arm_compute
29{
30namespace test
31{
32namespace validation
33{
34namespace reference
35{
36template <typename T>
Pablo Tello54e98d92019-02-05 16:16:19 +000037SimpleTensor<T> depthconcatenate_layer(const std::vector<SimpleTensor<T>> &srcs, SimpleTensor<T> &dst)
Moritz Pflanzer3ce3ff42017-07-21 17:41:02 +010038{
39 // Create reference
40 std::vector<TensorShape> shapes;
41
42 for(const auto &src : srcs)
43 {
44 shapes.emplace_back(src.shape());
45 }
46
Moritz Pflanzer3ce3ff42017-07-21 17:41:02 +010047 // Compute reference
48 int depth_offset = 0;
49 const int width_out = dst.shape().x();
50 const int height_out = dst.shape().y();
51 const int depth_out = dst.shape().z();
52 const int out_stride_z = width_out * height_out;
53 const int batches = dst.shape().total_size_upper(3);
Pablo Tello661c2522019-02-11 17:03:15 +000054 if(srcs[0].data_type() == DataType::QASYMM8 && srcs[0].quantization_info() != dst.quantization_info())
55 {
Pablo Tello0dde6672019-02-12 11:09:48 +000056 for(int b = 0; b < batches; ++b)
Pablo Tello661c2522019-02-11 17:03:15 +000057 {
Pablo Tello0dde6672019-02-12 11:09:48 +000058 // input tensors can have smaller width and height than the output, so for each output's slice we need to requantize 0 (as this is the value
59 // used in NEFillBorderKernel by NEDepthConcatenateLayer) using the corresponding quantization info for that particular slice/input tensor.
60 int slice = 0;
61 for(const auto &src : srcs)
Pablo Tello661c2522019-02-11 17:03:15 +000062 {
Pablo Tello0dde6672019-02-12 11:09:48 +000063 auto ptr_slice = static_cast<T *>(dst(Coordinates(0, 0, slice, b)));
64 const auto num_elems_in_slice((dst.num_elements() / depth_out) * src.shape().z());
65 std::transform(ptr_slice, ptr_slice + num_elems_in_slice, ptr_slice, [src, dst](T t)
66 {
67 return dst.quantization_info().quantize(src.quantization_info().dequantize(0), RoundingPolicy::TO_NEAREST_UP);
68 });
69 slice += src.shape().z();
70 }
Pablo Tello661c2522019-02-11 17:03:15 +000071 }
72 }
73 else
74 {
75 std::fill_n(dst.data(), dst.num_elements(), 0);
76 }
Moritz Pflanzer3ce3ff42017-07-21 17:41:02 +010077
78 for(const auto &src : srcs)
79 {
80 ARM_COMPUTE_ERROR_ON(depth_offset >= depth_out);
81 ARM_COMPUTE_ERROR_ON(batches != static_cast<int>(src.shape().total_size_upper(3)));
82
83 const int width = src.shape().x();
84 const int height = src.shape().y();
85 const int depth = src.shape().z();
86 const int x_diff = (width_out - width) / 2;
87 const int y_diff = (height_out - height) / 2;
88
89 const T *src_ptr = src.data();
90
91 for(int b = 0; b < batches; ++b)
92 {
93 const size_t offset_to_first_element = b * out_stride_z * depth_out + depth_offset * out_stride_z + y_diff * width_out + x_diff;
94
95 for(int d = 0; d < depth; ++d)
96 {
97 for(int r = 0; r < height; ++r)
98 {
Pablo Tello54e98d92019-02-05 16:16:19 +000099 if(src.data_type() == DataType::QASYMM8 && src.quantization_info() != dst.quantization_info())
100 {
101 std::transform(src_ptr, src_ptr + width, dst.data() + offset_to_first_element + d * out_stride_z + r * width_out, [src, dst](T t)
102 {
103 const float dequantized_input = src.quantization_info().dequantize(t);
104 return dst.quantization_info().quantize(dequantized_input, RoundingPolicy::TO_NEAREST_UP);
105 });
106 src_ptr += width;
107 }
108 else
109 {
110 std::copy(src_ptr, src_ptr + width, dst.data() + offset_to_first_element + d * out_stride_z + r * width_out);
111 src_ptr += width;
112 }
Moritz Pflanzer3ce3ff42017-07-21 17:41:02 +0100113 }
114 }
115 }
116
117 depth_offset += depth;
118 }
119
120 return dst;
121}
122
Pablo Tello54e98d92019-02-05 16:16:19 +0000123template SimpleTensor<uint8_t> depthconcatenate_layer(const std::vector<SimpleTensor<uint8_t>> &srcs, SimpleTensor<uint8_t> &dst);
124template SimpleTensor<float> depthconcatenate_layer(const std::vector<SimpleTensor<float>> &srcs, SimpleTensor<float> &dst);
125template SimpleTensor<half> depthconcatenate_layer(const std::vector<SimpleTensor<half>> &srcs, SimpleTensor<half> &dst);
Moritz Pflanzer3ce3ff42017-07-21 17:41:02 +0100126} // namespace reference
127} // namespace validation
128} // namespace test
129} // namespace arm_compute