Robust tracking with interest points: A sparse representation approach

Babu, Venkatesh R and Parate, Priti and Acharya, Aniruddha K (2015) Robust tracking with interest points: A sparse representation approach. In: IMAGE AND VISION COMPUTING, 33 . pp. 44-56.

PDF ima_vis_com_33_44_2015.pdf - Published Version Restricted to Registered users only Download (3MB) | Request a copy

Abstract

Visual tracking is an important task in various computer vision applications including visual surveillance, human computer interaction, event detection, video indexing and retrieval. Recent state of the art sparse representation (SR) based trackers show better robustness than many of the other existing trackers. One of the issues with these SR trackers is low execution speed. The particle filter framework is one of the major aspects responsible for slow execution, and is common to most of the existing SR trackers. In this paper,(1) we propose a robust interest point based tracker in l(1) minimization framework that runs at real-time with performance comparable to the state of the art trackers. In the proposed tracker, the target dictionary is obtained from the patches around target interest points. Next, the interest points from the candidate window of the current frame are obtained. The correspondence between target and candidate points is obtained via solving the proposed l(1) minimization problem. In order to prune the noisy matches, a robust matching criterion is proposed, where only the reliable candidate points that mutually match with target and candidate dictionary elements are considered for tracking. The object is localized by measuring the displacement of these interest points. The reliable candidate patches are used for updating the target dictionary. The performance and accuracy of the proposed tracker is benchmarked with several complex video sequences. The tracker is found to be considerably fast as compared to the reported state of the art trackers. The proposed tracker is further evaluated for various local patch sizes, number of interest points and regularization parameters. The performance of the tracker for various challenges including illumination change, occlusion, and background clutter has been quantified with a benchmark dataset containing 50 videos. (C) 2014 Elsevier B.V. All rights reserved.

Item Type:	Journal Article
Publication:	IMAGE AND VISION COMPUTING
Publisher:	ELSEVIER SCIENCE BV
Additional Information:	Copy right for this article belongs to the ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
Keywords:	Visual tracking; l(1) minimization; Interest points; Harris corner; Sparse representation
Department/Centre:	Division of Interdisciplinary Sciences > Supercomputer Education & Research Centre
Date Deposited:	04 Mar 2015 12:12
Last Modified:	04 Mar 2015 12:12
URI:	http://eprints.iisc.ac.in/id/eprint/50956

Actions (login required)

View Item