Name
Abstract | ||
|---|---|---|
Sparse representation and low-rank matrix decomposition approaches have been successfully applied to several computer vision problems. They build a generative representation of the data, which often requires complex training as well as testing to be robust against data variations induced by nuisance factors. We introduce the invariant components, a discriminative representation invariant to nuisance factors, because it spans subspaces orthogonal to the space where nuisance factors are defined. This allows developing a framework based on geometry that ensures a uniform inter-class separation, and a very efficient and robust classification based on simple nearest neighbor. In addition, we show how the approach is equivalent to a local metric learning, where the local metrics (one for each class) are learned jointly, rather than independently, thus avoiding the risk of overfitting without the need for additional regularization. We evaluated the approach for face recognition with highly corrupted training and testing data, obtaining very promising results. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ICCV.2015.480 | ICCV |
Field | DocType | Volume |
Computer science,Regularization (mathematics),Artificial intelligence,Overfitting,Discriminative model,k-nearest neighbors algorithm,Facial recognition system,Computer vision,Pattern recognition,Sparse approximation,Matrix decomposition,Invariant (mathematics),Machine learning | Conference | 2015 |
Issue | ISSN | Citations |
1 | 1550-5499 | 1 |
PageRank | References | Authors |
0.35 | 40 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Farzad Siyahjani | 1 | 8 | 1.11 |
| Ranya Almohsen | 2 | 9 | 1.45 |
| Sinan Sabri | 3 | 1 | 0.35 |
| Gianfranco Doretto | 4 | 1026 | 78.58 |