Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/35919
Title: Fast compressive tracking
Authors: Zhang, KH
Zhang, L 
Yang, MH
Keywords: Visual tracking
Random projection
Compressive sensing
Issue Date: 2014
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on pattern analysis and machine intelligence, 2014, v. 36, no. 10, p. 2002-2015 How to cite?
Journal: IEEE transactions on pattern analysis and machine intelligence 
Abstract: It is a challenging task to develop effective and efficient appearance models for robust object tracking due to factors such as pose variation, illumination change, occlusion, and motion blur. Existing online tracking algorithms often update models with samples from observations in recent frames. Despite much success has been demonstrated, numerous issues remain to be addressed. First, while these adaptive appearance models are data-dependent, there does not exist sufficient amount of data for online algorithms to learn at the outset. Second, online tracking algorithms often encounter the drift problems. As a result of self-taught learning, misaligned samples are likely to be added and degrade the appearance models. In this paper, we propose a simple yet effective and efficient tracking algorithm with an appearance model based on features extracted from a multiscale image feature space with data-independent basis. The proposed appearance model employs non-adaptive random projections that preserve the structure of the image feature space of objects. A very sparse measurement matrix is constructed to efficiently extract the features for the appearance model. We compress sample images of the foreground target and the background using the same sparse measurement matrix. The tracking task is formulated as a binary classification via a naive Bayes classifier with online update in the compressed domain. A coarse-to-fine search strategy is adopted to further reduce the computational complexity in the detection procedure. The proposed compressive tracking algorithm runs in real-time and performs favorably against state-of-the-art methods on challenging sequences in terms of efficiency, accuracy and robustness.
URI: http://hdl.handle.net/10397/35919
ISSN: 0162-8828 (print)
1939-3539 (online)
DOI: 10.1109/TPAMI.2014.2315808
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

167
Citations as of Feb 26, 2017

WEB OF SCIENCETM
Citations

108
Last Week
1
Last month
Citations as of Apr 18, 2017

Page view(s)

27
Last Week
4
Last month
Checked on Apr 23, 2017

Google ScholarTM

Check

Altmetric



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