↓ 13 callersFunctiongroup_point Input: points: (batch_size, ndataset, channel) float32 array, points to sample from idx: (batch_size, npoint, nsample) int32 arra
tf_utils/tf_ops/grouping/tf_grouping.py:33
↓ 6 callersFunctionpointSIFT_module(xyz, points, radius, out_channel, is_training, bn_decay, scope='point_sift', bn=True, use_xyz=True, use_nchw=
tf_utils/pointSIFT_util.py:71
↓ 4 callersFunctionpointSIFT_res_module(xyz, points, radius, out_channel, is_training, bn_decay, scope='point_sift', bn=True, use_xyz=True, same_dim=
tf_utils/pointSIFT_util.py:96
↓ 3 callersFunctionthree_interpolate Input: points: (b,m,c) float32 array, known points idx: (b,n,3) int32 array, indices to known points weight: (b,n,3) floa
tf_utils/tf_ops/interpolation/tf_interpolate.py:19
↓ 3 callersFunctionthree_nn Input: xyz1: (b,n,3) float32 array, unknown points xyz2: (b,m,3) float32 array, known points Output: dist: (b,n,3) fl
tf_utils/tf_ops/interpolation/tf_interpolate.py:8
↓ 1 callersFunctiongroup_point_cpuinput: points (b,n,c), idx (b,m,nsample) output: out (b,m,nsample,c)
tf_utils/tf_ops/grouping/test/query_ball_point.cpp:52
↓ 1 callersFunctiongroup_point_grad_cpuinput: grad_out (b,m,nsample,c), idx (b,m,nsample), output: grad_points (b,n,c)
tf_utils/tf_ops/grouping/test/query_ball_point.cpp:70
↓ 1 callersFunctioninterpolate_cpuinput: points (b,m,c), idx (b,n,3), weight (b,n,3) output: out (b,n,c)
tf_utils/tf_ops/interpolation/interpolate.cpp:84
↓ 1 callersFunctioninterpolate_grad_cpuinput: grad_out (b,n,c), idx (b,n,3), weight (b,n,3) output: grad_points (b,m,c)
tf_utils/tf_ops/interpolation/interpolate.cpp:108
↓ 1 callersFunctionquery_ball_point_cpuinput: radius (1), nsample (1), xyz1 (b,n,3), xyz2 (b,m,3) output: idx (b,m,nsample)
tf_utils/tf_ops/grouping/test/query_ball_point.cpp:19
↓ 1 callersFunctionsample_and_group_all Inputs: xyz: (batch_size, ndataset, 3) TF tensor points: (batch_size, ndataset, channel) TF tensor, if None will just use xyz as
tf_utils/pointSIFT_util.py:182
↓ 1 callersFunctionselect_top_k Input: k: int32, number of k SMALLEST elements selected dist: (b,m,n) float32 array, distance matrix, m query points, n dataset p
tf_utils/tf_ops/grouping/tf_grouping.py:22
↓ 1 callersFunctionselection_sort_cpuinput: k (1), distance matrix dist (b,m,n) output: idx (b,m,n), val (b,m,n)
tf_utils/tf_ops/grouping/test/selection_sort.cpp:20
↓ 1 callersFunctionthreeinterpolate_cpuinput: points (b,m,c), idx (b,n,3), weight (b,n,3) output: out (b,n,c)
tf_utils/tf_ops/interpolation/tf_interpolate.cpp:107
↓ 1 callersFunctionthreeinterpolate_grad_cpuinput: grad_out (b,n,c), idx (b,n,3), weight (b,n,3) output: grad_points (b,m,c)
tf_utils/tf_ops/interpolation/tf_interpolate.cpp:131
↓ 1 callersFunctionthreenn_cpuFind three nearest neigbors with square distance input: xyz1 (b,n,3), xyz2(b,m,3) output: dist (b,n,3), idx (b,n,3)
tf_utils/tf_ops/interpolation/interpolate.cpp:21
↓ 1 callersFunctionthreenn_cpuFind three nearest neigbors with square distance input: xyz1 (b,n,3), xyz2(b,m,3) output: dist (b,n,3), idx (b,n,3)
tf_utils/tf_ops/interpolation/tf_interpolate.cpp:60