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?
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?