用龙格-库塔法改进稀疏PCA，提升人脸识别速度与准确率
Novel sparse PCA method via Runge Kutta numerical method(s) for face recognition
- 用龙格-库塔数值方法求解稀疏PCA，替代传统梯度法
- 实验显示该方法在人脸分类中准确率更高，且计算速度更快
- 适合需要高效处理高维图像数据的研究者或工程师
人脸识别是数据科学与生物特征安全中的关键问题，广泛应用于军事、金融和零售领域。本文探讨了利用近端梯度法（ISTA）和龙格-库塔数值方法实现稀疏主成分分析（Sparse PCA）的可行性。为解决人脸识别问题，将稀疏PCA与k近邻或核岭回归分类器结合。实验结果表明，采用近端梯度法或龙格-库塔法求解的稀疏PCA配合分类系统，在识别准确率上优于标准PCA。此外，基于龙格-库塔法的稀疏PCA计算在速度上持续优于近端梯度法。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。