Name
Abstract | ||
|---|---|---|
Slow feature analysis (SFA) extracts slowly varying features out of the input data and has been successfully applied on pattern recognition. However, SFA heavily relies on the constructed time series when SFA is applied on databases that neither have obvious temporal structure nor have label information. Traditional SFA constructs time series based on k-nearest neighborhood (k-NN) criterion. Specifically, the time series set constructed by k-NN criterion is likely to include noisy time series or lose suitable time series because the parameter k is difficult to determine. To overcome these problems, a method called adaptive unsupervised slow feature analysis (AUSFA) is proposed. First, AUSFA designs an adaptive criterion to generate time series for characterizing submanifold. The constructed time series have two properties: (1) two points of time series lie on the same submanifold and (2) the submanifold of the time series is smooth. Second, AUSFA seeks projections that simultaneously minimize the slowness scatter and maximize the fastness scatter to extract slow discriminant features. Extensive experimental results on three benchmark face databases demonstrate the effectiveness of our proposed method. (C) 2015 SPIE and IS&T |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1117/1.JEI.24.2.023021 | JOURNAL OF ELECTRONIC IMAGING |
Keywords | Field | DocType |
slow feature analysis,manifold learning,adaptive criterion,feature extraction,face recognition | Facial recognition system,Computer vision,Pattern recognition,Computer science,Discriminant,Feature extraction,Submanifold,Artificial intelligence,Nonlinear dimensionality reduction,Slowness,Pattern recognition (psychology) | Journal |
Volume | Issue | ISSN |
24 | 2 | 1017-9909 |
Citations | PageRank | References |
0 | 0.34 | 29 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xingjian Gu | 1 | 68 | 5.05 |
| Chuancai Liu | 2 | 162 | 18.87 |
| Wang Sheng | 3 | 8 | 5.80 |