ECML: An Ensemble Cascade Metric Learning Mechanism towards Face
Verification
- URL: http://arxiv.org/abs/2007.05720v1
- Date: Sat, 11 Jul 2020 08:47:07 GMT
- Title: ECML: An Ensemble Cascade Metric Learning Mechanism towards Face
Verification
- Authors: Fu Xiong, Yang Xiao, Zhiguo Cao, Yancheng Wang, Joey Tianyi Zhou and
Jianxi Wu
- Abstract summary: In particular, hierarchical metric learning is executed in the cascade way to alleviate underfitting.
Considering the feature distribution characteristics of faces, a robust Mahalanobis metric learning method (RMML) with closed-form solution is additionally proposed.
EC-RMML is superior to state-of-the-art metric learning methods for face verification.
- Score: 50.137924223702264
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Face verification can be regarded as a 2-class fine-grained visual
recognition problem. Enhancing the feature's discriminative power is one of the
key problems to improve its performance. Metric learning technology is often
applied to address this need, while achieving a good tradeoff between
underfitting and overfitting plays the vital role in metric learning. Hence, we
propose a novel ensemble cascade metric learning (ECML) mechanism. In
particular, hierarchical metric learning is executed in the cascade way to
alleviate underfitting. Meanwhile, at each learning level, the features are
split into non-overlapping groups. Then, metric learning is executed among the
feature groups in the ensemble manner to resist overfitting. Considering the
feature distribution characteristics of faces, a robust Mahalanobis metric
learning method (RMML) with closed-form solution is additionally proposed. It
can avoid the computation failure issue on inverse matrix faced by some
well-known metric learning approaches (e.g., KISSME). Embedding RMML into the
proposed ECML mechanism, our metric learning paradigm (EC-RMML) can run in the
one-pass learning manner. Experimental results demonstrate that EC-RMML is
superior to state-of-the-art metric learning methods for face verification.
And, the proposed ensemble cascade metric learning mechanism is also applicable
to other metric learning approaches.
Related papers
- DAAL: Density-Aware Adaptive Line Margin Loss for Multi-Modal Deep Metric Learning [1.9472493183927981]
We propose a novel loss function called Density-Aware Adaptive Margin Loss (DAAL)
DAAL preserves the density distribution of embeddings while encouraging the formation of adaptive sub-clusters within each class.
Experiments on benchmark fine-grained datasets demonstrate the superior performance of DAAL.
arXiv Detail & Related papers (2024-10-07T19:04:24Z) - Adaptive neighborhood Metric learning [184.95321334661898]
We propose a novel distance metric learning algorithm, named adaptive neighborhood metric learning (ANML)
ANML can be used to learn both the linear and deep embeddings.
The emphlog-exp mean function proposed in our method gives a new perspective to review the deep metric learning methods.
arXiv Detail & Related papers (2022-01-20T17:26:37Z) - Adaptive Hierarchical Similarity Metric Learning with Noisy Labels [138.41576366096137]
We propose an Adaptive Hierarchical Similarity Metric Learning method.
It considers two noise-insensitive information, textiti.e., class-wise divergence and sample-wise consistency.
Our method achieves state-of-the-art performance compared with current deep metric learning approaches.
arXiv Detail & Related papers (2021-10-29T02:12:18Z) - MAML is a Noisy Contrastive Learner [72.04430033118426]
Model-agnostic meta-learning (MAML) is one of the most popular and widely-adopted meta-learning algorithms nowadays.
We provide a new perspective to the working mechanism of MAML and discover that: MAML is analogous to a meta-learner using a supervised contrastive objective function.
We propose a simple but effective technique, zeroing trick, to alleviate such interference.
arXiv Detail & Related papers (2021-06-29T12:52:26Z) - Towards Self-Adaptive Metric Learning On the Fly [16.61982837441342]
We aim to address the open challenge of "Online Adaptive Metric Learning" (OAML) for learning adaptive metric functions on the fly.
Unlike traditional online metric learning methods, OAML is significantly more challenging since the learned metric could be non-linear and the model has to be self-adaptive.
We present a new online metric learning framework that attempts to tackle the challenge by learning an ANN-based metric with adaptive model complexity from a stream of constraints.
arXiv Detail & Related papers (2021-04-03T23:11:52Z) - Performance Indicator in Multilinear Compressive Learning [106.12874293597754]
The Multilinear Compressive Learning (MCL) framework was proposed to efficiently optimize the sensing and learning steps when working with multidimensional signals.
In this paper, we analyze the relationship between the input signal resolution, the number of compressed measurements and the learning performance of MCL.
arXiv Detail & Related papers (2020-09-22T11:27:50Z) - A Multilayer Framework for Online Metric Learning [71.31889711244739]
This paper proposes a multilayer framework for online metric learning to capture the nonlinear similarities among instances.
A new Mahalanobis-based Online Metric Learning (MOML) algorithm is presented based on the passive-aggressive strategy and one-pass triplet construction strategy.
The proposed MLOML enjoys several nice properties, indeed learns a metric progressively, and performs better on the benchmark datasets.
arXiv Detail & Related papers (2018-05-15T01:10:18Z)
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.