Pith. sign in

REVIEW

Large Scale Strongly Supervised Ensemble Metric Learning, with Applications to Face Verification and Retrieval

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1212.6094 v1 pith:BJAAP4G4 submitted 2012-12-25 cs.CV

classification cs.CV
keywords metricfeaturelearningapplicationsblockdiagonalefficiencyensemble
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Learning Mahanalobis distance metrics in a high- dimensional feature space is very difficult especially when structural sparsity and low rank are enforced to improve com- putational efficiency in testing phase. This paper addresses both aspects by an ensemble metric learning approach that consists of sparse block diagonal metric ensembling and join- t metric learning as two consecutive steps. The former step pursues a highly sparse block diagonal metric by selecting effective feature groups while the latter one further exploits correlations between selected feature groups to obtain an accurate and low rank metric. Our algorithm considers all pairwise or triplet constraints generated from training samples with explicit class labels, and possesses good scala- bility with respect to increasing feature dimensionality and growing data volumes. Its applications to face verification and retrieval outperform existing state-of-the-art methods in accuracy while retaining high efficiency.

Discussion (0). Continue with ORCID to comment.

Pith tools