Niannan Xue

Niannan Xue

Auto-generated profile, based on publicly available information

Niannan Xue

Department of Computing, Imperial College London, London, U.K.

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 June 2021 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
JDJiankang Deng
Jiankang Deng
JGJia Guo
Jia Guo
JYJing Yang
Jing Yang
NXNiannan Xue
Niannan Xue
IKIrene Kotsia
Irene Kotsia
SZStefanos Zafeiriou
Stefanos Zafeiriou
Recently, a popular line of research in face recognition is adopting margins in the well-established softmax loss function to maximize class separability. In this paper, we first introduce an Additive Angular Margin Loss (ArcFace), which not only has a clear geometric interpretation but also significantly enhances the discriminative power. Since ArcFace is susceptible to the massive label noise, we further propose sub-center ArcFace, in which each class contains $K$ sub-centers and training samples only need to be close to any of the $K$ positive sub-centers. Sub-center ArcFace encourages one dominant sub-class that contains the majority of clean faces and non-dominant sub-classes that include hard or noisy faces. Based on this self-propelled isolation, we boost the performance through automatically purifying raw web faces under massive real-world noise. Besides discriminative feature embedding, we also explore the inverse problem, mapping feature vectors to face images. Without training any additional generator or discriminator, the pre-trained ArcFace model can generate identity-preserved face images for both subjects inside and outside the training data only by using the network gradient and Batch Normalization (BN) priors. Extensive experiments demonstrate that ArcFace can enhance the discriminative feature embedding as well as strengthen the generative face synthesis.

4 March 2019 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Open access
NXNiannan Xue
Niannan Xue
JDJiankang Deng
Jiankang Deng
SCShiyang Cheng
Shiyang Cheng
YPYannis Panagakis
Yannis Panagakis
SZStefanos Zafeiriou
Stefanos Zafeiriou
Robust principal component analysis (RPCA) is a powerful method for learning low-rank feature representation of various visual data. However, for certain types as well as significant amount of error corruption, it fails to yield satisfactory results; a drawback that can be alleviated by exploiting domain-dependent prior knowledge or information. In this paper, we propose two models for the RPCA that take into account such side information, even in the presence of missing values. We apply this framework to the task of UV completion which is widely used in pose-invariant face recognition. Moreover, we construct a generative adversarial network (GAN) to extract side information as well as subspaces. These subspaces not only assist in the recovery but also speed up the process in case of large-scale data. We quantitatively and qualitatively evaluate the proposed approaches through both synthetic data and eight real-world datasets to verify their effectiveness.

21 August 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
NXNiannan Xue
Niannan Xue
BLBin Liu
Bin Liu
HGHuifeng Guo
Huifeng Guo
RTRuiming Tang
Ruiming Tang
FZFengwei Zhou
Fengwei Zhou
ZLZhenguo Li
Zhenguo Li
Feature combinations are essential for the success of many web applications, such as personalised recommendation and online advertising. State-of-the-art methods usually model explicit feature interactions to help neural networks reduce the number of parameters and achieve better performance. However, their explicit feature interactions are often restricted to the second-order due to computational complexity. In this work, we propose efficient ways to represent explicit high-order feature combinations as well as prune redundant features in the mean time. To begin with, we make novel use of the Count Sketch algorithm within a DNN classifier such that high-order feature combinations can be compactly represented. After that, to combat the problem of redundant features which degrade the prediction performance, we introduce an adaptive hashing algorithm, AutoHash, which can automatically select meaningful features to interact at high orders according to the specific dataset in question. This is an AutoML approach. Experiments on three well-known public datasets demonstrate that AutoHash is significantly superior to state-of-the-art methods. Meanwhile, due to its efficient scheme of automatically selecting useful high-order feature interactions, AutoHash has less model complexity and can be trained in an end-to-end manner with less training time than state-of-the-art methods.