University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Layered Data Association Using Graph-Theoretic Formulation with Application to Tennis Ball Tracking in Monocular Sequences

Yan, F, Christmas, W and Kittler, J (2008) Layered Data Association Using Graph-Theoretic Formulation with Application to Tennis Ball Tracking in Monocular Sequences IEEE Transactions on Pattern Analysis and Machine Intelligence, 30, 10. pp. 1814-1830.

[img] ["document_typename_binary/octet-stream" not defined] (deleted)
pami2008.pdf
Restricted to Repository staff only
Available under License : See the attached licence file.

Download (3MB)
[img] PDF (licence)
SRI_deposit_agreement.pdf
Restricted to Repository staff only

Download (33kB)
[img] PDF
PAMI08.pdf
Restricted to Repository staff only
Available under License : See the attached licence file.

Download (1MB)

Abstract

In this paper, we propose a multi-layered data association scheme with graph-theoretic formulation for tracking multiple objects that undergo switching dynamics in clutter. The proposed scheme takes as input object candidates detected in each frame. At the object candidate level, "tracklets" are "grown" from sets of candidates that have high probabilities of containing only true positives. At the tracklet level, a directed and weighted graph is constructed, where each node is a tracklet, and the edge weight between two nodes is defined according to the "compatibility” of the two tracklets. The association problem is then formulated as an all-pairs shortest path (APSP) problem in this graph. Finally, at the path level, by analyzing the all-pairs shortest paths, all object trajectories are identified, and track initiation and track termination are automatically dealt with. By exploiting a special topological property of the graph, we have also developed a more efficient APSP algorithm than the general-purpose ones. The proposed data association scheme is applied to tennis sequences to track tennis balls. Experiments show that it works well on sequences where other data association methods perform poorly or fail completely.

Item Type: Article
Divisions : Faculty of Engineering and Physical Sciences > Electronic Engineering > Centre for Vision Speech and Signal Processing
Authors :
AuthorsEmailORCID
Yan, FUNSPECIFIEDUNSPECIFIED
Christmas, WUNSPECIFIEDUNSPECIFIED
Kittler, JUNSPECIFIEDUNSPECIFIED
Date : October 2008
Depositing User : Symplectic Elements
Date Deposited : 28 Mar 2017 15:01
Last Modified : 28 Mar 2017 15:01
URI: http://epubs.surrey.ac.uk/id/eprint/111094

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800