-
Notifications
You must be signed in to change notification settings - Fork 0
/
utility.py
329 lines (240 loc) · 8.92 KB
/
utility.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
import numpy as np
import logging
import networkx
import os
from scipy import misc
import maxflow
def loadunaryfile(filename):
file = open(filename, "r")
xsize = int(file.readline())
ysize = int(file.readline())
labels = int(file.readline())
data = np.empty((ysize, xsize, labels))
for x in range(xsize):
for y in range(ysize):
for l in range(labels):
data[y, x, l] = float(file.readline())
return data
def readimg_normalize(imagename):
img = misc.imread(os.path.join("data", imagename))
img = np.array(img, dtype=np.float64) / 255
return img
def readimg(imagename):
return misc.imread(os.path.join("data", imagename))
def readimg_grayscale(imagename):
return misc.imread(os.path.join("data", imagename), 'L')
class Node:
def __init__(self, y, x):
self.y = y
self.x = x
def pos(self):
return self.y, self.x
class Nodegrid:
def __init__(self, ysize, xsize):
# Create grid of nodes
self.nodegrid = [[Node(y, x) for x in range(xsize)] for y in range(ysize)]
self.g = networkx.DiGraph()
for nodelist in self.nodegrid:
self.g.add_nodes_from(nodelist)
# Source node
self.source = Node(-1, -1)
self.sink = Node(-1, -1)
self.g.add_node(self.source)
self.g.add_node(self.sink)
self.ysize = ysize
self.xsize = xsize
def loop(self, edgecallback, nodecallback):
"""
Loops over the grid of nodes. Two callback functions are required:
:param edgecallback: Called for every edge.
:param nodecallback: Called for every node.
"""
logging.info("Iterate through graph.")
for y in range(self.ysize - 1):
for x in range(self.xsize - 1):
node_i = self.nodegrid[y][x]
# Node
nodecallback(node_i)
# Right edge
node_j = self.nodegrid[y][x + 1]
edgecallback(node_i, node_j)
# Down edge
node_j = self.nodegrid[y + 1][x]
edgecallback(node_i, node_j)
# Last column
for y in range(self.ysize - 1):
node_i = self.nodegrid[y][self.xsize - 1]
# Node
nodecallback(node_i)
# Down edge
node_j = self.nodegrid[y + 1][self.xsize - 1]
edgecallback(node_i, node_j)
# Last row
for x in range(self.xsize - 1):
node_i = self.nodegrid[self.ysize - 1][x]
# Node
nodecallback(node_i)
# Right edge
node_j = self.nodegrid[self.ysize - 1][x + 1]
edgecallback(node_i, node_j)
# Last node
nodecallback(self.nodegrid[self.ysize - 1][self.xsize - 1])
def loopedges(self, edgecallback):
logging.info("Iterate through edges.")
for y in range(self.ysize - 1):
for x in range(self.xsize - 1):
node_i = self.nodegrid[y][x]
# Right edge
node_j = self.nodegrid[y][x + 1]
edgecallback(node_i, node_j)
# Down edge
node_j = self.nodegrid[y + 1][x]
edgecallback(node_i, node_j)
# Last column
for y in range(self.ysize - 1):
node_i = self.nodegrid[y][self.xsize - 1]
# Down edge
node_j = self.nodegrid[y + 1][self.xsize - 1]
edgecallback(node_i, node_j)
# Last row
for x in range(self.xsize - 1):
node_i = self.nodegrid[self.ysize - 1][x]
# Right edge
node_j = self.nodegrid[self.ysize - 1][x + 1]
edgecallback(node_i, node_j)
@staticmethod
def loopedges_raw(callback, ysize, xsize):
logging.info("Iterate through edges.")
for y in range(ysize - 1):
for x in range(xsize - 1):
pos_i = (y, x)
# Right edge
pos_j = (y, x + 1)
callback(pos_i, pos_j)
# Down edge
pos_j = (y + 1, x)
callback(pos_i, pos_j)
# Last column
for y in range(ysize - 1):
pos_i = (y, xsize - 1)
# Down edge
pos_j = (y + 1, xsize - 1)
callback(pos_i, pos_j)
# Last row
for x in range(xsize - 1):
pos_i = (ysize - 1, x)
# Right edge
pos_j = (ysize - 1, x + 1)
callback(pos_i, pos_j)
@staticmethod
def loopnodes_raw(callback, ysize, xsize):
logging.info("Iterate through nodes.")
for y in range(ysize):
for x in range(xsize):
callback((y, x))
def loopnodes(self, callback):
logging.info("Iterate through nodes.")
for y in range(self.ysize):
for x in range(self.xsize):
callback(self.nodegrid[y][x])
def add_edge(self, node_i, node_j, capacity):
self.g.add_edge(node_i, node_j, capacity=capacity)
def add_source_edge(self, node, capacity):
self.g.add_edge(self.source, node, capacity=capacity)
def add_sink_edge(self, node, capacity):
self.g.add_edge(node, self.sink, capacity=capacity)
def maxflow(self):
logging.info("Calculate max flow.")
value, flows = networkx.maximum_flow(self.g, self.source, self.sink)
return value, flows
def mincut(self):
logging.info("Calculate mincut.")
value, cut = networkx.minimum_cut(self.g, self.source, self.sink)
return value, cut
def getcap(self, node):
return self.g[self.source][node]["capacity"]
def hassourcepath(self, node):
return node in self.g[self.source]
def draw(self):
positions = {}
for nodelist in self.nodegrid:
for node in nodelist:
positions[node] = [node.x, node.y]
pad = 2
nodesize = 10
positions[self.source] = [self.xsize / 2 - 0.5, -pad]
positions[self.sink] = [self.xsize / 2 - 0.5, self.ysize + pad]
networkx.draw_networkx(self.g, pos=positions,
node_size=nodesize, with_labels=False,
width=0.5)
class Node_c:
def __init__(self, nodeid, y, x):
self.nodeid = nodeid
self.y = y
self.x = x
class Nodegrid_c:
def __init__(self, ysize, xsize):
self.g = maxflow.GraphFloat()
self.nodeids = self.g.add_grid_nodes((ysize, xsize))
self.ysize = ysize
self.xsize = xsize
def loop(self, edgecallback, nodecallback):
"""
Loops over the grid of nodes. Two callback functions are required:
:param edgecallback: Called for every edge.
:param nodecallback: Called for every node.
"""
logging.info("Iterate through graph.")
for y in range(self.ysize - 1):
for x in range(self.xsize - 1):
node_i = self.getNode(y, x)
# Node
nodecallback(node_i)
# Right edge
node_j = self.getNode(y, x + 1)
edgecallback(node_i, node_j)
# Down edge
node_j = self.getNode(y + 1, x)
edgecallback(node_i, node_j)
# Right-down edge
node_j = self.getNode(y + 1, x + 1)
edgecallback(node_i, node_j)
node_i = self.getNode(y, x + 1)
node_j = self.getNode(y + 1, x)
edgecallback(node_i, node_j)
# Last column
for y in range(self.ysize - 1):
node_i = self.getNode(y, self.xsize - 1)
# Node
nodecallback(node_i)
# Down edge
node_j = self.getNode(y + 1, self.xsize - 1)
edgecallback(node_i, node_j)
# Last row
for x in range(self.xsize - 1):
node_i = self.getNode(self.ysize - 1, x)
# Node
nodecallback(node_i)
# Right edge
node_j = self.getNode(self.ysize - 1, x + 1)
edgecallback(node_i, node_j)
# Last node
nodecallback(self.getNode(self.ysize - 1, self.xsize - 1))
def add_sink_edge(self, node_i, cap):
self.g.add_tedge(node_i.nodeid, 0, cap)
def add_source_edge(self, node_i, cap):
self.g.add_tedge(node_i.nodeid, cap, 0)
def add_edge(self, node_i, node_j, cap):
self.g.add_edge(node_i.nodeid, node_j.nodeid, cap, cap)
def loopnodes(self, callback):
logging.info("Iterate through nodes.")
for y in range(self.ysize):
for x in range(self.xsize):
callback(self.getNode(y, x))
def maxflow(self):
logging.info("Calculate max flow.")
return self.g.maxflow()
def getNode(self, y, x):
return Node_c(self.nodeids[y, x], y, x)
def getsegment(self, node):
return self.g.get_segment(node.nodeid)