Novel sparse PCA method via Runge Kutta numerical method(s) for face recognition

Loc Hoang Tran, Luong Anh Tuan Nguyen
3/30/2025
eess.IVcs.CVcs.LG

No confident code implementation found for this paper.

Abstract

Face recognition is a crucial topic in data science and biometric security, with applications spanning military, finance, and retail industries. This paper explores the implementation of sparse Principal Component Analysis (PCA) using the Proximal Gradient method (also known as ISTA) and the Runge-Kutta numerical methods. To address the face recognition problem, we integrate sparse PCA with either the k-nearest neighbor method or the kernel ridge regression method. Experimental results demonstrate that combining sparse PCA-solved via the Proximal Gradient method or the Runge-Kutta numerical approach-with a classification system yields higher accuracy compared to standard PCA. Additionally, we observe that the Runge-Kutta-based sparse PCA computation consistently outperforms the Proximal Gradient method in terms of speed.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{tran2025novel,
  title  = {Novel sparse PCA method via Runge Kutta numerical method(s) for face recognition},
  author = {Loc Hoang Tran and Luong Anh Tuan Nguyen},
  year   = {2025},
  eprint = {2504.01035},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2504.01035v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2504.01035.svg)](https://codeofpaper.com/paper/2504.01035)

Discussion