175 citations · 280 across the 13 of their papers we have counts for
3 papers · 1 filter
Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matching
Runzhong Wang, Junchi Yan, Xiaokang Yang
Graph matching involves combinatorial optimization based on edge-to-edge affinity matrix, which can be generally formulated as Lawler's Quadratic Assignment Problem (QAP). This pap…
InstaBoost: Boosting Instance Segmentation via Probability Map Guided Copy-Pasting
Hao-Shu Fang, Jianhua Sun, Runzhong Wang +3
Instance segmentation requires a large number of training samples to achieve satisfactory performance and benefits from proper data augmentation. To enlarge the training set and in…
Learning Combinatorial Embedding Networks for Deep Graph Matching
Runzhong Wang, Junchi Yan, Xiaokang Yang
Graph matching refers to finding node correspondence between graphs, such that the corresponding node and edge's affinity can be maximized. In addition with its NP-completeness nat…