-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathConvLayer.cpp
More file actions
225 lines (166 loc) · 6.03 KB
/
ConvLayer.cpp
File metadata and controls
225 lines (166 loc) · 6.03 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
//
// Created by Filip Lux on 27.11.16.
//
#include "ConvLayer.h"
double vectorDotProduct(double* a, double* b, int &dim_a, int &dim_b, const int &steps_i,const int &steps_j, const int input_depth) {
double ans = 0;
for (int i = 0; i <= steps_i; i++) {
for (int j = 0; j <= steps_j; j++) {
for ( int k = 0; k < input_depth; k++) {
ans += a[i * dim_a + j + k * dim_a * dim_a] * b[i * dim_b + j + k * dim_b * dim_b];
}
}
}
return ans;
}
double dotProduct(double* input, double* ddot, int &dim, const int &steps_i,const int &steps_j) {
double ans = 0;
int all_d;
for (int i = 0; i <= steps_i; i++) {
for (int j = 0; j <= steps_j; j++) {
all_d = i * dim + j;
ans += input[all_d] * ddot[all_d];
}
}
return ans;
}
double backPropDotProduct(double* ddot, double* w, int &dim_ddot, int &dim_w,
const int &steps_i, const int &steps_j,
const int &wn, const int &depth) {
double ans = 0;
int ddot_d;
int w_d;
for (int i = 0; i <= steps_i; i++) {
for (int j = 0; j <= steps_j; j++) {
ddot_d = i * dim_ddot + j;
w_d = (steps_i - i) * dim_w + steps_j - j;
for (int k = 0; k < depth; k++) {
ans += ddot[ddot_d + depth*k] * w[w_d + k*wn];
}
}
}
return ans;
}
ConvLayer::ConvLayer(int filter_dim, int stroke, int filters, int in_dim, int in_depth, double* in) {
//parameters of the input
input_depth = in_depth;
input_dim = in_dim;
input = in; //pole vektoru
//parameters of the output
dim = input_dim;
depth = filters;
n = dim * dim;
//parameters of the filters
w_dim = filter_dim;
wn = w_dim * w_dim; //number of weights in one layer
s = stroke;
w = new double[wn*depth*input_depth];
for (int i = 0; i < wn*depth*input_depth; i++) {
w[i] = fRand(INIT_MIN, INIT_MAX);
}
bias = new double[depth];
for (int j = 0; j < depth; j++) {
bias[j] = fRand(INIT_MIN, INIT_MAX);
}
out = new double[n*depth];
ddot = new double[n*depth]; //predat do horni vrstvy
}
ConvLayer::ConvLayer(int filter_dim, int stroke, int filters, Layer* lower) {
//conection to lower layer
down = lower;
//parameters of the input
input_depth = down->depth;
input_dim = down->dim;
input = down->out;
down_ddot = down->ddot;
//parameters of the output
dim = input_dim;
depth = filters;
n = dim * dim;
//parameters of the filters
w_dim = filter_dim;
wn = w_dim * w_dim; //number of weights in one layer
s = stroke;
w = new double[wn*depth*input_depth];
for (int i = 0; i < wn*depth*input_depth; i++) {
w[i] = fRand(INIT_MIN, INIT_MAX);
}
bias = new double[depth];
for (int j = 0; j < depth; j++) {
bias[j] = fRand(INIT_MIN, INIT_MAX);
}
out = new double[n*depth];
ddot = new double[n*depth]; //predat do horni vrstvy
}
void ConvLayer::forward_layer() {
const int diff = w_dim/2;
double sum;
for (int i = 0; i < dim; i++) {
for (int j = 0; j < dim; j++) {
const int out_diff = i * dim + j;
const int ii = std::max(0, i-diff);
const int jj = std::max(0, j-diff);
const int di = std::min(dim-1, i + diff) - ii;
const int dj = std::min(dim-1, j + diff) - jj;
const int in_diff = (ii * dim + jj); //posun zacatku matice vectoru v inputu
const int w_diff = (diff - i + ii) * w_dim + (diff - j + jj); //posun zacatku matice vectoru ve w
for (int d = 0; d < depth; d++) {
sum = bias[d] +
vectorDotProduct(&input[in_diff], &w[w_diff + d*wn], dim, w_dim, di, dj, input_depth);
out[out_diff + d*n] = ( sum > 0 ) ? sum : 0; //ReLu
}
}
}
}
void ConvLayer::backProp_layer() { //creates lower ddot array
const int diff = w_dim/2;
double sum;
for (int i = 0; i < dim; i++) {
for (int j = 0; j < dim; j++) {
const int down_ddot_diff = i * dim + j;
const int ii = std::max(0, i-diff);
const int jj = std::max(0, j-diff);
const int di = std::min(dim-1, i + diff) - ii;
const int dj = std::min(dim-1, j + diff) - jj;
const int ddot_diff = (ii * dim + jj); //posun zacatku matice vektoru v inputu
const int w_diff = (diff - i + ii) * w_dim + (diff - j + jj); //posun zacatku matice vektoru ve w
for (int d = 0; d < input_depth; d++) {
sum = backPropDotProduct(&ddot[ddot_diff], &w[w_diff + d*wn*depth], dim, w_dim, di, dj, wn, depth);
down_ddot[down_ddot_diff + n*d] = (sum > 0) ? 1 : 0;
//ReLu
}
}
}
}
void ConvLayer::learn() {
const int diff = w_dim/2;
for (int i = 0; i < w_dim; i++) {
for (int j = 0; j < w_dim; j++) {
const int ii = std::max(0,i - diff);
const int jj = std::max(0,j - diff);
const int di = std::min(dim-1, i + diff) - ii;
const int dj = std::min(dim-1, j + diff) - jj;
const int input_diff = ii * dim + jj;
const int ddot_diff = (w_dim - ii - di +1) * dim + w_dim - jj - dj +1;
const int w_diff = w_dim*i + j;
for (int d = 0; d < depth; d++) {
for (int k = 0; k < input_depth; k++) { //vsechny dvojice k a d
w[w_diff + d * wn * depth + k * wn] +=
dotProduct(&input[input_diff + k*n], &ddot[ddot_diff + d*n], dim, di, dj) * LR;
}
}
}
}
}
void ConvLayer::print() {
//not implemented
}
void ConvLayer::update_input(double* in) {
input = in;
}
ConvLayer::~ConvLayer() {
delete bias;
delete ddot;
delete out;
delete w;
};