A novel generative adversarial network‐based super‐resolution approach for face recognition

Abstract

AbstractFace recognition is an essential feature required for a range of computer vision applications such as security, attendance systems, emotion detection, airport check‐in, and many others. The super‐resolution of subject images is an important and challenging element in numerous scenarios. At times the images are low resolution and need to be processed through super‐resolution techniques to gain more accurate results. For the problem of image super‐resolution, deep learning‐based face recognition systems have been explored in recent years; however, low‐resolution face recognition remains an arduous task. Generative adversarial network (GAN) based models are a promising approach to address this challenge. However, conventional GAN‐based models may generate images that differ significantly from an original high‐resolution image in the test set to the point that the identity of the target face may be changed. To address this shortcoming, we propose a novel U‐Net style generator architecture, where skip‐connections between the encoder and decoder layer can help in preserving the facial characteristics of the input image in the generated image, thus curbing the generator's ability to generate an entirely new image and training it to generate an image more similar in characteristics to the original image. In addition to statistical metrics like structural similarity index measure and Fréchet inception distance, we compute the pixel‐wise distance between the original and model‐generated images to ascertain that our model generates as close to the original images as possible. While we train the model for 4× super‐resolution (64 × 64 images to 256 × 256), our architecture can also be trained for an arbitrary resizing scale. Finally, the number of faces detected over high‐resolution images generated by our model is shown to be higher than state‐of‐the‐art high‐resolution image creation models for face recognition tasks.