Ranking-Based Siamese Visual Tracking
- URL: http://arxiv.org/abs/2205.11761v1
- Date: Tue, 24 May 2022 03:46:40 GMT
- Title: Ranking-Based Siamese Visual Tracking
- Authors: Feng Tang, Qiang Ling
- Abstract summary: Siamese-based trackers mainly formulate the visual tracking into two independent subtasks, including classification and localization.
This paper proposes a ranking-based optimization algorithm to explore the relationship among different proposals.
The proposed two ranking losses are compatible with most Siamese trackers and incur no additional computation for inference.
- Score: 31.2428211299895
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Current Siamese-based trackers mainly formulate the visual tracking into two
independent subtasks, including classification and localization. They learn the
classification subnetwork by processing each sample separately and neglect the
relationship among positive and negative samples. Moreover, such tracking
paradigm takes only the classification confidence of proposals for the final
prediction, which may yield the misalignment between classification and
localization. To resolve these issues, this paper proposes a ranking-based
optimization algorithm to explore the relationship among different proposals.
To this end, we introduce two ranking losses, including the classification one
and the IoU-guided one, as optimization constraints. The classification ranking
loss can ensure that positive samples rank higher than hard negative ones,
i.e., distractors, so that the trackers can select the foreground samples
successfully without being fooled by the distractors. The IoU-guided ranking
loss aims to align classification confidence scores with the Intersection over
Union(IoU) of the corresponding localization prediction for positive samples,
enabling the well-localized prediction to be represented by high classification
confidence. Specifically, the proposed two ranking losses are compatible with
most Siamese trackers and incur no additional computation for inference.
Extensive experiments on seven tracking benchmarks, including OTB100, UAV123,
TC128, VOT2016, NFS30, GOT-10k and LaSOT, demonstrate the effectiveness of the
proposed ranking-based optimization algorithm. The code and raw results are
available at https://github.com/sansanfree/RBO.
Related papers
- Bipartite Ranking Fairness through a Model Agnostic Ordering Adjustment [54.179859639868646]
We propose a model agnostic post-processing framework xOrder for achieving fairness in bipartite ranking.
xOrder is compatible with various classification models and ranking fairness metrics, including supervised and unsupervised fairness metrics.
We evaluate our proposed algorithm on four benchmark data sets and two real-world patient electronic health record repositories.
arXiv Detail & Related papers (2023-07-27T07:42:44Z) - Optimizing Partial Area Under the Top-k Curve: Theory and Practice [151.5072746015253]
We develop a novel metric named partial Area Under the top-k Curve (AUTKC)
AUTKC has a better discrimination ability, and its Bayes optimal score function could give a correct top-K ranking with respect to the conditional probability.
We present an empirical surrogate risk minimization framework to optimize the proposed metric.
arXiv Detail & Related papers (2022-09-03T11:09:13Z) - Revisiting AP Loss for Dense Object Detection: Adaptive Ranking Pair
Selection [19.940491797959407]
In this work, we revisit the average precision (AP)loss and reveal that the crucial element is that of selecting the ranking pairs between positive and negative samples.
We propose two strategies to improve the AP loss. The first is a novel Adaptive Pairwise Error (APE) loss that focusing on ranking pairs in both positive and negative samples.
Experiments conducted on the MSCOCO dataset support our analysis and demonstrate the superiority of our proposed method compared with current classification and ranking loss.
arXiv Detail & Related papers (2022-07-25T10:33:06Z) - Large-Scale Sequential Learning for Recommender and Engineering Systems [91.3755431537592]
In this thesis, we focus on the design of an automatic algorithms that provide personalized ranking by adapting to the current conditions.
For the former, we propose novel algorithm called SAROS that take into account both kinds of feedback for learning over the sequence of interactions.
The proposed idea of taking into account the neighbour lines shows statistically significant results in comparison with the initial approach for faults detection in power grid.
arXiv Detail & Related papers (2022-05-13T21:09:41Z) - Learning Localization-aware Target Confidence for Siamese Visual
Tracking [13.684278662495204]
We propose a novel tracking paradigm, called SiamLA.
Within this paradigm, a series of simple, yet effective localization-aware components are introduced.
Our SiamLA achieves state-of-the-art performance in terms of both accuracy and efficiency.
arXiv Detail & Related papers (2022-04-29T13:37:15Z) - Unbiased Pairwise Learning to Rank in Recommender Systems [4.058828240864671]
Unbiased learning to rank algorithms are appealing candidates and have already been applied in many applications with single categorical labels.
We propose a novel unbiased LTR algorithm to tackle the challenges, which innovatively models position bias in the pairwise fashion.
Experiment results on public benchmark datasets and internal live traffic show the superior results of the proposed method for both categorical and continuous labels.
arXiv Detail & Related papers (2021-11-25T06:04:59Z) - Which to Match? Selecting Consistent GT-Proposal Assignment for
Pedestrian Detection [23.92066492219922]
The fixed Intersection over Union (IoU) based assignment-regression manner still limits their performance.
We introduce one geometric sensitive search algorithm as a new assignment and regression metric.
Specifically, we boost the MR-FPPI under R$_75$ by 8.8% on Citypersons dataset.
arXiv Detail & Related papers (2021-03-18T08:54:51Z) - Binary Classification from Multiple Unlabeled Datasets via Surrogate Set
Classification [94.55805516167369]
We propose a new approach for binary classification from m U-sets for $mge2$.
Our key idea is to consider an auxiliary classification task called surrogate set classification (SSC)
arXiv Detail & Related papers (2021-02-01T07:36:38Z) - 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) - Towards Model-Agnostic Post-Hoc Adjustment for Balancing Ranking
Fairness and Algorithm Utility [54.179859639868646]
Bipartite ranking aims to learn a scoring function that ranks positive individuals higher than negative ones from labeled data.
There have been rising concerns on whether the learned scoring function can cause systematic disparity across different protected groups.
We propose a model post-processing framework for balancing them in the bipartite ranking scenario.
arXiv Detail & Related papers (2020-06-15T10:08:39Z)
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.