Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
Tetragramm
GitHub Repository: Tetragramm/opencv
Path: blob/master/modules/dnn/src/opencl/activations.cl
16337 views
1
/*M///////////////////////////////////////////////////////////////////////////////////////
2
//
3
// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
4
//
5
// By downloading, copying, installing or using the software you agree to this license.
6
// If you do not agree to this license, do not download, install,
7
// copy or use the software.
8
//
9
//
10
// License Agreement
11
// For Open Source Computer Vision Library
12
//
13
// Copyright (C) 2017, Intel Corporation, all rights reserved.
14
// Copyright (c) 2016-2017 Fabian David Tschopp, all rights reserved.
15
// Third party copyrights are property of their respective owners.
16
//
17
// Redistribution and use in source and binary forms, with or without modification,
18
// are permitted provided that the following conditions are met:
19
//
20
// * Redistribution's of source code must retain the above copyright notice,
21
// this list of conditions and the following disclaimer.
22
//
23
// * Redistribution's in binary form must reproduce the above copyright notice,
24
// this list of conditions and the following disclaimer in the documentation
25
// and/or other materials provided with the distribution.
26
//
27
// * The name of the copyright holders may not be used to endorse or promote products
28
// derived from this software without specific prior written permission.
29
//
30
// This software is provided by the copyright holders and contributors "as is" and
31
// any express or implied warranties, including, but not limited to, the implied
32
// warranties of merchantability and fitness for a particular purpose are disclaimed.
33
// In no event shall the Intel Corporation or contributors be liable for any direct,
34
// indirect, incidental, special, exemplary, or consequential damages
35
// (including, but not limited to, procurement of substitute goods or services;
36
// loss of use, data, or profits; or business interruption) however caused
37
// and on any theory of liability, whether in contract, strict liability,
38
// or tort (including negligence or otherwise) arising in any way out of
39
// the use of this software, even if advised of the possibility of such damage.
40
//
41
//M*/
42
43
#define CONCAT(A,B) A##_##B
44
#define TEMPLATE(name,type) CONCAT(name,type)
45
#define KERNEL_ARG_DTYPE float
46
47
#if defined(cl_khr_fp16)
48
#pragma OPENCL EXTENSION cl_khr_fp16 : enable
49
#endif
50
51
__kernel void ReLUForward(const int count, __global const T* in, __global T* out
52
#ifndef RELU_NO_SLOPE
53
, KERNEL_ARG_DTYPE negative_slope
54
#endif
55
) {
56
int index = get_global_id(0);
57
if(index < count)
58
#ifndef RELU_NO_SLOPE
59
out[index] = in[index] > 0 ? in[index] : in[index] * negative_slope;
60
#else
61
out[index] = in[index] > 0 ? in[index] : 0;
62
#endif
63
}
64
65
__kernel void ReLU6Forward(const int count, __global const T* in, __global T* out,
66
const KERNEL_ARG_DTYPE minValue, const KERNEL_ARG_DTYPE maxValue)
67
{
68
int index = get_global_id(0);
69
if(index < count)
70
{
71
T x = in[index];
72
out[index] = clamp(x, convert_T(minValue), convert_T(maxValue));
73
}
74
}
75
76
__kernel void PReLUForward(const int count, const int channels, const int plane_size,
77
__global const T* in, __global T* out,
78
__global const KERNEL_ARG_DTYPE* slope_data)
79
{
80
int index = get_global_id(0);
81
int c = (index / plane_size) % channels;
82
if(index < count)
83
out[index] = in[index] > 0 ? in[index] : in[index] * slope_data[c];
84
}
85
86
__kernel void TanHForward(const int count, __global T* in, __global T* out) {
87
int index = get_global_id(0);
88
if(index < count)
89
out[index] = tanh(in[index]);
90
}
91
92
__kernel void SigmoidForward(const int count, __global const T* in, __global T* out) {
93
int index = get_global_id(0);
94
if(index < count)
95
out[index] = 1.0f / (1.0f + exp(-in[index]));
96
}
97
98
__kernel void BNLLForward(const int n, __global const T* in, __global T* out) {
99
int index = get_global_id(0);
100
if (index < n) {
101
out[index] = in[index] > 0 ? in[index] + log(1.0f + exp(-in[index])) : log(1.0f + exp(in[index]));
102
}
103
}
104
105
__kernel void AbsValForward(const int n, __global const T* in, __global T* out) {
106
int index = get_global_id(0);
107
if (index < n)
108
out[index] = fabs(in[index]);
109
}
110
111
__kernel void PowForward(const int n, __global const T* in, __global T* out,
112
const KERNEL_ARG_DTYPE power,
113
const KERNEL_ARG_DTYPE scale,
114
const KERNEL_ARG_DTYPE shift)
115
{
116
int index = get_global_id(0);
117
if (index < n)
118
out[index] = pow(shift + scale * in[index], power);
119
}
120
121
__kernel void ELUForward(const int n, __global const T* in, __global T* out)
122
{
123
int index = get_global_id(0);
124
if (index < n)
125
{
126
T src = in[index];
127
out[index] = (src >= 0.f) ? src : exp(src) - 1;
128
}
129
}
130
131