کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
530330 869760 2014 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Equidistant prototypes embedding for single sample based face recognition with generic learning and incremental learning
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
Equidistant prototypes embedding for single sample based face recognition with generic learning and incremental learning
چکیده انگلیسی


• Equidistant prototypes embedding that maximizes the minimum one-against-the-rest margin between the classes.
• A parameter-free model for the practical usage on one sample problem.
• Effective generic learning based on the training samples collected from a different database.
• An incremental learning algorithm that makes the model efficiently updated.
• Extensive experimental results on the Extended Yale B, CMU PIE, AR, and FERET databases.

We develop a parameter-free face recognition algorithm which is insensitive to large variations in lighting, expression, occlusion, and age using a single gallery sample per subject. We take advantage of the observation that equidistant prototypes embedding is an optimal embedding that maximizes the minimum one-against-the-rest margin between the classes. Rather than preserving the global or the local structure of the training data, our method, called linear regression analysis (LRA), applies a least-square regression technique to map gallery samples to the equally distant locations, regardless of the true structure of training data. Further, a novel generic learning method, which maps the intraclass facial differences of the generic faces to the zero vectors, is incorporated to enhance the generalization capability of LRA. Using this novel method, learning based on only a handful of generic classes can largely improve the face recognition performance, even when the generic data are collected from a different database and camera set-up. The incremental learning based on the Greville algorithm makes the mapping matrix efficiently updated from the newly coming gallery classes, training samples, or generic variations. Although it is fairly simple and parameter-free, LRA, combined with commonly used local descriptors, such as Gabor representation and local binary patterns, outperforms the state-of-the-art methods for several standard experiments on the Extended Yale B, CMU PIE, AR, and FERET databases.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pattern Recognition - Volume 47, Issue 12, December 2014, Pages 3738–3749
نویسندگان
, , , ,