Sciweavers

19 search results - page 2 / 4
» Null space versus orthogonal linear discriminant analysis
Sort
View
CVPR
2000
IEEE
14 years 7 months ago
A Robust and Efficient Motion Segmentation Based on Orthogonal Projection Matrix of Shape Space
A novel algorithm for motion segmentation is proposed. The algorithm uses the fact that shape of an object with homogeneous motion is represented as 4 dimensional linear space. Th...
Naoyuki Ichimura
ACII
2005
Springer
13 years 6 months ago
A Novel Regularized Fisher Discriminant Method for Face Recognition Based on Subspace and Rank Lifting Scheme
The null space N(St) of total scatter matrix St contains no useful information for pattern classification. So, discarding the null space N(St) results in dimensionality reduction ...
Wen-Sheng Chen, Pong Chi Yuen, Jian Huang, Jian-Hu...
PAMI
2008
162views more  PAMI 2008»
13 years 4 months ago
Bayes Optimality in Linear Discriminant Analysis
We present an algorithm which provides the one-dimensional subspace where the Bayes error is minimized for the C class problem with homoscedastic Gaussian distributions. Our main ...
Onur C. Hamsici, Aleix M. Martínez
ICPR
2010
IEEE
13 years 7 months ago
A Discriminative and Heteroscedastic Linear Feature Transformation for Multiclass Classification
This paper presents a novel discriminative feature transformation, named full-rank generalized likelihood ratio discriminant analysis (fGLRDA), on the grounds of the likelihood ra...
Hung-Shin Lee, Hsin-Min Wang, Berlin Chen
ICPR
2002
IEEE
14 years 6 months ago
Solving the Small Sample Size Problem of LDA
The small sample size problem is often encountered in pattern recognition. It results in the singularity of the within-class scatter matrix Sw in Linear Discriminant Analysis (LDA...
Rui Huang, Qingshan Liu, Hanqing Lu, Songde Ma