13.07.2015 Views

FACIAL SOFT BIOMETRICS - Library of Ph.D. Theses | EURASIP

FACIAL SOFT BIOMETRICS - Library of Ph.D. Theses | EURASIP

FACIAL SOFT BIOMETRICS - Library of Ph.D. Theses | EURASIP

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

10Figure 2: System overview.tion and subsequent elimination <strong>of</strong> s<strong>of</strong>t biometric-based categories, within the context <strong>of</strong> a searchwithin large databases (Figure 2). In the context <strong>of</strong> this work, the elimination or filtering our <strong>of</strong>the employed categories is based on the s<strong>of</strong>t biometric characteristics <strong>of</strong> the subjects. The pruneddatabase can be subsequently processed by humans or by a biometric such as face recognition.Towards analyzing the pruning behavior <strong>of</strong> such SBSs, we introduce the concept <strong>of</strong> pruninggain which describes, as a function <strong>of</strong> pruning reliability, the multiplicative reduction <strong>of</strong> the setsize after pruning. For example a pruning gain <strong>of</strong> 2 implies that pruning managed to halve thesize <strong>of</strong> the original set. We provide average case analysis <strong>of</strong> the pruning gain, as a function <strong>of</strong>reliability, but also moreover an atypical-case analysis, <strong>of</strong>fering insight on how <strong>of</strong>ten pruningfails to be sufficiently helpful. In the process we provide some intuition through examples ontopics such as, how the system gain-reliability performance suffers with increasing confusability<strong>of</strong> categories, or on whether searching for a rare looking subject renders the search performancemore sensitive to increases in confusability, than searching for common looking subjects.We then take a more practical approach and present nine different s<strong>of</strong>t biometric systems, anddescribe how the employed categorization algorithms (eye color detector, glasses and moustachedetector) are applied on a characteristic database <strong>of</strong> 646 people. We furthermore provide simulationsthat reveal the variability and range <strong>of</strong> the pruning benefits <strong>of</strong>fered by different SBSs. Wederive concise closed form expressions on the measures <strong>of</strong> pruning gain and goodput, providesimulations, as well as derive and simulate aspects relating to the complexity costs <strong>of</strong> differents<strong>of</strong>t biometric systems <strong>of</strong> interest.Frontal-to-side person re-identificationTypically biometric face-recognition algorithms are developed, trained, tested and improvedunder the simplifying assumption <strong>of</strong> frontal-to-frontal person recognition. Such algorithms thoughare challenged when facing scenarios that deviate from the training setting, such as for examplein the presence <strong>of</strong> non-constant viewpoints, including the frontal-to-side scenario. Most personrecognition algorithms, whether holistic or based on facial features, only manage to optimally handlepose differences that are less than about15 degrees. As a result, a variation in the pose is <strong>of</strong>tena more dominant factor than a variation <strong>of</strong> subjects. This aspect <strong>of</strong> pose variation comes to the forein video surveillance, where a suspect may be pictured firstly frontal, whereas the correspondingtest images could be captured from the side, thus introducing a frontal-to-side recognition problem.Towards handling this problem, we employ multiple s<strong>of</strong>t biometrics related traits. One <strong>of</strong> ourtasks here is to get some insight into the significance <strong>of</strong> these traits, specifically the significance<strong>of</strong> using hair, skin and clothes patches for frontal-to-side re-identification. We are working on

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!