A direct kernel uncorrelated discriminant analysis algorithm

doi:10.1109/LSP.2007.896441

Return

A direct kernel uncorrelated discriminant analysis algorithm

2007-10-01

PRE

Xuelian Yu *

Xuegang Wang

Benyong Liu

DOI：10.1109/LSP.2007.896441

Original

Original request for help

Save

Abstract

En 中文

In this letter, we present a new formulation for uncorrelated discriminant analysis (UDA) in some high-dimensional feature space and then propose an efficient UDA algorithm using kernel technique. Unlike some existing UDA algorithms, which solve uncorrelated discriminant vectors one at a time, the proposed algorithm is able to extract all the uncorrelated. discriminant vectors simultaneously in the feature space and does not suffer the small sample size problem. Experimental results show that the proposed method is very competitive in comparison with some existing discriminant analysis algorithms, in terms of recognition rate and robustness with respect to kernel parameters.

Keywords:

kernel technique

small sample size (SSS) problem

uncorrelated discriminimt analysis (UDA)

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.