Hits:

Indexed by:期刊论文

Date of Publication:2016-02-01

Journal:IEEE TRANSACTIONS ON IMAGE PROCESSING

Included Journals:SCIE、EI、Scopus

Volume:25

Issue:2

Page Number:840-849

ISSN No.:1057-7149

Key Words:Object tracking; hash functions; feature selection; part-based

Abstract:In this paper, we propose a novel tracking framework based on a sparse and discriminative hashing method. Different from the previous work, we treat object tracking as an approximate nearest neighbor searching process in a binary space. Using the hash functions, the target templates and the candidates can be projected into the Hamming space, facilitating the distance calculation and tracking efficiency. First, we integrate both the inter-class and intra-class information to train multiple hash functions for better classification, while most classifiers in previous tracking methods usually neglect the interclass correlation, which may cause the inaccuracy. Then, we introduce sparsity into the hash coefficient vectors for dynamic feature selection, which is crucial to select the discriminative and stable features to adapt to visual variations during the tracking process. Extensive experiments on various challenging sequences show that the proposed algorithm performs favorably against the state-of-the-art methods.