• 제목/요약/키워드: Gan Algorithm

Search Result 72, Processing Time 0.027 seconds

A Probabilistic Tracking Mechanism for Luxury Purchase Implemented by Hidden Markov Model, Bayesian Inference, Customer Satisfaction and Net Promoter Score (고객만족, NPS, Bayesian Inference 및 Hidden Markov Model로 구현하는 명품구매에 관한 확률적 추적 메카니즘)

  • Hwang, Sun Ju;Rhee, Jung Soo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.23 no.6
    • /
    • pp.79-94
    • /
    • 2018
  • The purpose of this study is to specify a probabilistic tracking mechanism for customer luxury purchase implemented by hidden Markov model, Bayesian inference, customer satisfaction and net promoter score. In this paper, we have designed a probabilistic model based on customer's actual data containing purchase or non-purchase states by tracking the SPC chain : customer satisfaction -> customer referral -> purchase/non-purchase. By applying hidden Markov model and Viterbi algorithm to marketing theory, we have developed the statistical model related to probability theories and have found the best purchase pattern scenario from customer's purchase records.

Infrared and visible image fusion based on Laplacian pyramid and generative adversarial network

  • Wang, Juan;Ke, Cong;Wu, Minghu;Liu, Min;Zeng, Chunyan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.5
    • /
    • pp.1761-1777
    • /
    • 2021
  • An image with infrared features and visible details is obtained by processing infrared and visible images. In this paper, a fusion method based on Laplacian pyramid and generative adversarial network is proposed to obtain high quality fusion images, termed as Laplacian-GAN. Firstly, the base and detail layers are obtained by decomposing the source images. Secondly, we utilize the Laplacian pyramid-based method to fuse these base layers to obtain more information of the base layer. Thirdly, the detail part is fused by a generative adversarial network. In addition, generative adversarial network avoids the manual design complicated fusion rules. Finally, the fused base layer and fused detail layer are reconstructed to obtain the fused image. Experimental results demonstrate that the proposed method can obtain state-of-the-art fusion performance in both visual quality and objective assessment. In terms of visual observation, the fusion image obtained by Laplacian-GAN algorithm in this paper is clearer in detail. At the same time, in the six metrics of MI, AG, EI, MS_SSIM, Qabf and SCD, the algorithm presented in this paper has improved by 0.62%, 7.10%, 14.53%, 12.18%, 34.33% and 12.23%, respectively, compared with the best of the other three algorithms.

Restoration of Ghost Imaging in Atmospheric Turbulence Based on Deep Learning

  • Chenzhe Jiang;Banglian Xu;Leihong Zhang;Dawei Zhang
    • Current Optics and Photonics
    • /
    • v.7 no.6
    • /
    • pp.655-664
    • /
    • 2023
  • Ghost imaging (GI) technology is developing rapidly, but there are inevitably some limitations such as the influence of atmospheric turbulence. In this paper, we study a ghost imaging system in atmospheric turbulence and use a gamma-gamma (GG) model to simulate the medium to strong range of turbulence distribution. With a compressed sensing (CS) algorithm and generative adversarial network (GAN), the image can be restored well. We analyze the performance of correlation imaging, the influence of atmospheric turbulence and the restoration algorithm's effects. The restored image's peak signal-to-noise ratio (PSNR) and structural similarity index map (SSIM) increased to 21.9 dB and 0.67 dB, respectively. This proves that deep learning (DL) methods can restore a distorted image well, and it has specific significance for computational imaging in noisy and fuzzy environments.

A Deep Learning Based Over-Sampling Scheme for Imbalanced Data Classification (불균형 데이터 분류를 위한 딥러닝 기반 오버샘플링 기법)

  • Son, Min Jae;Jung, Seung Won;Hwang, Een Jun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.8 no.7
    • /
    • pp.311-316
    • /
    • 2019
  • Classification problem is to predict the class to which an input data belongs. One of the most popular methods to do this is training a machine learning algorithm using the given dataset. In this case, the dataset should have a well-balanced class distribution for the best performance. However, when the dataset has an imbalanced class distribution, its classification performance could be very poor. To overcome this problem, we propose an over-sampling scheme that balances the number of data by using Conditional Generative Adversarial Networks (CGAN). CGAN is a generative model developed from Generative Adversarial Networks (GAN), which can learn data characteristics and generate data that is similar to real data. Therefore, CGAN can generate data of a class which has a small number of data so that the problem induced by imbalanced class distribution can be mitigated, and classification performance can be improved. Experiments using actual collected data show that the over-sampling technique using CGAN is effective and that it is superior to existing over-sampling techniques.

Outsourcing decryption algorithm of Verifiable transformed ciphertext for data sharing

  • Guangwei Xu;Chen Wang;Shan Li;Xiujin Shi;Xin Luo;Yanglan Gan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.4
    • /
    • pp.998-1019
    • /
    • 2024
  • Mobile cloud computing is a very attractive service paradigm that outsources users' data computing and storage from mobile devices to cloud data centers. To protect data privacy, users often encrypt their data to ensure data sharing securely before data outsourcing. However, the bilinear and power operations involved in the encryption and decryption computation make it impossible for mobile devices with weak computational power and network transmission capability to correctly obtain decryption results. To this end, this paper proposes an outsourcing decryption algorithm of verifiable transformed ciphertext. First, the algorithm uses the key blinding technique to divide the user's private key into two parts, i.e., the authorization key and the decryption secret key. Then, the cloud data center performs the outsourcing decryption operation of the encrypted data to achieve partial decryption of the encrypted data after obtaining the authorization key and the user's outsourced decryption request. The verifiable random function is used to prevent the semi-trusted cloud data center from not performing the outsourcing decryption operation as required so that the verifiability of the outsourcing decryption is satisfied. Finally, the algorithm uses the authorization period to control the final decryption of the authorized user. Theoretical and experimental analyses show that the proposed algorithm reduces the computational overhead of ciphertext decryption while ensuring the verifiability of outsourcing decryption.

Deep Learning Based Digital Staining Method in Fourier Ptychographic Microscopy Image (Fourier Ptychographic Microscopy 영상에서의 딥러닝 기반 디지털 염색 방법 연구)

  • Seok-Min Hwang;Dong-Bum Kim;Yu-Jeong Kim;Yeo-Rin Kim;Jong-Ha Lee
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.23 no.2
    • /
    • pp.97-106
    • /
    • 2022
  • In this study, H&E staining is necessary to distinguish cells. However, dyeing directly requires a lot of money and time. The purpose is to convert the phase image of unstained cells to the amplitude image of stained cells. Image data taken with FPM was created with Phase image and Amplitude image using Matlab's parameters. Through normalization, a visually identifiable image was obtained. Through normalization, a visually distinguishable image was obtained. Using the GAN algorithm, a Fake Amplitude image similar to the Real Amplitude image was created based on the Phase image, and cells were distinguished by objectification using MASK R-CNN with the Fake Amplitude image As a result of the study, D loss max is 3.3e-1, min is 6.8e-2, G loss max is 6.9e-2, min is 2.9e-2, A loss max is 5.8e-1, min is 1.2e-1, Mask R-CNN max is 1.9e0, and min is 3.2e-1.

A Positioning DB Generation Algorithm Applying Generative Adversarial Learning Method of Wireless Communication Signals

  • Ji, Myungin;Jeon, Juil;Cho, Youngsu
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.9 no.3
    • /
    • pp.151-156
    • /
    • 2020
  • A technology for calculating the position of a device is very important for users who receive positioning services, regardless of various indoor/outdoor or with/without any positioning infrastructure existence environments. One of the positioning resources widely used at present, LTE, is a typical infrastructure that can overcome the space limitation, however its positioning method based on the position of the LTE base station has low accuracy. A method of constructing a radio wave map of an LTE signal has been proposed as a method for overcoming the accuracy, but it takes a lot of time and cost to perform high-density collection in a wide area. In this paper, we describe a method of creating a high-density DB for the entire region by using vehicle-based partial collection data. To create a positioning database, we applied the idea of Generative Adversarial Network (GAN), which has recently been in the spotlight in the field of deep learning, and learned the collected data. Then, a virtually generated map which having the smallest error from the actual data is selected as the optimum DB. We verified the effectiveness of the positioning DB generation algorithm using the positioning data obtained from un-collected area.

Design of Ballistic Calculation Model for Improving Accuracy of Naval Gun Firing based on Deep Learning

  • Oh, Moon-Tak
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.12
    • /
    • pp.11-18
    • /
    • 2021
  • This paper shows the applicability of deep learning algorithm in predicting target position and getting correction value of impact point in order to improve the accuracy of naval gun firing. Predicting target position, the proposed model using LSTM model and RN structure is expected to be more accurate than existing method using kalman filter. Getting correction value of impact point, the another proposed model suggests a reinforcement model that manages factors which is related in ballistic calculation as data set, and learns using the data set. The model is expected to reduce error of naval gun firing. Combining two models, a ballistic calculation model for improving accuracy of naval gun firing based on deep learning algorithm was designed.

In-Process Relative Robot WorkCell Calibration

  • Wang, Jianjun;Sun, Yunquan;Gan, zhongxue
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.269-272
    • /
    • 2003
  • Industry is now seeing a dramatic increase in robot simulation and off-line programming. In order to use off-line programming effectively, the simulated workcell has to be identical to the real workcell. This requires an efficient and accurate method for the workcell calibration. Currently used techniques in the industry, however, are typically time-consuming, expensive and therefore not suitable for in-process application. This is because most of these techniques are based on the so-called “absolute calibration” method. In contrast to absolute method, relative calibration only measures the difference of an interested object relative to a standard reference. Owing to the small measurement range requirement, relative calibration method is very cheap and can achieve very high accuracy. In this paper the relative method is applied to calibrate an entire grinding workcell. Linear gauge is the only measurement device used. This workcell calibration includes tool center point (TCP) calibration and work object frame calibration. Due to the efficiency of the calibration algorithm and the simplicity of the calibration setup, the described calibration procedure can be done in process.

  • PDF

Algorithm and Rules for the Optimal Positiion of Two Gateways in Grid Topology Networks (격자구조망에서 두 개의 게이트웨어 최적 위치 설정을 위한 알고리즘 및 원리)

  • Go, Jong-Ha;Yang, Yeong-Nim;Sin, Ho-Gan;Lee, Jeong-Gyu
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.2
    • /
    • pp.223-231
    • /
    • 1999
  • 본 논문은 두 개의게이트웨이를 사용한 격자구저망에서 최적의 게이트웨이 위치 설정을 위한 알고리즘을 제안하고 원리를 유도하였다. 최적의 게이트웨이 위치란 격자구조망내 각 노드에서 게이트웨이까지의 평균 최소 링크 수를 가지는 위치로 정의한다. 두 개의 게이트웨이르 사용함으로써 망내의 신뢰도 향상 효과를 가져오며, 우회 경로로 인한 호차단 확률(call blocking probability)과 호설정시간(call setup time)을 최소화한다. 따라서 본 논문에서는 망의 성능을 향상시키기 위하여 두 개의 게이트웨이의 최적의 위치를 결정하는 Grid-Traverse 알고리즘을 제안하고 설정원리들을 유도하여 , 수학적 귀납법으로 이 원리들을 증명하였다.