Tracking Multiple People Online and in Real Time

We cast the problem of tracking several people as a graph partitioning problem that takes the form of an NP-hard binary integer program. We propose a tractable, approximate, online solution through the combination of a multi-stage cascade and a sliding temporal window. Our experiments demonstrate si...

Full description

Saved in:
Bibliographic Details
Published inComputer Vision -- ACCV 2014 pp. 444 - 459
Main Authors Ristani, Ergys, Tomasi, Carlo
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 2015
SeriesLecture Notes in Computer Science
Subjects
Binary Integer Program
Crowded Scene
Online Algorithm
Person Detection
Temporal Window
Online AccessGet full text

Cover

More Information
Summary:We cast the problem of tracking several people as a graph partitioning problem that takes the form of an NP-hard binary integer program. We propose a tractable, approximate, online solution through the combination of a multi-stage cascade and a sliding temporal window. Our experiments demonstrate significant accuracy improvement over the state of the art and real-time post-detection performance.
ISBN:9783319168135
3319168134
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-16814-2_29