-
Notifications
You must be signed in to change notification settings - Fork 2
/
optimization.py
892 lines (686 loc) · 35.1 KB
/
optimization.py
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
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
# -*- coding: utf-8 -*-
"""
Created on Sun Jul 01 15:29:15 2018
@author: pp34747
"""
import random
import os
import psutil
import time
import math
import numpy as np
from scipy.stats.mstats import gmean
from itertools import chain
import graphs
import dynamic_connectivity as dc
class Optimize():
def __init__(self, cost=None, nIterations=1000, n_repeats=3):
self.T_start = 1.0
self.T_min = 0.000000001
self.cost = cost
self.nIterations = nIterations
self.n_repeats = n_repeats
def run(self, candInfo, conflictList, mergeList, adjacencyList, dummyConflictsList, offset_dict):
pid = os.getpid()
py = psutil.Process(pid)
print("Resolving root hairs ...")
nCandidates = len(conflictList)
if nCandidates > 1: # If more than one candidate we need to find optimal set of roothairs
# Set initial solution and parameters
# Determine number of iterations
maxLevels = 5*self.nIterations
# Initialize state object
state = State( candInfo=candInfo,
mergeList=mergeList,
conflictList=conflictList,
adjacencyList=adjacencyList,
dummyConflictsList=dummyConflictsList,
offset_dict=offset_dict)
print("\n*** Get initial SA parameters ***")
# Create random state
shuffleState(state,nCandidates)
# Get initial values for cooling schedule by simulating random states
# - Assume equal weights for cost
finalProb = 0.01/nCandidates # 1% chance of upward move being accepted at last temperature level
initialProb = 0.95 # 95% chance of upward move being accepted at initial temperature level
nIterationsInitalize = int(0.2*self.nIterations)
csMaker = CoolingScheduleMaker(state, costFunction=self.cost, initialProb=initialProb, finalProb=finalProb) # object to make cooling schedule
csMaker.simulate(nIterationsInitalize*nCandidates) # 20% of iterations in actual optimization
normValuesRand = csMaker.normalization() # calculates avergae values of sub costs for normalization
csMaker.recalculateCost() # calculate costs with normalization
csMaker.calculateUpwardCosts() # calculate average upword cost
initialTemp = csMaker.getInitialTemp() # calculate initial temperature
alpha = csMaker.getAlpha(initialTemp, self.nIterations) # calculate alpha
finalTemp = csMaker.getFinalTemp(initialTemp,alpha, self.nIterations) # calculate final temperature
averageCost = csMaker.initialCost() # calcuulate initial cost from average of all costs
print("rand curvature: "+str(normValuesRand[0])+", rand length: "+str(normValuesRand[1])+". rand distance: "+str(normValuesRand[2]))
print("averageCost:"+str(averageCost), "averageDeltaCost: "+str(csMaker.averageDeltaCost()), ", initialTemp: ", str(initialTemp), ", finalTemp: ", str(finalTemp), ", alpha: ", str(alpha))
# Initialize Simulated Annealing object
sa = SimulatedAnnealing(initialState=state, initalTemp=initialTemp, finalTemp=finalTemp, averageCost=averageCost, alpha=alpha, maxLevels=maxLevels, n_repeats=self.n_repeats ,costFunction=self.cost)
memoryUse = py.memory_info()[0]/2.**30 # memory use in GB...I think
print(' - memory use: '+ str(round(memoryUse,4)))
print(" - Resolving...")
start_time = time.time()
# Run optimization
best_sol, best_cost, ratio_complete, bestMetrics, n_iterations = sa.anneal()
print("\nRandom: curvature: "+str(normValuesRand[0])+", length: "+str(normValuesRand[1])+", distance: "+str(normValuesRand[2]))
print("Result: "+"curvature: "+str(bestMetrics[0])+", length: "+str(bestMetrics[1])+", distance: "+str(bestMetrics[2]))
memoryUse = py.memory_info()[0]/2.**30 # memory use in GB...I think
print('\n - memory use: '+ str(round(memoryUse,4)))
#summary[i_run+1] = {'n':n_candidates, 'T':T_arr, 'cost':cost_arr, 'best':best_arr}
# Final solution
sol_out = np.where(best_sol)[0]
elapsed_time = time.time() - start_time
print('Time: ' + time.strftime("%H:%M:%S", time.gmtime(elapsed_time)))
elif nCandidates == 1: # If only one candidate -> trivial solution
sol_out = [0]
else: # If no candidates -> no solution
sol_out = []
memoryUse = py.memory_info()[0]/2.**30 # memory use in GB...I think
print(' - memory use: '+ str(round(memoryUse,4)))
# Create roothair connected components from overall best solution
components = dc.ConnectedComponents(mergeList)
for v in sol_out:
components.addVertex(v)
# Construct paths of connected components
roothair_paths = []
for cc in components.components.values():
g = graphs.Candidate_Graph([])
for candidate_id in cc:
g.merge(graphs.Candidate_Graph(candInfo.paths[candidate_id]))
roothair_paths.append(g.get_path())
memoryUse = py.memory_info()[0]/2.**30 # memory use in GB...I think
print(' - memory use: '+ str(round(memoryUse,4)))
try:
sa_parameters = {'SA_finalProb':finalProb,
'SA_initialProb':initialProb,
'SA_randCurvature': normValuesRand[0],
'SA_randLength': normValuesRand[1],
'SA_randDistance': normValuesRand[2],
'SA_initialTemp': initialTemp,
'SA_alpha': alpha,
'SA_finalTemp': finalTemp,
'SA_randCost': averageCost,
'SA_nIterations': n_iterations,
'SA_weightCurvature': self.cost.weights[0],
'SA_weightLength': self.cost.weights[1],
'SA_weightDistance': self.cost.weights[2]}
solution_summary = {'SA_resultCost':best_cost,
'SA_resultCurvature': bestMetrics[0],
'SA_resultLength': bestMetrics[1],
'SA_resultDistance': bestMetrics[2],
'SA_resultRatioComplete': ratio_complete}
except:
sa_parameters = {'SA_finalProb':np.nan,
'SA_initialProb':np.nan,
'SA_randCurvature': np.nan,
'SA_randLength': np.nan,
'SA_randDistance': np.nan,
'SA_initialTemp': np.nan,
'SA_alpha': np.nan,
'SA_finalTemp': np.nan,
'SA_randCost': np.nan,
'SA_nIterations': np.nan,
'SA_weightCurvature': np.nan,
'SA_weightLength': np.nan,
'SA_weightDistance': np.nan}
solution_summary = {'SA_resultCost':np.nan,
'SA_resultCurvature': np.nan,
'SA_resultLength': np.nan,
'SA_resultDistance': np.nan,
'SA_resultRatioComplete': np.nan}
return roothair_paths, solution_summary, sa_parameters
def shuffleState(state, n=100):
for _ in range(n):
# Get position (component id) to be changed
position = random.randint(0,n-1)
# Change current solution
isvalid = state.neighbor(position)
# If is invalid reverse and skip
if not isvalid:
state.reverseChanges()
continue
class SimulatedAnnealing:
def __init__(self, initialState, initalTemp, finalTemp, averageCost, alpha, maxLevels, n_repeats, costFunction):
self.state = initialState
self.initalTemp = initalTemp
self.finalTemp = finalTemp
self.averageCost = averageCost
self.alpha = alpha
self.maxLevels = maxLevels
self.n_repeats = n_repeats
self.costFunction = costFunction
self.iterationsPerTemp = len(self.state.candInfo.paths) # Number of iterations per temperature level
self.R_max = self.iterationsPerTemp
self.R = 0
def anneal(self):
# Initialize cost
metrics = self.costFunction.calculateMetrics(self.state)
metricsNorm = self.costFunction.normalizeMetrics(metrics)
cost = self.costFunction.calculateCost(metricsNorm) # Initial best cost is initial cost
# Save first solution as best solution
best_sol = np.array(self.state.binaryList) # Initial best solution is initial solution
new_cost = cost
best_cost = cost
best_metrics = metrics
newMetricsNorm = metricsNorm
bestMetricsNorm = metricsNorm
# Uncomment for plotting images:
#solutions_arr = [np.where(self.state.binaryList)[0]] # List with all states
#cost_arr = [cost] # List with all costs
#metrics_arr = [bestMetricsNorm] # List with all metrics
for rep in range(self.n_repeats):
currTemp = self.initalTemp
n_iterations = 0
self.R = 0
print(" - " + str([rep, n_iterations, "{0:.2E}".format(currTemp), round(cost,5), round(best_cost,5)]) \
+ str([round(c,3) for c in metricsNorm]) + " " + str(int(round(100*float(self.R)/self.R_max))) + "%")
while (currTemp > self.finalTemp or self.R < self.R_max) and n_iterations < self.maxLevels: # T must be less than finalTemp and R must be larger than R_max to stop
for _ in range(self.iterationsPerTemp):
# Get position (component id) to be changed
position = random.randint(0,len(self.state.binaryList)-1)
# Change current solution
isvalid = self.state.neighbor(position)
# If is invalid reverse and skip
if not isvalid:
self.state.reverseChanges()
continue
# Calculate cost for current state
metrics = self.costFunction.calculateMetrics(self.state)
newMetricsNorm = self.costFunction.normalizeMetrics(metrics)
new_cost = self.costFunction.calculateCost(newMetricsNorm)
# Acceptance probability
ap = self.probability(self.averageCost, cost, new_cost, currTemp)
# If acceptance probability is larger than random value between 0. and 1.
if ap > random.random():
self.R = 0 # Reset number of rejected moves
cost = new_cost # Cost is updated
if new_cost < best_cost: # New cost is better than overall best cost
best_sol = np.array(self.state.binaryList) # Update best solution
best_cost = new_cost # Update best cost
best_metrics = metrics
bestMetricsNorm = newMetricsNorm # Update best metrics
# Uncomment for plotting all accepted states:
#solutions_arr.append(np.where(self.state.binaryList)[0])
#cost_arr.append(new_cost)
#metrics_arr.append(newMetricsNorm)
else:
self.state.reverseChanges()
self.R += 1 # Increase number of consecutive rejeced moves
if self.R >= self.R_max and currTemp <= self.finalTemp:
break
# Reduce temperature
currTemp = currTemp*self.alpha
# Increase number of iterations
n_iterations += 1
print(" - " + str([rep, n_iterations, "{0:.2E}".format(currTemp), round(cost,5), round(best_cost,5)]) \
+ str([round(c,3) for c in bestMetricsNorm]) + " " + str(int(round(100*float(self.R)/self.R_max))) + "%")
ratio_complete = 1.-best_metrics[1]
# Uncomment for plotting images:
#return best_sol, best_cost, ratio_complete, best_metrics, solutions_arr, cost_arr, metrics_arr
return best_sol, best_cost, ratio_complete, best_metrics, n_iterations
def probability(self,average_cost,prev_score,next_score,temperature):
if next_score < prev_score:
return 1.0
else:
return math.exp((prev_score-next_score)/average_cost/temperature)
class State:
def __init__(self, candInfo, mergeList, conflictList, adjacencyList, dummyConflictsList, offset_dict):
self.candInfo = candInfo
self.binaryList = np.zeros(len(candInfo.paths),dtype=int) #sol is a binary 1D numpy array (e.g. sol = array([0,1,0,1,1]))
self.components = dc.ConnectedComponents(mergeList)
self.conflictList = conflictList
self.adjacencyList = adjacencyList
self.dummyConflictsList = dummyConflictsList
self.offset_dict = offset_dict
# Create a graph from path of each candidate
self.candidate_graphs = []
for p in self.candInfo.paths:
self.candidate_graphs.append(graphs.Candidate_Graph(p))
# Initialize individual items of cost
# Add all dummies, because there are no candidate root hairs yet
self.cost_items = CostItems(sum_length_dummy=sum(self.candInfo.dummy_lengths),
sum_length_all=sum(self.candInfo.dummy_lengths) )
# No conflicts yet for dummies
# Dummies can have more conflicting candidates in solution e.g. at intersection
n_dummies = max([max(rh) for rh in dummyConflictsList if len(rh)>0])+1
self.n_dummy_conflicts = np.zeros(n_dummies, dtype=int)
# Items to track recent changes to candidates and connected components
self.addedTips = []
self.removedTips = []
self.removedCandidates = []
self.addedCandidates = []
self.removedComponents = []
self.addedComponents = []
self.addedDummies = []
self.removedDummies = []
# Track difference in cost items
self.cost_items_difference = CostItemDifference()
def neighbor(self, position):
# Reset previous tracked changes
self.addedTips = []
self.removedTips = []
self.removedCandidates = []
self.addedCandidates = []
self.removedComponents = []
self.addedComponents = []
self.addedDummies = []
self.removedDummies = []
self.cost_items_difference = CostItemDifference()
# Get neighbor of current solution
self.addedCandidates, self.removedCandidates = self.getChangesFromBinaryList(position)
self.updateBinaryList(self.addedCandidates, self.removedCandidates)
# Remove vertices from components graph
for c in self.removedCandidates:
comp_add, comp_remove = self.components.removeVertex(c)
for value in comp_remove.values():
self.removedComponents.append(value)
for value in comp_add.values():
self.addedComponents.append(value)
# Add new vertices to components graph
for c in self.addedCandidates:
comp_add, comp_remove = self.components.addVertex(c)
for value in comp_remove.values():
self.removedComponents.append(value)
for value in comp_add.values():
self.addedComponents.append(value)
# Fill with dummies
self.addedDummies, self.removedDummies, self.n_dummy_conflicts = self.updateDummies(self.n_dummy_conflicts, self.addedCandidates, self.removedCandidates)
self.addedTips = getComponentTips(self.addedComponents, self.candidate_graphs)
self.removedTips = getComponentTips(self.removedComponents, self.candidate_graphs)
# Calcule difference in cost items
self.cost_items_difference.extract(self.candInfo,
self.candidate_graphs,
self.offset_dict,
self.addedComponents,
self.removedComponents,
self.addedDummies,
self.removedDummies)
# Update to new cost items
self.cost_items = self.cost_items + self.cost_items_difference
if not self.isvalid():
return False
if not self.hasTwoTips():
return False
else:
return True
def isvalid(self):
"""
Tests if candidates in a new connected component overlap
"""
for c in self.addedComponents:
if self.selfintersect(c):
#print "Invalid component: "+str(c)
return False
return True
def hasTwoTips(self):
for item in self.addedTips:
if len(item) != 2:
return False
#for item in self.changes['removedTips']:
# if len(item) != 2:
# return False
return True
def selfintersect(self, componentPath):
"""
Tests if candidates overlap
"""
lenPath = len(componentPath)
for i in range(lenPath):
for j in range(i+2,lenPath):
if componentPath[j] > componentPath[i]:
if componentPath[j] in self.adjacencyList[componentPath[i]]:
return True
elif componentPath[i] in self.adjacencyList[componentPath[j]]:
return True
return False
def getChanges(self):
return self.addedTips, self.removedTips, self.addedCandidates, self.removedCandidates, self.addedComponents, self.removedComponents, self.addedDummies, self.removedDummies
def reverseChanges(self):
# Reverse changes
self.updateBinaryList(self.removedCandidates, self.addedCandidates)
for c in self.addedCandidates:
self.components.removeVertex(c)
for c in self.removedCandidates:
self.components.addVertex(c)
_, _, self.n_dummy_conflicts = self.updateDummies(self.n_dummy_conflicts, self.removedCandidates, self.addedCandidates)
self.cost_items = self.cost_items - self.cost_items_difference
# Reset tracked changes
self.addedTips = []
self.removedTips = []
self.removedCandidates = []
self.addedCandidates = []
self.removedComponents = []
self.addedComponents = []
self.addedDummies = []
self.removedDummies = []
self.cost_items_difference = CostItemDifference()
def getChangesFromBinaryList(self, pos):
if self.binaryList[pos] == 1: # If candidate is already in solution
cand_add = [] # Add none
cand_remove = [pos] # Remove
else:
cand_add = [pos]
c = self.conflictList[pos]
cand_remove = c[np.where(self.binaryList[c])]
return cand_add, cand_remove
def updateBinaryList(self, add, remove):
self.binaryList[add] = 1
self.binaryList[remove] = 0
def updateDummies(self, n_dummy_conflicts, cand_add, cand_remove):
# For each removed candidate, dummies have to be added
n_dummy_conflicts_copy = np.array(n_dummy_conflicts)
dum_add = []
for c in cand_remove: # For each removed candidate
dummy_ids = self.dummyConflictsList[c]
n_dummy_conflicts_copy[dummy_ids] -= 1 # Reduce number of conflicting candidates for this dummy
ids = np.where(n_dummy_conflicts_copy[dummy_ids]==0)[0] # If no more conflicts add a dummy
dum_add.append(dummy_ids[ids])
dum_add = list(chain(*dum_add))
# For each added candidate, dummies have to be removed
dum_remove = []
for c in cand_add:
dummy_ids = self.dummyConflictsList[c]
ids = np.where(n_dummy_conflicts_copy[dummy_ids]==0)[0]
dum_remove.append(dummy_ids[ids])
n_dummy_conflicts_copy[dummy_ids] += 1
dum_remove = list(chain(*dum_remove))
return dum_add, dum_remove, n_dummy_conflicts_copy
def getComponentTips(components, candidateGraphs):
tips = []
# print "get_component_tips:"
for candidates in components:
g = graphs.Candidate_Graph([])
for candidate_id in candidates:
g.merge(candidateGraphs[candidate_id])
tips.append(g.all_degree_one())
return tips
class CoolingScheduleMaker:
def __init__(self, initialState, costFunction, initialProb=0.95, finalProb=0.0001):
"""
Class to determine cooling schedule based on simulated solution
"""
self.initialProb = initialProb
self.finalProb = finalProb
self.state = initialState # State object
#self.temperatureLevels = temperatureLevels # Number of temperatre levels
self.deltaCostArray = [] # Holds upward changed costs of simulation
self.costArray = [] # Holds all costs
self.subCostArray = []
self.costFunction = costFunction
def simulate(self, n):
"""
Creates neighbors n times start at given solution
"""
nPaths = len(self.state.binaryList)
for _ in range(n):
# Get position (component id) to be changed
position = random.randint(0,nPaths-1)
# Change current solution
isvalid = self.state.neighbor(position)
# If is invalid reverse and skip
if not isvalid:
self.state.reverseChanges()
continue
# Calculate cost for current state
metrics = self.costFunction.calculateMetrics(self.state)
cost = self.costFunction.calculateCost(metrics)
self.costArray.append(cost)
self.subCostArray.append(metrics)
avg = np.mean(self.subCostArray,0)
std = np.std(self.subCostArray,0)
rse = 100 * std / avg / np.sqrt(len(self.subCostArray)) # Relative Standard Error
print(' Initial simulation ', avg, std, rse, len(self.subCostArray))
# Determine if more iterations are required based on Relative Standard Error
cv = std/avg # Coefficient of variation
cv[cv>0.5] = 0.5 # If coefficient is too extreme, set to 0.25
nRequired = int(max((2.576*100*cv)**2)) # 99% have to be within 1*cv
nMore = nRequired-n
for _ in range(nMore):
# Get position (component id) to be changed
position = random.randint(0,nPaths-1)
# Change current solution
isvalid = self.state.neighbor(position)
# If is invalid reverse and skip
if not isvalid:
self.state.reverseChanges()
continue
# Calculate cost for current state
metrics = self.costFunction.calculateMetrics(self.state)
cost = self.costFunction.calculateCost(metrics)
self.costArray.append(cost)
self.subCostArray.append(metrics)
avg = np.mean(self.subCostArray,0)
std = np.std(self.subCostArray,0)
rse = 100 * std / avg / np.sqrt(len(self.subCostArray)) # Relative Standard Error
print(' Final simulation ', avg, std, rse, len(self.subCostArray))
def recalculateCost(self):
"""
Recalculates costs with normalized sub costs
"""
self.costArray = []
for metrics in self.subCostArray:
metricsNorm = self.costFunction.normalizeMetrics(metrics)
cost = self.costFunction.calculateCost(metricsNorm)
self.costArray.append(cost)
def calculateUpwardCosts(self):
self.deltaCostArray = []
previous_cost = self.costArray[0]
for current_cost in self.costArray:
if current_cost > previous_cost:
self.deltaCostArray.append(current_cost-previous_cost)
previous_cost = current_cost
def normalization(self):
"""
Determines average values of sub cost for normalization of cost.
Output: numpy array with 3 normalization values (float)
"""
normValuesRand = np.mean(self.subCostArray,0)
return normValuesRand
def averageDeltaCost(self):
"""
Calculates average increasing cost
"""
return np.mean(self.deltaCostArray)
def initialCost(self):
"""
Calculates average initial cost
"""
return np.mean(self.costArray)
def getInitialTemp(self):
"""
Calculates initial temperature
"""
t = - self.averageDeltaCost() / (self.initialCost() * np.log(self.initialProb))
return t
def getAlpha(self,initialTemp,nIterations):
"""
Calculate the cooling rate
"""
return (-self.averageDeltaCost() / (initialTemp * np.log(self.finalProb) * self.initialCost()))**(1.0/nIterations)
def getFinalTemp(self, initialTemp, alpha, nIterations):
"""
Calculates final temperature
"""
return initialTemp*(alpha**nIterations)
def matrix_to_list(adjmat):
# converts adjacency matrix to adjaceny list
graph = [[] for v in adjmat]
for i, v in enumerate(adjmat, 0):
for j, u in enumerate(v, 0):
if u != 0:
#edges.add(frozenset([i, j]))
graph[i].append(j)
return [np.array(v,dtype=int) for v in graph]
class CandidateInformation:
def __init__(self):
# Path of each candidate
self.paths = []
# Dummie values
self.dummy_lengths = np.array([])
# Candidate values
self.excess_strain = np.array([])
self.min_distance = np.array([])
self.max_distance = np.array([])
self.n_segments = np.array([])
# Segment distance to root
self.minDistToEdge = {}
class CostItems:
def __init__( self,
sum_excess_strain_roothair=0.0,\
sum_length_dummy=0.0, \
sum_length_all=0.0, \
sum_min_distance_roothair=0.0, \
num_roothair=0, \
sum_max_distance_roothair=0.0):
self.sum_excess_strain_roothair = sum_excess_strain_roothair
# Total length of remaining dummies measure
self.sum_length_dummy = sum_length_dummy
self.sum_length_all = sum_length_all
# Min distance to root
self.sum_min_distance_roothair = sum_min_distance_roothair
self.num_roothair = num_roothair
# Max distance to root
self.sum_max_distance_roothair = sum_max_distance_roothair
def __add__(self, other):
sum_excess_strain_roothair = self.sum_excess_strain_roothair + other.sum_excess_strain_roothair
# Total length of remaining dummies measure
sum_length_dummy = self.sum_length_dummy + other.sum_length_dummy
sum_length_all = self.sum_length_all + other.sum_length_all
# Min distance to root
sum_min_distance_roothair = self.sum_min_distance_roothair + other.sum_min_distance_roothair
num_roothair = self.num_roothair + other.num_roothair
# Max distance to root
sum_max_distance_roothair = self.sum_max_distance_roothair + other.sum_max_distance_roothair
return CostItems(sum_excess_strain_roothair, \
sum_length_dummy, sum_length_all,
sum_min_distance_roothair, num_roothair, sum_max_distance_roothair)
def __sub__(self, other):
sum_excess_strain_roothair = self.sum_excess_strain_roothair - other.sum_excess_strain_roothair
# Total length of remaining dummies measure
sum_length_dummy = self.sum_length_dummy - other.sum_length_dummy
sum_length_all = self.sum_length_all - other.sum_length_all
# Min distance to root
sum_min_distance_roothair = self.sum_min_distance_roothair - other.sum_min_distance_roothair
num_roothair = self.num_roothair - other.num_roothair
# Max distance to root
sum_max_distance_roothair = self.sum_max_distance_roothair - other.sum_max_distance_roothair
return CostItems(sum_excess_strain_roothair, \
sum_length_dummy, sum_length_all,
sum_min_distance_roothair, num_roothair, sum_max_distance_roothair)
class CostItemDifference(CostItems):
def extract(self, candInfo, candidate_graphs, offset_dict, comp_add, comp_remove, dum_add, dum_remove):
# Compute curvatures/strains
s_remove_total = 0.
for c in comp_remove:
len_remove = sum(candInfo.n_segments[c]) - len(c) + 1
s_remove = sum(candInfo.excess_strain[c])
if len(c)>1:
for first, second in zip(c, c[1:]):
s_remove += offset_dict[(min(first, second),max(first, second))]
if s_remove < 0:
s_remove = 0.0
s_remove_total += s_remove**2 # TODO: should use square **2; take root at end when calculating cost
s_add_total = 0.
for c in comp_add:
len_add = sum(candInfo.n_segments[c]) - len(c) + 1
s_add = sum(candInfo.excess_strain[c])
if len(c)>1:
for first, second in zip(c, c[1:]):
s_add += offset_dict[(min(first, second),max(first, second))]
if s_add < 0:
s_add = 0.0
s_add_total += s_add**2 # TODO: should use square **2; take root at end when calculating cost
# Curvature measure
self.sum_excess_strain_roothair = s_add_total - s_remove_total
# Total length of remaining dummies measure
self.sum_length_dummy = sum(candInfo.dummy_lengths[dum_add]) \
- sum(candInfo.dummy_lengths[dum_remove])
# Number of components
self.num_roothair = len(comp_add) - len(comp_remove)
# Get tips of component
tips_remove = getComponentTips(comp_remove, candidate_graphs)
tips_add = getComponentTips(comp_add, candidate_graphs)
# Sum min/max distances of tips
min_distance = 0.0
max_distance = 0.0
for tip_pair in tips_add:
distances = [candInfo.minDistToEdge[t] for t in tip_pair]
if len(distances) == 2:
min_distance += min(distances)**2 # Square to reduce number of outliers
max_distance += max(distances)**2 # Square to reduce number of outliers
else:
#print "for tip_pair in tips_add: len(distances) = ", len(distances)
return False
for tip_pair in tips_remove:
distances = [candInfo.minDistToEdge[t] for t in tip_pair]
if len(distances) == 2:
min_distance -= min(distances)**2 # Square to reduce number of outliers
max_distance -= max(distances)**2 # Square to reduce number of outliers
else:
#print "for tip_pair in tips_remove: len(distances) = ", len(distances)
return False
# Min distance to root
self.sum_min_distance_roothair = min_distance
# Max distance to root
self.sum_max_distance_roothair = max_distance
return True
class Cost:
def __init__(self, measure, cost_type, weights=[1., 1., 1.], normValuesLow=[0., 0., 0.], normValuesHigh=[1., 1., 1.]):
self.measure = measure
self.cost_type = cost_type
self.normValuesHigh = np.array(normValuesHigh)
self.normValuesLow = np.array(normValuesLow)
self.weights = np.array(weights)
sum_weights = np.sum(weights)
self.weights = np.float_(weights)/sum_weights
def setNormValues(self, newValuesHigh, newValuesLow):
self.normValuesHigh = newValuesHigh
self.normValuesLow = newValuesLow
def setWeights(self, newWeights):
sum_weights = np.sum(newWeights)
self.weights = np.float_(newWeights)/sum_weights
def calculateMetrics(self, state):
"""
Calculates metrics of state
"""
cost_items = state.cost_items
tot_len_measure = cost_items.sum_length_dummy / cost_items.sum_length_all
if cost_items.num_roothair > 0:
min_dist_measure = math.sqrt(cost_items.sum_min_distance_roothair / cost_items.num_roothair)
if cost_items.sum_excess_strain_roothair > 0:
curvature_measure = math.sqrt(cost_items.sum_excess_strain_roothair / cost_items.num_roothair)
else:
curvature_measure = 0.0
else:
min_dist_measure = 0.0
curvature_measure = 0.0
return np.array([curvature_measure, tot_len_measure, min_dist_measure])
def normalizeMetrics(self, metrics):
"""
Returns metrics normalized with Cost.normValues
"""
return (metrics - self.normValuesLow) / (self.normValuesHigh - self.normValuesLow)
def calculateCost(self, metrics):
"""
Calculates cost from metrics using cost function settings
"""
if self.cost_type == 'exp':
return np.sum(self.weights * np.exp(metrics))
elif self.cost_type == 'mean':
return np.sum(self.weights * metrics)
elif self.cost_type == 'rms':
return weighted_root_mean_square(metrics, self.weights)
elif self.cost_type == 'pow3':
return np.mean(metrics**3.)**(1/3.0)
elif self.cost_type == 'pow4':
return np.mean(metrics**4.)**(1/4.0)
elif self.cost_type == 'geom':
return gmean(metrics)
else:
return None
def weighted_root_mean_square(arr, weights):
'''
Get the root mean square value of the array values
'''
return np.sqrt(np.sum(weights * np.array(arr)**2.))