1*c217d954SCole Faust /*
2*c217d954SCole Faust * Copyright (c) 2017-2018 Arm Limited.
3*c217d954SCole Faust *
4*c217d954SCole Faust * SPDX-License-Identifier: MIT
5*c217d954SCole Faust *
6*c217d954SCole Faust * Permission is hereby granted, free of charge, to any person obtaining a copy
7*c217d954SCole Faust * of this software and associated documentation files (the "Software"), to
8*c217d954SCole Faust * deal in the Software without restriction, including without limitation the
9*c217d954SCole Faust * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
10*c217d954SCole Faust * sell copies of the Software, and to permit persons to whom the Software is
11*c217d954SCole Faust * furnished to do so, subject to the following conditions:
12*c217d954SCole Faust *
13*c217d954SCole Faust * The above copyright notice and this permission notice shall be included in all
14*c217d954SCole Faust * copies or substantial portions of the Software.
15*c217d954SCole Faust *
16*c217d954SCole Faust * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17*c217d954SCole Faust * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18*c217d954SCole Faust * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19*c217d954SCole Faust * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20*c217d954SCole Faust * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21*c217d954SCole Faust * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
22*c217d954SCole Faust * SOFTWARE.
23*c217d954SCole Faust */
24*c217d954SCole Faust #include "NormalizationLayer.h"
25*c217d954SCole Faust
26*c217d954SCole Faust #include "arm_compute/core/Types.h"
27*c217d954SCole Faust
28*c217d954SCole Faust namespace arm_compute
29*c217d954SCole Faust {
30*c217d954SCole Faust namespace test
31*c217d954SCole Faust {
32*c217d954SCole Faust namespace validation
33*c217d954SCole Faust {
34*c217d954SCole Faust namespace reference
35*c217d954SCole Faust {
36*c217d954SCole Faust template <typename T>
normalization_layer(const SimpleTensor<T> & src,NormalizationLayerInfo info)37*c217d954SCole Faust SimpleTensor<T> normalization_layer(const SimpleTensor<T> &src, NormalizationLayerInfo info)
38*c217d954SCole Faust {
39*c217d954SCole Faust // Create reference
40*c217d954SCole Faust SimpleTensor<T> dst{ src.shape(), src.data_type(), 1 };
41*c217d954SCole Faust
42*c217d954SCole Faust // Compute reference
43*c217d954SCole Faust const uint32_t norm_size = info.norm_size();
44*c217d954SCole Faust NormType type = info.type();
45*c217d954SCole Faust float beta = info.beta();
46*c217d954SCole Faust uint32_t kappa = info.kappa();
47*c217d954SCole Faust
48*c217d954SCole Faust const int cols = src.shape()[0];
49*c217d954SCole Faust const int rows = src.shape()[1];
50*c217d954SCole Faust const int depth = src.shape()[2];
51*c217d954SCole Faust int upper_dims = src.shape().total_size() / (cols * rows);
52*c217d954SCole Faust
53*c217d954SCole Faust float coeff = info.scale_coeff();
54*c217d954SCole Faust int radius_cols = norm_size / 2;
55*c217d954SCole Faust
56*c217d954SCole Faust // IN_MAP_1D and CROSS_MAP normalize over a single axis only
57*c217d954SCole Faust int radius_rows = (NormType::IN_MAP_2D == type) ? norm_size / 2 : 0;
58*c217d954SCole Faust
59*c217d954SCole Faust if(info.is_cross_map())
60*c217d954SCole Faust {
61*c217d954SCole Faust // Remove also depth from upper dimensions since it is the dimension we
62*c217d954SCole Faust // want to use for normalization
63*c217d954SCole Faust upper_dims /= depth;
64*c217d954SCole Faust
65*c217d954SCole Faust for(int r = 0; r < upper_dims; ++r)
66*c217d954SCole Faust {
67*c217d954SCole Faust for(int i = 0; i < rows; ++i)
68*c217d954SCole Faust {
69*c217d954SCole Faust for(int k = 0; k < cols; ++k)
70*c217d954SCole Faust {
71*c217d954SCole Faust for(int l = 0; l < depth; ++l)
72*c217d954SCole Faust {
73*c217d954SCole Faust float accumulated_scale = 0.f;
74*c217d954SCole Faust
75*c217d954SCole Faust for(int j = -radius_cols; j <= radius_cols; ++j)
76*c217d954SCole Faust {
77*c217d954SCole Faust const int z = l + j;
78*c217d954SCole Faust
79*c217d954SCole Faust if(z >= 0 && z < depth)
80*c217d954SCole Faust {
81*c217d954SCole Faust const T value = src[k + i * cols + z * rows * cols + r * cols * rows * depth];
82*c217d954SCole Faust accumulated_scale += value * value;
83*c217d954SCole Faust }
84*c217d954SCole Faust }
85*c217d954SCole Faust
86*c217d954SCole Faust dst[k + i * cols + l * rows * cols + r * cols * rows * depth] = kappa + accumulated_scale * coeff;
87*c217d954SCole Faust }
88*c217d954SCole Faust }
89*c217d954SCole Faust }
90*c217d954SCole Faust }
91*c217d954SCole Faust }
92*c217d954SCole Faust else
93*c217d954SCole Faust {
94*c217d954SCole Faust for(int r = 0; r < upper_dims; ++r)
95*c217d954SCole Faust {
96*c217d954SCole Faust for(int i = 0; i < rows; ++i)
97*c217d954SCole Faust {
98*c217d954SCole Faust for(int k = 0; k < cols; ++k)
99*c217d954SCole Faust {
100*c217d954SCole Faust float accumulated_scale = 0.f;
101*c217d954SCole Faust
102*c217d954SCole Faust for(int j = -radius_rows; j <= radius_rows; ++j)
103*c217d954SCole Faust {
104*c217d954SCole Faust const int y = i + j;
105*c217d954SCole Faust for(int l = -radius_cols; l <= radius_cols; ++l)
106*c217d954SCole Faust {
107*c217d954SCole Faust const int x = k + l;
108*c217d954SCole Faust
109*c217d954SCole Faust if((x >= 0 && y >= 0) && (x < cols && y < rows))
110*c217d954SCole Faust {
111*c217d954SCole Faust const T value = src[x + y * cols + r * cols * rows];
112*c217d954SCole Faust accumulated_scale += value * value;
113*c217d954SCole Faust }
114*c217d954SCole Faust }
115*c217d954SCole Faust }
116*c217d954SCole Faust
117*c217d954SCole Faust dst[k + i * cols + r * cols * rows] = kappa + accumulated_scale * coeff;
118*c217d954SCole Faust }
119*c217d954SCole Faust }
120*c217d954SCole Faust }
121*c217d954SCole Faust }
122*c217d954SCole Faust
123*c217d954SCole Faust if(beta == 1.f)
124*c217d954SCole Faust {
125*c217d954SCole Faust for(int i = 0; i < dst.num_elements(); ++i)
126*c217d954SCole Faust {
127*c217d954SCole Faust dst[i] = src[i] / dst[i];
128*c217d954SCole Faust }
129*c217d954SCole Faust }
130*c217d954SCole Faust else if(beta == 0.5f)
131*c217d954SCole Faust {
132*c217d954SCole Faust for(int i = 0; i < dst.num_elements(); ++i)
133*c217d954SCole Faust {
134*c217d954SCole Faust dst[i] = src[i] / std::sqrt(dst[i]);
135*c217d954SCole Faust }
136*c217d954SCole Faust }
137*c217d954SCole Faust else
138*c217d954SCole Faust {
139*c217d954SCole Faust for(int i = 0; i < dst.num_elements(); ++i)
140*c217d954SCole Faust {
141*c217d954SCole Faust dst[i] = src[i] * std::exp(std::log(dst[i]) * -beta);
142*c217d954SCole Faust }
143*c217d954SCole Faust }
144*c217d954SCole Faust
145*c217d954SCole Faust return dst;
146*c217d954SCole Faust }
147*c217d954SCole Faust
148*c217d954SCole Faust template SimpleTensor<float> normalization_layer(const SimpleTensor<float> &src, NormalizationLayerInfo info);
149*c217d954SCole Faust template SimpleTensor<half> normalization_layer(const SimpleTensor<half> &src, NormalizationLayerInfo info);
150*c217d954SCole Faust } // namespace reference
151*c217d954SCole Faust } // namespace validation
152*c217d954SCole Faust } // namespace test
153*c217d954SCole Faust } // namespace arm_compute
154