-
Notifications
You must be signed in to change notification settings - Fork 0
/
spatialFmp.c
177 lines (143 loc) · 3.32 KB
/
spatialFmp.c
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
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <jpeglib.h>
struct Matrix
{
long w;
long h;
float *matrix;
};
struct Matrix *newMatrix(long w, long h)
{
struct Matrix *m = malloc(sizeof(struct Matrix));
m->w = w;
m->h = h;
m->matrix = (float*)malloc(w*h*sizeof(float));
unsigned int i, j,idx;
for(j=0; j< m->h; j++){
for(i=0; i< m->w; i++){
idx = i + j*m->w;
m->matrix[idx] = idx*2;
}
}
return m;
};
void matrixPrint(struct Matrix *m){
int idx, i,j;
int gap = 10;
for(j=0; j< m->h; j++){
for(i=0; i< m->w; i++){
idx = i + j*m->w;
printf("%*f ",gap,m->matrix[idx]);
}
printf("\n");
}
printf("\n\n");
}
struct Sequence
{
long nInH;
long nInW;
long nOutH;
long nOutW;
int poolSize;
long *sequenceW;
long *sequenceH;
};
struct Sequence *newSequence(long nInW, long nOutW, long nInH, long nOutH, int poolSize)
{
struct Sequence *s = malloc(sizeof(struct Sequence));
s->nInW = nInW;
s->nOutW = nOutW;
s->nInH = nInH;
s->nOutH = nOutH;
s->poolSize = poolSize;
size_t size = sizeof(long);
s->sequenceW = (long*)malloc(size*(nOutW));
s->sequenceH = (long*)malloc(size*(nOutH));
float alphaW, alphaH;
alphaW = (float)(nInW - poolSize)/(float)(nOutW - 1);
alphaH = (float)(nInH - poolSize)/(float)(nOutH - 1);
float u = 0.5;
long i;
s->sequenceW[0] = 0;
for(i=1;i < s->nOutW ;i++){
s->sequenceW[i] = ceil(alphaW*(i+u))-1;
}
s->sequenceH[0] = 0;
for(i=1;i < s->nOutH ;i++){
s->sequenceH[i] = ceil(alphaH*(i+u))-1;
}
return s;
};
void sequencePrint(struct Sequence *s){
int gap = 5;
long i;
printf("Indices Sequences width \n");
for(i=0;i<s->nOutW;i++){
printf("%*ld ",gap,i);
printf("%*ld ",gap, s->sequenceW[i]);
printf("\n");
}
printf("Indices Sequences height \n");
for(i=0;i<s->nOutH;i++){
printf("%*ld ",gap,i);
printf("%*ld ",gap, s->sequenceH[i]);
printf("\n");
}
printf("\n");
}
void forwardInput(struct Matrix *input, struct Matrix *output, struct Sequence *sequence){
long i,j;
long idx,idx1;
long i1,j1;
long startW, startH;
int gap =5;
int poolSize = sequence-> poolSize;
float maxVal,val;
long *seqH = sequence->sequenceH;
long *seqW = sequence->sequenceW;
for(j=0;j<output->h;j++){
for(i=0;i<output->w;i++){
idx = i + j*output->w;
//printf("i,j,idx = %lu %lu \n",i,j,idx);
startW = i;
startH = j;
maxVal = input->matrix[idx];
for(j1=0; j1 < poolSize; ++j1){
for(i1=0; i1 < poolSize; ++i1 ){
long x = seqW[i] + i1;
long y = seqH[j] + j1;
idx1 = x + y*input->w;
val = input->matrix[idx1];
//printf("i1,j1,idx,val(idx) = %lu, %lu, %lu, %f \n",x,y,idx1,val);
if (val > maxVal)
maxVal = val;
}
}
//printf("Max value = %f \n\n",maxVal);
output->matrix[idx] = maxVal;
}
printf("\n");
}
printf("\n");
}
int main(void){
int poolSize = 2;
long inputW = 10;
long inputH = 10; // Make everything square to begin with
float fmp = 0.6;
long outputH = floor(inputH*fmp);
long outputW = floor(inputW*fmp);
float u = 0.5;
struct Matrix *input = newMatrix(inputW,inputH);
struct Matrix *output = newMatrix(outputW,outputH);
//matrixPrint(input);
//matrixPrint(output);
struct Sequence *sequenceH = newSequence(inputW, outputW, inputH, outputH, poolSize);
sequencePrint(sequenceH);
forwardInput(input,output,sequenceH);
matrixPrint(output);
return 0;
}