The Multi-strand Graph for a PTZ Tracker |
| |
Authors: | Shachaf Melman Yael Moses Gérard Medioni Yinghao Cai |
| |
Affiliation: | 1.Tel Aviv University,Tel Aviv,Israel;2.The Interdisciplinary Center Herzliya,Herzliya,Israel;3.University of Southern California,Los Angeles,USA |
| |
Abstract: | High-resolution images can be used to resolve matching ambiguities between trajectory fragments (tracklets), which is a key challenge in multiple-target tracking. A pan–tilt–zoom (PTZ) camera, which can pan, tilt and zoom, is a powerful and efficient tool that offers both close-up views and wide area coverage on demand. The wide area enables tracking of many targets, while the close-up view allows individuals to be identified from high-resolution images of their faces. A central component of a PTZ tracking system is a scheduling algorithm that determines which target to zoom in on, particularly when the high-resolution images are also used for tracklet matching. In this paper, we study this scheduling problem from a theoretical perspective. We propose a novel data structure, the Multi-strand Tracking Graph (MSG), which represents the set of tracklets computed by a tracker and the possible associations between them. The MSG allows efficient scheduling as well as resolving of matching ambiguities between tracklets. The main feature of the MSG is the auxiliary data saved in each vertex, which allows efficient computation while avoiding time-consuming graph traversal. Synthetic data simulations are used to evaluate our scheduling algorithm and to demonstrate its superiority over a naïve one. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|