Higher order matching for consistent multiple target tracking

Chetan Arora, Amir Globerson

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper addresses the data assignment problem in multi frame multi object tracking in video sequences. Traditional methods employing maximum weight bipartite matching offer limited temporal modeling. It has recently been shown [6, 8, 24] that incorporating higher order temporal constraints improves the assignment solution. Finding maximum weight matching with higher order constraints is however NP-hard and the solutions proposed until now have either been greedy [8] or rely on greedy rounding of the solution obtained from spectral techniques [15]. We propose a novel algorithm to find the approximate solution to data assignment problem with higher order temporal constraints using the method of dual decomposition and the MPLP message passing algorithm [21]. We compare the proposed algorithm with an implementation of [8] and [15] and show that proposed technique provides better solution with a bound on approximation factor for each inferred solution.

Original languageEnglish
Title of host publicationProceedings - 2013 IEEE International Conference on Computer Vision, ICCV 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages177-184
Number of pages8
ISBN (Print)9781479928392
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 14th IEEE International Conference on Computer Vision, ICCV 2013 - Sydney, NSW, Australia
Duration: 1 Dec 20138 Dec 2013

Publication series

NameProceedings of the IEEE International Conference on Computer Vision

Conference

Conference2013 14th IEEE International Conference on Computer Vision, ICCV 2013
Country/TerritoryAustralia
CitySydney, NSW
Period1/12/138/12/13

Fingerprint

Dive into the research topics of 'Higher order matching for consistent multiple target tracking'. Together they form a unique fingerprint.

Cite this