GLAN: A Graph-based Linear Assignment Network

by   He Liu, et al.

Differentiable solvers for the linear assignment problem (LAP) have attracted much research attention in recent years, which are usually embedded into learning frameworks as components. However, previous algorithms, with or without learning strategies, usually suffer from the degradation of the optimality with the increment of the problem size. In this paper, we propose a learnable linear assignment solver based on deep graph networks. Specifically, we first transform the cost matrix to a bipartite graph and convert the assignment task to the problem of selecting reliable edges from the constructed graph. Subsequently, a deep graph network is developed to aggregate and update the features of nodes and edges. Finally, the network predicts a label for each edge that indicates the assignment relationship. The experimental results on a synthetic dataset reveal that our method outperforms state-of-the-art baselines and achieves consistently high accuracy with the increment of the problem size. Furthermore, we also embed the proposed solver, in comparison with state-of-the-art baseline solvers, into a popular multi-object tracking (MOT) framework to train the tracker in an end-to-end manner. The experimental results on MOT benchmarks illustrate that the proposed LAP solver improves the tracker by the largest margin.


page 1

page 2

page 3

page 4


Learnable Graph Matching: Incorporating Graph Partitioning with Deep Feature Learning for Multiple Object Tracking

Data association across frames is at the core of Multiple Object Trackin...

Learnable Graph Matching: A Practical Paradigm for Data Association

Data association is at the core of many computer vision tasks, e.g., mul...

Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths

We present an efficient approximate message passing solver for the lifte...

Deep Probabilistic Graph Matching

Most previous learning-based graph matching algorithms solve the quadrat...

Bridging the Gap Between End-to-end and Non-End-to-end Multi-Object Tracking

Existing end-to-end Multi-Object Tracking (e2e-MOT) methods have not sur...

Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching

Box-simplex games are a family of bilinear minimax objectives which enca...

Structure-Unified M-Tree Coding Solver for MathWord Problem

As one of the challenging NLP tasks, designing math word problem (MWP) s...

Please sign up or login with your details

Forgot password? Click here to reset