i-manager Publications

Generative Adversarial Networks: Techniques, Area Covered, and Challenges

Choubey Aakanksha S.*, Gajbhiye Samta**, Tiwari Rajesh***

*-** Department of Computer Science & Engineering, Shri Shankaracharya Institute of Engineering and Technology, Bhilai, Chhattisgarh, India.

*** CMR Engineering College, Medchal, Hyderabad, Telangana, India.

Periodicity:July - December'2023
DOI : https://doi.org/10.26634/jaim.1.2.20025

Abstract

Generative Adversarial Networks (GANs) have emerged as powerful frameworks for generating realistic and diverse data samples in various domains including computer vision, natural language processing and audio synthesis. In this study, a comprehensive overview of GANs, their key components, the training process, and the evolution of the field are presented. Different variations in GAN architectures and their applications across domains are discussed. Furthermore, the challenges and open research directions in GANs, their stability, mode collapse, evaluation metrics, and ethical considerations are analysed. The aim of this review is to provide a comprehensive understanding of GANs and their strengths, limitations, and potential future developments.

Keywords

Generative Adversarial Networks (GANs), Natural Language Processing, Training, Fréchet Inception Distance (FID), Dataset.

How to Cite this Article?

Aakanksha, S. C., Samta, G., and Rajesh, T. (2023). Generative Adversarial Networks: Techniques, Area Covered, and Challenges. i-manager’s Journal on Artificial Intelligence & Machine Learning, 1(2), 49-55. https://doi.org/10.26634/jaim.1.2.20025

References

[1]. Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., & Bengio, Y. (2014). Generative adversarial nets. Advances in Neural Information Processing Systems, 27.

[2]. Salimans, T., Goodfellow, I., Zaremba, W., Cheung, V., Radford, A., & Chen, X. (2016). Improved techniques for training GANs. Advances in Neural Information Processing Systems, 29.

[3]. Theis, L., Oord, A. V. D., & Bethge, M. (2015). A note on the evaluation of generative models. arXiv, 1, 1-10.

[4]. Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., & Hochreiter, S. (2017). GANs trained by a two time-scale update rule converge to a local Nash equilibrium. Advances in Neural Information Processing Systems, 30.

[5]. Karras, T., Aila, T., Laine, S., & Lehtinen, J. (2017). Progressive growing of gans for improved quality, stability, and variation. arXiv.

[6]. Zhang, H., Goodfellow, I., Metaxas, D., & Odena, A. (2019, May). Self-attention generative adversarial networks. In International Conference on Machine Learning (pp. 7354-7363). PMLR.

[7]. Kynkäänniemi, T., Karras, T., Laine, S., Lehtinen, J., & Aila, T. (2019). Improved precision and recall metric for assessing generative models. Advances in Neural Information Processing Systems, 1, 1-16.

[8]. Borji, A. (2019). Pros and cons of GAN evaluation measures. Computer Vision and Image Understanding, 179, 41-65.

[9]. Han, X., Song, X., Yao, Y., Xu, X. S., & Nie, L. (2019). Neural compatibility modeling with probabilistic knowledge distillation. IEEE Transactions on Image Processing, 29, 871-882.

[10]. Soloveitchik, M., Diskin, T., Morin, E., & Wiesel, A. (2021). Conditional frechet inception distance. arXiv.

[11]. Lin, T. Y., Goyal, P., Girshick, R., He, K., & Dollár, P. (2017). Focal loss for dense object detection. In IEEE Transactions on Pattern Analysis and Machine Intelligence, 42(2), 318-327.

[12]. Zhang, W., He, X., Yu, X., Lu, W., Zha, Z., & Tian, Q. (2019). A multi-scale spatial-temporal attention model for person re-identification in videos. IEEE Transactions on Image Processing, 29, 3365-3373.

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Pdf	40	40	300
Online	40	40	300
Pdf & Online	40	40	300

Generative Adversarial Networks: Techniques, Area Covered, and Challenges

Abstract

Keywords

How to Cite this Article?

References

If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Options for accessing this content: