An Efficient Feature Extraction Method, Global Between Maximum and Local Within Minimum, and Its Applications | Zendy

Lei Wang | Zendy; Jiangshe Zhang | Zendy; Fei Zang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Efficient Feature Extraction Method, Global Between Maximum and Local Within Minimum, and Its Applications

Author(s) -

Lei Wang,

Jiangshe Zhang,

Fei Zang

Publication year - 2011

Publication title -

mathematical problems in engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.262

H-Index - 62

eISSN - 1026-7077

pISSN - 1024-123X

DOI - 10.1155/2011/176058

Subject(s) - preprocessor , face (sociological concept) , computer science , set (abstract data type) , feature extraction , pattern recognition (psychology) , feature (linguistics) , data mining , data set , visualization , facial recognition system , artificial intelligence , algorithm , social science , linguistics , philosophy , sociology , programming language

Feature extraction plays an important role in preprocessing procedure in dealing with small sample size problems. Considering the fact that LDA, LPP, and many other existing methods are confined to one case of the data set. To solve this problem, we propose an efficient method in this paper, named global between maximum and local within minimum. It not only considers the global structure of the data set, but also makes the best of the local geometry of the data set through dividing the data set into four domains. This method preserves relations of the nearest neighborhood, as well as demonstrates an excellent performance in classification. Superiority of the proposed method in this paper is manifested in many experiments on data visualization, face representative, and face recognition

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research