Classification with Repulsion Tensors: A Case Study on Face Recognition
We consider dimensionality reduction methods for face recognition in a supervised setting, using an image-as-matrix representation. A common procedure is to project image matrices into a smaller space in which the recognition is performed. These methods are often called "two-dimensional" in the literature and there exist counterparts that use an image-as-vector representation. When two face images are close to each other in the input space they may remain close after projection - but this is not desirable in the situation when these two images are from different classes, and this often affects the recognition performance. We extend a previously developed `repulsion Laplacean' technique based on adding terms to the objective function with the goal or creation a repulsion energy between such images in the projected space. This scheme, which relies on a repulsion graph, is generic and can be incorporated into various two-dimensional methods. It can be regarded as a multilinear generalization of the repulsion strategy by Kokiopoulou and Saad [Pattern Recog., 42 (2009), pp. 2392--2402]. Experimental results demonstrate that the proposed methodology offers significant recognition improvement relative to the underlying two-dimensional methods.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationDimensionality ReductionFace RecognitionGeneral ClassificationSimilar Papers 제목 키워드 기반
Repulsion Loss: Detecting Pedestrians in a Crowd
Detecting individual pedestrians in a crowd remains a challenging problem since the pedestrians often gather together and occlude each other in real-world scenarios. In this paper, we first explore how a state-of-the-art…
Pedestrian DetectionregressionDon't Break the Boundary: Continual Unlearning for OOD Detection Based on Free Energy Repulsion
Deploying trustworthy AI in open-world environments faces a dual challenge: the necessity for robust Out-of-Distribution (OOD) detection to ensure system safety, and the demand for flexible machine unlearning to satisfy …
parameter-efficient fine-tuningBypassing Skip-Gram Negative Sampling: Dimension Regularization as a More Efficient Alternative for Graph Embeddings
A wide range of graph embedding objectives decompose into two components: one that enforces similarity, attracting the embeddings of nodes that are perceived as similar, and another that enforces dissimilarity, repelling…
GPUGraph EmbeddingLink PredictionSelf-Supervised LearningInput-gradient space particle inference for neural network ensembles
Deep Ensembles (DEs) demonstrate improved accuracy, calibration and robustness to perturbations over single neural networks partly due to their functional diversity. Particle-based variational inference (ParVI) methods e…
DiversityEnsemble Learningimage-classificationImage Classification+22D+3D facial expression recognition via embedded tensor manifold regularization
In this paper, a novel approach via embedded tensor manifold regularization for 2D+3D facial expression recognition (FERETMR) is proposed. Firstly, 3D tensors are constructed from 2D face images and 3D face shape models …
3D Facial Expression RecognitionDimensionality ReductionFacial Expression RecognitionFacial Expression Recognition (FER)