Complete large margin linear discriminant analysis using mathematical programming approach

Authors:
Xiaobo Chen;Jian Yang;David Zhang;Jun Liang
Affiliations:
School of Computer Science and Telecommunication Engineering, Jiangsu University, Zhenjiang 212013, PR China and School of Computer Science and Technology, Nanjing University of Science and Techno ...;School of Computer Science and Technology, Nanjing University of Science and Technology, Nanjing 210094, PR China;Biometrics Research Centre, Department of Computing, Hong Kong Polytechnic University, Hong Kong;Automotive Engineering Research Institute, Jiangsu University, Zhenjiang 212013, PR China
Venue:
Pattern Recognition
Year:
2013

Citing 23
Cited 0

An Optimal Transformation for Discriminant and Principal Component Analysis

IEEE Transactions on Pattern Analysis and Machine Intelligence
Support-Vector Networks

Machine Learning
Fractional-Step Dimensionality Reduction

IEEE Transactions on Pattern Analysis and Machine Intelligence
Multiclass Linear Dimension Reduction by Weighted Pairwise Fisher Criteria

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Tutorial on Support Vector Machines for Pattern Recognition

Data Mining and Knowledge Discovery
Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection

ECCV '96 Proceedings of the 4th European Conference on Computer Vision-Volume I - Volume I
The concave-convex procedure

Neural Computation
The CMU Pose, Illumination, and Expression (PIE) Database

FGR '02 Proceedings of the Fifth IEEE International Conference on Automatic Face and Gesture Recognition
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)
KPCA Plus LDA: A Complete Kernel Fisher Discriminant Framework for Feature Extraction and Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence
Uncorrelated linear discriminant analysis based on weighted pairwise Fisher criterion

Pattern Recognition
Letters: Training robust support vector machine with smooth Ramp loss in the primal space

Neurocomputing
Geometric Mean for Subspace Selection

IEEE Transactions on Pattern Analysis and Machine Intelligence
A least squares formulation for a class of generalized eigenvalue problems in machine learning

ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Feature extraction based on Laplacian bidirectional maximum margin criterion

Pattern Recognition
Rapid and brief communication: Uncorrelated heteroscedastic LDA based on the weighted pairwise Chernoff criterion

Pattern Recognition
A scalable two-stage approach for a class of dimensionality reduction techniques

Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Dimensionality Reduction by Minimal Distance Maximization

ICPR '10 Proceedings of the 2010 20th International Conference on Pattern Recognition
Max-Min Distance Analysis by Using Sequential SDP Relaxation for Dimension Reduction

IEEE Transactions on Pattern Analysis and Machine Intelligence
A multi-manifold discriminant analysis method for image feature extraction

Pattern Recognition
Recursive projection twin support vector machine via within-class variance minimization

Pattern Recognition
Recursive "concave-convex" Fisher Linear Discriminant with applications to face, handwritten digit and terrain recognition

Pattern Recognition
Face recognition using recursive Fisher linear discriminant

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we develop a novel dimensionality reduction (DR) framework coined complete large margin linear discriminant analysis (CLMLDA). Inspired by several recently proposed DR methods, CLMLDA constructs two mathematical programming models by maximizing the minimum distance between each class center and the total class center respectively in the null space of within-class scatter matrix and its orthogonal complementary space. In this way, CLMLDA not only makes full use of the discriminative information contained in the whole feature space but also overcome the weakness of linear discriminant analysis (LDA) in dealing with the class separation problem. The solutions of CLMLDA follow from solving two nonconvex optimization problems, each of which is transformed to a series of convex quadratic programming problems by using the constrained concave-convex procedure first, and then solved by off-the-shelf optimization toolbox. Experiments on both toy and several publicly available databases demonstrate its feasibility and effectiveness.