Efficient multiple people tracking using minimum cost arborescences

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Authors

Research Organisations

External Research Organisations

  • ETH Zurich
View graph of relations

Details

Original languageEnglish
Title of host publicationPattern Recognition
Subtitle of host publication36th German Conference, GCPR 2014, Proceedings
PublisherSpringer Verlag
Pages265-276
Number of pages12
ISBN (electronic)9783319117515
Publication statusPublished - 15 Oct 2014
Event36th German Conference on Pattern Recognition, GCPR 2014 - Münster, Germany
Duration: 2 Sept 20145 Sept 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8753
ISSN (Print)0302-9743
ISSN (electronic)1611-3349

Abstract

We present a new global optimization approach for multiple people tracking based on a hierarchical tracklet framework. A new type of tracklets is introduced, which we call tree tracklets. They contain bifurcations to naturally deal with ambiguous tracking situations. Difficult decisions are postponed to a later iteration of the hierarchical framework, when more information is available.We cast the optimization problem as a minimum cost arborescence problem in an acyclic directed graph, where a tracking solution can be obtained in linear time. Experiments on six publicly available datasets show that the method performs well when compared to state-of-the art tracking algorithms.

ASJC Scopus subject areas

Cite this

Efficient multiple people tracking using minimum cost arborescences. / Henschel, Roberto; Leal-Taixé, Laura; Rosenhahn, Bodo.
Pattern Recognition: 36th German Conference, GCPR 2014, Proceedings. Springer Verlag, 2014. p. 265-276 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8753).

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Henschel, R, Leal-Taixé, L & Rosenhahn, B 2014, Efficient multiple people tracking using minimum cost arborescences. in Pattern Recognition: 36th German Conference, GCPR 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8753, Springer Verlag, pp. 265-276, 36th German Conference on Pattern Recognition, GCPR 2014, Münster, Germany, 2 Sept 2014. https://doi.org/10.1007/978-3-319-11752-2_21
Henschel, R., Leal-Taixé, L., & Rosenhahn, B. (2014). Efficient multiple people tracking using minimum cost arborescences. In Pattern Recognition: 36th German Conference, GCPR 2014, Proceedings (pp. 265-276). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8753). Springer Verlag. https://doi.org/10.1007/978-3-319-11752-2_21
Henschel R, Leal-Taixé L, Rosenhahn B. Efficient multiple people tracking using minimum cost arborescences. In Pattern Recognition: 36th German Conference, GCPR 2014, Proceedings. Springer Verlag. 2014. p. 265-276. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-11752-2_21
Henschel, Roberto ; Leal-Taixé, Laura ; Rosenhahn, Bodo. / Efficient multiple people tracking using minimum cost arborescences. Pattern Recognition: 36th German Conference, GCPR 2014, Proceedings. Springer Verlag, 2014. pp. 265-276 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Download
@inproceedings{2d2940bd95d641f3b3c6f26d80aea379,
title = "Efficient multiple people tracking using minimum cost arborescences",
abstract = "We present a new global optimization approach for multiple people tracking based on a hierarchical tracklet framework. A new type of tracklets is introduced, which we call tree tracklets. They contain bifurcations to naturally deal with ambiguous tracking situations. Difficult decisions are postponed to a later iteration of the hierarchical framework, when more information is available.We cast the optimization problem as a minimum cost arborescence problem in an acyclic directed graph, where a tracking solution can be obtained in linear time. Experiments on six publicly available datasets show that the method performs well when compared to state-of-the art tracking algorithms.",
author = "Roberto Henschel and Laura Leal-Taix{\'e} and Bodo Rosenhahn",
year = "2014",
month = oct,
day = "15",
doi = "10.1007/978-3-319-11752-2_21",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "265--276",
booktitle = "Pattern Recognition",
address = "Germany",
note = "36th German Conference on Pattern Recognition, GCPR 2014 ; Conference date: 02-09-2014 Through 05-09-2014",

}

Download

TY - GEN

T1 - Efficient multiple people tracking using minimum cost arborescences

AU - Henschel, Roberto

AU - Leal-Taixé, Laura

AU - Rosenhahn, Bodo

PY - 2014/10/15

Y1 - 2014/10/15

N2 - We present a new global optimization approach for multiple people tracking based on a hierarchical tracklet framework. A new type of tracklets is introduced, which we call tree tracklets. They contain bifurcations to naturally deal with ambiguous tracking situations. Difficult decisions are postponed to a later iteration of the hierarchical framework, when more information is available.We cast the optimization problem as a minimum cost arborescence problem in an acyclic directed graph, where a tracking solution can be obtained in linear time. Experiments on six publicly available datasets show that the method performs well when compared to state-of-the art tracking algorithms.

AB - We present a new global optimization approach for multiple people tracking based on a hierarchical tracklet framework. A new type of tracklets is introduced, which we call tree tracklets. They contain bifurcations to naturally deal with ambiguous tracking situations. Difficult decisions are postponed to a later iteration of the hierarchical framework, when more information is available.We cast the optimization problem as a minimum cost arborescence problem in an acyclic directed graph, where a tracking solution can be obtained in linear time. Experiments on six publicly available datasets show that the method performs well when compared to state-of-the art tracking algorithms.

UR - http://www.scopus.com/inward/record.url?scp=84908665267&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-11752-2_21

DO - 10.1007/978-3-319-11752-2_21

M3 - Conference contribution

AN - SCOPUS:84908665267

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 265

EP - 276

BT - Pattern Recognition

PB - Springer Verlag

T2 - 36th German Conference on Pattern Recognition, GCPR 2014

Y2 - 2 September 2014 through 5 September 2014

ER -

By the same author(s)