By Topic

A structured learning-based graph matching for dynamic multiple object tracking

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Dayu Zheng ; Dept. of Electron. Eng., Shanghai Jiao Tong Univ., Shanghai, China ; Hongkai Xiong ; Zheng, Y.F.

To correctly detect dynamic targets and obtain a record of the trajectories of identical targets in appearance over time, has become significantly more challenging and infers countless applications in biomedicine. In this paper, we propose a novel structured learning-based graph matching algorithm to track a variable number of interacting objects in dynamic environments. Different from previous approaches, the proposed method takes full advantage of neighboring relationships as edge feature in the structured graph. The target problem is regarded as structured node and edge matching between graphs generated from successive frames. In essence, it is formulated as the maximum weighted bipartite matching problem which is solved by dynamic Hungarian algorithm. The parameters of the structured graph matching model can be acquired in a stochastic graduated learning step in different dynamic environments. The extensive experiments on dynamic cell and football sequences demonstrate that the resulting approach deals effectively with complicated target interactions.

Published in:

Image Processing (ICIP), 2011 18th IEEE International Conference on

Date of Conference:

11-14 Sept. 2011