Skip navigation
Skip navigation

Efficient multi-target tracking via discovering dense subgraphs

Bozorgtabar, Behzad; Goecke, Roland

Description

In this paper, we cast multi-target tracking as a dense subgraph discovering problem on the undirected relation graph of all given target hypotheses. We aim to extract multiple clusters (dense subgraphs), in which each cluster contains a set of hypotheses of one particular target. In the presence of occlusion or similar moving targets or when there is no reliable evidence for the target’s presence, each target trajectory is expected to be fragmented into multiple tracklets. The proposed...[Show more]

CollectionsANU Research Publications
Date published: 2016
Type: Journal article
URI: http://hdl.handle.net/1885/103643
Source: Computer Vision and Image Understanding
DOI: 10.1016/j.cviu.2015.11.013

Download

File Description SizeFormat Image
01_Bozorgtabar_Efficient_multi-target_2016.pdf3.24 MBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator