You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In section 3.2, The cost between image regions and words is defined as the alignment scores S = WR⊤ . The bipartite matching problem can then be efficiently solved by the off-the-shelf Hungarian Algorithm.
The input of the Hungarian algorithm is a cost matrix. So, that means alignment score S is the cost matrix? But, why did you call WR⊤ alignment score?
The text was updated successfully, but these errors were encountered:
In section 3.2, The cost between image regions and words is defined as the alignment scores S = WR⊤ . The bipartite matching problem can then be efficiently solved by the off-the-shelf Hungarian Algorithm.
The input of the Hungarian algorithm is a cost matrix. So, that means alignment score S is the cost matrix? But, why did you call WR⊤ alignment score?
The text was updated successfully, but these errors were encountered: