• Title/Summary/Keyword: Gaussian Learning

Search Result 278, Processing Time 0.034 seconds

On the Radial Basis Function Networks with the Basis Function of q-Normal Distribution

  • Eccyuya, Kotaro;Tanaka, Masaru
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.26-29
    • /
    • 2002
  • Radial Basis Function (RBF) networks is known as efficient method in classification problems and function approximation. The basis function of RBF networks is usual adopted normal distribution like the Gaussian function. The output of the Gaussian function has the maximum at the center and decrease as increase the distance from the center. For learning of neural network, the method treating the limited area of input space is sometimes more useful than the method treating the whole of input space. The q-normal distribution is the set of probability density function include the Gaussian function. In this paper, we introduce the RBF networks with the basis function of q-normal distribution and actually approximate a function using the RBF networks.

  • PDF

Advanced Gaussian Mixture Learning for Complex Environment (개선된 적응적 가우시안 혼합 모델을 이용한 객체 검출)

  • Park Dae-Yong;Kim Jae-Min;Cho Seong-Won
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2005.11a
    • /
    • pp.283-289
    • /
    • 2005
  • Background Subtraction은 움직이는 물체 검출에 가장 많이 사용되는 방법 중 하나이다. 배경이 복잡하고 변화가 심한 경우, 배경을 실시간으로 얼마나 정확하게 학습하는가가 물체 검출의 정확도를 결정한다. Gaussian Mixture Model은 이러한 배경의 모델링에 가장 많이 쓰이는 방법이다. Gaussian Mixture Model은 확률적 학습 방법을 사용하는데, 이러한 방법은 물체가 자주 지나다니거나 물체가 멈춰있는 경우, 배경을 정확하게 모델링하지 못한다. 본 논문에서는 밝기 값에 대한 확률적 모델링과 밝기 값의 변화에 따른 처리를 결합하여 혼잡한 환경에서 배경을 정확하게 모델링할 수 있는 학습 방법을 제안한다.

  • PDF

Estimation of Non-Gaussian Probability Density by Dynamic Bayesian Networks

  • Cho, Hyun-C.;Fadali, Sami M.;Lee, Kwon-S.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.408-413
    • /
    • 2005
  • A new methodology for discrete non-Gaussian probability density estimation is investigated in this paper based on a dynamic Bayesian network (DBN) and kernel functions. The estimator consists of a DBN in which the transition distribution is represented with kernel functions. The estimator parameters are determined through a recursive learning algorithm according to the maximum likelihood (ML) scheme. A discrete-type Poisson distribution is generated in a simulation experiment to evaluate the proposed method. In addition, an unknown probability density generated by nonlinear transformation of a Poisson random variable is simulated. Computer simulations numerically demonstrate that the method successfully estimates the unknown probability distribution function (PDF).

  • PDF

Implementation of Deep CNN denoiser for Reducing Over blur (Over blur를 감소시킨 Deep CNN 구현)

  • Lee, Sung-Hun;Lee, Kwang-Yeob;Jung, Jun-Mo
    • Journal of IKEEE
    • /
    • v.22 no.4
    • /
    • pp.1242-1245
    • /
    • 2018
  • In this paper, we have implemented a network that overcomes the over-blurring phenomenon that occurs when removing Gaussian noise. In the conventional filtering method, blurring of the original image is performed to remove noise, thereby eliminating high frequency components such as edges and corners. We propose a network that reducing over blurring while maintaining denoising performance by adding denoised high frequency components to denoisers based on CNN.

Estimating Regression Function with $\varepsilon-Insensitive$ Supervised Learning Algorithm

  • Hwang, Chang-Ha
    • Journal of the Korean Data and Information Science Society
    • /
    • v.15 no.2
    • /
    • pp.477-483
    • /
    • 2004
  • One of the major paradigms for supervised learning in neural network community is back-propagation learning. The standard implementations of back-propagation learning are optimal under the assumptions of identical and independent Gaussian noise. In this paper, for regression function estimation, we introduce $\varepsilon-insensitive$ back-propagation learning algorithm, which corresponds to minimizing the least absolute error. We compare this algorithm with support vector machine(SVM), which is another $\varepsilon-insensitive$ supervised learning algorithm and has been very successful in pattern recognition and function estimation problems. For comparison, we consider a more realistic model would allow the noise variance itself to depend on the input variables.

  • PDF

Study on Image Processing Techniques Applying Artificial Intelligence-based Gray Scale and RGB scale

  • Lee, Sang-Hyun;Kim, Hyun-Tae
    • International Journal of Advanced Culture Technology
    • /
    • v.10 no.2
    • /
    • pp.252-259
    • /
    • 2022
  • Artificial intelligence is used in fusion with image processing techniques using cameras. Image processing technology is a technology that processes objects in an image received from a camera in real time, and is used in various fields such as security monitoring and medical image analysis. If such image processing reduces the accuracy of recognition, providing incorrect information to medical image analysis, security monitoring, etc. may cause serious problems. Therefore, this paper uses a mixture of YOLOv4-tiny model and image processing algorithm and uses the COCO dataset for learning. The image processing algorithm performs five image processing methods such as normalization, Gaussian distribution, Otsu algorithm, equalization, and gradient operation. For RGB images, three image processing methods are performed: equalization, Gaussian blur, and gamma correction proceed. Among the nine algorithms applied in this paper, the Equalization and Gaussian Blur model showed the highest object detection accuracy of 96%, and the gamma correction (RGB environment) model showed the highest object detection rate of 89% outdoors (daytime). The image binarization model showed the highest object detection rate at 89% outdoors (night).

Increasing Accuracy of Stock Price Pattern Prediction through Data Augmentation for Deep Learning (데이터 증강을 통한 딥러닝 기반 주가 패턴 예측 정확도 향상 방안)

  • Kim, Youngjun;Kim, Yeojeong;Lee, Insun;Lee, Hong Joo
    • The Journal of Bigdata
    • /
    • v.4 no.2
    • /
    • pp.1-12
    • /
    • 2019
  • As Artificial Intelligence (AI) technology develops, it is applied to various fields such as image, voice, and text. AI has shown fine results in certain areas. Researchers have tried to predict the stock market by utilizing artificial intelligence as well. Predicting the stock market is known as one of the difficult problems since the stock market is affected by various factors such as economy and politics. In the field of AI, there are attempts to predict the ups and downs of stock price by studying stock price patterns using various machine learning techniques. This study suggest a way of predicting stock price patterns based on the Convolutional Neural Network(CNN) among machine learning techniques. CNN uses neural networks to classify images by extracting features from images through convolutional layers. Therefore, this study tries to classify candlestick images made by stock data in order to predict patterns. This study has two objectives. The first one referred as Case 1 is to predict the patterns with the images made by the same-day stock price data. The second one referred as Case 2 is to predict the next day stock price patterns with the images produced by the daily stock price data. In Case 1, data augmentation methods - random modification and Gaussian noise - are applied to generate more training data, and the generated images are put into the model to fit. Given that deep learning requires a large amount of data, this study suggests a method of data augmentation for candlestick images. Also, this study compares the accuracies of the images with Gaussian noise and different classification problems. All data in this study is collected through OpenAPI provided by DaiShin Securities. Case 1 has five different labels depending on patterns. The patterns are up with up closing, up with down closing, down with up closing, down with down closing, and staying. The images in Case 1 are created by removing the last candle(-1candle), the last two candles(-2candles), and the last three candles(-3candles) from 60 minutes, 30 minutes, 10 minutes, and 5 minutes candle charts. 60 minutes candle chart means one candle in the image has 60 minutes of information containing an open price, high price, low price, close price. Case 2 has two labels that are up and down. This study for Case 2 has generated for 60 minutes, 30 minutes, 10 minutes, and 5minutes candle charts without removing any candle. Considering the stock data, moving the candles in the images is suggested, instead of existing data augmentation techniques. How much the candles are moved is defined as the modified value. The average difference of closing prices between candles was 0.0029. Therefore, in this study, 0.003, 0.002, 0.001, 0.00025 are used for the modified value. The number of images was doubled after data augmentation. When it comes to Gaussian Noise, the mean value was 0, and the value of variance was 0.01. For both Case 1 and Case 2, the model is based on VGG-Net16 that has 16 layers. As a result, 10 minutes -1candle showed the best accuracy among 60 minutes, 30 minutes, 10 minutes, 5minutes candle charts. Thus, 10 minutes images were utilized for the rest of the experiment in Case 1. The three candles removed from the images were selected for data augmentation and application of Gaussian noise. 10 minutes -3candle resulted in 79.72% accuracy. The accuracy of the images with 0.00025 modified value and 100% changed candles was 79.92%. Applying Gaussian noise helped the accuracy to be 80.98%. According to the outcomes of Case 2, 60minutes candle charts could predict patterns of tomorrow by 82.60%. To sum up, this study is expected to contribute to further studies on the prediction of stock price patterns using images. This research provides a possible method for data augmentation of stock data.

  • PDF

The Design of Self-Organizing Map Using Pseudo Gaussian Function Network

  • Kim, Byung-Man;Cho, Hyung-Suck
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.42.6-42
    • /
    • 2002
  • Kohonen's self organizing feature map (SOFM) converts arbitrary dimensional patterns into one or two dimensional arrays of nodes. Among the many competitive learning algorithms, SOFM proposed by Kohonen is considered to be powerful in the sense that it not only clusters the input pattern adaptively but also organize the output node topologically. SOFM is usually used for a preprocessor or cluster. It can perform dimensional reduction of input patterns and obtain a topology-preserving map that preserves neighborhood relations of the input patterns. The traditional SOFM algorithm[1] is a competitive learning neural network that maps inputs to discrete points that are called nodes on a lattice...

  • PDF

Feature selection using genetic algorithm for constructing time-series modelling

  • Oh, Sang-Keon;Hong, Sun-Gi;Kim, Chang-Hyun;Lee, Ju-Jang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.102.4-102
    • /
    • 2001
  • An evolutionary structure optimization method for the Gaussian radial basis function (RBF) network is presented, for modelling and predicting nonlinear time series. Generalization performance is significantly improved with a much smaller network, compared with that of the usual clustering and least square learning method.

  • PDF

Convergence Properties of a Adaptive Learning Algorithm Employing a Ramp Threshold Function (Ramp 임계 함수를 적용한 적응 학습 알고리즘의 수렴성)

  • 박소희;조제황
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2000.08a
    • /
    • pp.121-124
    • /
    • 2000
  • 적응 학습 알고리즘으로 가중치를 변화시키는 단층 신경망의 출력부에 Ramp 임계 함수를 적용하여 입력이 zero-mean Gaussian random vector인 경우 가중치의 stationary point를 구하고, 적응 학습 알고리즘을 유도한다.

  • PDF