Sciweavers

8 search results - page 1 / 2
» Linear discriminant analysis using rotational invariant L1 n...
Sort
View
IJON
2010
150views more  IJON 2010»
13 years 2 months ago
Linear discriminant analysis using rotational invariant L1 norm
Linear Discriminant Analysis (LDA) is a well-known scheme for supervised subspace learning. It has been widely used in the applications of computer vision and pattern recognition....
Xi Li, Weiming Hu, Hanzi Wang, Zhongfei Zhang
CVPR
2011
IEEE
13 years 18 days ago
Scale and Rotation Invariant Matching Using Linearly Augmented Trees
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
Hao Jiang, Tai-Peng Tian, Stan Sclaroff
AAAI
2008
13 years 6 months ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han
ICDM
2007
IEEE
159views Data Mining» more  ICDM 2007»
13 years 8 months ago
Spectral Regression: A Unified Approach for Sparse Subspace Learning
Recently the problem of dimensionality reduction (or, subspace learning) has received a lot of interests in many fields of information processing, including data mining, informati...
Deng Cai, Xiaofei He, Jiawei Han
NECO
2008
101views more  NECO 2008»
13 years 4 months ago
On the Classification Capability of Sign-Constrained Perceptrons
The perceptron (also referred to as McCulloch-Pitts neuron, or linear threshold gate) is commonly used as a simplified model for the discrimination and learning capability of a bi...
Robert A. Legenstein, Wolfgang Maass