5 October 2011 Multiple object tracking based on the partition of the bipartite graph
Author Affiliations +
Abstract
In this work an algorithm of the tracking of the set of moving objects is described. The important features of the task are crossings of the object trajectories and temporary screening of the objects by other objects. The source data for the proposed algorithm is a list of the parameters of the binary regions extracted from each image of the sequence. The main idea of the considered algorithm is to build a bipartite graph. The recoursive procedure is used to partition the graph into connected graphs corresponding to five situations: detection of a new object, missing object, merging of the objects into one region, division of the region and "simple" object tracking. These graphs are used to form a new list of the objects. The experimental research of the algorithm shows a good tracking performance in both ground and aerial environments.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Boris Alpatov, Boris Alpatov, Pavel Babayan, Pavel Babayan, } "Multiple object tracking based on the partition of the bipartite graph", Proc. SPIE 8186, Electro-Optical Remote Sensing, Photonic Technologies, and Applications V, 81860B (5 October 2011); doi: 10.1117/12.897814; https://doi.org/10.1117/12.897814
PROCEEDINGS
6 PAGES


SHARE
RELATED CONTENT

Automatic recognition of road signs
Proceedings of SPIE (November 20 2002)
Approach for counting vehicles in congested traffic flow
Proceedings of SPIE (February 24 2005)
Automated counting of pedestrians
Proceedings of SPIE (September 15 1994)
Video segmentation using 3D hints contained in 2D images
Proceedings of SPIE (October 31 1996)

Back to Top