Fisher Discrimination Sparse Learning Based On Graph Embedding for Image Classification

Fisher discrimination dictionary sparse learning (FDDL) has led to interesting image recognition results where the Fisher discrimination criterion is subject to the coding coefficients. But Fisher discrimination criterion has the limitations of data distribution assumptions and does not consider the local manifold structure of the coding coefficients. In this paper, we will introduce a novel Fisher discrimination sparse learning based on graph embedding (GE-FDSL) scheme. First, we utilizes graph embedding framework to define intra-class compact matrix and inter-class separable matrix imposed on the coding coefficients of training samples to preserving the intra-class compactness and the inter-class separability for the training samples, which simultaneously consider the local manifold structure and label information of the coding coefficients. Then, a new Fisher discrimination criterion based on graph embedding is added to the object function of the sparse coding problem so that the coding coefficients have more discriminative power, where the dictionary atoms in the sparse coding model are associated with the class labels so that the reconstructed error is applied to classification. This method can learn a structured dictionary and sparse coefficients, and in the meantime, it will also keep the local manifold structure of the coding coefficients. So, they will be more discriminative. Experiments on many image databases show that the our algorithm has good classification and recognition performance.