Fast Face Recognition Via Sparse Coding and Extreme Learning Machine

Abstract

Most Face Recognition Approaches Developed So Far Regard the Sparse Coding as One of the Essential Means, While the Sparse Coding Models Have Been Hampered by the Extremely Expensive Computational Cost in the Implementation. in This Paper, a Novel Scheme for the Fast Face Recognition is Presented Via Extreme Learning Machine (Elm) and Sparse Coding. the Common Feature Hypothesis is First Introduced to Extract the Basis Function from the Local Universal Images, and Then the Single Hidden Layer Feedforward Network (Slfn) is Established to Simulate the Sparse Coding Process for the Face Images by Elm Algorithm. Some Developments Have Been Done to Maintain the Efficient Inherent Information Embedding in the Elm Learning. the Resulting Local Sparse Coding Coefficient Will Then Be Grouped into the Global Representation and Further Fed into the Elm Ensemble Which is Composed of a Number of Slfns for Face Recognition. the Simulation Results Have Shown the Good Performance in the Proposed Approach that Could Be Comparable to the State-Of-The-Art Techniques at a Much Higher Speed. © 2013 Springer Science+business Media New York.

Department(s)

Engineering Management and Systems Engineering

Keywords and Phrases

Common feature hypothesis; Extreme learning machine; Face recognition; Sparse coding

International Standard Serial Number (ISSN)

1866-9964; 1866-9956

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2024 Springer, All rights reserved.

Publication Date

01 Jan 2014

Link to Full Text

Share

 
COinS