Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

An Approach for Unconstrained Face Recognition Algorithm Using Viola-Jones Method


Affiliations
1 Department of ECE, Dhanalakshmi Srinivasan College of Engineering, Coimbatore, India
     

   Subscribe/Renew Journal


This address the problem of unconstrained face recognition from remotely acquired images. The main factors that make this problem challenging are image degradation due to blur, and appearance variations due to illumination and pose. In this paper, we address the problems of blur and illumination. We show that the set of all images obtained by blurring a given image forms a convex set. Based on this set theoretic characterization, we propose a blur-robust algorithm whose main step involves solving simple convex optimization problems. We do not assume any parametric form for the blur kernels, however, if this information is available it can be easily incorporated into our algorithm.

Keywords

Direct Recognition of Blurred and Illuminated Faces, Remote Biometrics, Unconstrained Face Recognition.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 218

PDF Views: 5




  • An Approach for Unconstrained Face Recognition Algorithm Using Viola-Jones Method

Abstract Views: 218  |  PDF Views: 5

Authors

Y. Faizal
Department of ECE, Dhanalakshmi Srinivasan College of Engineering, Coimbatore, India
Konguvel
Department of ECE, Dhanalakshmi Srinivasan College of Engineering, Coimbatore, India

Abstract


This address the problem of unconstrained face recognition from remotely acquired images. The main factors that make this problem challenging are image degradation due to blur, and appearance variations due to illumination and pose. In this paper, we address the problems of blur and illumination. We show that the set of all images obtained by blurring a given image forms a convex set. Based on this set theoretic characterization, we propose a blur-robust algorithm whose main step involves solving simple convex optimization problems. We do not assume any parametric form for the blur kernels, however, if this information is available it can be easily incorporated into our algorithm.

Keywords


Direct Recognition of Blurred and Illuminated Faces, Remote Biometrics, Unconstrained Face Recognition.