Discriminative extended canonical correlation analysis for pattern set matching
Ognjen Arandjelovic

TL;DR
This paper introduces a robust, parameter-free extension of canonical correlation analysis (E-CCA) for pattern set matching, and further develops a discriminative version (DE-CCA) that significantly improves face recognition performance.
Contribution
The paper presents a novel, robust framework for set matching based on E-CCA, and introduces a discriminative learning scheme DE-CCA, both outperforming existing methods.
Findings
E-CCA outperforms CCA and C-CCA in face recognition tasks.
DE-CCA achieves even greater accuracy than E-CCA and C-CCA.
The methods are efficient and do not require free parameter tuning.
Abstract
In this paper we address the problem of matching sets of vectors embedded in the same input space. We propose an approach which is motivated by canonical correlation analysis (CCA), a statistical technique which has proven successful in a wide variety of pattern recognition problems. Like CCA when applied to the matching of sets, our extended canonical correlation analysis (E-CCA) aims to extract the most similar modes of variability within two sets. Our first major contribution is the formulation of a principled framework for robust inference of such modes from data in the presence of uncertainty associated with noise and sampling randomness. E-CCA retains the efficiency and closed form computability of CCA, but unlike it, does not possess free parameters which cannot be inferred directly from data (inherent data dimensionality, and the number of canonical correlations used for set…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
