Active Learning for Solving the Incomplete Data Problem in Facial Age Classification by the Furthest Nearest-Neighbor Criterion

被引:15
|
作者
Wang, Jian-Gang [1 ]
Sung, Eric [2 ]
Yau, Wei-Yun [1 ]
机构
[1] Connexis, Inst Infocomm Res, Singapore 138632, Singapore
[2] Nanyang Technol Univ, Singapore 639798, Singapore
关键词
Active learning; age estimation; furthest nearest neighbor; incomplete data problem; DISCRIMINANT-ANALYSIS; FACE-RECOGNITION;
D O I
10.1109/TIP.2011.2106794
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Facial age classification is an approach to classify face images into one of several predefined age groups. One of the difficulties in applying learning techniques to the age classification problem is the large amount of labeled training data required. Acquiring such training data is very costly in terms of age progress, privacy, human time, and effort. Although unlabeled face images can be obtained easily, it would be expensive to manually label them on a large scale and getting the ground truth. The frugal selection of the unlabeled data for labeling to quickly reach high classification performance with minimal labeling efforts is a challenging problem. In this paper, we present an active learning approach based on an online incremental bilateral two-dimension linear discriminant analysis (IB2DLDA) which initially learns from a small pool of labeled data and then iteratively selects the most informative samples from the unlabeled set to increasingly improve the classifier. Specifically, we propose a novel data selection criterion called the furthest nearest-neighbor (FNN) that generalizes the margin-based uncertainty to the multiclass case and which is easy to compute, so that the proposed active learning algorithm can handle a large number of classes and large data sizes efficiently. Empirical experiments on FG-NET and Morph databases together with a large unlabeled data set for age categorization problems show that the proposed approach can achieve resultscomparableor even outperform a conventionally trained active classifier that requires much more labeling effort. Our IB2DLDA-FNN algorithm can achieve similar results much faster than random selection and with fewer samples for age categorization. It also can achieve comparable results with active SVM but is much faster than active SVM in terms of training because kernel methods are not needed. The results on the face recognition database and palmprint/palm vein database showed that our approach can handle problems with large number of classes. Our contributions in this paper are twofold. First, we proposed the IB2DLDA-FNN, the FNN being our novel idea, as a generic on-line or active learning paradigm. Second, we showed that it can be another viable tool for active learning of facial age range classification.
引用
收藏
页码:2049 / 2062
页数:14
相关论文
共 35 条
  • [1] Active Learning with the Furthest Nearest Neighbor Criterion for Facial Age Estimation
    Wang, Jian-Gang
    Sung, Eric
    Yau, Wei-Yun
    COMPUTER VISION - ACCV 2010, PT IV, 2011, 6495 : 11 - +
  • [2] Active Nearest-Neighbor Learning in Metric Spaces
    Kontorovich, Aryeh
    Sabato, Sivan
    Urner, Ruth
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 29 (NIPS 2016), 2016, 29
  • [3] Active Nearest-Neighbor Learning in Metric Spaces
    Kontorovich, Aryeh
    Sabato, Sivan
    Urner, Ruth
    JOURNAL OF MACHINE LEARNING RESEARCH, 2018, 18
  • [4] A new nearest-neighbor rule in the pattern classification problem
    Hattori, K
    Takahashi, M
    PATTERN RECOGNITION, 1999, 32 (03) : 425 - 432
  • [5] Learning weighted metrics to minimize nearest-neighbor classification error
    Paredes, R
    Vidal, E
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2006, 28 (07) : 1100 - 1110
  • [6] Simultaneous learning of a discriminative projection and prototypes for Nearest-Neighbor classification
    Villegas, Mauricio
    Paredes, Roberto
    2008 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOLS 1-12, 2008, : 1928 - 1935
  • [7] NearTree, a data structure and a software toolkit for the nearest-neighbor problem
    Andrews, Lawrence C.
    Bernstein, Herbert J.
    JOURNAL OF APPLIED CRYSTALLOGRAPHY, 2016, 49 : 756 - 761
  • [8] Evolutionary Extreme Learning Machine Based Weighted Nearest-neighbor Equality Classification
    Zhang, Nana
    Qu, Yanpeng
    Deng, Ansheng
    2015 7TH INTERNATIONAL CONFERENCE ON INTELLIGENT HUMAN-MACHINE SYSTEMS AND CYBERNETICS IHMSC 2015, VOL II, 2015,
  • [9] On a nearest-neighbor problem under Minkowski and power metrics for large data sets
    Gavrilova, ML
    JOURNAL OF SUPERCOMPUTING, 2002, 22 (01): : 87 - 98
  • [10] On a Nearest-Neighbor Problem Under Minkowski and Power Metrics for Large Data Sets
    Marina L. Gavrilova
    The Journal of Supercomputing, 2002, 22 : 87 - 98