Skip to content
New issue

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

the shape of transport plan is (m+1)*n, the transport plan can only assign one gt to an anchor, how about the lable? #20

Open
fido20160817 opened this issue Aug 14, 2023 · 0 comments

Comments

@fido20160817
Copy link

fido20160817 commented Aug 14, 2023

since the shape of the transport plan is (m+1)*n, the transport plan can only assign one gt to an anchor, how about the label? In Figure 2, the optimal transport plan only gives a clue about which gt the anchor could be assigned to, but which label (from k lables each gt contains mentioned in the paper) should be assigned to the anchor and how?

@fido20160817 fido20160817 changed the title the shape of transport plan is (m+1)*n, the transport plan can only assign one gt to an anchor, how about the lables? the shape of transport plan is (m+1)*n, the transport plan can only assign one gt to an anchor, how about the lable? Aug 14, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant