Master Thesis - Department of Computer Science
Master Thesis - Department of Computer Science
Master Thesis - Department of Computer Science
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
suppressed and a detail subband (in some cases) is eliminated. Reconstructing<br />
a face with an optimal selection <strong>of</strong> subbands enhances the performance <strong>of</strong> face<br />
recognition. We present four different criteria as cost functions to obtain an<br />
optimal subband face for each subject, and compare their performances. The<br />
performance <strong>of</strong> the subband face representation with several linear subspace<br />
techniques: PCA, LDA, 2D-PCA, 2D-LDA and Discriminative Common Vec-<br />
tors (DCV), on Yale, ORL and PIE face databases show that the subband<br />
face based representation performs significantly better than that proposed by<br />
Ekenel for Multiresolution Face Recognition [36] for frontal face recognition, in<br />
the presence <strong>of</strong> varying illumination, expression and pose.<br />
• In the second approach, we propose a new face recognition technique by com-<br />
bining information from null space and range space <strong>of</strong> within-class scatter <strong>of</strong><br />
a face space. The combination <strong>of</strong> information at feature level poses a problem<br />
<strong>of</strong> optimally merging two eigenmodels obtained separately from null space and<br />
range space. We use two different methods: 1) Covariance Sum and 2) Gramm-<br />
Schmidt Orthonormalization to construct a new combined space, named as<br />
dual space, by merging two different sets <strong>of</strong> discriminatory directions obtained<br />
from null space and range space separately. We employ forward or backward<br />
selection technique to select the best set <strong>of</strong> discriminative features from dual<br />
space and use them for face recognition. Experimental results on three public<br />
databases, Yale, ORL and PIE will show the superiority <strong>of</strong> our method over a<br />
face recognition technique called Discriminative Common Vectors (DCV) [20],<br />
based on only the null space <strong>of</strong> within-class scatter.<br />
• The third approach <strong>of</strong> face recognition presents a novel face recognition tech-<br />
nique by combining information from null space and range space <strong>of</strong> within-class<br />
scatter <strong>of</strong> a face space at decision level. Along with two classical decision fu-<br />
sion strategies sum rule and product rule, we employ our own decision fusion<br />
technique which exploits each classifier space separately to enhance combined<br />
performance. Our method <strong>of</strong> decision fusion uses Linear Discriminant Anal-<br />
ysis (LDA) and nonparametric LDA on classifier’s response to enhance class<br />
separability. This method is also evaluated using Yale, ORL and PIE database.<br />
6