Fast Feature Extraction Approach for Multi-Dimension Feature Space Problems

We proposed a fast feature extraction-approach denoted FSOM utilizing self organizing map (SOM). FSOM overcomes the slowness of traditional SOM search algorithm. We investigated the superiority of the new approach using two lip reading data sets which require a limited feature space as the experiments showed. In this paper, we continue FSOM investigation but using an RGB face recognition database across different poses and different lighting conditions. We believe that such data sets require multi-dimensional feature space to extract the information included in the original data in an effective way especially if you have a big number of classes. Again, we show here how FSOM reduces the feature extraction time of traditional SOM drastically while preserving same SOM's qualities

[1]  Ah Chung Tsoi,et al.  Face recognition: a convolutional neural-network approach , 1997, IEEE Trans. Neural Networks.

[2]  I. Jolliffe Principal Component Analysis , 2002 .

[3]  Teuvo Kohonen,et al.  Self-Organizing Maps , 2010 .

[4]  David Austin,et al.  Visual Object Recognition using Template Matching , 2004 .

[5]  Terence Sim,et al.  The CMU Pose, Illumination, and Expression Database , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Samuel Kaski,et al.  Dimensionality reduction by random mapping: fast similarity computation for clustering , 1998, 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227).

[7]  Rin-ichiro Taniguchi,et al.  Fast Competition Approach using Self Organizing Map for Lip-Reading Applications , 2006, The 2006 IEEE International Joint Conference on Neural Network Proceedings.

[8]  William W. Hsieh,et al.  Simplified nonlinear principal component analysis , 2003, Proceedings of the International Joint Conference on Neural Networks, 2003..

[9]  Yajie Tian,et al.  Handbook of face recognition , 2003 .