Heteroscedastic Max-Min Distance Analysis

Bing Su, Xiaoqing Ding, Changsong Liu, Ying Wu; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2015, pp. 4539-4547

Abstract


Many discriminant analysis methods such as LDA and HLDA actually maximize the average pairwise distances between classes, which often causes the class separation problem. Max-min distance analysis (MMDA) addresses this problem by maximizing the minimum pairwise distance in the latent subspace, but it is developed under the homoscedastic assumption. This paper proposes Heteroscedastic MMDA (HMMDA) methods that explore the discriminative information in the difference of intra-class scatters for dimensionality reduction. WHMMDA maximizes the minimal pairwise Chenoff distance in the whitened space. OHMMDA incorporates this objective and the minimization of class compactness into a trace quotient formulation and imposes an orthogonal constraint to the final transformation, which can be solved by a bisection search algorithm. Two variants of OHMMDA are further proposed to encode the margin information. Experiments on several UCI Machine Learning datasets and the Yale Face database demonstrate the effectiveness of the proposed HMMDA methods.

Related Material


[pdf]
[bibtex]
@InProceedings{Su_2015_CVPR,
author = {Su, Bing and Ding, Xiaoqing and Liu, Changsong and Wu, Ying},
title = {Heteroscedastic Max-Min Distance Analysis},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2015}
}