blob: 073341146203e6bdbd516c166bcaab56b9f9b4a8 [file] [log] [blame]
Giorgio Arena93a690e2017-08-01 16:09:33 +01001/*
2 * Copyright (c) 2017 ARM Limited.
3 *
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 */
Isabella Gottardi1fab09f2017-07-13 15:55:57 +010024#ifndef __ARM_COMPUTE_TEST_VALIDATION_UTILS_H__
25#define __ARM_COMPUTE_TEST_VALIDATION_UTILS_H__
Giorgio Arena93a690e2017-08-01 16:09:33 +010026
Isabella Gottardi1fab09f2017-07-13 15:55:57 +010027#include "arm_compute/core/Types.h"
28#include "tests/Globals.h"
29#include "tests/ILutAccessor.h"
30#include "tests/Types.h"
Isabella Gottardi1fab09f2017-07-13 15:55:57 +010031
32#include <array>
33#include <random>
34#include <type_traits>
35#include <utility>
36#include <vector>
Giorgio Arena93a690e2017-08-01 16:09:33 +010037
38namespace arm_compute
39{
40namespace test
41{
42namespace validation
43{
Moritz Pflanzer6c6597c2017-09-24 12:09:41 +010044// Return a tensor element at a specified coordinate with different border modes
Giorgio Arena93a690e2017-08-01 16:09:33 +010045template <typename T>
Moritz Pflanzer6c6597c2017-09-24 12:09:41 +010046T tensor_elem_at(const SimpleTensor<T> &src, Coordinates coord, BorderMode border_mode, T constant_border_value)
47{
48 const int x = coord.x();
49 const int y = coord.y();
50 const int width = src.shape().x();
51 const int height = src.shape().y();
52
53 // If coordinates beyond range of tensor's width or height
54 if(x < 0 || y < 0 || x >= width || y >= height)
55 {
56 if(border_mode == BorderMode::REPLICATE)
57 {
58 coord.set(0, std::max(0, std::min(x, width - 1)));
59 coord.set(1, std::max(0, std::min(y, height - 1)));
60 }
61 else
62 {
63 return constant_border_value;
64 }
65 }
66
67 return src[coord2index(src.shape(), coord)];
68}
Isabella Gottardi1fab09f2017-07-13 15:55:57 +010069
70template <typename T>
Georgios Pinitas583137c2017-08-31 18:12:42 +010071T bilinear_policy(const SimpleTensor<T> &in, Coordinates id, float xn, float yn, BorderMode border_mode, T constant_border_value);
Abe Mbise3f0ab6e2017-09-01 16:43:47 +010072
Moritz Pflanzer7655a672017-09-23 11:57:33 +010073/* Apply 2D spatial filter on a single element of @p in at coordinates @p coord
74 *
75 * - filter sizes have to be odd number
76 * - Row major order of filter assumed
77 * - TO_ZERO rounding policy assumed
78 * - SATURATE convert policy assumed
79 */
80template <typename T, typename U, typename V>
81void apply_2d_spatial_filter(Coordinates coord, const SimpleTensor<T> &src, SimpleTensor<U> &dst, const TensorShape &filter_shape, const V *filter_itr, double scale, BorderMode border_mode,
82 T constant_border_value = T(0))
83{
84 double val = 0.;
85 const int x = coord.x();
86 const int y = coord.y();
87 for(int j = y - static_cast<int>(filter_shape[1] / 2); j <= y + static_cast<int>(filter_shape[1] / 2); ++j)
88 {
89 for(int i = x - static_cast<int>(filter_shape[0] / 2); i <= x + static_cast<int>(filter_shape[0] / 2); ++i)
90 {
91 coord.set(0, i);
92 coord.set(1, j);
93 val += static_cast<double>(*filter_itr) * tensor_elem_at(src, coord, border_mode, constant_border_value);
94 ++filter_itr;
95 }
96 }
97 coord.set(0, x);
98 coord.set(1, y);
99 dst[coord2index(src.shape(), coord)] = saturate_cast<U>(support::cpp11::trunc(val * scale));
100}
Moritz Pflanzercde1e8a2017-09-08 09:53:14 +0100101
102RawTensor transpose(const RawTensor &src, int chunk_width = 1);
Isabella Gottardi83be7452017-08-29 13:47:03 +0100103
104/** Fill matrix random.
105 *
106 * @param[in,out] matrix Matrix
Isabella Gottardi83be7452017-08-29 13:47:03 +0100107 */
108template <std::size_t SIZE>
Pablo Tellod616cb92017-09-27 10:07:45 +0100109inline void fill_warp_matrix(std::array<float, SIZE> &matrix)
Isabella Gottardi83be7452017-08-29 13:47:03 +0100110{
111 std::mt19937 gen(library.get()->seed());
112 std::uniform_real_distribution<float> dist(-1, 1);
Pablo Tellod616cb92017-09-27 10:07:45 +0100113 for(auto &x : matrix)
Isabella Gottardi83be7452017-08-29 13:47:03 +0100114 {
Pablo Tellod616cb92017-09-27 10:07:45 +0100115 x = dist(gen);
Isabella Gottardi83be7452017-08-29 13:47:03 +0100116 }
117 if(SIZE == 9)
118 {
Pablo Tellod616cb92017-09-27 10:07:45 +0100119 // This is only used in Warp Perspective, we set M[3][3] = 1 so that Z0 is not 0 and we avoid division by 0.
120 matrix[8] = 1.f;
Isabella Gottardi83be7452017-08-29 13:47:03 +0100121 }
122}
123
Abe Mbise31bbce12017-09-19 16:19:13 +0100124bool valid_bilinear_policy(float xn, float yn, int width, int height, BorderMode border_mode);
Giorgio Arena93a690e2017-08-01 16:09:33 +0100125} // namespace validation
126} // namespace test
127} // namespace arm_compute
Isabella Gottardi1fab09f2017-07-13 15:55:57 +0100128#endif /* __ARM_COMPUTE_TEST_VALIDATION_UTILS_H__ */