A computationally efficient scheme for feature extraction with kernel discriminant analysis

作者：

Highlights：

• We propose a complexity-reduced scheme for the kernel discriminant analysis.

• The proposed scheme does not cause degradation of recognition accuracy performance.

• The core is the transformation of the original problem into a linear equation problem.

• We further address the incorporation of regularization into the proposed scheme.

摘要

Highlights•We propose a complexity-reduced scheme for the kernel discriminant analysis.•The proposed scheme does not cause degradation of recognition accuracy performance.•The core is the transformation of the original problem into a linear equation problem.•We further address the incorporation of regularization into the proposed scheme.

论文关键词：Kernel discriminant analysis,Computational complexity,Lagrange method,Regularization,Pattern recognition

论文评审过程：Received 2 March 2015, Revised 13 July 2015, Accepted 22 August 2015, Available online 2 September 2015, Version of Record 5 November 2015.

论文官网地址：https://doi.org/10.1016/j.patcog.2015.08.021