File size: 19,345 Bytes
d4cbafd | 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 | import numpy as np
from scipy.spatial.distance import pdist, squareform
import scipy.signal as ss
from collections import defaultdict
import warnings
from .node import Node
class Edge(object):
def __init__(self, curr_node, other_node):
self.id = self.get_edge_id(curr_node, other_node)
self.type = self.get_edge_type(curr_node, other_node)
self.curr_node = curr_node
self.other_node = other_node
@staticmethod
def get_edge_id(n1, n2):
raise NotImplementedError("Use one of the Edge subclasses!")
@staticmethod
def get_str_from_types(nt1, nt2):
raise NotImplementedError("Use one of the Edge subclasses!")
@staticmethod
def get_edge_type(n1, n2):
raise NotImplementedError("Use one of the Edge subclasses!")
def __eq__(self, other):
return (isinstance(other, self.__class__)
and self.id == other.id)
def __ne__(self, other):
return not self.__eq__(other)
def __hash__(self):
return hash(self.id)
def __repr__(self):
return self.id
class UndirectedEdge(Edge):
def __init__(self, curr_node, other_node):
super(UndirectedEdge, self).__init__(curr_node, other_node)
@staticmethod
def get_edge_id(n1, n2):
return '-'.join(sorted([str(n1), str(n2)]))
@staticmethod
def get_str_from_types(nt1, nt2):
return '-'.join(sorted([nt1.name, nt2.name]))
@staticmethod
def get_edge_type(n1, n2):
return '-'.join(sorted([n1.type.name, n2.type.name]))
class DirectedEdge(Edge):
def __init__(self, curr_node, other_node):
super(DirectedEdge, self).__init__(curr_node, other_node)
@staticmethod
def get_edge_id(n1, n2):
return '->'.join([str(n1), str(n2)])
@staticmethod
def get_str_from_types(nt1, nt2):
return '->'.join([nt1.name, nt2.name])
@staticmethod
def get_edge_type(n1, n2):
return '->'.join([n1.type.name, n2.type.name])
class TemporalSceneGraph(object):
def __init__(self,
edge_radius,
nodes=None,
adj_cube=np.zeros((1, 0, 0)),
weight_cube=np.zeros((1, 0, 0)),
node_type_mat=np.zeros((0, 0)),
edge_scaling=None):
self.edge_radius = edge_radius
self.nodes = nodes
if nodes is None:
self.nodes = np.array([])
self.adj_cube = adj_cube
self.weight_cube = weight_cube
self.node_type_mat = node_type_mat
self.adj_mat = np.max(self.adj_cube, axis=0).clip(max=1.0)
self.edge_scaling = edge_scaling
self.node_index_lookup = None
self.calculate_node_index_lookup()
def calculate_node_index_lookup(self):
node_index_lookup = dict()
for i, node in enumerate(self.nodes):
node_index_lookup[node] = i
self.node_index_lookup = node_index_lookup
def get_num_edges(self, t=0):
return np.sum(self.adj_cube[t]) // 2
def get_index(self, node):
return self.node_index_lookup[node]
@classmethod
def create_from_temp_scene_dict(cls,
scene_temp_dict,
attention_radius,
duration=1,
edge_addition_filter=None,
edge_removal_filter=None,
online=False):
"""
Construct a spatiotemporal graph from node positions in a dataset.
:param scene_temp_dict: Dict with all nodes in scene as keys and np.ndarray with positions as value
:param attention_radius: Attention radius dict.
:param duration: Temporal duration of the graph.
:param edge_addition_filter: -
:param edge_removal_filter: -
:return: TemporalSceneGraph
"""
nodes = scene_temp_dict.keys()
N = len(nodes)
total_timesteps = duration
if N == 0:
return TemporalSceneGraph(attention_radius)
position_cube = np.full((total_timesteps, N, 2), np.nan)
adj_cube = np.zeros((total_timesteps, N, N), dtype=np.int8)
dist_cube = np.zeros((total_timesteps, N, N), dtype=np.float64)
node_type_mat = np.zeros((N, N), dtype=np.int8)
node_attention_mat = np.zeros((N, N), dtype=np.float64)
for node_idx, node in enumerate(nodes):
if online:
# RingBuffers do not have a fixed constant size. Instead, they grow up to their capacity. Thus,
# we need to fill the values preceding the RingBuffer values with NaNs to make them fill the
# position_cube.
position_cube[-scene_temp_dict[node].shape[0]:, node_idx] = scene_temp_dict[node]
else:
position_cube[:, node_idx] = scene_temp_dict[node]
node_type_mat[:, node_idx] = node.type.value
for node_idx_from, node_from in enumerate(nodes):
node_attention_mat[node_idx_from, node_idx] = attention_radius[(node_from.type, node.type)]
np.fill_diagonal(node_type_mat, 0)
for timestep in range(position_cube.shape[0]):
dists = squareform(pdist(position_cube[timestep], metric='euclidean'))
# Put a 1 for all agent pairs which are closer than the edge_radius.
# Can produce a warning as dists can be nan if no data for node is available.
# This is accepted as nan <= x evaluates to False
with warnings.catch_warnings():
warnings.simplefilter("ignore")
adj_matrix = (dists <= node_attention_mat).astype(np.int8) * node_type_mat
# Remove self-loops.
np.fill_diagonal(adj_matrix, 0)
adj_cube[timestep] = adj_matrix
dist_cube[timestep] = dists
dist_cube[np.isnan(dist_cube)] = 0.
weight_cube = np.divide(1.,
dist_cube,
out=np.zeros_like(dist_cube),
where=(dist_cube > 0.))
edge_scaling = None
if edge_addition_filter is not None and edge_removal_filter is not None:
edge_scaling = cls.calculate_edge_scaling(adj_cube, edge_addition_filter, edge_removal_filter)
tsg = cls(attention_radius,
np.array(list(nodes)),
adj_cube, weight_cube,
node_type_mat,
edge_scaling=edge_scaling)
return tsg
@staticmethod
def calculate_edge_scaling(adj_cube, edge_addition_filter, edge_removal_filter):
shifted_right = np.pad(adj_cube, ((len(edge_addition_filter) - 1, 0), (0, 0), (0, 0)), 'constant', constant_values=0)
new_edges = np.minimum(
ss.convolve(shifted_right, np.reshape(edge_addition_filter, (-1, 1, 1)), 'full'), 1.
)[(len(edge_addition_filter) - 1):-(len(edge_addition_filter) - 1)]
new_edges[adj_cube == 0] = 0
result = np.minimum(
ss.convolve(new_edges, np.reshape(edge_removal_filter, (-1, 1, 1)), 'full'), 1.
)[:-(len(edge_removal_filter) - 1)]
return result
def to_scene_graph(self, t, t_hist=0, t_fut=0):
"""
Creates a Scene Graph from a Temporal Scene Graph
:param t: Time in Temporal Scene Graph for which Scene Graph is created.
:param t_hist: Number of history timesteps which are considered to form edges in Scene Graph.
:param t_fut: Number of future timesteps which are considered to form edges in Scene Graph.
:return: SceneGraph
"""
lower_t = np.clip(t-t_hist, a_min=0, a_max=None)
higher_t = np.clip(t + t_fut + 1, a_min=None, a_max=self.adj_cube.shape[0] + 1)
adj_mat = np.max(self.adj_cube[lower_t:higher_t], axis=0)
weight_mat = np.max(self.weight_cube[lower_t:higher_t], axis=0)
return SceneGraph(self.edge_radius,
self.nodes,
adj_mat,
weight_mat,
self.node_type_mat,
self.node_index_lookup,
edge_scaling=self.edge_scaling[t] if self.edge_scaling is not None else None)
class SceneGraph(object):
def __init__(self,
edge_radius,
nodes=None,
adj_mat=np.zeros((0, 0)),
weight_mat=np.zeros((0, 0)),
node_type_mat=np.zeros((0, 0)),
node_index_lookup=None,
edge_scaling=None):
self.edge_radius = edge_radius
self.nodes = nodes
if nodes is None:
self.nodes = np.array([])
self.node_type_mat = node_type_mat
self.adj_mat = adj_mat
self.weight_mat = weight_mat
self.edge_scaling = edge_scaling
self.node_index_lookup = node_index_lookup
def get_index(self, node):
return self.node_index_lookup[node]
def get_num_edges(self):
return np.sum(self.adj_mat) // 2
def get_neighbors(self, node, node_type):
"""
Get all neighbors of a node.
:param node: Node for which all neighbors are returned.
:param node_type: Specifies node types which are returned.
:return: List of all neighbors.
"""
node_index = self.get_index(node)
connection_mask = self.get_connection_mask(node_index)
mask = ((self.node_type_mat[node_index] == node_type.value) * connection_mask)
return self.nodes[mask]
def get_edge_scaling(self, node=None):
if node is None:
return self.edge_scaling
else:
node_index = self.get_index(node)
connection_mask = self.get_connection_mask(node_index)
return self.edge_scaling[node_index, connection_mask]
def get_edge_weight(self, node=None):
if node is None:
return self.weight_mat
else:
node_index = self.get_index(node)
connection_mask = self.get_connection_mask(node_index)
return self.weight_mat[node_index, connection_mask]
def get_connection_mask(self, node_index):
if self.edge_scaling is None: # We do not use edge scaling
return self.adj_mat[node_index] > 0.
else:
return self.edge_scaling[node_index] > 1e-2
def __sub__(self, other):
new_nodes = [node for node in self.nodes if node not in other.nodes]
removed_nodes = [node for node in other.nodes if node not in self.nodes]
our_types = set(node.type for node in self.nodes)
other_types = set(node.type for node in other.nodes)
all_node_types = our_types | other_types
new_neighbors = defaultdict(dict)
for node in self.nodes:
if node in removed_nodes:
continue
if node in other.nodes:
for node_type in all_node_types:
new_items = set(self.get_neighbors(node, node_type)) - set(other.get_neighbors(node, node_type))
if len(new_items) > 0:
new_neighbors[node][DirectedEdge.get_edge_type(node, Node(node_type, None, None))] = new_items
else:
for node_type in our_types:
neighbors = self.get_neighbors(node, node_type)
if len(neighbors) > 0:
new_neighbors[node] = {DirectedEdge.get_edge_type(node, Node(node_type, None, None)): set(neighbors)}
removed_neighbors = defaultdict(dict)
for node in other.nodes:
if node in removed_nodes:
continue
if node in self.nodes:
for node_type in all_node_types:
removed_items = set(other.get_neighbors(node, node_type)) - set(self.get_neighbors(node, node_type))
if len(removed_items) > 0:
removed_neighbors[node][DirectedEdge.get_edge_type(node, Node(node_type, None, None))] = removed_items
else:
for node_type in other_types:
neighbors = other.get_neighbors(node, node_type)
if len(neighbors) > 0:
removed_neighbors[node] = {DirectedEdge.get_edge_type(node, Node(node_type, None, None)): set(neighbors)}
return new_nodes, removed_nodes, new_neighbors, removed_neighbors
if __name__ == '__main__':
from data import NodeTypeEnum
import time
# # # # # # # # # # # # # # # # #
# Testing edge mask calculation #
# # # # # # # # # # # # # # # # #
B = np.array([[0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0],
[1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0],
[1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0],
[1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0]])[:, :, np.newaxis, np.newaxis]
print(B.shape)
edge_addition_filter = [0.25, 0.5, 0.75, 1.0]
edge_removal_filter = [1.0, 0.5, 0.0]
for i in range(B.shape[0]):
A = B[i] # (time, N, N)
print(A[:, 0, 0])
start = time.time()
new_edges = np.minimum(ss.convolve(A, np.reshape(edge_addition_filter, (-1, 1, 1)), 'full'), 1.)[(len(edge_addition_filter) - 1):]
old_edges = np.minimum(ss.convolve(A, np.reshape(edge_removal_filter, (-1, 1, 1)), 'full'), 1.)[:-(len(edge_removal_filter) - 1)]
res = np.minimum(new_edges + old_edges, 1.)[:, 0, 0]
end = time.time()
print(end - start)
print(res)
start = time.time()
res = TemporalSceneGraph.calculate_edge_scaling(A, edge_addition_filter, edge_removal_filter)[:, 0, 0]
end = time.time()
print(end - start)
print(res)
print('-'*40)
# # # # # # # # # # # # # # #
# Testing graph subtraction #
# # # # # # # # # # # # # # #
print('\n' + '-' * 40 + '\n')
node_type_list = ['PEDESTRIAN',
'BICYCLE',
'VEHICLE']
nte = NodeTypeEnum(node_type_list)
attention_radius = dict()
attention_radius[(nte.PEDESTRIAN, nte.PEDESTRIAN)] = 5.0
attention_radius[(nte.PEDESTRIAN, nte.VEHICLE)] = 20.0
attention_radius[(nte.PEDESTRIAN, nte.BICYCLE)] = 10.0
attention_radius[(nte.VEHICLE, nte.PEDESTRIAN)] = 20.0
attention_radius[(nte.VEHICLE, nte.VEHICLE)] = 20.0
attention_radius[(nte.VEHICLE, nte.BICYCLE)] = 20.0
attention_radius[(nte.BICYCLE, nte.PEDESTRIAN)] = 10.0
attention_radius[(nte.BICYCLE, nte.VEHICLE)] = 20.0
attention_radius[(nte.BICYCLE, nte.BICYCLE)] = 10.0
scene_dict1 = {Node(nte.PEDESTRIAN, node_id='1'): np.array([1, 0]),
Node(nte.PEDESTRIAN, node_id='2'): np.array([0, 1])}
sg1 = TemporalSceneGraph.create_from_temp_scene_dict(
scene_dict1,
attention_radius=attention_radius,
duration=1,
edge_addition_filter=[0.25, 0.5, 0.75, 1.0],
edge_removal_filter=[1.0, 0.0]).to_scene_graph(t=0)
scene_dict2 = {Node(nte.PEDESTRIAN, node_id='1'): np.array([1, 0]),
Node(nte.PEDESTRIAN, node_id='2'): np.array([1, 1])}
sg2 = TemporalSceneGraph.create_from_temp_scene_dict(
scene_dict2,
attention_radius=attention_radius,
duration=1,
edge_addition_filter=[0.25, 0.5, 0.75, 1.0],
edge_removal_filter=[1.0, 0.0]).to_scene_graph(t=0)
new_nodes, removed_nodes, new_neighbors, removed_neighbors = sg2 - sg1
print('New Nodes:', new_nodes)
print('Removed Nodes:', removed_nodes)
print('New Neighbors:', new_neighbors)
print('Removed Neighbors:', removed_neighbors)
# # # # # # # # # # # # # # #
print('\n' + '-' * 40 + '\n')
scene_dict1 = {Node(nte.PEDESTRIAN, node_id='1'): np.array([1, 0]),
Node(nte.PEDESTRIAN, node_id='2'): np.array([0, 1])}
sg1 = TemporalSceneGraph.create_from_temp_scene_dict(
scene_dict1,
attention_radius=attention_radius,
duration=1,
edge_addition_filter=[0.25, 0.5, 0.75, 1.0],
edge_removal_filter=[1.0, 0.0]).to_scene_graph(t=0)
scene_dict2 = {Node(nte.PEDESTRIAN, node_id='1'): np.array([1, 0]),
Node(nte.PEDESTRIAN, node_id='2'): np.array([1, 1]),
Node(nte.PEDESTRIAN, node_id='3'): np.array([20, 1])}
sg2 = TemporalSceneGraph.create_from_temp_scene_dict(
scene_dict2,
attention_radius=attention_radius,
duration=1,
edge_addition_filter=[0.25, 0.5, 0.75, 1.0],
edge_removal_filter=[1.0, 0.0]).to_scene_graph(t=0)
new_nodes, removed_nodes, new_neighbors, removed_neighbors = sg2 - sg1
print('New Nodes:', new_nodes)
print('Removed Nodes:', removed_nodes)
print('New Neighbors:', new_neighbors)
print('Removed Neighbors:', removed_neighbors)
# # # # # # # # # # # # # # #
print('\n' + '-' * 40 + '\n')
scene_dict1 = {Node(nte.PEDESTRIAN, node_id='1'): np.array([1, 0]),
Node(nte.PEDESTRIAN, node_id='2'): np.array([0, 1])}
sg1 = TemporalSceneGraph.create_from_temp_scene_dict(
scene_dict1,
attention_radius=attention_radius,
duration=1,
edge_addition_filter=[0.25, 0.5, 0.75, 1.0],
edge_removal_filter=[1.0, 0.0]).to_scene_graph(t=0)
scene_dict2 = {Node(nte.PEDESTRIAN, node_id='1'): np.array([1, 0]),
Node(nte.PEDESTRIAN, node_id='2'): np.array([10, 1]),
Node(nte.PEDESTRIAN, node_id='3'): np.array([20, 1])}
sg2 = TemporalSceneGraph.create_from_temp_scene_dict(
scene_dict2,
attention_radius=attention_radius,
duration=1,
edge_addition_filter=[0.25, 0.5, 0.75, 1.0],
edge_removal_filter=[1.0, 0.0]).to_scene_graph(t=0)
new_nodes, removed_nodes, new_neighbors, removed_neighbors = sg2 - sg1
print('New Nodes:', new_nodes)
print('Removed Nodes:', removed_nodes)
print('New Neighbors:', new_neighbors)
print('Removed Neighbors:', removed_neighbors)
# # # # # # # # # # # # # # #
print('\n' + '-' * 40 + '\n')
scene_dict1 = {Node(nte.PEDESTRIAN, node_id='1'): np.array([0, 0]),
Node(nte.PEDESTRIAN, node_id='2'): np.array([0, 1])}
sg1 = TemporalSceneGraph.create_from_temp_scene_dict(
scene_dict1,
attention_radius=attention_radius,
duration=1,
edge_addition_filter=[0.25, 0.5, 0.75, 1.0],
edge_removal_filter=[1.0, 0.0]).to_scene_graph(t=0)
scene_dict2 = {Node(nte.PEDESTRIAN, node_id='2'): np.array([10, 1]),
Node(nte.PEDESTRIAN, node_id='3'): np.array([12, 1]),
Node(nte.PEDESTRIAN, node_id='4'): np.array([13, 1])}
sg2 = TemporalSceneGraph.create_from_temp_scene_dict(
scene_dict2,
attention_radius=attention_radius,
duration=1,
edge_addition_filter=[0.25, 0.5, 0.75, 1.0],
edge_removal_filter=[1.0, 0.0]).to_scene_graph(t=0)
new_nodes, removed_nodes, new_neighbors, removed_neighbors = sg2 - sg1
print('New Nodes:', new_nodes)
print('Removed Nodes:', removed_nodes)
print('New Neighbors:', new_neighbors)
print('Removed Neighbors:', removed_neighbors)
|