High-quality face image generation using particle swarm optimization-based generative adversarial networks

Face image generation based on generative adversarial networks (GAN) is a hot research topic in computer vision. Existing GAN-based algorithms are constrained by training instability and mode collapse. Considering that particle swarm optimization (PSO) algorithm has good global optimization ability,...

Full description

Saved in:
Bibliographic Details
Published inFuture generation computer systems Vol. 122; pp. 98 - 104
Main Authors Zhang, Long, Zhao, Lin
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.09.2021
Subjects
Online AccessGet full text
ISSN0167-739X
1872-7115
DOI10.1016/j.future.2021.03.022

Cover

More Information
Summary:Face image generation based on generative adversarial networks (GAN) is a hot research topic in computer vision. Existing GAN-based algorithms are constrained by training instability and mode collapse. Considering that particle swarm optimization (PSO) algorithm has good global optimization ability, we propose a generation antagonism network based on PSO algorithm to improve the training stability. More specifically, the inertia weight of particle swarm is improved by using the parameters of particle representative generator network in particle swarm optimization, and the aggregation degree of particles is judged to ensure the optimization ability of particle swarm optimization and the diversity of population. In addition, we evaluate the performance of the generator by generating quality and diversity evaluation functions to better guide the iterative updating of particle swarm optimization. Our face image generation experiment is conducted on CelebA dataset and experimental result shows the effectiveness and robustness of our proposed method. •Inertia weight of particle swarm is improved.•Aggregation degree of particles is judged to ensure optimization ability.•Quality and diversity function is created to assess the generator’s performance.
ISSN:0167-739X
1872-7115
DOI:10.1016/j.future.2021.03.022