All Pairs Shortest Path Formulation for Multiple Object Tracking with Application to Tennis Video Analysis

Yan, F, Christmas, W and Kittler, J (2007) All Pairs Shortest Path Formulation for Multiple Object Tracking with Application to Tennis Video Analysis In: British Machine Vision Conference 2007, 2007-09-10 - 2007-09-13, University of Warwick.

Preview	Text (licence) SRI_deposit_agreement.pdf Download (33kB)
Preview	Text BMVC07.pdf Available under License : See the attached licence file. Download (1MB)

Abstract

In previous work, we developed a novel data association algorithm with graph-theoretic formulation, and used it to track a tennis ball in broadcast tennis video. However, the track initiation/termination was not automatic, and it could not deal with situations in which more than one ball appeared in the scene. In this paper, we extend our previous work to track multiple tennis balls fully automatically. The algorithm presented in this paper requires the set of all-pairs shortest paths in a directed and edge-weighted graph. We also propose an efficient All-Pairs Shortest Path algorithm by exploiting a special topological property of the graph. Comparative experiments show that the proposed data association algorithm performs well both in terms of efficiency and tracking accuracy.

Item Type:	Conference or Workshop Item (Conference Paper)
Divisions :	Faculty of Engineering and Physical Sciences > Electronic Engineering > Centre for Vision Speech and Signal Processing
Authors :	Name Email ORCID Yan, F Christmas, W Kittler, J
Date :	2007
Depositing User :	Symplectic Elements
Date Deposited :	14 Dec 2012 09:19
Last Modified :	31 Oct 2017 14:49
URI:	http://epubs.surrey.ac.uk/id/eprint/733266

Actions (login required)

View Item

Downloads