Abstract
Fisher’s linear discriminant analysis (FLDA) has been used in many pattern recognition applications. However, this method cannot be applied for solving the pattern recognition problems when the within-class scatter matrix is singular, i.e., when the so-called small sample size problem occurs. Many FLDA variants that have been proposed in the past to circumvent this problem either suffer from excessive computational load when patterns have a large dimension or lose some useful discriminant information. In this paper, a new systematic framework for the pattern recognition of datasets with linearly independent samples is developed. Within this framework, a discriminant model, in which the samples of the individual classes of a dataset lie on parallel hyperplanes and project to single distinct points of a discriminant subspace of the underlying input space, is shown to exist. Based on this model, three algorithms that do not encounter the adverse effects of the small sample size (SSS) problem are developed to obtain such a discriminant subspace for a given dataset with linearly independent samples. A kernelized algorithm is also developed for the discriminant analysis of datasets for which the samples are not linearly independent. Simulation results are provided to examine the validity of the proposed discriminant model and to demonstrate the effectiveness, both in terms of complexity and classification accuracy, of the linear and nonlinear algorithms designed based on the proposed model.
Similar content being viewed by others
References
Y. Bing, J. Lianfu, C. Ping, A new LDA-based method for face recognition, in Proc. 16th Int. Conf. Pattern Recognition, vol. 1 (2002), pp. 168–171
C. Burges, A Tutorial on support vector machine for pattern recognition. Data Min. Knowl. Discov. 2, 121–167 (1998)
H. Cevikalp, M. Neamtu, M. Wilkes, Discriminative common vector method with kernels. IEEE Trans. Neural Netw. 17(6), 1550–156 (2006)
D.-G. Chen, Q. He, X.Z. Wang, On linear separability of data sets in feature space. Neurocomputing 70(13–15), 2441–8 (2007)
D.-Q. Dai, P.C. Yuen, Regularized discriminant analysis and its application to face recognition. Pattern Recognit. 36, 845–847 (2003)
K.-L. Du, M.N.S. Swamy, Neural Networks in a Softcomputing Framework (Springer, London, 2006)
K. Fukunaga, Introduction to Statistical Pattern Recognition, 2nd edn. (Academic Press, San Diego, 1990)
H. Gao, W.D. James, Why direct LDA is not equivalent to LDA. Pattern Recognit. 39, 1002–1996 (2006)
P. Howland, M. Jeon, H. Park, Structure preserving dimension reduction for clustered text data based on the generalized singular value decomposition. SIAM J. Matrix Anal. Appl. 25(1), 165–179 (2003)
R. Huang, Q. Liu, H. Lu, S. Ma, Solving the small size problem of LDA, in Proc. 16th Int. Conf. Pattern Recognition, vol. 3 (2002), pp. 29–32
C. Lee, D. Landgrebe, Analyzing high-dimensional multispectral data. IEEE Trans. Geosci. Remote Sens. 31(7), 792–800 (1993)
J. Lu, K.N. Plataniotis, A.N. Venetsanopoulos, J. Wang, An efficient kernel discriminant analysis method. Pattern Recognit. 38(10), 1788–1790 (2005)
C.H. Park, H. Park, A comparison of generalized linear discriminant analysis algorithms. Pattern Recognit. 41, 1083–1097 (2008)
B. Schölkopf, A.J. Smola, Learning with Kernels—Support Vector Machines, Regularization, Optimization, and Beyond (MIT, Cambridge, 2002)
G. Strang, Linear Algebra and Its Application, 3rd edn. (MIT, Cambridge, 1998)
D.L. Swets, J. Weng, Using discriminant eigenfeatures for image retrieval. IEEE Trans. Pattern Anal. Mach. Intell. 18(8), 831–836 (1996)
Wei Wu, M.O. Ahmad, S. Samadi, Discriminant analysis based on modified generalized singular value decomposition and its numerical error analysis. IET Comput. Vis. 3(3), 159–173 (2009)
J. Yang, A.F. Frangi, J. Yang, D. Zhang, Z. Jin, KPCA plus LDA: a complete kernel fisher discriminant framework for feature extraction and recognition. IEEE Trans. Pattern Anal. Mach. Intell. 27(2), 230–244 (2005)
J. Yang, D. Zhang, J.-Y. Yang, A generalised K-L expansion method which can deal with small sample size and high-dimensional problems. Pattern Anal. Appl. 6, 47–54 (2003)
J. Ye, R. Janardan, C.H. Park, H. Park, An optimization criterion for generalized discriminant analysis on under sampled problems. IEEE Trans. Pattern Anal. Mach. Intell. 26(8), 982–994 (2004)
J. Ye, T. Xiong, Q. Li, R. Janardan, J. Bi, V. Cherkassky, C. Kambhamettu, Efficient model selection for regularized linear discriminant analysis, in Proc. International Conference on Information and Knowledge Management (2006), pp. 5–11
H. Yu, J. Yang, A direct LDA algorithm for high-dimensional data with application to face recognition. Pattern Recognit. 34, 2067–2070 (2001)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wu, W., Ahmad, M.O. A Discriminant Model for the Pattern Recognition of Linearly Independent Samples. Circuits Syst Signal Process 31, 669–687 (2012). https://doi.org/10.1007/s00034-011-9337-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00034-011-9337-2