/
build_relation_map.py
602 lines (534 loc) · 19.3 KB
/
build_relation_map.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
# coding=utf-8
import json
import os
import itertools
import numpy as np
from plyfile import PlyData, PlyElement
from pyobb.obb import OBB
import sys
import util
import random
import colorsys
from concurrent.futures import ProcessPoolExecutor
from scipy.spatial import ConvexHull
from util import remove_none
MAPPING_JSON_PATH = './relation_map.json'
ROOT_PATH = '/data/ScanNet_v2_7'
PREVIEW_PATH = '/media/ScanNet-Preprocess/new_ply_v2'
SAVED_JSON_PATH = './new_json_v2_other_in(copy)_1'
label_dict = {}
min_distance = 0.40
min_group_dis = 0.8
MAX_INTERACTION = 5
def get_n_hls_colors(num):
hls_colors = []
i = 0
step = 360.0 / num
while i < 360:
h = i
s = 90 + random.random() * 10
l = 50 + random.random() * 10
_hlsc = [h / 360.0, l / 100.0, s / 100.0]
hls_colors.append(_hlsc)
i += step
return hls_colors
def ncolors(num):
rgb_colors = []
if num < 1:
return rgb_colors
hls_colors = get_n_hls_colors(num)
for hlsc in hls_colors:
_r, _g, _b = colorsys.hls_to_rgb(hlsc[0], hlsc[1], hlsc[2])
r, g, b = [int(x * 255.0) for x in (_r, _g, _b)]
rgb_colors.append([r, g, b])
return rgb_colors
color_list = ncolors(20)
def get_ply_data(path, color_index):
with open(path, 'rb')as fp:
ply_data = PlyData.read(fp)
point_list = ply_data.elements[0].data[0:]
for p in point_list:
p[3] = color_list[color_index][0]
p[4] = color_list[color_index][1]
p[5] = color_list[color_index][2]
return point_list
def read_json():
global label_dict
with open(MAPPING_JSON_PATH)as fp:
label_dict = json.load(fp)
for (key, _) in label_dict.items():
label_dict[key].append(key)
keys = label_dict.keys()
all_things = list(keys)
all_things.extend(['picture', 'window', 'otherfurniture'])
label_dict['picture'] = all_things
label_dict['window'] = all_things
label_dict['otherfurniture'] = all_things
# label_dict['other'] = all_things
def read_ply(path):
ply_data = PlyData.read(path).elements[0][0:]
return ply_data
def same_plane(coords_4):
x1, y1, z1 = coords_4[0][0], coords_4[0][1], coords_4[0][2]
x2, y2, z2 = coords_4[1][0], coords_4[1][1], coords_4[1][2]
x3, y3, z3 = coords_4[2][0], coords_4[2][1], coords_4[2][2]
x4, y4, z4 = coords_4[3][0], coords_4[3][1], coords_4[3][2]
a = (x2 - x1, y2 - y1, z2 - z1)
a = np.array(a)
b = (x3 - x1, y3 - y1, z3 - z1)
b = np.array(b)
c = (x4 - x1, y4 - y1, z4 - z1)
c = np.array(c)
if abs(np.inner(np.multiply(a, b), c)) / 6 <= 0.01:
return True
else:
return False
def compute_obb(coords, return_max=False):
obb = OBB.build_from_points(coords)
min_xyz = obb.min
max_xyz = obb.max
centroid = obb.centroid
rotation = obb.rotation
points = obb.points
# combined_index = []
# for i in itertools.combinations(range(7), 4):
# combined_index.append([i[0], i[1], i[2], i[3]])
# combined_xyz = [[points[index[i]]
# for i in range(4)] for index in combined_index]
# count = 0
# mean_centroid = []
# for xyz in combined_xyz:
# if same_plane(xyz):
# mean_centroid.append(np.mean(np.array(xyz), axis=0))
if return_max:
return points, [min_xyz, max_xyz]
return points
def compute_min_dis(points_1, points_2):
min_dis = 100
for i in itertools.product(points_1[0], points_2[0]):
distance = calculate_distance(i[0], i[1])
if distance < min_dis:
min_dis = distance
central_dis = calculate_distance(np.mean(points_1[0], axis=0),
np.mean(points_2[0], axis=0))
if central_dis < min_dis:
min_dis = central_dis
# max_xyz_1 = np.max(np.array(points_1), axis=0)
# min_xyz_1 = np.min(np.array(points_1), axis=0)
# max_xyz_2 = np.max(np.array(points_2), axis=0)
# min_xyz_2 = np.min(np.array(points_2), axis=0)
# four_1 = [(max_xyz_1[0], max_xyz_1[1]), (min_xyz_1[0], min_xyz_1[1]),
# (min_xyz_1[0], max_xyz_1[1]), (max_xyz_1[0], min_xyz_1[1])]
# four_2 = [(max_xyz_2[0], max_xyz_2[1]), (min_xyz_2[0], min_xyz_2[1]),
# (min_xyz_2[0], max_xyz_2[1]), (max_xyz_2[0], min_xyz_2[1])]
# dis = util.get_distance_simple(four_1, four_2)
dis = util.get_distance(points_1[1], points_2[1])
if dis < min_dis:
min_dis = dis
return min_dis
def calculate_distance(coords_1, coords_2):
return np.sqrt(np.sum((coords_1 - coords_2) ** 2))
def build_hier(path):
def find_index(sub_list):
for i, mean in enumerate(mean_list):
if str(sub_list) == str(mean[0]):
return i
read_json()
path_list = [os.path.join(path, p) for p in os.listdir(path)]
path_list = sorted(path_list)
new_path_list = []
for p in path_list:
label = p.split('.')[0].split('/')[-1].split('_')[0]
# 这里是为了把other 放进去
# if label == 'other':
# pass
# else:
new_path_list.append(p)
# path_list = new_path_list
mean_list = []
label_index_dict = {}
label_list = []
coords_list = []
count = 0
index_dict = {}
gt_leaf_list = create_leaf_node(new_path_list)
other_list = []
for i, p in enumerate(new_path_list):
label = p.split('/')[-1].split('.')[0].split('_')[0]
# 这里是为了把 other 当做一类引入分割
# if label == 'other' or label == 'floor' or label == 'wall':
# continue
if label == 'floor' or label == 'wall':
continue
ply_data = read_ply(p)
if label not in label_index_dict.keys():
label_index_dict[label] = []
# 每类 label 对应的index
label_index_dict[label].append(count)
index_dict[count] = i
if label == 'other':
other_list.append(count)
count += 1
# label 对应的index
label_list.append(label)
coords = ply_data.tolist()
coords = [[c[0], c[1], c[2]] for c in coords[:]]
coords_2d = [[c[0], c[1]] for c in coords[:]]
coords_list.append(coords)
obb_points = compute_obb(coords)
hull = ConvexHull(coords_2d)
hull_points = hull.vertices
hull_list = []
for v in hull_points:
hull_list.append(coords_2d[v])
# mean_coords = np.mean(coords, axis=0)
# 所有instance 的obb 的八个顶点
mean_list.append((obb_points, hull_list))
distance_dict = {}
# 两两结合,计算距离
for i in itertools.combinations(mean_list, 2):
if not (find_index(i[0][0]), find_index(i[1][0])) in distance_dict.keys():
if find_index(i[0][0]) in other_list or find_index(i[1][0]) in other_list:
continue
distance = compute_min_dis(i[0], i[1])
distance_dict[(find_index(i[0][0]),
find_index(i[1][0]))] = distance
distance_dict[(find_index(i[1][0]),
find_index(i[0][0]))] = distance
group = []
recorded_group = []
for i, (key, value) in enumerate(label_index_dict.items()):
if key == 'other':
continue
single_group = {}
for v in itertools.product(value, value):
if v[0] not in single_group.keys():
single_group[v[0]] = []
single_group[v[0]].append(v[1])
g_list = []
for j, (k, v) in enumerate(single_group.items()):
g = [k]
for m in v:
if m != k:
if distance_dict[(k, m)] < min_group_dis:
g.append(m)
g_list.append(g)
g_list = sorted(g_list, reverse=True,
key=lambda parameter_list: len(parameter_list))
g_list = find_max(k, g_list)
new_g_list = []
for g in g_list:
g_ = []
for d in g:
g_.append((key, d))
new_g_list.append(g_)
group.extend(new_g_list)
real_group = group
gt_group_list, gt_leaf_list = create_group_node(
real_group, gt_leaf_list, index_dict)
# TODO 计算group之间的距离。
group_coords_list = []
group_point_list = []
group_label_index = {}
for i, g in enumerate(real_group):
single_coords = []
for index in g:
single_coords.extend(coords_list[index[1]])
if g[0][0] not in group_label_index.keys():
group_label_index[g[0][0]] = [i]
group_coords_list.append(single_coords)
else:
group_label_index[g[0][0]].append(i)
group_coords_list.append(single_coords)
for coords in group_coords_list:
coords_2d = [[c[0], c[1]] for c in coords[:]]
hull_points = ConvexHull(coords_2d).vertices
hull_list = []
for v in hull_points:
hull_list.append(coords_2d[v])
points = compute_obb(coords)
group_point_list.append((points, hull_list))
group_distance_dict = {}
def find_group_index(points):
for i, g in enumerate(group_point_list):
if str(g) == str(points):
return i
for i in itertools.combinations(group_point_list, 2):
index_0 = find_group_index(i[0])
index_1 = find_group_index(i[1])
if (index_0, index_1) not in group_distance_dict.keys():
distance = compute_min_dis(i[0], i[1])
group_distance_dict[(index_0, index_1)] = distance
group_distance_dict[(index_1, index_0)] = distance
"""
计算 other 与各个group 的距离并记录,但实际上不加入group
"""
other_dict = {}
reverse_other_dict = {}
if 'other' in label_index_dict.keys():
for value in label_index_dict['other']:
for target in group_point_list:
dis = compute_min_dis(mean_list[value], target)
if value not in other_dict.keys():
other_dict[value] = []
other_dict[value].append((find_group_index(target), dis))
for (key, value) in other_dict.items():
v = sorted(value, key=lambda i: i[1])
count = 0
for dis in v:
if dis[1] == 0:
count += 1
if count >= MAX_INTERACTION:
if -1 not in reverse_other_dict.keys():
reverse_other_dict[-1] = []
reverse_other_dict[-1].append(key)
else:
if v[0][0] not in reverse_other_dict.keys():
reverse_other_dict[v[0][0]] = []
reverse_other_dict[v[0][0]].append(key)
related_group_index = {}
for i, group in enumerate(real_group):
label = group[0][0]
# 获取规则
related_label = label_dict[label]
related_group_index[i] = []
for r_label in related_label:
if r_label in group_label_index.keys():
related_group_index[i].extend(
group_label_index[r_label])
group_distance_record = {}
for i, (key, value) in enumerate(related_group_index.items()):
distance_list = [(key, index, group_distance_dict[(key, index)])
if key != index else None for index in value]
distance_list = list(filter(remove_none, distance_list))
group_distance_record[key] = distance_list
area = []
areaed_group_record = []
for i, (key, value) in enumerate(group_distance_record.items()):
area_item = [key]
for v in value:
if v[2] < min_distance:
area_item.append(v[1])
areaed_group_record.append(area_item)
def get_lens(record):
count = 0
for i in record:
count += len(real_group[i])
return count
areaed_group_record = sorted(
areaed_group_record, key=lambda i: get_lens(i), reverse=True)
areaed_record_index = []
real_area = find_max('', areaed_group_record)
# sys.exit()
# # original func
# def get_rest(record):
# count = 0
# for i in record:
# if i not in areaed_record_index:
# count += 1
# return count
# while len(areaed_record_index) != len(group_point_list):
# areaed_group_record = sorted(
# areaed_group_record, key=lambda i: get_rest(i), reverse=True)
# new_area = []
# for group in areaed_group_record[0]:
# if group not in areaed_record_index:
# new_area.append(group)
# areaed_record_index.append(group)
# real_area.append(new_area)\
gt_area_list, gt_group_list = create_area_node(real_area, gt_group_list)
for i, gt_group in enumerate(gt_group_list):
if i in reverse_other_dict.keys():
gt_group_list[i].path.extend(
[path_list[index_dict[v]] for v in reverse_other_dict[i]])
gt_group_list[i].children.extend(
index_dict[v] for v in reverse_other_dict[i])
for v in reverse_other_dict[i]:
gt_leaf_list[index_dict[v]].parent = gt_group_list[i].id
gt_leaf_list.extend(gt_group_list)
gt_leaf_list.extend(gt_area_list)
if not os.path.exists(SAVED_JSON_PATH):
os.makedirs(SAVED_JSON_PATH)
with open(SAVED_JSON_PATH + '/' + path.split('/')[-1] + '.json', 'w')as json_data:
json.dump(gt_leaf_list, json_data, default=obj_2_json)
#############-------------ply preview-----------##################
area_ply_list = []
for area in real_area:
ply_list = []
for group in area:
for p in real_group[group]:
ply_path = path_list[index_dict[p[1]]]
ply_list.append(ply_path)
if group in reverse_other_dict.keys():
for v in reverse_other_dict[group]:
ply_list.append(path_list[index_dict[v]])
area_ply_list.append(ply_list)
for i, area in enumerate(area_ply_list):
points = []
for ply in area:
points.extend(get_ply_data(ply, i))
el = PlyElement.describe(np.array(points), 'vertex')
if not os.path.exists(os.path.join(PREVIEW_PATH, path.split('/')[-1])):
os.makedirs(os.path.join(
PREVIEW_PATH, path.split('/')[-1]))
PlyData([el]).write(os.path.join(
PREVIEW_PATH, path.split('/')[-1], str(i) + '.ply'))
gt_count = 0
for gt in gt_leaf_list:
if gt.parent == -1:
gt_count += 1
return path, gt_count
def find_max(k, group_list):
lens = len(list(set([i for g in group_list for i in g])))
def in_sum(group, record):
count = 0
for g in group:
if g in record:
count += 1
return count
def find_left(group, record):
return list(set(group).difference(set(record)))
record = []
count = 0
groups = []
while len(record) != lens:
group_score = []
for i, group in enumerate(group_list):
score = len(group) - in_sum(group, record)
group_score.append((i, score))
group_score = sorted(group_score, reverse=True, key=lambda i: i[1])
candidate_group_index = group_score[0][0]
left = find_left(group_list[candidate_group_index], record)
if left:
groups.append(left)
record.extend(left)
return groups
class GT:
id = 0
parent = -1
children = []
label = ''
path = ''
def __init__(self, id=None, parent=None, children=None, label=None, path=None):
self.id = id
self.parent = parent
self.children = children
self.label = label
self.path = path
def obj_2_json(pc):
return {
"id": pc.id,
"parent": pc.parent,
"children": pc.children,
"label": pc.label,
"path": pc.path
}
def create_leaf_node(path_list):
gt_leaf_list = []
wall_list = []
floor_list = []
for i, path in enumerate(path_list):
# if 'wall' in path:
# wall_list.append(path)
# elif 'floor' in path:
# floor_list.append(path)
# else:
gt = GT()
gt.id = i
gt.parent = -1
gt.children = []
gt.label = path.split('/')[-1].split('.')[0].split('_')[0]
gt.path = [path]
gt_leaf_list.append(gt)
return gt_leaf_list
def create_group_node(group_list, leaf_list, index_dict):
gt_group_list = []
for i, group in enumerate(group_list):
group = [g[1] for g in group]
gt = GT()
gt.id = len(leaf_list) + i
gt.parent = -1
gt.children = [index_dict[g] for g in group]
gt.path = []
for g in group:
leaf_list[index_dict[g]].parent = gt.id
gt.path.extend(leaf_list[index_dict[g]].path)
if gt.label == None:
gt.label = leaf_list[index_dict[g]].label + ' group'
gt_group_list.append(gt)
return gt_group_list, leaf_list
def create_area_node(area_list, group_list):
gt_area_list = []
for i, area in enumerate(area_list):
gt = GT()
gt.id = group_list[-1].id + i + 1
gt.parent = -1
# gt.children =[group_list[g].id for g in group for group in area]
gt.children = []
gt.path = []
gt.label = ''
for group in area:
gt.path.extend(group_list[group].path)
gt.children.append(group_list[group].id)
group_list[group].parent = gt.id
gt_area_list.append(gt)
return gt_area_list, group_list
def sum_error(path):
count = 0
child_err = False
data = json.load(open(path))
for d in data:
if d['parent'] == -1:
count += 1
if len(d['children']) > 10 and d['label'] != 'other group':
child_err = True
print(count, child_err)
return count, child_err
# build_hier(os.path.join(ROOT_PATH, 'scene0379_00.json'))
# path_list = [os.path.join(ROOT_PATH, p) for p in os.listdir(ROOT_PATH)]
# path_copy_list = [os.path.join(ROOT_PATH, p) for p in os.listdir('/media/ScanNet-Preprocess/new_ply_v2')]
# new_path = []
# for p in path_list:
# if p not in path_copy_list:
# new_path.append(p)
# for i, p in enumerate(path_list):
# pool = ProcessPoolExecutor(max_workers=16)
# result = list(pool.map(build_hier, p))
# for i in result:
# print(i)
# build_hier(p)
# print(i+1, '/1513', '---okay!')
# build_hier(os.path.join(ROOT_PATH, 'scene0154_00'))
# print(new_path)
# print(len(new_path))
# pool = ProcessPoolExecutor(max_workers=9)
# result = list(pool.map(build_hier, new_path))
# for i in result:
# pass
# lines = open('./error_v5.txt').readlines()
# error_list = lines
# new_errors = []
# for error in error_list:
# error = error.split('/')[-1].split('.')[0]
# error = os.path.join(ROOT_PATH, error)
# new_errors.append(error)
# # min_distance =1.0
# # pool = ProcessPoolExecutor(max_workers=13)
# # result = list(pool.map(build_hier, new_errors))
# # for i in result:
# # print(i)
# for i, err in enumerate(new_errors):
# build_hier(err)
# lens, child_err = sum_error(os.path.join(SAVED_JSON_PATH, err.split('/')[-1] + '.json'))
# while child_err:
# min_distance -= 0.05
# _, child_err = build_hier(error)
# print(lens)
# print(error)
# _, lens = build_hier(error)
# print(lens)
# while lens > 10:
# min_distance += 0.05
# _, lens = build_hier(error)
# print(lens)
build_hier(os.path.join(ROOT_PATH, 'scene0588_03'))