-
Notifications
You must be signed in to change notification settings - Fork 11
Description
Hi, thank you for sharing your work! I have been trying to implement your code on large datasets such as SensatUrban and Dales. However, I encountered a couple of challenges:
In scene_seg.py, while computing nearest neighbors per tile:
_, idxs = tiled_knn(q_pts, s_pts, k=1, tile_size=20.5, margin=2 * dl) # 3.5
Dividing the area by 3.5 meters takes a significant amount of time. Could you recommend any adjustments or optimizations for this parameter to improve performance on large datasets?
Also, in Kpconv_blocks.py, I ran into the following error:
output_feats = torch.sum(neighbor_feats * neighbors_weights, dim=1) # -> (M, G, 0//G)
RuntimeError: The size of tensor a (59584) must match the size of tensor b (931) at non-singleton dimension 0
Could you provide guidance on resolving this issue?