23 January 2018 in IEEE Transactions on Information Forensics and Security
Clustering face images according to their latent identity has two important applications: 1) grouping a collection of face images when no external labels are associated with images, and 2) indexing for efficient large scale face retrieval. The clustering problem is composed of two key parts: representation and similarity metric for face images, and choice of the partition algorithm. We first propose a representation based on ResNet, which has been shown to perform very well in image classification problems. Given this representation, we design a clustering algorithm, Conditional Pairwise Clustering (ConPaC), which directly estimates the adjacency matrix only based on the similarities between face images. This allows a dynamic selection of number of clusters and retains pairwise similarities between faces. ConPaC formulates the clustering problem as a Conditional Random Field model and uses Loopy Belief Propagation to find an approximate solution for maximizing the posterior probability of the adjacency matrix. Experimental results on two benchmark face datasets (LFW and IJB-B) show that ConPaC outperforms well known clustering algorithms such as k-means, spectral clustering, and approximate Rank-order. Additionally, our algorithm can naturally incorporate pairwise constraints to work in a semi-supervised way that leads to improved clustering performance. We also propose a k-NN variant of ConPaC, which has a linear time complexity given a k-NN graph, suitable for large datasets.
9 January 2023 in IEEE Internet of Things Journal
Federated learning (FL) is a distributed machine learning (ML) technique that allows numerous Internet of Things (IoT) devices to jointly train an ML model using a centralized server for help. Local data never leaves each IoT device in FL, so the local data of IoT devices are protected. In FL, distributed IoT devices usually collect their local data independently, so the data set of each IoT device may naturally form a distinct source domain. In real-world applications, the model trained over multisource domains may have poor generalization performance on unseen target domains. To address this issue, we propose federated adversarial domain generalization (FedADG) to equip FL with domain generalization capability. FedADG employs the federated adversarial learning approach to measure and align the distributions among different source domains via matching each distribution to a reference distribution. The reference distribution is adaptively generated (by accommodating all source domains) to minimize the domain shift distance during alignment. Therefore, the learned feature representation tends to be universal, and, thus, it has good generalization performance over the unseen target domains while protecting local data privacy. Intensive experiments on various data sets demonstrate that FedADG has comparable performance with the state-of-the-art.
6 February 2019 in IEEE Transactions on Biometrics, Behavior, and Identity Science
1 August 2023 in International Journal of Science and Engineering Applications