Comments on “Efficient and Robust Feature Extraction by Maximum Margin Criterion”

Authors:
Jun Liu;Songcan Chen;Xiaoyang Tan;Daoqiang Zhang
Affiliations:
Nanjing Univ. of Aeronaut. & Astronautics, Nanjing;-;-;-
Venue:
IEEE Transactions on Neural Networks
Year:
2007

Citing 0
Cited 7

Sparsity preserving projections with applications to face recognition

Pattern Recognition
Sparsity preserving discriminant analysis for single training image face recognition

Pattern Recognition Letters
Locality preserving discriminant projections

ICIC'09 Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications
Locality preserving discriminant projections for face and palmprint recognition

Neurocomputing
Maximum Margin Multisurface Support Tensor Machines with application to image classification and segmentation

Expert Systems with Applications: An International Journal
Discriminant sparse neighborhood preserving embedding for face recognition

Pattern Recognition
Extracting sparse error of robust PCA for face recognition in the presence of varying illumination and occlusion

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

The goal of this comment is to first point out two loopholes in the paper by Li (2006): (1) so-designed efficient maximal margin criterion (MMC) algorithm for small sample size (SSS) problem is problematic and (2) the discussion on the equivalence with the null-space-based methods in SSS problem does not hold. Then, we will present a really efficient MMC algorithm for SSS problem.