-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfigures_analyzer_terminal.py
More file actions
327 lines (285 loc) · 8.48 KB
/
Copy pathfigures_analyzer_terminal.py
File metadata and controls
327 lines (285 loc) · 8.48 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
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
import sys
import random
import glob
import math
global connectedPerm, minOverlap, window_size, overlapping, len_side, columns, desiredLocalActivity, permanenceInc, permanenceDec, sliding_average, boostInc, iterations
#_______________ initial variables
window_size=5
overlapping=2
len_side=20
connectedPerm=0.3
minOverlap=3
desiredLocalActivity=3
permanenceInc=0.1
permanenceDec=0.025
sliding_average=10
boostInc=0.05
iterations=25
#_____________internal variables
folders=[]
for i in range(1, len(sys.argv)):
folders.append(sys.argv[i])
columns=[]
#_______________ functions
def get_matrix(filename):
matrix=[]
f=open(filename, "r")
for line in f:
line=line.strip()
a=line.split()
matrix.append(a)
return matrix
def read_matrix(x1, x2 ,y1, y2, count, matrix):
k=count
l=0
sum_overlap=0
for i in range(x1, x2):
for j in range(y1, y2):
columns[k].synapses[l].activation_state=int(matrix[i][j])
if (columns[k].synapses[l].connected_state() and columns[k].synapses[l].activation_state):
sum_overlap+=1
#print columns[k].synapses[l].activation_state
l+=1
columns[k].overlap=sum_overlap
#print columns[k].overlap
def new_input(matrix):
count=0
for i in range(0,len(matrix[0]), window_size-overlapping):
for j in range(0, len(matrix), window_size-overlapping):
try:
endx=i+window_size
endy=j+window_size
#print i,endx,j,endy
read_matrix(i, endx, j, endy, count, matrix)
#name="column"+str(i)+str(j)
count+=1
except:
pass
def create_columns():
n=int(((len_side-overlapping)/(window_size-overlapping))**2)
for i in range (0, n):
name="column"+str(i)
name=column(name)
columns.append(name)
def check_column_activation():
for column in columns:
column.activation_state()
#print column.overlap,
def make_inhibition():
activeColumns=[]
inhibitedColumns=[]
notActivatedColumns=[]
for i in range(0, len(columns)):
column=columns[i]
neighbors=get_neighbors(i)
sorted_list = sorted(neighbors, key=lambda x: x.overlap, reverse=True)
minLocalActivity=sorted_list[desiredLocalActivity-1].overlap
if column.overlap > 0 and column.overlap >= minLocalActivity:
activeColumns.append(column)
if column.overlap > 0 and column.overlap <= minLocalActivity:
inhibitedColumns.append(column)
if column.overlap ==0:
notActivatedColumns.append(column)
return (activeColumns, inhibitedColumns, notActivatedColumns)
def get_neighbors(i):
i=int(i)
neighbors=[]
n=int(((len_side-overlapping)/(window_size-overlapping)))
if i-n>=0:
neighbors.append(columns[i-n])
if (i+1)-n>=0 and ((i+1)%n) !=0:
neighbors.append(columns[i-n+1])
if (i-1)-n>=0 and ((i)%n) !=0:
neighbors.append(columns[i-n-1])
if i+n<n**2:
neighbors.append(columns[i+n])
if (i-1)+n<n**2 and ((i)%n) !=0:
neighbors.append(columns[i+n-1])
if (i+1)+n<n**2 and ((i+1)%n) !=0:
neighbors.append(columns[i+n+1])
if ((i+1)%n) !=0:
neighbors.append(columns[i+1])
if ((i)%n) !=0:
neighbors.append(columns[i-1])
return neighbors
def update_permanence(activeColumns):
for column in activeColumns:
for i in range(0, len(column.synapses)):
if column.synapses[i].activation_state == 1:
#print column.synapses[i].perm
column.synapses[i].perm+=permanenceInc
#print column.synapses[i].perm
if column.synapses[i].perm > 1:
column.synapses[i].perm=1
else:
column.synapses[i].perm-=permanenceDec
if column.synapses[i].perm < 0:
column.synapses[i].perm=0
def update_duty(activeColumns, inhibitedColumns, notActivatedColumns):
for column in activeColumns:
column.activeDutyCycle.append(1.)
for column in inhibitedColumns:
column.activeDutyCycle.append(0.)
for column in notActivatedColumns:
column.activeDutyCycle.append(0.)
if len(columns[0].activeDutyCycle)==sliding_average:
for i in range(0, len(columns)):
neighbors=get_neighbors(i)
maxDutyCycle=0
for neighbor in neighbors:
average=sum(neighbor.activeDutyCycle)/sliding_average
if average>maxDutyCycle:
maxDutyCycle=float(average)
minDutyCycle=maxDutyCycle*0.01
ownAverage=sum(columns[i].activeDutyCycle)/sliding_average
if ownAverage<minDutyCycle:
columns[i].boost+=boostInc
for column in columns:
column.activeDutyCycle.pop(0)
def update_activity_state(activeColumns, inhibitedColumns, notActiveColumns, folder):
for column in activeColumns:
column.activity_state=1
column.folder+=1
for column in inhibitedColumns:
column.activity_state=2
for column in notActiveColumns:
column.activity_state=0
def print_activity_state(display):
'''Display must have 1 to display inhibitions and 0 not to display inhibitions'''
n=int(((len_side-overlapping)/(window_size-overlapping)))
if display==1:
for i in range(0, n):
for j in range(i, len(columns), n):
output=0
if columns[j].activity_state==2:
output=0
if columns[j].activity_state==1:
output=1
print output,
print ""
else:
for i in range(0, n):
for j in range(i, len(columns), n):
print columns[j].activity_state,
print ""
def compute_frecuencies(folder):
for column in columns:
one_frecuency=(float(column.folder)+1)/(iterations+1)
zero_frecuency=1-one_frecuency
if zero_frecuency==0:
zero_frecuency=float(1)/(5*iterations+1)
one_frecuency=math.log(one_frecuency)
zero_frecuency=math.log(zero_frecuency)
column.figures_hash[folder]=[zero_frecuency, one_frecuency]
#print column.figures_hash
def guess_figure():
probabilities={}
total_prob=0
max_prob=""
#print columns[0].figures_hash
for figure in sorted(columns[0].figures_hash.iterkeys()):
for column in columns:
activation=column.activity_state
if activation ==2:
activation=0
total_prob=total_prob+column.figures_hash[figure][activation]
probabilities[figure]=total_prob
total_prob=0
print "_______________SCORES__________________"
print ""
for key in probabilities:
print key+":\t"+str(probabilities[key])
best_figure=""
prob_sum=0
print ""
print "______________RECOGNITION______________"
print ""
for figure in sorted(columns[0].figures_hash.iterkeys()):
prob_sum+=float(math.e**(probabilities[figure]))
if not max_prob:
max_prob=probabilities[figure]
if probabilities[figure]>=max_prob:
max_prob=probabilities[figure]
best_figure=figure
#print math.e**max_prob
#print prob_sum
n=int(((len_side-overlapping)/(window_size-overlapping))**2)
percent_prob= ((math.e**max_prob)/prob_sum)*100
threshold_of_randomness=(math.log(0.5**n))/2
if (max_prob > threshold_of_randomness):
print "Recognition: "+best_figure#+" with a conditionated probability of "+str(percent_prob)+"%"
else:
print "Recognition: No figure has been recognized"
print ""
#____________________classes
class synapse:
def __init__(self, column):
self.column=column
self.connectedPerm=connectedPerm
self.perm=random.uniform(connectedPerm-0.05,connectedPerm+0.05)
self.activation_state=0
def connected_state(self):
if self.perm > self.connectedPerm:
c_state=1
else:
c_state=0
return c_state
class column:
"""Cell column class"""
def __init__(self, name):
self.name=name
self.overlap=0
self.minOverlap=minOverlap
self.boost=1
self.activeDutyCycle=[]
self.synapses=[]
self.activity_state=0
self.figures_hash={}
for i in range(0,window_size**2):
nombre="Synapse"+str(i)
nombre=synapse(self)
self.synapses.append(nombre)
def activation_state(self):
if self.overlap < self.minOverlap:
self.overlap = 0
else:
self.overlap=self.overlap*self.boost
#_____________________ MAIN
create_columns()
count=0
for folder in folders:
images=[]
images=glob.glob('./'+str(folder)+'/*')
#print images
for column in columns:
column.folder=0
matrixes=[]
for image in images:
matrix=get_matrix(image)
matrixes.append(matrix)
x=0
for i in range (0, iterations):
print "Cycle "+str(count)+" "+images[x]
new_input(matrixes[x])
check_column_activation()
activeColumns, inhibitedColumns, notActiveColumns=make_inhibition()
update_activity_state(activeColumns, inhibitedColumns, notActiveColumns, folder)
print_activity_state(2)
#print ""
#print_activity_state(1)
update_permanence(activeColumns)
update_duty(activeColumns, inhibitedColumns, notActiveColumns)
x+=1
count+=1
if x>=(len(matrixes)):
x=0
compute_frecuencies(folder)
query=raw_input(">Enter matrix to evaluate: ")
print ""
matrix=get_matrix(query)
new_input(matrix)
check_column_activation()
activeColumns, inhibitedColumns, notActiveColumns=make_inhibition()
update_activity_state(activeColumns, inhibitedColumns, notActiveColumns, folder)
#print_activity_state(2)
guess_figure()