Max-Min Distance Analysis by Using Sequential SDP Relaxation for Dimension Reduction

Authors:
Wei Bian;Dacheng Tao
Affiliations:
University of Technology, Sydney;University of Technology, Sydney
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
2011

Citing 0
Cited 44

Face Recognition Using Kernel UDP

Neural Processing Letters
Recognition of adult images, videos, and web page bags

ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special section on ACM multimedia 2010 best paper candidates, and issue on social media
Column subset selection for active learning in image classification

Neurocomputing
A method using long digital straight segments for fingerprint recognition

Neurocomputing
Graph based transductive learning for cartoon correspondence construction

Neurocomputing
Supervised sparse representation method with a heuristic strategy and face recognition experiments

Neurocomputing
Efficient image matching using weighted voting

Pattern Recognition Letters
Scale invariant image matching using triplewise constraint and weighted voting

Neurocomputing
An energy model approach to people counting for abnormal crowd behavior detection

Neurocomputing
Human computer interactions for converting color images to gray

Neurocomputing
CIPCA: Complete-Information-based Principal Component Analysis for interval-valued data

Neurocomputing
Interactive cartoon reusing by transfer learning

Signal Processing
Sparse transfer learning for interactive video search reranking

ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Learning a distance metric by empirical loss minimization

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Regularized locality preserving discriminant analysis for face recognition

Neurocomputing
Kernel approximately harmonic projection

Neurocomputing
Two dimensional principal components of natural images and its application

Neurocomputing
A novel face recognition method based on sub-pattern and tensor

Neurocomputing
Stochastic neighbor projection on manifold for feature extraction

Neurocomputing
Fisher Difference Discriminant Analysis: Determining the Effective Discriminant Subspace Dimensions for Face Recognition

Neural Processing Letters
Query difficulty estimation for image retrieval

Neurocomputing
Maxi-Min discriminant analysis via online learning

Neural Networks
Kinect image classification using LLC

Proceedings of the 4th International Conference on Internet Multimedia Computing and Service
Integrating Spectral Kernel Learning and Constraints in Semi-Supervised Classification

Neural Processing Letters
Extracting elite pairwise constraints for clustering

Neurocomputing
LF-EME: Local features with elastic manifold embedding for human action recognition

Neurocomputing
Joint geometry and variability for image recognition

Neurocomputing
Face identification using reference-based features with message passing model

Neurocomputing
Complete large margin linear discriminant analysis using mathematical programming approach

Pattern Recognition
Fast multi-view segment graph kernel for object classification

Signal Processing
Multiple kernel local Fisher discriminant analysis for face recognition

Signal Processing
Low-rank quadratic semidefinite programming

Neurocomputing
Towards the Optimal Discriminant Subspace

WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Evaluation of weighted Fisher criteria for large category dimensionality reduction in application to Chinese handwriting recognition

Pattern Recognition
From the idea of "sparse representation" to a representation-based transformation method for feature extraction

Neurocomputing
Facial expression recognition based on Hessian regularized support vector machine

Proceedings of the Fifth International Conference on Internet Multimedia Computing and Service
Exploiting fisher and fukunaga-koontz transforms in chernoff dimensionality reduction

ACM Transactions on Knowledge Discovery from Data (TKDD)
Robust probabilistic tensor analysis for time-variant collaborative filtering

Neurocomputing
Regularized least squares fisher linear discriminant with applications to image recognition

Neurocomputing
Recognizing architecture styles by hierarchical sparse coding of blocklets

Information Sciences: an International Journal
Similar handwritten Chinese character recognition by kernel discriminative locality alignment

Pattern Recognition Letters
A Rayleigh-Ritz style method for large-scale discriminant analysis

Pattern Recognition
A hierarchical structure of extreme learning machine (HELM) for high-dimensional datasets with noise

Neurocomputing
Face Recognition and Micro-expression Recognition Based on Discriminant Tensor Subspace Analysis Plus Extreme Learning Machine

Neural Processing Letters

Quantified Score

Hi-index	0.14

Visualization

Abstract

We propose a new criterion for discriminative dimension reduction, max-min distance analysis (MMDA). Given a data set with C classes, represented by homoscedastic Gaussians, MMDA maximizes the minimum pairwise distance of these C classes in the selected low-dimensional subspace. Thus, unlike Fisher's linear discriminant analysis (FLDA) and other popular discriminative dimension reduction criteria, MMDA duly considers the separation of all class pairs. To deal with general case of data distribution, we also extend MMDA to kernel MMDA (KMMDA). Dimension reduction via MMDA/KMMDA leads to a nonsmooth max-min optimization problem with orthonormal constraints. We develop a sequential convex relaxation algorithm to solve it approximately. To evaluate the effectiveness of the proposed criterion and the corresponding algorithm, we conduct classification and data visualization experiments on both synthetic data and real data sets. Experimental results demonstrate the effectiveness of MMDA/KMMDA associated with the proposed optimization algorithm.