We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
作者您好,根据您的代码,
ULSD-ISPRS/network/line_proposal_network.py
Line 133 in df4f26d
在这前面会计算距离,从而match。
这一步cost加上了loi_score。
但是这里的cost,在后面只是会排序,然而排序结果不会筛选loi_pred。所以我理解,match过程完全是受距离的影响,loi_score似乎是不起作用。
不知道我理解的是不是有问题,感谢您的回复!
The text was updated successfully, but these errors were encountered:
indeces = cost.argsort() loi_pred = loi_pred[indeces] loi_score = loi_score[indeces] idx_junc = idx_junc[indeces] idx_junc, unique_indices = np.unique(idx_junc.detach().cpu().numpy(), return_index=True, axis=0)
排序之后有一个np.unique的操作,去除重复的线段,如果有重复线段保留第一条,因此受排序结果影响。
Sorry, something went wrong.
No branches or pull requests
作者您好,根据您的代码,
ULSD-ISPRS/network/line_proposal_network.py
Line 133 in df4f26d
在这前面会计算距离,从而match。
这一步cost加上了loi_score。
但是这里的cost,在后面只是会排序,然而排序结果不会筛选loi_pred。所以我理解,match过程完全是受距离的影响,loi_score似乎是不起作用。
不知道我理解的是不是有问题,感谢您的回复!
The text was updated successfully, but these errors were encountered: