Object Tracking via Partial Least Squares Analysis

IEEE Transactions on Image Processing (Impact Factor: 3.11). 06/2012; 21(10):4454-65. DOI: 10.1109/TIP.2012.2205700
Source: PubMed

ABSTRACT We propose an object tracking algorithm that learns a set of appearance models for adaptive discriminative object representation. In this paper, object tracking is posed as a binary classification problem in which the correlation of object appearance and class labels from foreground and background is modeled by partial least squares (PLS) analysis, for generating a low-dimensional discriminative feature subspace. As object appearance is temporally correlated and likely to repeat over time, we learn and adapt multiple appearance models with PLS analysis for robust tracking. The proposed algorithm exploits both the ground truth appearance information of the target labeled in the first frame and the image observations obtained online, thereby alleviating the tracking drift problem caused by model update. Experiments on numerous challenging sequences and comparisons to state-of-the-art methods demonstrate favorable performance of the proposed tracking algorithm.

  • [Show abstract] [Hide abstract]
    ABSTRACT: To tackle robust visual tracking in complex environment, an online algorithm based on generative model is proposed. The target is represented with overlapped and selected local patches based on key point proportion ranking, and its location is estimated by spatiotemporal analysis. Temporally, a propagated affine warping dynamical model is newly introduced. Spatially, an observation model based on weighted sparse representation and geometric confidence inference is newly established. Both selection pattern and templates are periodically updated to adapt the target's appearance variation. Experiments demonstrate that the proposed approach achieves more favorable performance compared with classical works on challenging image sequences. (C) The Authors.
    Optical Engineering 01/2014; 53(1):013103. DOI:10.1117/1.OE.53.1.013103 · 0.96 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Thanks to its good performance on object recognition, sparse representation has recently been widely studied in the area of visual object tracking. Up to now, little attention has been paid to the complexity of sparse representation, while most works are focused on the performance improvement. By reducing the computation load related to sparse representation hundreds of times, this paper proposes by far the most computationally efficient tracking approach based on sparse representation. The proposal simply consists of two stages of sparse representation, one is for object detection and the other for object validation. Experimentally, it achieves better performance than some state-of-the-art methods in both accuracy and speed.
    Journal on Advances in Signal Processing 12/2015; 2015(1). DOI:10.1186/s13634-015-0200-7 · 0.81 Impact Factor
  • Source
    The Visual Computer 01/2015; DOI:10.1007/s00371-015-1067-1 · 1.07 Impact Factor