• Title/Summary/Keyword: Gaussian Learning

Search Result 278, Processing Time 0.06 seconds

Learning Distribution Graphs Using a Neuro-Fuzzy Network for Naive Bayesian Classifier (퍼지신경망을 사용한 네이브 베이지안 분류기의 분산 그래프 학습)

  • Tian, Xue-Wei;Lim, Joon S.
    • Journal of Digital Convergence
    • /
    • v.11 no.11
    • /
    • pp.409-414
    • /
    • 2013
  • Naive Bayesian classifiers are a powerful and well-known type of classifiers that can be easily induced from a dataset of sample cases. However, the strong conditional independence assumptions can sometimes lead to weak classification performance. Normally, naive Bayesian classifiers use Gaussian distributions to handle continuous attributes and to represent the likelihood of the features conditioned on the classes. The probability density of attributes, however, is not always well fitted by a Gaussian distribution. Another eminent type of classifier is the neuro-fuzzy classifier, which can learn fuzzy rules and fuzzy sets using supervised learning. Since there are specific structural similarities between a neuro-fuzzy classifier and a naive Bayesian classifier, the purpose of this study is to apply learning distribution graphs constructed by a neuro-fuzzy network to naive Bayesian classifiers. We compare the Gaussian distribution graphs with the fuzzy distribution graphs for the naive Bayesian classifier. We applied these two types of distribution graphs to classify leukemia and colon DNA microarray data sets. The results demonstrate that a naive Bayesian classifier with fuzzy distribution graphs is more reliable than that with Gaussian distribution graphs.

A Hardware Implementation of Moving Object Detection Algorithm using Gaussian Mixture Model (가우시안 혼합 모델을 이용한 이동 객체 검출 알고리듬의 하드웨어 구현)

  • Kim, Gyeong-hun;An, Hyo-Sik;Shin, Kyung-wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.407-409
    • /
    • 2015
  • In this paper, a hardware implementation of MOD(Moving Object Detection) algorithm is described, which is based GMM(Gaussian Mixture Model) and background subtraction. The EGML(Effective Gaussian Mixture Learning) is used to model and update background. Some approximations of EGML calculations are applied to reduce hardware complexity, and pipelining technique is used to improve operating speed. Gaussian parameters are adjustable according to various environment conditions to achieve better MOD performance. MOD processor is verified by using FPGA-in-the-loop verification, and it can operate with 109 MHz clock frequency on XC5VSX95T FPGA device.

  • PDF

An analysis of hardware design conditions of EGML-based moving object detection algorithm (EGML 기반 이동 객체 검출 알고리듬의 하드웨어 설계조건 분석)

  • An, Hyo-sik;Kim, Keoung-hun;Shin, Kyung-wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.371-373
    • /
    • 2015
  • This paper describes an analysis of hardware design conditions of moving object detection algorithm which is based on effective Gaussian mixture learning (EGML). The simulation model of EGML algorithm is implemented using OpenCV, and it is analyzed that the effects of parameter values on background learning time and moving object detection sensitivity for various images. In addition, optimal design conditions for hardware implementation of EGML-based MOD algorithm are extracted from fixed-point simulations for various bit-width parameters.

  • PDF

Efficient Learning Algorithm using Structural Hybrid of Multilayer Neural Networks and Gaussian Potential Function Networks (다층 신경회로망과 가우시안 포텐샬 함수 네트워크의 구조적 결합을 이용한 효율적인 학습 방법)

  • 박상봉;박래정;박철훈
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.12
    • /
    • pp.2418-2425
    • /
    • 1994
  • Although the error backpropagation(EBP) algorithm based on the gradient descent method is a widely-used learning algorithm of neural networks, learning sometimes takes a long time to acquire accuracy. This paper develops a novel learning method to alleviate the problems of EBP algorithm such as local minima, slow speed, and size of structure and thus to improve performance by adopting other new networks. Gaussian Potential Function networks(GPFN), in parallel with multilayer neural networks. Empirical simulations show the efficacy of the proposed algorithm in function approximation, which enables us to train networks faster with the better generalization capabilities.

  • PDF

A Design of Hierarchical Gaussian ARTMAP using Different Metric Generation for Each Level (계층별 메트릭 생성을 이용한 계층적 Gaussian ARTMAP의 설계)

  • Choi, Tea-Hun;Lim, Sung-Kil;Lee, Hyon-Soo
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.8
    • /
    • pp.633-641
    • /
    • 2009
  • In this paper, we proposed a new pattern classifier which can be incrementally learned, be added new class in learning time, and handle with analog data. Proposed pattern classifier has hierarchical structure and the classification rate is improved by using different metric for each levels. Proposed model is based on the Gaussian ARTMAP which is an artificial neural network model for the pattern classification. We hierarchically constructed the Gaussian ARTMAP and proposed the Principal Component Emphasis(P.C.E) method to be learned different features in each levels. And we defined new metric based on the P.C.E. P.C.E is a method that discards dimensions whose variation are small, that represents common attributes in the class. And remains dimensions whose variation are large. In the learning process, if input pattern is misclassified, P.C.E are performed and the modified pattern is learned in sub network. Experimental results indicate that Hierarchical Gaussian ARTMAP yield better classification result than the other pattern recognition algorithms on variable data set including real applicable problem.

Smoothed Local PC0A by BYY data smoothing learning

  • Liu, Zhiyong;Xu, Lei
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.109.3-109
    • /
    • 2001
  • The so-called curse of dimensionality arises when Gaussian mixture is used on high-dimensional small-sample-size data, since the number of free elements that needs to be specied in each covariance matrix of Gaussian mixture increases exponentially with the number of dimension d. In this paper, by constraining the covariance matrix in its decomposed orthonormal form we get a local PCA model so as to reduce the number of free elements needed to be specified. Moreover, to cope with the small sample size problem, we adopt BYY data smoothing learning which is a regularization over maximum likelihood learning obtained from BYY harmony learning to implement this local PCA model.

  • PDF

Adaptive Gaussian Mixture Learning for High Traffic Region (혼잡한 환경에서 적응적 가우시안 혼합 모델을 이용한 배경의 학습 및 객체 검출)

  • Park Dae-Yong;Kim Jae-Min;Cho Seong-Won
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.55 no.2
    • /
    • pp.52-61
    • /
    • 2006
  • For the detection of moving objects, background subtraction methods are widely used. An adaptive Gaussian mixture model combined with probabilistic learning is one of the most popular methods for the real-time update of the complex and dynamic background. However, probabilistic learning approach does not work well in high traffic regions. In this paper, we Propose a reliable learning method of complex and dynamic backgrounds in high traffic regions.

Autoencoder-Based Automotive Intrusion Detection System Using Gaussian Kernel Density Estimation Function (가우시안 커널 밀도 추정 함수를 이용한 오토인코더 기반 차량용 침입 탐지 시스템)

  • Donghyeon Kim;Hyungchul Im;Seongsoo Lee
    • Journal of IKEEE
    • /
    • v.28 no.1
    • /
    • pp.6-13
    • /
    • 2024
  • This paper proposes an approach to detect abnormal data in automotive controller area network (CAN) using an unsupervised learning model, i.e. autoencoder and Gaussian kernel density estimation function. The proposed autoencoder model is trained with only message ID of CAN data frames. Afterwards, by employing the Gaussian kernel density estimation function, it effectively detects abnormal data based on the trained model characterized by the optimally determined number of frames and a loss threshold. It was verified and evaluated using four types of attack data, i.e. DoS attacks, gear spoofing attacks, RPM spoofing attacks, and fuzzy attacks. Compared with conventional unsupervised learning-based models, it has achieved over 99% detection performance across all evaluation metrics.

Outlier Robust Learning Algorithm for Gaussian Process Classification (가우시안 과정 분류를 위한 극단치에 강인한 학습 알고리즘)

  • Kim, Hyun-Chul;Ghahramani, Zoubin
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.10c
    • /
    • pp.485-489
    • /
    • 2007
  • Gaussian process classifiers (GPCs) are fully statistical kernel classification models which have a latent function with Gaussian process prior Recently, EP approximation method has been proposed to infer the posterior over the latent function. It can have a special hyperparameter which can treat outliers potentially. In this paper, we propose the outlier robust algorithm which alternates EP and the hyperparameter updating until convergence. We also show its usefulness with the simulation results.

  • PDF

License Plates Detection Using a Gaussian Windows (가우시안 창을 이용한 번호판 영역 검출)

  • Kang, Yong-Seok;Bae, Cheol-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.9
    • /
    • pp.780-785
    • /
    • 2012
  • In the current study, the authors propose a method for extracting license plate regions by means of a neural network trained to output the plates center of gravity. The method is shown to be effective. Since the learning pattern presentation positions are defined by random numbers, a different pattern is submitted to the neural network for learning each time, which enables it to form a neural network with high universality of coverage. The article discusses issues of the optimal learning surface for a license plate covered by the learning pattern, the effect of suppression learning of the number and headlight sections, as well as the effect of learning pattern enlargement/reduction and of concentration value conversion. Results of evaluation tests based on pictures of 595 vehicles taken at an underground parking garage demonstrated detection rates of 98.5%.