Correlation filter tracking with adaptive proposal selection for
accurate scale estimation
- URL: http://arxiv.org/abs/2007.07018v1
- Date: Tue, 14 Jul 2020 13:16:52 GMT
- Title: Correlation filter tracking with adaptive proposal selection for
accurate scale estimation
- Authors: Luo Xiong, Yanjie Liang, Yan Yan, Hanzi Wang
- Abstract summary: We propose an adaptive proposal selection algorithm which can generate a small number of high-quality proposals.
Experiments on two benchmark datasets demonstrate that the proposed algorithm performs favorably against several state-of-the-art trackers.
- Score: 29.212854268141704
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Recently, some correlation filter based trackers with detection proposals
have achieved state-of-the-art tracking results. However, a large number of
redundant proposals given by the proposal generator may degrade the performance
and speed of these trackers. In this paper, we propose an adaptive proposal
selection algorithm which can generate a small number of high-quality proposals
to handle the problem of scale variations for visual object tracking.
Specifically, we firstly utilize the color histograms in the HSV color space to
represent the instances (i.e., the initial target in the first frame and the
predicted target in the previous frame) and proposals. Then, an adaptive
strategy based on the color similarity is formulated to select high-quality
proposals. We further integrate the proposed adaptive proposal selection
algorithm with coarse-to-fine deep features to validate the generalization and
efficiency of the proposed tracker. Experiments on two benchmark datasets
demonstrate that the proposed algorithm performs favorably against several
state-of-the-art trackers.
Related papers
- An incremental preference elicitation-based approach to learning potentially non-monotonic preferences in multi-criteria sorting [53.36437745983783]
We first construct a max-margin optimization-based model to model potentially non-monotonic preferences.
We devise information amount measurement methods and question selection strategies to pinpoint the most informative alternative in each iteration.
Two incremental preference elicitation-based algorithms are developed to learn potentially non-monotonic preferences.
arXiv Detail & Related papers (2024-09-04T14:36:20Z) - Fast Empirical Scenarios [0.0]
We seek to extract representative scenarios from large panel data consistent with sample moments.
Among two novel algorithms, the first identifies scenarios that have not been observed before.
The second proposal selects important data points from states of the world that have already realized.
arXiv Detail & Related papers (2023-07-08T07:58:53Z) - Dense Hybrid Proposal Modulation for Lane Detection [72.49084826234363]
We present a dense hybrid proposal modulation (DHPM) method for lane detection.
We densely modulate all proposals to generate topologically and spatially high-quality lane predictions.
Our DHPM achieves very competitive performances on four popular datasets.
arXiv Detail & Related papers (2023-04-28T14:31:11Z) - AcroFOD: An Adaptive Method for Cross-domain Few-shot Object Detection [59.10314662986463]
Cross-domain few-shot object detection aims to adapt object detectors in the target domain with a few annotated target data.
The proposed method achieves state-of-the-art performance on multiple benchmarks.
arXiv Detail & Related papers (2022-09-22T10:23:40Z) - Contrastive Proposal Extension with LSTM Network for Weakly Supervised
Object Detection [52.86681130880647]
Weakly supervised object detection (WSOD) has attracted more and more attention since it only uses image-level labels and can save huge annotation costs.
We propose a new method by comparing the initial proposals and the extension ones to optimize those initial proposals.
Experiments on PASCAL VOC 2007, VOC 2012 and MS-COCO datasets show that our method has achieved the state-of-the-art results.
arXiv Detail & Related papers (2021-10-14T16:31:57Z) - Adaptive Proposal Generation Network for Temporal Sentence Localization
in Videos [58.83440885457272]
We address the problem of temporal sentence localization in videos (TSLV)
Traditional methods follow a top-down framework which localizes the target segment with pre-defined segment proposals.
We propose an Adaptive Proposal Generation Network (APGN) to maintain the segment-level interaction while speeding up the efficiency.
arXiv Detail & Related papers (2021-09-14T02:02:36Z) - Distributed Adaptive Nearest Neighbor Classifier: Algorithm and Theory [6.696267547013535]
We propose a novel distributed adaptive NN classifier for which the number of nearest neighbors is a tuning parameterally chosen by a data-driven criterion.
An early stopping rule is proposed when searching for the optimal tuning parameter, which improves the finite sample performance.
In particular, we show that when the sub-sample sizes are sufficiently large, the proposed classifier achieves the nearly optimal convergence rate.
arXiv Detail & Related papers (2021-05-20T14:38:41Z) - Learning a Proposal Classifier for Multiple Object Tracking [36.67900094433032]
We propose a novel proposal-based learnable framework, which models MOT as a proposal generation, proposal scoring and trajectory inference paradigm on an affinity graph.
We experimentally demonstrate that the proposed method achieves a clear performance improvement in both MOTA and IDF1 with respect to previous state-of-the-art on two public benchmarks.
arXiv Detail & Related papers (2021-03-14T10:46:54Z) - CRACT: Cascaded Regression-Align-Classification for Robust Visual
Tracking [97.84109669027225]
We introduce an improved proposal refinement module, Cascaded Regression-Align- Classification (CRAC)
CRAC yields new state-of-the-art performances on many benchmarks.
In experiments on seven benchmarks including OTB-2015, UAV123, NfS, VOT-2018, TrackingNet, GOT-10k and LaSOT, our CRACT exhibits very promising results in comparison with state-of-the-art competitors.
arXiv Detail & Related papers (2020-11-25T02:18:33Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.