BiTrackGAN: Cascaded CycleGANs to Constraint Face Aging

Tsung-Han Kuo, Zhenge Jia, Tei-Wei Kuo, Jingtong Hu
4/22/2023
cs.CV

No confident code implementation found for this paper.

Abstract

With the increased accuracy of modern computer vision technology, many access control systems are equipped with face recognition functions for faster identification. In order to maintain high recognition accuracy, it is necessary to keep the face database up-to-date. However, it is impractical to collect the latest facial picture of the system's user through human effort. Thus, we propose a bottom-up training method for our proposed network to address this challenge. Essentially, our proposed network is a translation pipeline that cascades two CycleGAN blocks (a widely used unpaired image-to-image translation generative adversarial network) called BiTrackGAN. By bottom-up training, it induces an ideal intermediate state between these two CycleGAN blocks, namely the constraint mechanism. Experimental results show that BiTrackGAN achieves more reasonable and diverse cross-age facial synthesis than other CycleGAN-related methods. As far as we know, it is a novel and effective constraint mechanism for more reason and accurate aging synthesis through the CycleGAN approach.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kuo2023bitrackgan,
  title  = {BiTrackGAN: Cascaded CycleGANs to Constraint Face Aging},
  author = {Tsung-Han Kuo and Zhenge Jia and Tei-Wei Kuo and Jingtong Hu},
  year   = {2023},
  eprint = {2304.11313},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.11313v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.11313.svg)](https://codeofpaper.com/paper/2304.11313)

Discussion