Face recognition algorithm based on compressed sensing and sparse representation is hotly argued in these years. The
scheme of this algorithm increases recognition rate as well as anti-noise capability. However, the computational cost is
expensive and has become a main restricting factor for real world applications. In this paper, we introduce a
GPU-accelerated hybrid variant of face recognition algorithm named parallel face recognition algorithm (pFRA). We
describe here how to carry out parallel optimization design to take full advantage of many-core structure of a GPU. The
pFRA is tested and compared with several other implementations under different data sample size. Finally, Our pFRA,
implemented with NVIDIA GPU and Computer Unified Device Architecture (CUDA) programming model, achieves a
significant speedup over the traditional CPU implementations.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.