44 4. SEARCH PRUNING IN VIDEO SURVEILLANCE SYSTEMSfurther elimination <strong>of</strong> categories, which limits large databases <strong>of</strong> subjects to a fraction <strong>of</strong> the initialdatabase, see Figure 4.1. In the context <strong>of</strong> this chapter the elimination or filtering <strong>of</strong> the employedcategories is based on the s<strong>of</strong>t biometric characteristics <strong>of</strong> the subjects. The pruned database canbe subsequently processed by humans or by a biometric such as face recognition.The approach <strong>of</strong> pruning the search using SBSs, can apply to several re-identification scenarios,including the following:– A theft in a crowded mall is observed by different people who give partial information aboutthe thief’s appearance. Based on this information, a first-pass search applies SBS methodsto cut down on the long surveillance video recordings from several cameras.– A mother has lost her child and can describe traits like clothes color and height <strong>of</strong> the child.Video surveillance material can be pruned and resulting suggestions can be displayed to themother.The above cases support the applicability <strong>of</strong> SBSs, but also reveal that together with the benefits<strong>of</strong> such systems, come considerable risks such as that <strong>of</strong> erroneously pruning out the target <strong>of</strong> thesearch. This brings to the fore the need to jointly analyze the gains and risks <strong>of</strong> such systems.In the setting <strong>of</strong> human identification, we consider the scenario where we search for a specificsubject <strong>of</strong> interest, denoted as v ′ , belonging to a large and randomly drawn authentication groupv <strong>of</strong> n subjects, where each subject belongs to one <strong>of</strong> ρ categories. The elements <strong>of</strong> the set(authentication group) v are derived randomly from a larger population, which adheres to a set<strong>of</strong> population statistics. A category corresponds to subjects who adhere to a specific combination<strong>of</strong> s<strong>of</strong>t biometric characteristics, so for example one may consider a category consisting <strong>of</strong> blond,tall, females. We note the analogy to the scenario from chapter 3, but proceed to elaborate on thedifferent goal <strong>of</strong> the current chapter.With n being potentially large, we seek to simplify the search for subject v ′ within v by algorithmicpruning based on categorization, i.e., by first identifying the subjects that potentiallybelong to the same category as v ′ , and by then pruning out all other subjects that have not beenestimated to share the same traits as v ′ . Pruning is then expected to be followed by careful search<strong>of</strong> the remaining unpruned set. Such categorization-based pruning allows for a search speedupthrough a reduction in the search space, from v to some smaller and easier to handle set S whichis the subset <strong>of</strong> v that remains after pruning, see Figure 4.1 and Figure 4.4. This reduction thoughhappens in the presence <strong>of</strong> a set <strong>of</strong> categorization error probabilities {ɛ f }, called confusion probabilities,that essentially describe how easy it is for categories to be confused, hence also describingthe probability that the estimation algorithm erroneously prunes out the subject <strong>of</strong> interest, byfalsely categorizing it. This confusion set, together with the set <strong>of</strong> population statistics {p f } ρ f=1which describes how common a certain category is inside the large population, jointly define thestatistical performance <strong>of</strong> the search pruning, which we will explore. The above aspects will beprecisely described later on.Example 7 An example <strong>of</strong> a sufficiently large population includes the inhabitants <strong>of</strong> a certaincity, and an example <strong>of</strong> a randomly chosen authentication group (n-tuple) v includes the set <strong>of</strong>people captured by a video surveillance system in the aforementioned city between 11:00 and11:05 yesterday. An example SBS could be able to classify 5 instances <strong>of</strong> hair color, 6 instances <strong>of</strong>height and 2 <strong>of</strong> gender, thus being able to differentiate betweenρ = 5·6·2 = 60 distinct categories.An example search could seek for a subject that was described to belong to the first category <strong>of</strong>,say, blond and tall females. The subject and the rest <strong>of</strong> the authentication group <strong>of</strong> n = 1000people, were captured by a video-surveillance system at approximately the same time and placesomewhere in the city. In this city, each SBS-based category appears with probability p 1 ,··· ,p 60 ,and each such category can be confused for the first category with probability ɛ 2 ,··· ,ɛ 60 . The
45Figure 4.1: System overview.SBS makes an error wheneverv ′ is pruned out, thus it allows for reliability <strong>of</strong>ɛ 1 . To clarify, havingp 1 = 0.1 implies that approximately one in ten city inhabitants are blond-tall-females, and havingɛ 2 = 0.05 means that the system (its feature estimation algorithms) tends to confuse the secondcategory for the first category with probability equal to 0.05.What becomes apparent though is that a more aggressive pruning <strong>of</strong> subjects in v results in asmaller S and a higher pruning gain, but as categorization entails estimation errors, such a gaincould come at the risk <strong>of</strong> erroneously pruning out the subject v ′ that we are searching for, thusreducing the system reliability.Reliability and pruning gain are naturally affected by, among other things, the distinctivenessand differentiability <strong>of</strong> the subjectv ′ from the rest <strong>of</strong> the people in the specific authentication groupv over which pruning will take place that particular instance. In several scenarios though, thisdistinctiveness changes randomly because v itself changes randomly. This introduces a stochasticenvironment. In this case, depending on the instance in which v ′ and its surroundings v−v ′ werecaptured by the system, some instances would have v consist <strong>of</strong> bystanders that look similar tothe subject <strong>of</strong> interest v ′ , and other instances would havevconsist <strong>of</strong> people who look sufficientlydifferent from the subject. Naturally the first case is generally expected to allow for a lowerpruning gain than the second case.The pruning gain and reliability behavior can also be affected by the system design. At oneextreme we find a very conservative system that prunes out a member <strong>of</strong> v only if it is highlyconfident about its estimation and categorization, in which case the system yields maximal reliability(near-zero error probability) but with a much reduced pruning gain. At the other extreme,we find an effective but unreliable system which aggressively prunes out subjects in v, resultingin a potentially much reduced search space (|S|
- Page 1: FACIAL SOFT BIOMETRICSMETHODS, APPL
- Page 5: AcknowledgementsThis thesis would n
- Page 8: 6hair, skin and clothes. The propos
- Page 11 and 12: 97 Practical implementation of soft
- Page 13 and 14: 11Notations used in this workE : st
- Page 15 and 16: 13Chapter 1IntroductionTraditional
- Page 17 and 18: 15event of collision, which is of s
- Page 19 and 20: 17ric. In Section 6.6 we employ the
- Page 21 and 22: 19Chapter 2Soft biometrics: charact
- Page 23 and 24: 21is the fusion of soft biometrics
- Page 25 and 26: 23plied on low resolution grey scal
- Page 27 and 28: 25Chapter 3Bag of facial soft biome
- Page 29 and 30: 27In this setting we clearly assign
- Page 31 and 32: 29Table 3.1: SBSs with symmetric tr
- Page 33 and 34: 31corresponding to p(n,ρ). Towards
- Page 35 and 36: the same category (all subjects in
- Page 37 and 38: 3.5.2 Analysis of interference patt
- Page 39 and 40: an SBS by increasing ρ, then what
- Page 41 and 42: 39Table 3.4: Example for a heuristi
- Page 43 and 44: 41for a given randomly chosen authe
- Page 45: 43Chapter 4Search pruning in video
- Page 49 and 50: 472.52rate of decay of P(τ)1.510.5
- Page 51 and 52: 49to be the probability that the al
- Page 53 and 54: 51The following lemma describes the
- Page 55 and 56: 534.5.1 Typical behavior: average g
- Page 57 and 58: 55n = 50 subjects, out of which we
- Page 59 and 60: 5710.950.9pruning Gain r(vt)0.850.8
- Page 61 and 62: 59for one person, for trait t, t =
- Page 63 and 64: 61Chapter 5Frontal-to-side person r
- Page 65 and 66: 63Figure 5.1: Frontal / gallery and
- Page 67 and 68: 6510.90.80.7Skin colorHair colorShi
- Page 69 and 70: 6710.90.80.70.6Perr0.50.40.30.20.10
- Page 71 and 72: 69Chapter 6Soft biometrics for quan
- Page 73 and 74: 71raphy considerations include [BSS
- Page 75 and 76: 73Figure 6.3: Example image of the
- Page 77 and 78: 75A direct way to find a relationsh
- Page 79 and 80: 77- Pearson’s correlation coeffic
- Page 81 and 82: 79shown to have a high impact on ou
- Page 83 and 84: 81Chapter 7Practical implementation
- Page 85 and 86: 834) Eye glasses detection: Towards
- Page 87 and 88: 857.2 Eye color as a soft biometric
- Page 89 and 90: 87Table 7.5: GMM eye color results
- Page 91 and 92: 89and office lights, daylight, flas
- Page 93 and 94: 917.5 SummaryThis chapter presented
- Page 95 and 96: 93Chapter 8User acceptance study re
- Page 97 and 98:
95Table 8.1: User experience on acc
- Page 99 and 100:
97scared of their PIN being spying.
- Page 101 and 102:
99Table 8.2: Comparison of existing
- Page 103 and 104:
101ConclusionsThis dissertation exp
- Page 105 and 106:
103Future WorkIt is becoming appare
- Page 107 and 108:
105Appendix AAppendix for Section 3
- Page 109 and 110:
107- We are now left withN −F = 2
- Page 111 and 112:
109Appendix BAppendix to Section 4B
- Page 113 and 114:
111Blue Green Brown BlackBlue 0.75
- Page 115 and 116:
113Appendix CAppendix for Section 6
- Page 117 and 118:
115Appendix DPublicationsThe featur
- Page 119 and 120:
117Bibliography[AAR04] S. Agarwal,
- Page 121 and 122:
119[FCB08] L. Franssen, J. E. Coppe
- Page 123 and 124:
121[Ley96] M. Leyton. The architect
- Page 125 and 126:
123[RN11] D. Reid and M. Nixon. Usi
- Page 127 and 128:
125[ZG09] X. Zhang and Y. Gao. Face
- Page 129:
2Rapporteurs:Prof. Dr. Abdenour HAD
- Page 132 and 133:
Biométrie faciale douce 2Les terme
- Page 134 and 135:
Biométrie faciale douce 4une perso
- Page 136 and 137:
Couleur depeauCouleur descheveuxCou
- Page 138 and 139:
Biométrie faciale douce 8Nous nous
- Page 140 and 141:
Biométrie faciale douce 103. Proba
- Page 142 and 143:
Biométrie faciale douce 12l’entr
- Page 144 and 145:
Biométrie faciale douce 14Figure 6
- Page 146 and 147:
Biométrie faciale douce 16pages 77
- Page 148 and 149:
Reviewers:Prof. Dr. Abdenour HADID,
- Page 150 and 151:
3hair, skin and clothes. The propos
- Page 152 and 153:
person in the red shirt”. Further
- Page 154 and 155:
7- Not requiring the individual’s
- Page 156 and 157:
9Probability of Collision10.90.80.7
- Page 158 and 159:
11the color FERET dataset [Fer11] w
- Page 160 and 161:
13Table 2: Table of Facial soft bio
- Page 162 and 163:
15Chapter 1PublicationsThe featured
- Page 164 and 165:
17Bibliography[ACPR10] D. Adjeroh,
- Page 166 and 167:
19[ZESH04] R. Zewail, A. Elsafi, M.