scholarly journals Learning Spatial–Temporal Background-Aware Based Tracking

2021 ◽  
Vol 11 (18) ◽  
pp. 8427
Author(s):  
Peiting Gu ◽  
Peizhong Liu ◽  
Jianhua Deng ◽  
Zhi Chen
Keyword(s):  
State Of The Art ◽  
Feature Representation ◽  
Boundary Effects ◽  
Correlation Filter ◽  
Discriminative Performance ◽  
Sampling Process ◽  
Alternating Direction ◽  
Discriminative Correlation Filter ◽  
Speed And Accuracy ◽  
Appearance Changes

Discriminative correlation filter (DCF) based tracking algorithms have obtained prominent speed and accuracy strengths, which have attracted extensive attention and research. However, some unavoidable deficiencies still exist. For example, the circulant shifted sampling process is likely to cause repeated periodic assumptions and cause boundary effects, which degrades the tracker’s discriminative performance, and the target is not easy to locate in complex appearance changes. In this paper, a spatial–temporal regularization module based on BACF (background-aware correlation filter) framework is proposed, which is performed by introducing a temporal regularization to deal effectively with the boundary effects issue. At the same time, the accuracy of target recognition is improved. This model can be effectively optimized by employing the alternating direction multiplier (ADMM) method, and each sub-problem has a corresponding closed solution. In addition, in terms of feature representation, we combine traditional hand-crafted features with deep convolution features linearly enhance the discriminative performance of the filter. Considerable experiments on multiple well-known benchmarks show the proposed algorithm is performs favorably against many state-of-the-art trackers and achieves an AUC score of 64.4% on OTB-100.

scholarly journals Spatio-temporal joint aberrance suppressed correlation filter for visual tracking

2021 ◽  
Author(s):  
Libin Xu ◽  
Pyoungwon Kim ◽  
Mengjie Wang ◽  
Jinfeng Pan ◽  
Xiaomin Yang ◽  
...  
Keyword(s):  
Visual Tracking ◽  
State Of The Art ◽  
Boundary Effect ◽  
Correlation Filter ◽  
Star Model ◽  
Unified Framework ◽  
Alternating Direction ◽  
Background Clutter ◽  
Discriminative Correlation Filter ◽  
Spatio Temporal

AbstractThe discriminative correlation filter (DCF)-based tracking methods have achieved remarkable performance in visual tracking. However, the existing DCF paradigm still suffers from dilemmas such as boundary effect, filter degradation, and aberrance. To address these problems, we propose a spatio-temporal joint aberrance suppressed regularization (STAR) correlation filter tracker under a unified framework of response map. Specifically, a dynamic spatio-temporal regularizer is introduced into the DCF to alleviate the boundary effect and filter degradation, simultaneously. Meanwhile, an aberrance suppressed regularizer is exploited to reduce the interference of background clutter. The proposed STAR model is effectively optimized using the alternating direction method of multipliers (ADMM). Finally, comprehensive experiments on TC128, OTB2013, OTB2015 and UAV123 benchmarks demonstrate that the STAR tracker achieves compelling performance compared with the state-of-the-art (SOTA) trackers.

scholarly journals Improved Correlation Filter Tracking with Enhanced Features and Adaptive Kalman Filter

Sensors ◽  
2019 ◽  
Vol 19 (7) ◽  
pp. 1625 ◽  
Author(s):  
Hao Yang ◽  
Yingqing Huang ◽  
Zhihong Xie
Keyword(s):  
Kalman Filter ◽  
Texture Features ◽  
Boundary Effects ◽  
Correlation Filter ◽  
Target Response ◽  
Correlation Filters ◽  
Adaptive Kalman Filter ◽  
Optimal Functions ◽  
Discriminative Correlation Filter ◽  
High Computational Efficiency

In the field of visual tracking, discriminative correlation filter (DCF)-based trackers have made remarkable achievements with their high computational efficiency. The crucial challenge that still remains is how to construct qualified samples without boundary effects and redetect occluded targets. In this paper a feature-enhanced discriminative correlation filter (FEDCF) tracker is proposed, which utilizes the color statistical model to strengthen the texture features (like the histograms of oriented gradient of HOG) and uses the spatial-prior function to suppress the boundary effects. Then, improved correlation filters using the enhanced features are built, the optimal functions of which can be effectively solved by Gauss–Seidel iteration. In addition, the average peak-response difference (APRD) is proposed to reflect the degree of target-occlusion according to the target response, and an adaptive Kalman filter is established to support the target redetection. The proposed tracker achieved a success plot performance of 67.8% with 5.1 fps on the standard datasets OTB2013.

Bayesian Covariance Representation with Global Informative Prior for 3D Action Recognition

2021 ◽  
Vol 17 (4) ◽  
pp. 1-22
Author(s):  
Jianhai Zhang ◽  
Zhiyong Feng ◽  
Yong Su ◽  
Meng Xing
Keyword(s):  
Action Recognition ◽  
Temporal Order ◽  
State Of The Art ◽  
Feature Representation ◽  
Independent Action ◽  
Sufficient Statistics ◽  
Informative Prior ◽  
Global Action ◽  
High Order Statistics ◽  
Order Structures

For the merits of high-order statistics and Riemannian geometry, covariance matrix has become a generic feature representation for action recognition. An independent action can be represented by an empirical statistics over all of its pose samples. Two major problems of covariance include the following: (1) it is prone to be singular so that actions fail to be represented properly, and (2) it is short of global action/pose-aware information so that expressive and discriminative power is limited. In this article, we propose a novel Bayesian covariance representation by a prior regularization method to solve the preceding problems. Specifically, covariance is viewed as a parametric maximum likelihood estimate of Gaussian distribution over local poses from an independent action. Then, a Global Informative Prior (GIP) is generated over global poses with sufficient statistics to regularize covariance. In this way, (1) singularity is greatly relieved due to sufficient statistics, (2) global pose information of GIP makes Bayesian covariance theoretically equivalent to a saliency weighting covariance over global action poses so that discriminative characteristics of actions can be represented more clearly. Experimental results show that our Bayesian covariance with GIP efficiently improves the performance of action recognition. In some databases, it outperforms the state-of-the-art variant methods that are based on kernels, temporal-order structures, and saliency weighting attentions, among others.

scholarly journals Correlation Tracking via Self-Adaptive Fusion of Multiple Features

Information ◽  
2018 ◽  
Vol 9 (10) ◽  
pp. 241 ◽  
Author(s):  
Zhi Chen ◽  
Peizhong Liu ◽  
Yongzhao Du ◽  
Yanmin Luo ◽  
Wancheng Zhang
Keyword(s):  
State Of The Art ◽  
Correlation Filter ◽  
Multiple Features ◽  
Multi Scale ◽  
Tracking Algorithms ◽  
Model Update ◽  
Adaptive Fusion ◽  
Tracking Model ◽  
Update Strategy ◽  
Self Adaptive

Correlation filter (CF) based tracking algorithms have shown excellent performance in comparison to most state-of-the-art algorithms on the object tracking benchmark (OTB). Nonetheless, most CF based tracking algorithms only consider limited single channel feature, and the tracking model always updated from frame-by-frame. It will generate some erroneous information when the target objects undergo sophisticated scenario changes, such as background clutter, occlusion, out-of-view, and so forth. Long-term accumulation of erroneous model updating will cause tracking drift. In order to address problems that are mentioned above, in this paper, we propose a robust multi-scale correlation filter tracking algorithm via self-adaptive fusion of multiple features. First, we fuse powerful multiple features including histogram of oriented gradients (HOG), color name (CN), and histogram of local intensities (HI) in the response layer. The weights assigned according to the proportion of response scores that are generated by each feature, which achieve self-adaptive fusion of multiple features for preferable feature representation. In the meantime the efficient model update strategy is proposed, which is performed by exploiting a pre-defined response threshold as discriminative condition for updating tracking model. In addition, we introduce an accurate multi-scale estimation method integrate with the model update strategy, which further improves the scale variation adaptability. Both qualitative and quantitative evaluations on challenging video sequences demonstrate that the proposed tracker performs superiorly against the state-of-the-art CF based methods.

scholarly journals Random Fourier Features via Fast Surrogate Leverage Weighted Sampling

2020 ◽  
Vol 34 (04) ◽  
pp. 4844-4851
Author(s):  
Fanghui Liu ◽  
Xiaolin Huang ◽  
Yudong Chen ◽  
Jie Yang ◽  
Johan Suykens
Keyword(s):  
State Of The Art ◽  
Sampling Strategy ◽  
Prediction Performance ◽  
Current State ◽  
Kernel Approximation ◽  
Sampling Process ◽  
New Strategy ◽  
The Matrix ◽  
Benchmark Datasets ◽  
Random Fourier Features

In this paper, we propose a fast surrogate leverage weighted sampling strategy to generate refined random Fourier features for kernel approximation. Compared to the current state-of-the-art method that uses the leverage weighted scheme (Li et al. 2019), our new strategy is simpler and more effective. It uses kernel alignment to guide the sampling process and it can avoid the matrix inversion operator when we compute the leverage function. Given n observations and s random features, our strategy can reduce the time complexity for sampling from O(ns2+s3) to O(ns2), while achieving comparable (or even slightly better) prediction performance when applied to kernel ridge regression (KRR). In addition, we provide theoretical guarantees on the generalization performance of our approach, and in particular characterize the number of random features required to achieve statistical guarantees in KRR. Experiments on several benchmark datasets demonstrate that our algorithm achieves comparable prediction performance and takes less time cost when compared to (Li et al. 2019).

scholarly journals Disentangled Feature Learning Network for Vehicle Re-Identification

2020 ◽  
Author(s):  
Yan Bai ◽  
Yihang Lou ◽  
Yongxing Dai ◽  
Jun Liu ◽  
Ziqian Chen ◽  
...  
Keyword(s):  
State Of The Art ◽  
Feature Learning ◽  
Feature Representation ◽  
Public Security ◽  
The Public ◽  
Common Features ◽  
Learning Network ◽  
Single Feature ◽  
Art Performance

Vehicle Re-Identification (ReID) has attracted lots of research efforts due to its great significance to the public security. In vehicle ReID, we aim to learn features that are powerful in discriminating subtle differences between vehicles which are visually similar, and also robust against different orientations of the same vehicle. However, these two characteristics are hard to be encapsulated into a single feature representation simultaneously with unified supervision. Here we propose a Disentangled Feature Learning Network (DFLNet) to learn orientation specific and common features concurrently, which are discriminative at details and invariant to orientations, respectively. Moreover, to effectively use these two types of features for ReID, we further design a feature metric alignment scheme to ensure the consistency of the metric scales. The experiments show the effectiveness of our method that achieves state-of-the-art performance on three challenging datasets.

scholarly journals Redundancy Removal Adversarial Active Learning Based on Norm Online Uncertainty Indicator

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Jifeng Guo ◽  
Zhiqi Pang ◽  
Wenbo Sun ◽  
Shi Li ◽  
Yu Chen
Keyword(s):  
Active Learning ◽  
Feature Vector ◽  
State Of The Art ◽  
Representation Learning ◽  
The State ◽  
Feature Representation ◽  
Learning Ability ◽  
Redundancy Removal ◽  
Previous State ◽  
Uncertainty Score

Active learning aims to select the most valuable unlabelled samples for annotation. In this paper, we propose a redundancy removal adversarial active learning (RRAAL) method based on norm online uncertainty indicator, which selects samples based on their distribution, uncertainty, and redundancy. RRAAL includes a representation generator, state discriminator, and redundancy removal module (RRM). The purpose of the representation generator is to learn the feature representation of a sample, and the state discriminator predicts the state of the feature vector after concatenation. We added a sample discriminator to the representation generator to improve the representation learning ability of the generator and designed a norm online uncertainty indicator (Norm-OUI) to provide a more accurate uncertainty score for the state discriminator. In addition, we designed an RRM based on a greedy algorithm to reduce the number of redundant samples in the labelled pool. The experimental results on four datasets show that the state discriminator, Norm-OUI, and RRM can improve the performance of RRAAL, and RRAAL outperforms the previous state-of-the-art active learning methods.

Fast motion tracking based on moth-flame optimization and kernel correlation filter

2020 ◽  
Vol 39 (3) ◽  
pp. 3825-3837
Author(s):  
Yibin Chen ◽  
Guohao Nie ◽  
Huanlong Zhang ◽  
Yuxing Feng ◽  
Guanglu Yang
Keyword(s):  
Motion Tracking ◽  
State Of The Art ◽  
Candidate Region ◽  
Correlation Filter ◽  
Data Sets ◽  
Search Window ◽  
Tracking Method ◽  
Fast Motion ◽  
Kernel Correlation

Kernel Correlation Filter (KCF) tracker has shown great potential on precision, robustness and efficiency. However, the candidate region used to train the correlation filter is fixed, so tracking is difficult when the target escapes from the search window due to fast motion. In this paper, an improved KCF is put forward for long-term tracking. At first, the moth-flame optimization (MFO) algorithm is introduced into tracking to search for lost target. Then, the candidate sample strategy of KCF tracking method is adjusted by MFO algorithm to make it has the capability of fast motion tracking. Finally, we use the conservative learning correlation filter to judge the moving state of the target, and combine the improved KCF tracker to form a unified tracking framework. The proposed algorithm is tested on a self-made dataset benchmark. Moreover, our method obtains scores for both the distance precision plot (0.891 and 0.842) and overlap success plots (0.631 and 0.601) on the OTB-2013 and OTB-2015 data sets, respectively. The results demonstrate the feasibility and effectiveness compared with the state-of-the-art methods, especially in dealing with fast or uncertain motion.

Sign in / Sign up

Export Citation Format

Share Document