Sanghoon Lee | c9938d2 | 2017-10-16 16:36:44 +0100 | [diff] [blame] | 1 | /* |
Michalis Spyrou | d1d7722 | 2020-04-08 14:10:15 +0100 | [diff] [blame] | 2 | * Copyright (c) 2017-2020 ARM Limited. |
Sanghoon Lee | c9938d2 | 2017-10-16 16:36:44 +0100 | [diff] [blame] | 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 | */ |
| 24 | #include "Dilate.h" |
| 25 | |
| 26 | #include "Utils.h" |
| 27 | #include "tests/validation/Helpers.h" |
| 28 | |
| 29 | #include <algorithm> |
| 30 | #include <array> |
| 31 | |
| 32 | namespace arm_compute |
| 33 | { |
| 34 | namespace test |
| 35 | { |
| 36 | namespace validation |
| 37 | { |
| 38 | namespace reference |
| 39 | { |
| 40 | template <typename T> |
| 41 | SimpleTensor<T> dilate(const SimpleTensor<T> &src, BorderMode border_mode, T constant_border_value) |
| 42 | { |
| 43 | /* |
| 44 | -1 x +1 |
| 45 | -1 [tl][tc][tr] -1 |
| 46 | y [ml][xy][mr] y |
| 47 | +1 [bl][bc][br] +1 |
| 48 | -1 x +1 |
| 49 | dilate: |
| 50 | dst(x, y) = max[ src(x', y') for x-1<=x'<=x+1, y-1<=y'<=y+1 ] = max({tl, tc, tr, ml, xy, mr, bl, bc, br}) |
| 51 | */ |
| 52 | SimpleTensor<T> dst(src.shape(), src.data_type()); |
Michalis Spyrou | fae513c | 2019-10-16 17:41:33 +0100 | [diff] [blame] | 53 | const uint32_t num_elements = src.num_elements(); |
Sanghoon Lee | c9938d2 | 2017-10-16 16:36:44 +0100 | [diff] [blame] | 54 | |
Michalis Spyrou | d1d7722 | 2020-04-08 14:10:15 +0100 | [diff] [blame] | 55 | #if defined(_OPENMP) |
| 56 | #pragma omp parallel for |
| 57 | #endif /* _OPENMP */ |
Michalis Spyrou | fae513c | 2019-10-16 17:41:33 +0100 | [diff] [blame] | 58 | for(uint32_t i = 0; i < num_elements; ++i) |
Sanghoon Lee | c9938d2 | 2017-10-16 16:36:44 +0100 | [diff] [blame] | 59 | { |
| 60 | Coordinates coord = index2coord(src.shape(), i); |
| 61 | const int x = coord.x(); |
| 62 | const int y = coord.y(); |
| 63 | |
| 64 | std::array<T, 9> neighbours = { { 0 } }; |
| 65 | for(int row = y - 1, j = 0; row <= y + 1; ++row) |
| 66 | { |
| 67 | for(int col = x - 1; col <= x + 1; ++col, ++j) |
| 68 | { |
| 69 | coord.set(0, col); |
| 70 | coord.set(1, row); |
| 71 | neighbours[j] = tensor_elem_at(src, coord, border_mode, constant_border_value); |
| 72 | } |
| 73 | } |
| 74 | |
| 75 | dst[i] = *std::max_element(neighbours.cbegin(), neighbours.cend()); |
| 76 | } |
| 77 | |
| 78 | return dst; |
| 79 | } |
| 80 | |
| 81 | template SimpleTensor<uint8_t> dilate(const SimpleTensor<uint8_t> &src, BorderMode border_mode, uint8_t constant_border_value); |
| 82 | } // namespace reference |
| 83 | } // namespace validation |
| 84 | } // namespace test |
| 85 | } // namespace arm_compute |