Elsevier

Neurocomputing

Volume 197, 12 July 2016, Pages 136-142
Neurocomputing

Kinship verification from facial images by scalable similarity fusion

https://doi.org/10.1016/j.neucom.2016.02.039Get rights and content

Abstract

Kinship verification using face images (KVFI) is a relatively new and challenging problem in computer vision and biometrics, while kin relationship in psychology has been well studied over the past decades. Recent advances in KVFI have shown that learning an effective similarity metric plays a critical role in the verification problem. However, most existing distance metric learning (DML) based KVFI methods use batch learning techniques to seek an optimal kin similarity metric, making them less scalable in practical verification tasks. To address this, we propose in this paper a scalable similarity learning (SSL) method for KVFI. Unlike existing DML-based solutions, SSL aims to learn a diagonal bilinear similarity model by online truncated gradient learning, which enjoys superiority in scalability and computational efficiency for practical KVFI with high-dimensional data. We further derive a multiview SSL algorithm by optimal fusion of the diagonal similarity models from multiple feature representations in a coherent online process, such that the interactions and correlations in multiview kin data can be leveraged to obtain refined and high-level information. Empirically, we evaluate our proposed method on two benchmark datasets against the state-of-the-art DML-based solutions, and the results demonstrate that our method can achieve competitive or better verification performance, and enjoys the superiority in scalability and computational efficiency.

Introduction

The goal of kinship verification using face images (KVFI) is to determine whether a given pair of face images has a kinship relation. Recent evidence in psychology has indicated that face appearance is a reliable cue for measurement of the genetic similarity between children and their parents [1], [2], [3], [4]. Motivated by this observation, KVFI has attracted more attention from computer vision and biometrics societies [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18]. In practice, there exist some important and potential applications for KVFI, ranging from searching missing children to social media analysis [5], [9], [10], [12]. Fig. 1 presents some face examples (with kin relations) from the KinFaceW dataset [12].

While some encouraging results have been achieved over the past five years [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], KVFI still remains open to further improvement. On one hand, face images are often captured in wild conditions, and varying illumination, poses and expressions in such scenarios make the verification problem quite challenging. On the other hand, kinship verification aims to investigate the kin relationship between two different visual entities (e.g., mother and son), and hence the inherent appearance gap in kinship verification is generally much larger than that in traditional face recognition [24], [25], [26], [27], [28], [29], [30], [31], [32], [33], [38].

The existing methods for KVFI are either feature-based [5], [6], [7], [10], [14], [16], [18] or model-based [8], [9], [12], [13], [15], [17], [19]. Feature-based methods extract discriminative feature from face image either by hand-crafted descriptors [5], [10], [18] or feature learning [6], [7], [14], [16], to describe the genetic traits on human face. Model-based methods, however, aim to learn an appropriate distance metric or classifier based on some statistical learning techniques. Among them, distance metric learning (DML) [20], [21], [22], [23] has been a promising choice for learning the kin similarity metric on face [12], [13], [15], [17], [19]. Most DML-based kinship verification methods suffer from two limitations; on one hand, they aim to learn a Mahalanobis distance metric parameterized by a full matrix for each feature representation, making the training and testing computationally inefficient for high-dimensional kin data. On the other hand, they seek to learn the kinship similarity metric in batch learning mode, making the process less scalable in practical verification tasks with ever-growing amount of training data collected and stored in the kinship databases. To address these issues, we propose in this paper a scalable similarity learning (SSL) method for KVFI.

Different from existing kinship verification methods, our proposed SSL seeks to learn a diagonal bilinear similarity metric on the human face based on an online sparse learning strategy, which enjoys superiority in efficiency and scalability for KVFI with high-dimensional kin data. In practice, we have access to multiple views (feature representations) of face data, each of which can be individually used for kinship verification. Exploiting information from multiple views, we hope to find a fused similarity metric on face appearance that is more robust and accurate than the ones learned by using the individual views. As such, we further develop a multiview SSL method by optimal fusion of the diagonal similarity models from multiple feature representations in a coherent process, such that the interactions and correlations in multiview kin data can be leveraged to obtain the refined and high-level information. The contributions of this work are summarized as follows:

  • 1)

    A scalable similarity learning method is proposed for training the kin similarity metric on the human face by introducing the truncated gradient to induce sparsity in online learning of the diagonal bilinear similarity function, making it computationally efficient and scalable for practical KVFI with high-dimensional kin data.

  • 2)

    A multiview SSL algorithm is developed for effective fusion of kin similarity by an optimal combination of the diagonal bilinear similarity models from multiple feature representations in a coherent online process.

  • 3)

    We empirically evaluate our SSL method against the state-of-the-art DML-based solutions to KVFI on two widely used kinship datasets, and the experimental results demonstrate that our method can achieve competitive or better verification performance, and enjoys superiority in computational efficiency and scalability.

The remainder of this paper is organized as follows. We briefly review the related work on kinship verification methods in Section 2. In Section 3, we first elaborate the scalable similarity learning method for KVFI, and then the multiview SSL algorithm is derived. Experiments and evaluations of our method are conducted in Section 4. Finally, we conclude the paper in Section 5.

Section snippets

Related work

We briefly review the work related to kinship verification in this section. The existing kinship verification methods can be roughly divided into two categories: feature-based [5], [6], [7], [10], [14], [16], [18] and model-based [8], [9], [12], [13], [15], [17], [19].

Diagonal bilinear similarity model

Most existing DML-based kinship verification methods [12], [13], [15], [17] aim at learning the Mahalanobis distance metric that measures the squared distance between a pair of face examples xi and xj:dM2(xi,xj)=(xixj)TM(xixj)where xi,xjRd, and M̲0 is a positive semi-definite matrix. One limitation of these methods is that they learn a full parameterized matrix from low-dimensional data. Such methods, however, typically require O(d2) for storage and O(d3) for optimization, making them

Experiments

In this section, experimental evaluations for our proposed methods are performed on the two benchmark datasets, i.e., the KinFaceW-I and KinFaceW-II [12], [13]. We detail the experimental settings and results in the following subsections.

Conclusion

We have introduced a new method for kinship verification by learning a diagonal bilinear similarity model in an online manner, which obtains comparable or better accuracy performance against state-of-the-art DML-based solutions, and enjoys the superiority in scalability and computational efficiency for practical KVFI with high-dimensional data. We also derive a multi-view SSL algorithm by optimal fusion of the diagonal similarity functions from multiple feature representations in a coherent

Acknowledgments

This work was supported by the research grant from the National Natural Science Foundation of China under Grant 61373090.

Xiuzhuang Zhou received the Ph.D. degree from the School of Computer Science, Beijing Institute of Technology, Beijing, China, in 2011. He is currently an associate professor at the College of Information Engineering, Capital Normal University, Beijing, China. His research interests include computer vision, pattern recognition, and machine learning. He has authored more than 30 scientific papers in peer-reviewed journals and conferences including some top venues such as the IEEE Transactions on

References (42)

  • G. Kaminski, S. Dridi, C. Graff, E. Gentaz, Human ability to detect kinship in strangers׳ faces: effects of the degree...
  • G. Kaminski et al.

    Firstborns׳ disadvantage in kinship detection

    Psychol. Sci.

    (2010)
  • L. DeBruine et al.

    Kin recognition signals in adult faces

    Vis. Res.

    (2009)
  • A. Alvergne et al.

    Cross-cultural perceptions of facial resemblance between kin

    J. Vis.

    (2009)
  • R. Fang, K. Tang, N. Snavely, T. Chen, Towards computational models of kinship verification, in: Proceedings of the...
  • X. Zhou, J. Hu, J. Lu, Y. Shang, Y. Guan, Kinship verification from facial images under uncontrolled conditions, in:...
  • X. Zhou, J. Lu, J. Hu, Y. Shang, Gabor-based gradient orientation pyramid for kinship verification under uncontrolled...
  • S. Xia, M. Shao, Y. Fu, Kinship verification through transfer learning, in: Proceedings of the IJCAI, 2011, pp....
  • S. Xia et al.

    Understanding kin relationships in a photo

    IEEE Trans. Multimed.

    (2012)
  • G.-D. Guo et al.

    Kinship measurement on salient facial features

    IEEE Trans. Instrum. Meas.

    (2012)
  • H. Dibeklioglu, A.A. Salah, T. Gevers, Like father, like son: facial expression dynamics for kinship verification, in:...
  • J. Lu et al.

    Neighborhood repulsed metric learning for kinship verification

    IEEE Trans. Pattern Anal. Mach. Intell.

    (2014)
  • J. Lu, J. Hu, X. Zhou, Y. Shang, Y.-P. Tan, G. Wang, Neighborhood repulsed metric learning for kinship verification,...
  • H. Yan et al.

    Prototype-based discriminative feature learning for kinship verification

    IEEE Trans. Cybern.

    (2015)
  • H. Yan et al.

    Discriminative multi-metric learning for kinship verification

    IEEE Trans. Inf. Forensics Secur.

    (2014)
  • A. Dehghan, E.G. Ortiz, R. Villegas, M. Shah, Who do i look like? Determining parent-offspring resemblance via gated...
  • J. Hu, J. Lu, J. Yuan, Y.-P. Tan, Large margin multi-metric learning for face and kinship verification in the wild, in:...
  • N. Kohli, R. Singh, M. Vatsa, Self-similarity representation of weber faces for kinship classification, in: Proceedings...
  • X. Zhou et al.

    Ensemble similarity learning for kinship verification from facial images in the wild

    Inf. Fusion

    (2015)
  • J. Davis, B. Kulis, P. Jain, S. Sra, I. Dhillon, Informationtheoretic metric learning, in: Proceedings of the ICML,...
  • J. Goldberger, S. Roweis, G. Hinton, R. Salakhutdinov, Neighborhood component analysis, in: Proceedings of the NIPS,...
  • Cited by (52)

    • Binary cross coupled discriminant analysis for visual kinship verification

      2022, Signal Processing: Image Communication
      Citation Excerpt :

      In [24] Zhou et al. proposed the ensemble similarity learning (ESL) method, which was learned by merging multiple base similarity functions, which results in increase in the similarity among kin pairs. Zhou et al. [25] proposed scalable similarity learning (SSL) which was learned by bi linear similarity model. In [35] Laiadi et al. proposed side-information based weighted exponential discriminant analysis (SIWEDA) method.

    • Deep discriminant generation-shared feature learning for image-based kinship verification

      2022, Signal Processing: Image Communication
      Citation Excerpt :

      Third, genetic diversity makes it very difficult to describe patterns of kinship recognition. To tackle these difficulties, many methods have been presented [9,12–17]. Generally, these works can be roughly classified into two categories: traditional methods and deep learning methods.

    • A literature survey on kinship verification through facial images

      2020, Neurocomputing
      Citation Excerpt :

      On the other hand, most metric learning-based kinship verification methods seek to learn the metric in batch learning mode, which is less efficient and scalable to practical applications even for medium-size training set. To tackle this issue, Zhou et al. [99] and Kou et al. [36] propose to learn a similarity model by online learning, which enjoys superiority in scalability and computational efficiency. Kin relationship is one of the most important and most basic in the human social relationship, thus accurately and efficiently verifying whether given entities have kin relationship is naturally becoming research focus with an extraordinary realistic and applicative value.

    View all citing articles on Scopus

    Xiuzhuang Zhou received the Ph.D. degree from the School of Computer Science, Beijing Institute of Technology, Beijing, China, in 2011. He is currently an associate professor at the College of Information Engineering, Capital Normal University, Beijing, China. His research interests include computer vision, pattern recognition, and machine learning. He has authored more than 30 scientific papers in peer-reviewed journals and conferences including some top venues such as the IEEE Transactions on Pattern Analysis and Machine Intelligence, IEEE Transactions on Image Processing, IEEE Transactions on Information Forensics and Security, IEEE CVPR and ACM MM. He is a member of the IEEE.

    Haibin Yan received the B.Eng. and M.Eng. degrees from the Xi׳an University of Technology, Xi׳an, China, in 2004 and 2007, and the Ph.D. degree from the National University of Singapore, Singapore, in 2013, all in mechanical engineering. Currently, she is a research fellow at the Department of Mechanical Engineering, National University of Singapore, Singapore. Her research interests include social robotics, human-robotic interaction, and computer vision. She has authored more than 10 scientific papers in peer- reviewed journals and conferences including some top venues such as the IEEE Transactions on Cybernetics, IEEE Transactions on Information Forensics and Security, and IEEE ICRA.

    Yuanyuan Shang received the Ph.D. degree from the National Astronomical Observatories, Chinese Academy of Sciences in 2005. She is currently a professor and vice dean (research) of the College of Information Engineering, Capital Normal University, Beijing, PR China. Her research interests include digital imaging sensor, image processing, and computer vision. She has authored more than 50 scientific papers in peer-reviewed journals and conferences, including some top venues such as the IEEE Transactions on Pattern Analysis and Machine Intelligence , IEEE Transactions on Information Forensics and Security, and ACM MM. She is a member of the IEEE.

    View full text