MLBoost Revisited: A Faster Metric Learning Algorithm for Identity-Based Face Retrieval

Romain Negrel, Alexis Lechervy and Frederic Jurie

Abstract

This paper addresses the question of metric learning, i.e. the learning of a dissimilarity function from a set of similar/dissimilar example pairs. This domain plays an important role in many machine learning applications such as those related to face recognition or face retrieval. More specifically, this paper builds on the recent MLBoost method proposed by Negrel. MLBoost has been shown to perform very well for face retrieval tasks, but this algorithm relies on the computation of a weak metric which is very time consuming. This paper demonstrates how, by introducing sparsity into the weak projectors, the convergence time can be reduced up to a factor of 10 times compared to MLBoost, without any performance loss. The paper also introduces an explicit way to control the rank of the so-obtained metrics, allowing to fix in advance the dimension of the (projected) feature space. The proposed ideas are experimentally validated on a face retrieval task with three different signatures.

Session

Posters 2

Files

Extended Abstract (PDF, 101K)
Paper (PDF, 239K)

DOI

10.5244/C.30.103
https://dx.doi.org/10.5244/C.30.103

Citation

Bibtex

        @inproceedings{BMVC2016_103,
        	title={MLBoost Revisited: A Faster Metric Learning Algorithm for Identity-Based Face Retrieval},
        	author={Romain Negrel, Alexis Lechervy and Frederic Jurie},
        	year={2016},
        	month={September},
        	pages={103.1-103.13},
        	articleno={103},
        	numpages={13},
        	booktitle={Proceedings of the British Machine Vision Conference (BMVC)},
        	publisher={BMVA Press},
        	editor={Richard C. Wilson, Edwin R. Hancock and William A. P. Smith},
        	doi={10.5244/C.30.103},
        	isbn={1-901725-59-6},
        	url={https://dx.doi.org/10.5244/C.30.103}
        }