کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
536001 870424 2011 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Homomorphic filtering based illumination normalization method for face recognition
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
Homomorphic filtering based illumination normalization method for face recognition
چکیده انگلیسی

The appearance of a face image is severely affected by illumination conditions that will hinder the automatic face recognition process. To recognize faces under varying lighting conditions, a homomorphic filtering-based illumination normalization method is proposed in this paper. In this work, the effect of illumination is effectively reduced by a modified implementation of homomorphic filtering whose key component is a Difference of Gaussian (DoG) filter, and the contrast is enhanced by histogram equalization. The resulted face image is not only reduced illumination effect but also preserved edges and details that will facilitate the further face recognition task. Among others, our method has the following advantages: (1) neither does it need any prior information of 3D shape or light sources, nor many training samples thus can be directly applied to single training image per person condition; and (2) it is simple and computationally fast because there are mature and fast algorithms for the Fourier transform used in homomorphic filter. The Eigenfaces method is chosen to recognize the normalized face images. Experimental results on the Yale face database B and the CMU PIE face database demonstrate the significant performance improvement of the proposed method in the face recognition system for the face images with large illumination variations.


► A homomorphic filtering-based illumination normalization method is proposed.
► We replaced Butterworth high-pass filter normally used by a DoG filter.
► Then, we add histogram equalization and improve performance more than 4 times.
► We do not need any prior information of 3D shape or light sources or many samples.
► The method is simple and computationally fast for fast Fourier transform algorithm.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pattern Recognition Letters - Volume 32, Issue 10, 15 July 2011, Pages 1468–1479
نویسندگان
, ,