Paper Reading: Subgraph Decomposition for Multi-Target Tracking


Note: this post is only meant for personal digestion and interpretation. It is incomplete and may mislead readers.

Abstract

Motivation: multiple hypotheses will often be similar to each other

Introduction

Objective: select a subset of nodes and edges, maximize similarity of graph

Fomulations of multi-target tracking

Minimum cost subgraph multicut problem

Probabilistic model


Author: Texot
Reprint policy: All articles in this blog are used except for special statements CC BY 4.0 reprint polocy. If reproduced, please indicate source Texot !
  TOC