250 likes | 476 Views
Preprocessing Overview. Preprocessing to enhance recognition performance in the presence of: Illumination variations Pose /expression/scale variations - Resolution enhancement (deblurring) Stand-alone recognition system Preprocessing/recognition results
E N D
Preprocessing Overview • Preprocessing to enhance recognition performance in the presence of: • Illumination variations • Pose/expression/scale variations - Resolutionenhancement (deblurring) • Stand-alone recognition system • Preprocessing/recognition results - Face Recognition Grand Challenge (NIST)
Face Recognition Problem: Current state-of-the-art face recognition systems degrade significantly in performance due to variations in pose, illumination, and blurring. Solution: PREPROCESSING RESTORATION/ ENHANCEMENT FACE RECOGNITION SYSTEM IMAGE CAPTURE POSE CORRECTION due to mismatch in facial position, facial expression and scale ILLUMINATION CORRECTIONdue to mismatch in lighting conditions in both indoor and outdoor environments DEBLURRINGdue to mismatch in camera focus, camera lenses, camera resolution and motion blur
Highlights of the approach • No a priori information with regards to pose orientation, camera parameters, etc • No laser scanned images for 3D reconstruction • No manual detection of feature points • Preprocessing & Stand-Alone Recognition
Principle • Find a function which maps a given test (probe) image into the correct train (gallery) image • Approach where M is the number of training images • Select that is maximally bijective
domain (X) f range(X) Y X One to One and Onto (bijection) Recognition Principle • A function ’f ‘ is found which maps points in the test (probe) to equivalent points in the train (gallery) where X = Test image (domain) Y = Train image (co-domain) = Bijective function mapping X Y Test Train
where Y = Train image (domain) X = Test image (co-domain) = Bijective function mapping Y X Inverse Estimation • A function ’g ‘ is found which maps points in the train (gallery) to equivalent points in the test (probe) domain (Y) g range(Y) Y X Test Train
Blue,Green,Cyan Red Measure of Bijectivity X f Y Partition X where n is the total number of distinct blocks in X
g X Y Blue,Green,Cyan Red Partition Y Measure of Bijectivity where p is the total number of distinct blocks in Y
= Forward (test train) = Backward (train test) The Bijectivity score is given by: = Adaptive Forward (test train) = Adaptive Backward (train test) Measure of Bijectivity = constants and
Mapping Properties Train Image No.1
Face recognition performance Table 4.2 Yale Results-Stand Alone Recognition-II
Face recognition performance Table 4.4 PIE Database-Stand Alone Recognition PCA-based Approach recognition accuracy: 5.88 %
Preprocessing for Illumination Correction Training Test Preprocessed
Preprocessing for Illumination Correction • Algorithm based on image adaptive least squares illumination correction Training image A Testing image B Adaptive segmentation Least squares estimate of illumination Image A illuminated as B Image B illuminated as A
Preprocessing ResultsIllumination Correction Enrollment : Process of accepting the image and creating a feature set for recognition.
Comparison with Existing Methods • 3D morphable models : • Good results (FRVT 2002). • Very complex, computationally expensive, • manual labeling of features 1. T. Vetter and V. Blanz, “Face Recognition Based on Fitting a 3D Morphable Model,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, no. 9, pp. 1063--1075, Sept. 2003.
train test Vector Field Representation of f Preprocessed Test Image Preprocessing Example
Preprocessing Example Notre Dame Database
Preprocessing Example Notre Dame Database
With the correct gallery Bijective Mapping Gallery Probe White Region measure of bijectivity (52.91%) Recognition Example
With the incorrect gallery Bijective Mapping Gallery Probe White Region measure of bijectivity (33.94%) Recognition Example
Face Recognition Performance Notre Dame Database
Conclusion and Future Work • New algorithm for registration and illumination correction to enhance the performance of face recognition systems • Algorithm is based on properties of the mappingbetween test and train data • Mapping produces similarity scores which can be used for a stand-alone face recognition algorithm • Extend algorithm for high resolution data • Reduce algorithm complexity