Tracking with multi-level features

Publikation: Arbeitspapier/PreprintPreprint

Autoren

Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
PublikationsstatusElektronisch veröffentlicht (E-Pub) - 25 Juli 2016

Abstract

We present a novel formulation of the multiple object tracking problem which integrates low and mid-level features. In particular, we formulate the tracking problem as a quadratic program coupling detections and dense point trajectories. Due to the computational complexity of the initial QP, we propose an approximation by two auxiliary problems, a temporal and spatial association, where the temporal subproblem can be efficiently solved by a linear program and the spatial association by a clustering algorithm. The objective function of the QP is used in order to find the optimal number of clusters, where each cluster ideally represents one person. Evaluation is provided for multiple scenarios, showing the superiority of our method with respect to classic tracking-by-detection methods and also other methods that greedily integrate low-level features.

Zitieren

Tracking with multi-level features. / Henschel, Roberto; Leal-Taixé, Laura; Rosenhahn, Bodo et al.
2016.

Publikation: Arbeitspapier/PreprintPreprint

Henschel, R., Leal-Taixé, L., Rosenhahn, B., & Schindler, K. (2016). Tracking with multi-level features. Vorabveröffentlichung online. https://arxiv.org/abs/1607.07304v1
Henschel R, Leal-Taixé L, Rosenhahn B, Schindler K. Tracking with multi-level features. 2016 Jul 25. Epub 2016 Jul 25.
Henschel, Roberto ; Leal-Taixé, Laura ; Rosenhahn, Bodo et al. / Tracking with multi-level features. 2016.
Download
@techreport{e11f6a22a1b6406e8de78d13b85d0d6f,
title = "Tracking with multi-level features",
abstract = " We present a novel formulation of the multiple object tracking problem which integrates low and mid-level features. In particular, we formulate the tracking problem as a quadratic program coupling detections and dense point trajectories. Due to the computational complexity of the initial QP, we propose an approximation by two auxiliary problems, a temporal and spatial association, where the temporal subproblem can be efficiently solved by a linear program and the spatial association by a clustering algorithm. The objective function of the QP is used in order to find the optimal number of clusters, where each cluster ideally represents one person. Evaluation is provided for multiple scenarios, showing the superiority of our method with respect to classic tracking-by-detection methods and also other methods that greedily integrate low-level features. ",
keywords = "cs.CV",
author = "Roberto Henschel and Laura Leal-Taix{\'e} and Bodo Rosenhahn and Konrad Schindler",
note = "Submitted as an IEEE PAMI short article",
year = "2016",
month = jul,
day = "25",
language = "English",
type = "WorkingPaper",

}

Download

TY - UNPB

T1 - Tracking with multi-level features

AU - Henschel, Roberto

AU - Leal-Taixé, Laura

AU - Rosenhahn, Bodo

AU - Schindler, Konrad

N1 - Submitted as an IEEE PAMI short article

PY - 2016/7/25

Y1 - 2016/7/25

N2 - We present a novel formulation of the multiple object tracking problem which integrates low and mid-level features. In particular, we formulate the tracking problem as a quadratic program coupling detections and dense point trajectories. Due to the computational complexity of the initial QP, we propose an approximation by two auxiliary problems, a temporal and spatial association, where the temporal subproblem can be efficiently solved by a linear program and the spatial association by a clustering algorithm. The objective function of the QP is used in order to find the optimal number of clusters, where each cluster ideally represents one person. Evaluation is provided for multiple scenarios, showing the superiority of our method with respect to classic tracking-by-detection methods and also other methods that greedily integrate low-level features.

AB - We present a novel formulation of the multiple object tracking problem which integrates low and mid-level features. In particular, we formulate the tracking problem as a quadratic program coupling detections and dense point trajectories. Due to the computational complexity of the initial QP, we propose an approximation by two auxiliary problems, a temporal and spatial association, where the temporal subproblem can be efficiently solved by a linear program and the spatial association by a clustering algorithm. The objective function of the QP is used in order to find the optimal number of clusters, where each cluster ideally represents one person. Evaluation is provided for multiple scenarios, showing the superiority of our method with respect to classic tracking-by-detection methods and also other methods that greedily integrate low-level features.

KW - cs.CV

M3 - Preprint

BT - Tracking with multi-level features

ER -

Von denselben Autoren