Fig 4 - available via license: CC BY-ND
Content may be subject to copyright.
A randomly chosen subset of the MB-LBP features E. Choosing weak classifiers For each MB-LBP feature, we adopt multi-branch tree as weak classifiers. The multi-branch tree totally has 256 branches, and each branch corresponds to a certain discrete value of MB-LBP features. The weak classifier can be defined as:

A randomly chosen subset of the MB-LBP features E. Choosing weak classifiers For each MB-LBP feature, we adopt multi-branch tree as weak classifiers. The multi-branch tree totally has 256 branches, and each branch corresponds to a certain discrete value of MB-LBP features. The weak classifier can be defined as:

Source publication
Article
Full-text available
In this paper an eye center localization algorithm based on multi-block local binary patterns is described. Performance of the suggested algorithm is compared to another methods based on Bayesian approach and image gradients. Visual examples of eye center localization results are provided.

Context in source publication

Context 1
... the center rectangle, are rectangles (see Fig. 3 for an tterns may be obtained for a m are presented in Fig. 4. ...

Citations

Conference Paper
An eye center localization algorithm based on multi-block local binary patterns is described. Performance of the suggested algorithm is compared to other popular approaches on standard BioID and FERET image databases. Additional test on images with two types of distortions: Additive white Gaussian noise and JPEG compression is considered. The impact of eye center localization accuracy on face recognition rate is analyzed.