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
48 4. SEARCH PRUNING IN VIDEO SURVEILLANCE SYSTEMS Figure 4.4: Pruning process: categorization and elimination of categories.4.4 General settingFor this chapter, as mentioned above, we consider the setting where there is a search for asubject of interest v ′ , from within a larger authentication group of n subjects, v. The subject ofinterest v ′ is randomly placed inside v, and in turn v is randomly drawn from a larger population.Each member of v belongs to one of ρ categories C f ⊂ v, f = 1,··· ,ρ, with probability equalto|C f |p f := E v , f = 1,··· ,ρ, (4.4)nwhere E is used to denote the statistical expectation. Such category can be for example (labeledas) ’blue eyed, with moustache and with glasses’. The soft biometric system goes through theelements v ∈ v, and provides an estimate Ĉ(v) ∈ [1,ρ] of the category that v belongs in. For C′denoting the actual category of v ′ , where this category is considered to be known to the system,then each element v is pruned out if and only ifĈ(v) ≠ C′ . Specifically the SBS produces a setS = {v ∈ v : Ĉ(v) = C ′ } ⊂ vof subjects that were not pruned out. The pruning gain comes from the fact that S is generallysmaller than v.It is the case that pruning which results in generally smaller S, is associated to a higher gain,but also a higher risk of erroneously pruning out the target subject v ′ , thus reducing the reliabilityof the SBS. Both reliability and pruning gain are naturally affected by different parameters suchas– the category distribution of the authentication group v,– the distinctiveness of the category to which v ′ belongs– the system design: a conservatively tuned system will prune only with low risk to prune outv ′ , allowing for a high false acceptance rate FAR, on the other hand an aggressive systemwill prune stronger with the cost of a higher false rejection rate FRR.Furthermore, the gain is clearly a function ofv. Consequently any meaningful analysis of an SBSwill have to be statistical in nature. We here consider the average behavior of such systems. Insuch a case we will see that two aspects prove to be crucial in defining the average case behaviorof the system. The first aspect is the population statistics and the second is the error behavior ofthe different categorization algorithms. Specifically we here consider the vectorp := [p 1 ,p 2 ,··· ,p ρ ] T (4.5)which defines the entire population statistics. In terms of error behavior, we defineɛ ij := P(Ĉ(v) = C j : v ∈ C i ) (4.6)
49to be the probability that the algorithms will categorize into thejth categoryC j , an element whichactually belongs to the ith category C i (see Figure 4.5 for a graphical illustration). Simply ɛ iji,j ∈ [1,ρ] is the element of the ith row andjth column of what is known as theρ×ρ confusionmatrix, which we denote here asE:⎡E := ⎢⎣Related to these parameters we also define⎤ɛ 11 ɛ 12 ··· ɛ 1ρɛ 21 ɛ 22 ··· ɛ 2ρ. ..⎥ɛ ρ1 ɛ ρ2 ··· ɛ ρρɛ f :=ρ∑i=1,i≠f⎦ . (4.7)ɛ fi (4.8)to denote the probability that a member of category C f is wrongly categorized. Finally we use thenotatione := [ɛ 1 ,ɛ 2 ,··· ,ɛ ρ ]. (4.9)RealcategoriesSystem reliabilityEstimatedcategoriesFigure 4.5: Confusion parameters {ɛ f }.4.5 Statistical analysis using the method of types and informationdivergenceLet us consider a scenario where a search for a subject v ′ turned out to be extremely ineffective,and fell below the expectations, due to a very unfortunate matching of the subject withits surroundings v. This unfortunate scenario motivates the natural question of how often will asystem that was designed to achieve a certain average gain-reliability behavior, fall short of theexpectations, providing an atypically small pruning gain and leaving its users with an atypicallylarge and unmanageable S. It consequently brings to the previously related questions such as forexample, how will this probability be altered if we change the hardware and algorithmic resourcesof the system (change the ɛ f and ρ), or change the setting in which the system operates (changethe p i ).
- 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 and 46: 43Chapter 4Search pruning in video
- Page 47 and 48: 45Figure 4.1: System overview.SBS m
- Page 49: 472.52rate of decay of P(τ)1.510.5
- 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.
49to be the probability that the algorithms will categorize into thejth categoryC j , an element whichactually belongs to the ith category C i (see Figure 4.5 for a graphical illustration). Simply ɛ iji,j ∈ [1,ρ] is the element <strong>of</strong> the ith row andjth column <strong>of</strong> what is known as theρ×ρ confusionmatrix, which we denote here asE:⎡E := ⎢⎣Related to these parameters we also define⎤ɛ 11 ɛ 12 ··· ɛ 1ρɛ 21 ɛ 22 ··· ɛ 2ρ. ..⎥ɛ ρ1 ɛ ρ2 ··· ɛ ρρɛ f :=ρ∑i=1,i≠f⎦ . (4.7)ɛ fi (4.8)to denote the probability that a member <strong>of</strong> category C f is wrongly categorized. Finally we use thenotatione := [ɛ 1 ,ɛ 2 ,··· ,ɛ ρ ]. (4.9)RealcategoriesSystem reliabilityEstimatedcategoriesFigure 4.5: Confusion parameters {ɛ f }.4.5 Statistical analysis using the method <strong>of</strong> types and informationdivergenceLet us consider a scenario where a search for a subject v ′ turned out to be extremely ineffective,and fell below the expectations, due to a very unfortunate matching <strong>of</strong> the subject withits surroundings v. This unfortunate scenario motivates the natural question <strong>of</strong> how <strong>of</strong>ten will asystem that was designed to achieve a certain average gain-reliability behavior, fall short <strong>of</strong> theexpectations, providing an atypically small pruning gain and leaving its users with an atypicallylarge and unmanageable S. It consequently brings to the previously related questions such as forexample, how will this probability be altered if we change the hardware and algorithmic resources<strong>of</strong> the system (change the ɛ f and ρ), or change the setting in which the system operates (changethe p i ).