• 제목/요약/키워드: Gan 알고리즘

검색결과 61건 처리시간 0.027초

A Study on GAN Algorithm for Restoration of Cultural Property (pagoda)

  • Yoon, Jin-Hyun;Lee, Byong-Kwon;Kim, Byung-Wan
    • Journal of the Korea Society of Computer and Information
    • /
    • 제26권1호
    • /
    • pp.77-84
    • /
    • 2021
  • Today, the restoration of cultural properties is done by applying the latest IT technology from relying on existing data and experts. However, there are cases where new data are released and the original restoration is incorrect. Also, sometimes it takes too long to restore. And there is a possibility that the results will be different than expected. Therefore, we aim to quickly restore cultural properties using DeepLearning. Recently, so the algorithm DcGAN made in GANs algorithm, and image creation, restoring sectors are constantly evolving. We try to find the optimal GAN algorithm for the restoration of cultural properties among various GAN algorithms. Because the GAN algorithm is used in various fields. In the field of restoring cultural properties, it will show that it can be applied in practice by obtaining meaningful results. As a result of experimenting with the DCGAN and Style GAN algorithms among the GAN algorithms, it was confirmed that the DCGAN algorithm generates a top image with a low resolution.

A Study on Image Quality Improvement for 3D Pagoda Restoration (3D 탑복원을 위한 화질 개선에 관한 연구)

  • Kim, Beom Jun-Ji;Lee, Hyun-woo;Kim, Ki-hyeop;Kim, Eun-ji;Kim, Young-jin;Lee, Byong-Kwon
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 한국컴퓨터정보학회 2022년도 제66차 하계학술대회논문집 30권2호
    • /
    • pp.145-147
    • /
    • 2022
  • 본 논문에서는 훼손되어 식별할 수 없는 탑 이미지를 비롯해 낮은 해상도의 탑 이미지를 개선하기 위해 우리는 탑 이미지의 화질 개선을 인공지능을 이용하여 빠르게 개선을 해 보고자 한다. 최근에 Generative Adversarial Networks(GANS) 알고리즘에서 SrGAN 알고리즘이 나오면서 이미지 생성, 이미지 복원, 해상도 변화 분야가 지속해서 발전하고 있다. 이에 본 연구에서는 다양한 GAN 알고리즘을 화질 개선에 적용해 보았다. 탑 이미지에 GAN 알고리즘 중 SrGan을 적용하였으며 실험한 결과 Srgan 알고리즘은 학습이 진행되었으며, 낮은 해상도의 탑 이미지가 높은 해상도, 초고해상도 이미지가 생성되는 것을 확인했다.

  • PDF

Trading Algorithm Selection Using Time-Series Generative Adversarial Networks (TimeGAN을 활용한 트레이딩 알고리즘 선택)

  • Lee, Jae Yoon;Lee, Ju Hong;Choi, Bum Ghi;Song, Jae Won
    • Smart Media Journal
    • /
    • 제11권1호
    • /
    • pp.38-45
    • /
    • 2022
  • A lot of research is being going until this day in order to obtain stable profit in the stock market. Trading algorithms are widely used, accounting for over 80% of the trading volume of the US stock market. Despite a lot of research, there is no trading algorithm that always shows good performance. In other words, there is no guarantee that an algorithm that performed well in the past will perform well in the future. The reason is that there are many factors that affect the stock price and there are uncertainties about the future. Therefore, in this paper, we propose a model using TimeGAN that predicts future returns well and selects algorithms that are expected to have high returns based on past records of the returns of algorithms. We use TimeGAN becasue it is probabilistic, whereas LSTM method predicts future time series data is deterministic. The advantage of TimeGAN probabilistic prediction is that it can reflect uncertainty about the future. As an experimental result, the method proposed in this paper achieves a high return with little volatility and shows superior results compared to many comparison algorithms.

Comparison Analysis on Automatic Coloring System Algorithm Using Machine Learning (머신러닝을 활용한 자동 채색 시스템 알고리즘 비교 분석)

  • Lee, song eun;Lee, Ji Yeon;Kim, Na Heon;Kim, Jin Hwan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 한국정보처리학회 2017년도 추계학술발표대회
    • /
    • pp.792-794
    • /
    • 2017
  • 현재 머신러닝(Machine Learning) 기술은 기존의 머신러닝과 조합 및 변형 되어 조금 더 발전 된 형태로 연구되어지고 있다. 따라서 수많은 알고리즘이 개발되고 있는 시점이다. 본 연구는 최근 좋은 결과로 관심을 받고있는 GAN(Generative Adversarial Net)을 중심으로 IT기술의 머신러닝과 그림을 조합하여 자동채색을 목적으로 GAN 알고리즘을 비교하고 분석하고자 한다. GAN 알고리즘들 가운데서 'Conditional GAN'과 'Wasserstein GAN'을 사용하여 자동채색을 적용시켰고, 가장 부합한 알고리즘을 찾고 성능을 비교하여 어떠한 알고리즘이 '자동채색' 목적에 더 부합한지 비교하고 판단 한다.

Evaluation of Suitability of Fire Images augmented using GAN Algorithm (GAN 알고리즘을 이용하여 증식된 화재 영상의 적합성 평가)

  • Son, SeongHyeok;Choi, Donggyu;Jang, Si-woong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 한국정보통신학회 2022년도 추계학술대회
    • /
    • pp.77-79
    • /
    • 2022
  • A large amount of related images are required to detect images with variable shapes. Therefore, in this paper, fire images among images with variable shapes are multiplied through GAN algorithms, and detection rates when AI learning is performed using this image are compared to analyze whether the multiplied images are suitable for learning data.

  • PDF

Improved CycleGAN for underwater ship engine audio translation (수중 선박엔진 음향 변환을 위한 향상된 CycleGAN 알고리즘)

  • Ashraf, Hina;Jeong, Yoon-Sang;Lee, Chong Hyun
    • The Journal of the Acoustical Society of Korea
    • /
    • 제39권4호
    • /
    • pp.292-302
    • /
    • 2020
  • Machine learning algorithms have made immense contributions in various fields including sonar and radar applications. Recently developed Cycle-Consistency Generative Adversarial Network (CycleGAN), a variant of GAN has been successfully used for unpaired image-to-image translation. We present a modified CycleGAN for translation of underwater ship engine sounds with high perceptual quality. The proposed network is composed of an improved generator model trained to translate underwater audio from one vessel type to other, an improved discriminator to identify the data as real or fake and a modified cycle-consistency loss function. The quantitative and qualitative analysis of the proposed CycleGAN are performed on publicly available underwater dataset ShipsEar by evaluating and comparing Mel-cepstral distortion, pitch contour matching, nearest neighbor comparison and mean opinion score with existing algorithms. The analysis results of the proposed network demonstrate the effectiveness of the proposed network.

Broken Image Selection Algorithm based on Histogram Analysis (히스토그램 분석 기반 파손 영상 선별 알고리즘)

  • Cho, Jin-Hwan;Jang, Si-Woong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 한국정보통신학회 2021년도 추계학술대회
    • /
    • pp.72-74
    • /
    • 2021
  • Recently, the spread of deep learning environments has increased the importance of dataset generation. Therefore, data is being augmented using GAN for efficient data set generation. However, several problems have been found in data generated using GAN, such as problems that occur in the early stages of learning and pixel breakage occurring in the generated image. In this paper, we intend to implement an image data selection algorithm to solve various problems arising from the existing GAN. The broken image screening algorithm was implemented to analyze the histogram distribution in the image and determine whether to store the generated image according to whether the result value satisfies the specified threshold value.

  • PDF

GAN-based camouflage pattern generation parameter optimization system for improving assimilation rate with environment (야생 환경과의 동화율 개선을 위한 GAN 알고리즘 기반 위장 패턴 생성 파라미터 최적화 시스템)

  • Park, JunHyeok;Park, Seungmin;Cho, Dae-Soo
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 한국컴퓨터정보학회 2022년도 제66차 하계학술대회논문집 30권2호
    • /
    • pp.511-512
    • /
    • 2022
  • 동물무늬는 서식지에 따라 야생에서 천적으로부터 살아남을 수 있는 중요한 역할을 한다. 동물무늬의 역할 중 하나인 자연과 야생 환경에서 천적의 눈을 피해 위장하는 기능이 있기 때문인데 본 논문에서는 기존 위장무늬의 개선을 위한 GAN 알고리즘 기반 위장 패턴 생성모델을 제안한다. 이 모델은 단순히 색상만을 사용하여 위장무늬의 윤곽선을 Blur 처리를 해서 사람의 관측을 흐리게 만드는 기존의 모델의 단순함을 보완하여 GAN 알고리즘의 활용기술인 Deep Dream을 활용하여 경사 상승법을 통해 특정 층의 필터 값을 조절하여 원하는 부분에 대한 구분되는 패턴을 생성할 수 있어 색뿐만 아니라 위장의 기능이 있는 동물무늬와 섞어 자연과 야생 환경에서 더욱 동화율이 높아진 위장 패턴을 생성하고자 한다.

  • PDF

Applying SeqGAN Algorithm to Software Bug Repair (소프트웨어 버그 정정에 SeqGAN 알고리즘을 적용)

  • Yang, Geunseok;Lee, Byungjeong
    • Journal of Internet Computing and Services
    • /
    • 제21권5호
    • /
    • pp.129-137
    • /
    • 2020
  • Recently, software size and program code complexity have increased due to application to various fields of software. Accordingly, the existence of program bugs inevitably occurs, and the cost of software maintenance is increasing. In open source projects, developers spend a lot of debugging time when solving a bug report assigned. To solve this problem, in this paper, we apply SeqGAN algorithm to software bug repair. In detail, the SeqGAN model is trained based on the source code. Open similar source codes during the learning process are also used. To evaluate the suitability for the generated candidate patch, a fitness function is applied, and if all test cases are passed, software bug correction is considered successful. To evaluate the efficiency of the proposed model, it was compared with the baseline, and the proposed model showed better repair.

A Broken Image Screening Method based on Histogram Analysis to Improve GAN Algorithm (GAN 알고리즘 개선을 위한 히스토그램 분석 기반 파손 영상 선별 방법)

  • Cho, Jin-Hwan;Jang, Jongwook;Jang, Si-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • 제26권4호
    • /
    • pp.591-597
    • /
    • 2022
  • Recently, many studies have been done on the data augmentation technique as a way to efficiently build datasets. Among them, a representative data augmentation technique is a method of utilizing Generative Adversarial Network (GAN), which generates data similar to real data by competitively learning generators and discriminators. However, when learning GAN, there are cases where a broken pixel image occurs among similar data generated according to the environment and progress, which cannot be used as a dataset and causes an increase in learning time. In this paper, an algorithm was developed to select these damaged images by analyzing the histogram of image data generated during the GAN learning process, and as a result of comparing them with the images generated in the existing GAN, the ratio of the damaged images was reduced by 33.3 times(3,330%).