--- title: "Boosting Face Identification in Airports" authors: - "Jimmy Jiang Liu" - "Kia-Fock Loe" doi: "" url: "https://ijcai.org/proceedings/2003/251" pdf: "https://ijcai.org/proceedings/2003/0251.pdf" venue: "Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence" year: 2003 pages: "1503-1503" track: "" keywords: --- # Boosting Face Identification in Airports Jimmy Jiang Liu, Kia-Fock Loe *Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence*, pages 1503-1503. ## Abstract Robust face identification system in complex airport environment, which can identify certain candidates from a crowd of people in real time, is in urgent demand. S-AdaBoost is discussed in this paper as a variant of AdaBoost to handle real world environment. The Face Identification Sys tem for Airports (FISA), based upon SAdaBoost algorithm, is implemented in an international airport. Comparison of results obtained from FISA with those from other leading face identification approaches based on FISA database clearly demonstrates the effectiveness ofFISA in real airport environment. ## Full text ## 1 Introduction When AdaBoost [Freund and Schapire 1996] is used to handle scenarios in complex environment with outliers, its limitations have been pointed out by researchers [Dietterich, 2000]. Some discussions and approaches [Ratsch, et al., 200 1] have been proposed to address these limitations. S-AdaBoost works by dividing the input space into a few sub-spaces and using dedicated classifiers to classify patterns in the sub-spaces. The final classification result is the combination of the outputs of the dedicated classifiers. The S-AdaBoost Machine is made up of an AdaBoost divider, an AdaBoost classifier, a dedicated classifier for outliers, and a non-linear combiner. S-AdaBoost can enhance AdaBoost's capability of handling scenarios in real world complex environment. ## 2 S-AdaBoost in Classification S-AdaBoost applies the Divide and Conquer Principle through dividing the input pattern space S into a few sub­ spaces and conquering the sub-spaces by finding simple fittings (decision boundaries) to the patterns in the sub­ spaces. Input space can be denoted by: where, X= {xi} denotes the input patterns. Y = {yi} denotes the classification results. P = {pi= {(xi, Yi)}} denotes the input pattern and classification result pairs. In S-AdaBoost, patterns in S can be divided into a few sub-spaces relative to a classifier F(x): Sno = {P no} : Normal Patterns (Patterns can be easily classified by F(x)). S,P = {P sp}: Special Patterns (Patterns can be classified correctly by F(x) with bearable adjustment). Sns= {Pns}: Patterns with Noise (Noisy patterns) Shd = {Phd}: Hard-To-Classify Patterns (Patterns hard to be classified by F(x)). A typical input pattern space is shown in Figure 1. The first two sub-spaces are further referred to as Ordinary Pattern Space, and the last two are called Outliers in S­ AdaBoost: Figure 1: Input Pattern Space ![Image](https://ijcai.org/proceedings/2003/fulltext/251/image_000000_b14abe005260ecc20113e3182e77ca72f2ee630aef44a7380caec9f0e76cc456.png) During training, S-AdaBoost uses an AdaBoost D(t) as a divider to divide the patterns in the original training input space s into two separate sets in Sod and s.,. One set in s.d is used to train the next AdaBoost F.d(x), which has good generalization characteristic; and another set in s., is used to train a dedicated outlier classifier IO(x), which has good localization characteristic. The structure of S-AdaBoost is shown in Figure 2. During testing, the divider D(t) is no longer needed, testing patterns are fed directly to the two classifiers F od(x) and IO(x) followed by the combiner c;: to obtain the classification results. Figure 2: S-AdaBoost Machine ![Image](https://ijcai.org/proceedings/2003/fulltext/251/image_000001_f4446fb20463cb502bbd2224376fefa1c25076eb8681aa2dc61955c0b0a3a621.png) ## 3 FISA In FISA, 40 candidate's face images are stored in the candidate database. 5000 images with one or multiple face images in an airport environment are collected within 3 months; about 40% of the images contain one or a few candidate faces. 3000 images are randomly selected as the training set and the remaining 2000 images are chosen as the test set. The pro-processor will detect potential faces and generate constant flow of 20 X 20 segmented potential face images to FISA. Back-Propagation (BP) Neural Network is used as the base Ieamer for AdaBoost D(t) and Fod(x) in FISA. A three-layer RBF Neural Network with dynamic number of hidden nodes is chosen to implement IO(x) due to RBF Neural Network's good localization characteristic. The radii of hidden nodes in RBF are also chosen to be very small to enhance RBF network's good local clustering characteristic, which helps to isolate the P "' from the Phd· A Multi-Layer Perceptron (MLP) Neural Network is used to implement the combiner c;: in FISA. To test the effectiveness of S-AdaBoost (S-AB) on face identification in airports, we compared the performance of FISA (when Threshold t was set to 1/(M X () 2 )) with other leading approaches. We implemented the neural network based EBGM (Elastic Bunch Graph Matching) approach [Wyner et a!., 2001], the statistical subspace LDA (Linear/Fisher Discriminant Analysis) approach [Friedman et a!., 1998], and Probabilistic PCA (Principle Component Analysis) approach [Freund, 1999], PPCA. The False Negative Rate (FNR) and False Positive Rate (FPR) of the four algorithms as well as those of the AdaBoost (AB) algorithm were used in our analysis. The same training and testing face images (as used in FISA) were used in our experiment to compare the effectiveness of different approaches in real complex airport environment. In FISA testing, the pre-processed data (20 X 20 images) were fed directly to Fod(x) and IO(x). The testing results obtained from various approaches are listed in Table I. Table 1: Comparison of error rates of different approaches on FISA Database | 0 /o | S-AB | AB | EBGM | LDA | PPCA | |--------|--------|------|--------|-------|--------| | FPR | 33.4 | 44.6 | 40.2 | 43.3 | 38.5 | | FNR | 0.1 | 1.4 | 0.2 | 0.6 | 0.5 | ## 4 Discussion and Conclusions FISA is introduced as a practical system to handle face identification in real airport environment. S-AdaBoost, which is a variant of AdaBoost and is more effective than the conventional AdaBoost in handling outliers in real world complex environment, is also introduced as the algorithm behind FISA. Experimental results on FISA databases clearly show S-AdaBoost's effectives in handling classification m complex environment and FISA 's capability in boosting Face Identification in Airport. Improvements of the algorithm will focus on utilizing more hybrid approaches to improve the overall identification rates of the system. ## References 1. [Dietterich, 2000] Dietterich T. G. (2000) An experimental comparison of three methods for constructing ensembl es of decision trees: Bagging, boosting, and randomization . Mac hine Learning, 40 (2) pp . 139-158 2. Freund and Schapire 1996] 3. Freund, Y., R. E. Schapire. ( 1996) Experiment with a new boosting algorithm, Machine Learn ing: proceeding of the 13'd International conference, pp. 148-156 4. [Freund , 1999] Freund, Y. ( 1999) An Adaptive Version of the Boost by Majority Algorithm. Proceedings of the Twelfth Annual Conference on Computational Learning Theory [Friedman et a!., 1998] 5. Jerome Friedman, Trevor Hastie, and Robert Tibshirani (1998). Additive logistic regression: a statistical view of boosting. Stanford University Techni cal Report. 6. Riitsch, et a!., 2001) 7. G. Riitsch, T. Onoda, and K.-R. Mi.ill er (200 I). Soft margins for AdaBoost. Machine Learning Journal, 42(3) :287-320, March. Kluwer Academic Publishers [Wyner eta!., 200 I] 8. Abraham Wyner, Abba Kriege and Chuan Long Boosting Noisy Data. Proceeding of 8 1 h ICML