Patchwise Joint Sparse Tracking with Occlusion Detection

TitlePatchwise Joint Sparse Tracking with Occlusion Detection
Publication TypeJournal Article
Year of Publication2014
AuthorsZarezade, A., H. R. Rabiee, and A. Soltani-Farani
JournalIEEE Transactions on Image Processing
Start Page4496
Date Published08/2014
Accession Number14579167
Keywordsdictionary, Joint Sparse Representation, Markov chain, Particle Filter, Visual tracking
AbstractThis paper presents a robust tracking approach to handle challenges such as occlusion and appearance change. Here, the target is partitioned into a number of patches. Then, the appearance of each patch is modeled using a dictionary composed of corresponding target patches in previous frames. In each frame, the target is found among a set of candidates generated by a particle filter, via a likelihood measure that is shown to be proportional to the sum of patch-reconstruction errors of each candidate. Since the target’s appearance often changes slowly in a video sequence, it is assumed that the target in the current frame and the best candidates of a small number of previous frames, belong to a common subspace. This is imposed using joint sparse representation to enforce the target and previous best candidates to have a common sparsity pattern. Moreover, an occlusion detection scheme is proposed that uses patch-reconstruction errors and a prior probability of occlusion, extracted from an adaptive Markov chain, to calculate the probability of occlusion per patch. In each frame, occluded patches are excluded when updating the dictionary. Extensive experimental results on several challenging sequences shows that the proposed method outperforms state-of-the-art trackers.
URL<a href="/dmlsite/?q=%3Ca%20href%3D%22/dmlsite/%3Fq%3D%253Ca%2520href%253D%2522/dmlsite/%253Fq%253D%25253Ca%252520href%25253D%252522/dmlsite/%25253Fq%25253D%2525253Ca%25252520href%2525253D%25252522/dmlsite/%2525253Fq%2525253D%252525253Ca%2525252520href%25
DOI<a href=";amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp