TY - GEN
T1 - Super-resolving Tiny Faces with Face Feature Vectors
AU - Luo, Yangkai
AU - Huang, Kaizhu
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/9
Y1 - 2020/9
N2 - Most of the current state-of-the-art tiny face super-resolution (SR) methods aim at learning a single one-to-one mapping to super-resolve low-resolution (LR) face images. In contrast with high-resolution (HR) faces images, LR faces images lack fine facial details, implying that an LR face image can be mapped to many HR candidates or vice versa. This ambiguity may lead that an HR face image super-resolved by one-to-one SR methods cannot preserve the accurate facial details. To alleviate this problem, we consider tiny face SR as an one-to-many mapping, and demonstrate that injecting reasonable additional facial prior knowledge can significantly reduce the ambiguity in face SR. Specifically, with the GAN architecture, we propose a novel face SR network consisting of an upsampling network and a discriminative network. The upsampling network is designed to embed facial prior knowledge (represented as a vector) into the residual features of LR inputs and super-resolve LR inputs (16 \times 16 pixels) with up-scaling factor of 4 \times. The discriminative network aims at examining whether the generated HR face images matches the corresponding facial prior. Furthermore, we also propose a model which can map the samples of a standard normal distribution to the facial prior distribution. In this way, we can readily sample different facial prior to support us to super-resolve a single LR face image to abundant different HR faces images. Through conducting extensive evaluations on a large-scale dataset, we demonstrate that our method achieves encouraging results, outperforming the current competitive algorithms.
AB - Most of the current state-of-the-art tiny face super-resolution (SR) methods aim at learning a single one-to-one mapping to super-resolve low-resolution (LR) face images. In contrast with high-resolution (HR) faces images, LR faces images lack fine facial details, implying that an LR face image can be mapped to many HR candidates or vice versa. This ambiguity may lead that an HR face image super-resolved by one-to-one SR methods cannot preserve the accurate facial details. To alleviate this problem, we consider tiny face SR as an one-to-many mapping, and demonstrate that injecting reasonable additional facial prior knowledge can significantly reduce the ambiguity in face SR. Specifically, with the GAN architecture, we propose a novel face SR network consisting of an upsampling network and a discriminative network. The upsampling network is designed to embed facial prior knowledge (represented as a vector) into the residual features of LR inputs and super-resolve LR inputs (16 \times 16 pixels) with up-scaling factor of 4 \times. The discriminative network aims at examining whether the generated HR face images matches the corresponding facial prior. Furthermore, we also propose a model which can map the samples of a standard normal distribution to the facial prior distribution. In this way, we can readily sample different facial prior to support us to super-resolve a single LR face image to abundant different HR faces images. Through conducting extensive evaluations on a large-scale dataset, we demonstrate that our method achieves encouraging results, outperforming the current competitive algorithms.
KW - Face Super-Resolution
KW - Facial Piror and GAN
KW - One-to-Many mapping
UR - http://www.scopus.com/inward/record.url?scp=85093963118&partnerID=8YFLogxK
U2 - 10.1109/ICIST49303.2020.9202156
DO - 10.1109/ICIST49303.2020.9202156
M3 - Conference Proceeding
AN - SCOPUS:85093963118
T3 - 10th International Conference on Information Science and Technology, ICIST 2020
SP - 145
EP - 152
BT - 10th International Conference on Information Science and Technology, ICIST 2020
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 10th International Conference on Information Science and Technology, ICIST 2020
Y2 - 9 September 2020 through 15 September 2020
ER -