ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

سایکل‌گن (CycleGAN): ترجمه تصویر به تصویر بدون جفت با سازگاری چرخه‌ای×شبکه مولد تخاصمی×
حوزهیادگیری عمیقیادگیری عمیق
خانوادهMachine learningMachine learning
سال پیدایش20172014
پدیدآورJun-Yan Zhu et al.Goodfellow, I. et al.
نوعUnsupervised image-to-image translationGenerative deep learning (adversarial two-network game)
منبع بنیادینZhu, J.-Y., Park, T., Isola, P., & Efros, A. A. (2017). Unpaired image-to-image translation using cycle-consistent adversarial networks. IEEE International Conference on Computer Vision (ICCV), 2242–2251. DOI ↗Goodfellow, I. et al. (2014). Generative Adversarial Nets. NeurIPS. link ↗
نام‌های دیگرCycle-Consistent Adversarial Networks, Unpaired Image-to-Image Translation, Cycle-GAN, Çevrimsel Tutarlı GANÜretici Çekişmeli Ağ (GAN), GAN, generative adversarial nets, adversarial network
مرتبط34
خلاصهCycleGAN, introduced by Zhu et al. at ICCV 2017, learns to translate images between two visual domains without requiring paired training examples. It trains two generators and two discriminators simultaneously, enforcing a cycle-consistency constraint so that an image translated from domain X to Y and back again recovers the original. This makes it applicable whenever large aligned datasets are unavailable, such as converting photographs to artwork styles, turning summer landscapes into winter scenes, or mapping satellite imagery to map tiles.A Generative Adversarial Network (GAN), introduced by Ian Goodfellow and colleagues in 2014, produces realistic synthetic data through the competition of two neural networks — a generator and a discriminator. It is widely used for image synthesis, data augmentation, and distribution estimation.
ScholarGateمجموعه‌داده
  1. v1
  2. 1 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: CycleGAN · Generative Adversarial Network. بازیابی‌شده در 2026-06-15 از https://scholargate.app/fa/compare