2007
DOI: 10.1109/tip.2006.884939
|View full text |Cite
|
Sign up to set email alerts
|

Face Verification With Balanced Thresholds

Abstract: Abstract-The process of face verification is guided by a prelearned global threshold, which, however, is often inconsistent with class-specific optimal thresholds. It is, hence, beneficial to pursue a balance of the class-specific thresholds in the model-learning stage. In this paper, we present a new dimensionality reduction algorithm tailored to the verification task that ensures threshold balance. This is achieved by the following aspects. First, feasibility is guaranteed by employing an affine transformati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 26 publications
0
3
0
Order By: Relevance
“…Many different projections have been proposed including famous examples like Eigenfaces [4], where the basis of the face space is spanned by eigenvectors obtained from a PCA analysis of the training images, and Fisherfaces [7], where the projection bases on Fisher's Linear Discriminant and is computed to be nearly orthogonal to intra-class scatter to minimize intra-class variance while maximizing interclass variance. Further projection methods construct linear subspaces for each person based on the original gallery images and measure the distance of query faces to these spaces [12], enhance the projection by kernel methods to model higher-order pixel dependencies [14], or refine the Fisherfaces approach with more intricate target subspaces [13], [15]. All projection methods are characterized by a low computational complexity and all modern variants and Fisherfaces attain high recognition rates on standard databases.…”
Section: Related Workmentioning
confidence: 99%
“…Many different projections have been proposed including famous examples like Eigenfaces [4], where the basis of the face space is spanned by eigenvectors obtained from a PCA analysis of the training images, and Fisherfaces [7], where the projection bases on Fisher's Linear Discriminant and is computed to be nearly orthogonal to intra-class scatter to minimize intra-class variance while maximizing interclass variance. Further projection methods construct linear subspaces for each person based on the original gallery images and measure the distance of query faces to these spaces [12], enhance the projection by kernel methods to model higher-order pixel dependencies [14], or refine the Fisherfaces approach with more intricate target subspaces [13], [15]. All projection methods are characterized by a low computational complexity and all modern variants and Fisherfaces attain high recognition rates on standard databases.…”
Section: Related Workmentioning
confidence: 99%
“…The results of the localization can be used for the human-machine interface [2,13,14,21], the recognition of a face and facial expression [6,15,17,23,24], 3D face recognition [1], and etc. Facial feature location methods can be classified into the following two categories: (1) local methods [7,16], which detect eye, mouth, chin separately; (2) global methods [3,4,22], which detect facial features jointly.…”
Section: Introductionmentioning
confidence: 99%
“…Subspace face recognition can be formulated as global formulation or class-specific formulation. In global formulation, one unified projection matrix is trained for all the classes through constructing a pooled covariance matrix [116]. In class-specific formulation, a classspecific projection matrix is trained for each class [117].…”
Section: Face Verificationmentioning
confidence: 99%