Metric Learning with Dynamically Generated Pairwise Constraints for Ear Recognition

03/26/2018
by   Ibrahim Omara, et al.
0

Ear recognition task is known as predicting whether two ear images belong to the same person or not. In this paper, we present a novel metric learning method for ear recognition. This method is formulated as a pairwise constrained optimization problem. In each training cycle, this method selects the nearest similar and dissimilar neighbors of each sample to construct the pairwise constraints, and then solve the optimization problem by the iterated Bregman projections. Experiments are conducted on AMI, USTB II and WPUT databases. The results show that the proposed approach can achieve promising recognition rates in ear recognition, and its training process is much more efficient than the other competing metric learning methods.

READ FULL TEXT
research
02/02/2015

Iterated Support Vector Machines for Distance Metric Learning

Distance metric learning aims to learn from the given training data a va...
research
04/08/2016

Bayesian Neighbourhood Component Analysis

Learning a good distance metric in feature space potentially improves th...
research
03/15/2012

Robust Metric Learning by Smooth Optimization

Most existing distance metric learning methods assume perfect side infor...
research
11/08/2021

Query-augmented Active Metric Learning

In this paper we propose an active metric learning method for clustering...
research
01/07/2018

Threshold Auto-Tuning Metric Learning

It has been reported repeatedly that discriminative learning of distance...
research
02/15/2021

A Unified Batch Selection Policy for Active Metric Learning

Active metric learning is the problem of incrementally selecting high-ut...
research
12/24/2019

a simple and effective framework for pairwise deep metric learning

Deep metric learning (DML) has received much attention in deep learning ...

Please sign up or login with your details

Forgot password? Click here to reset