muSSP: Efficient Min-cost Flow Algorithm for Multi-object Tracking
Min-cost flow has been a widely used paradigm for solving data association problems in multi-object tracking (MOT). However, most existing methods of solving min-cost flow problems in MOT are either direct adoption or slight modifications of generic min-cost flow algorithms, yielding sub-optimal computation efficiency and holding the applications back from larger scale of problems. In this paper, by exploiting the special structures and properties of the graphs formulated in MOT problems, we develop an efficient min-cost flow algorithm, namely, minimum-update Successive Shortest Path (muSSP). muSSP is proved to provide exact optimal solution and we demonstrated its efficiency through 40 experiments on five MOT datasets with various object detection results and a number of graph designs. muSSP is always the most efficient in each experiment compared to the three peer solvers, improving the efficiency by 5 to 337 folds relative to the best competing algorithm and averagely 109 to 4089 folds to each of the three peer methods.
Code (2)
Tasks
Multi-Object Trackingobject-detectionObject DetectionObject TrackingSimilar Papers 제목 키워드 기반
Multi-objective Optimization of Clustering-based Scheduling for Multi-workflow On Clouds Considering Fairness
Distributed computing, such as cloud computing, provides promising platforms to execute multiple workflows. Workflow scheduling plays an important role in multi-workflow execution with multi-objective requirements. Altho…
Cloud ComputingClusteringDistributed ComputingFairness+1On Pairwise Costs for Network Flow Multi-Object Tracking
Multi-object tracking has been recently approached with the min-cost network flow optimization techniques. Such methods simultaneously resolve multiple object tracks in a video and enable modeling of dependencies among t…
Multi-Object TrackingObjectObject TrackingA Comparative Evaluation of Population-based Optimization Algorithms for Workflow Scheduling in Cloud-Fog Environments
This work presents a comparative evaluation of four population-based optimization algorithms for workflow scheduling in cloud-fog environments. These algorithms are as follows: Particle Swarm Optimization (PSO), Genetic …
SchedulingA Hybrid Data Association Framework for Robust Online Multi-Object Tracking
Global optimization algorithms have shown impressive performance in data-association based multi-object tracking, but handling online data remains a difficult hurdle to overcome. In this paper, we present a hybrid data a…
global-optimizationMulti-Object TrackingObject TrackingOnline Multi-Object TrackingMulti Objective Prioritized Workflow Scheduling Using Deep Reinforcement Based Learning in Cloud Computing
ABSTRACT Workflow Scheduling is a huge challenge in cloud paradigm as many number of workflows dynamically generated from various heterogeneous resources and task dependencies in each workflow varies from each other.…
Cloud ComputingDeep Reinforcement LearningScheduling