Efficient Discriminative Nonorthogonal Binary Subspace with its Application to Visual Tracking
One of the crucial problems in visual tracking is how the object is represented. Conventional appearance-based trackers are using increasingly more complex features in order to be robust. However, complex representations typically not only require more computation for feature extraction, but also make the state inference complicated. We show that with a careful feature selection scheme, extremely simple yet discriminative features can be used for robust object tracking. The central component of the proposed method is a succinct and discriminative representation of the object using discriminative non-orthogonal binary subspace (DNBS) which is spanned by Haar-like features. The DNBS representation inherits the merits of the original NBS in that it efficiently describes the object. It also incorporates the discriminative information to distinguish foreground from background. However, the problem of finding the DNBS bases from an over-complete dictionary is NP-hard. We propose a greedy algorithm called discriminative optimized orthogonal matching pursuit (D-OOMP) to solve this problem. An iterative formulation named iterative D-OOMP is further developed to drastically reduce the redundant computation between iterations and a hierarchical selection strategy is integrated for reducing the search space of features. The proposed DNBS representation is applied to object tracking through SSD-based template matching. We validate the effectiveness of our method through extensive experiments on challenging videos with comparisons against several state-of-the-art trackers and demonstrate its capability to track objects in clutter and moving background.
Code (0)
등록된 구현이 없습니다.
Tasks
feature selectionObjectObject TrackingTemplate MatchingVisual TrackingSimilar Papers 제목 키워드 기반
Iterated Relevance Matrix Analysis (IRMA) for the identification of class-discriminative subspaces
We introduce and investigate the iterated application of Generalized Matrix Learning Vector Quantizaton for the analysis of feature relevances in classification problems, as well as for the construction of class-discrimi…
Dimensionality ReductionQuantizationLearning Discriminative Video Representations Using Adversarial Perturbations
Adversarial perturbations are noise-like patterns that can subtly change the data, while failing an otherwise accurate classifier. In this paper, we propose to use such perturbations for improving the robustness of video…
Binary ClassificationRiemannian optimizationVideo RecognitionTransition Subspace Learning based Least Squares Regression for Image Classification
Only learning one projection matrix from original samples to the corresponding binary labels is too strict and will consequentlly lose some intrinsic geometric structures of data. In this paper, we propose a novel transi…
ClassificationGeneral Classificationimage-classificationImage Classification+1Contrastive Video Representation Learning via Adversarial Perturbations
Adversarial perturbations are noise-like patterns that can subtly change the data, while failing an otherwise accurate classifier. In this paper, we propose to use such perturbations within a novel contrastive learning s…
Action RecognitionBinary ClassificationContrastive LearningRepresentation Learning+2Self-Supervised Convolutional Subspace Clustering Network
Subspace clustering methods based on data self-expression have become very popular for learning from data that lie in a union of low-dimensional linear subspaces. However, the applicability of subspace clustering has bee…
ClusteringImage Clustering