• 제목/요약/키워드: Bayesian Learning Algorithm

Search Result 97, Processing Time 0.03 seconds

Developing an approach for fast estimation of range of ion in interaction with material using the Geant4 toolkit in combination with the neural network

  • Khalil Moshkbar-Bakhshayesh;Soroush Mohtashami
    • Nuclear Engineering and Technology
    • /
    • v.54 no.11
    • /
    • pp.4209-4214
    • /
    • 2022
  • Precise modelling of the interaction of ions with materials is important for many applications including material characterization, ion implantation in devices, thermonuclear fusion, hadron therapy, secondary particle production (e.g. neutron), etc. In this study, a new approach using the Geant4 toolkit in combination with the Bayesian regularization (BR) learning algorithm of the feed-forward neural network (FFNN) is developed to estimate the range of ions in materials accurately and quickly. The different incident ions at different energies are interacted with the target materials. The Geant4 is utilized to model the interactions and to calculate the range of the ions. Afterward, the appropriate architecture of the FFNN-BR with the relevant input features is utilized to learn the modelled ranges and to estimate the new ranges for the new cases. The notable achievements of the proposed approach are: 1- The range of ions in different materials is given as quickly as possible and the time required for estimating the ranges can be neglected (i.e. less than 0.01 s by a typical personal computer). 2- The proposed approach can generalize its ability for estimating the new untrained cases. 3- There is no need for a pre-made lookup table for the estimation of the range values.

A Study on Speaker Identification Using Hybrid Neural Network (하이브리드 신경회로망을 이용한 화자인식에 관한 연구)

  • Shin, Chung-Ho;Shin, Dea-Kyu;Lee, Jea-Hyuk;Park, Sang-Hee
    • Proceedings of the KIEE Conference
    • /
    • 1997.11a
    • /
    • pp.600-602
    • /
    • 1997
  • In this study, a hybrid neural net consisting of an Adaptive LVQ(ALVQ) algorithm and MLP is proposed to perform speaker identification task. ALVQ is a new learning procedure using adaptively feature vector sequence instead of only one feature vector in training codebooks initialized by LBG algorithm and the optimization criterion of this method is consistent with the speaker classification decision rule. ALVQ aims at providing a compressed, geometrically consistent data representation. It is fit to cover irregular data distributions and computes the distance of the input vector sequence from its nodes. On the other hand, MLP aim at a data representation to fit to discriminate patterns belonging to different classes. It has been shown that MLP nets can approximate Bayesian "optimal" classifiers with high precision, and their output values can be related a-posteriori class probabilities. The different characteristics of these neural models make it possible to devise hybrid neural net systems, consisting of classification modules based on these two different philosophies. The proposed method is compared with LBG algorithm, LVQ algorithm and MLP for performance.

  • PDF

Study on Compressed Sensing of ECG/EMG/EEG Signals for Low Power Wireless Biopotential Signal Monitoring (저전력 무선 생체신호 모니터링을 위한 심전도/근전도/뇌전도의 압축센싱 연구)

  • Lee, Ukjun;Shin, Hyunchol
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.3
    • /
    • pp.89-95
    • /
    • 2015
  • Compresses sensing (CS) technique is beneficial for reducing power consumption of biopotential acquisition circuits in wireless healthcare system. This paper investigates the maximum possible compress ratio for various biopotential signal when the CS technique is applied. By using the CS technique, we perform the compression and reconstruction of typical electrocardiogram(ECG), electromyogram(EMG), electroencephalogram(EEG) signals. By comparing the original signal and reconstructed signal, we determines the validity of the CS-based signal compression. Raw-biopotential signal is compressed by using a psuedo-random matrix, and the compressed signal is reconstructed by using the Block Sparse Bayesian Learning(BSBL) algorithm. EMG signal, which is the most sparse biopotential signal, the maximum compress ratio is found to be 10, and the ECG'sl maximum compress ratio is found to be 5. EEG signal, which is the least sparse bioptential signal, the maximum compress ratio is found to be 4. The results of this work is useful and instrumental for the design of wireless biopotential signal monitoring circuits.

Emotion Recognition and Expression System of User using Multi-Modal Sensor Fusion Algorithm (다중 센서 융합 알고리즘을 이용한 사용자의 감정 인식 및 표현 시스템)

  • Yeom, Hong-Gi;Joo, Jong-Tae;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.1
    • /
    • pp.20-26
    • /
    • 2008
  • As they have more and more intelligence robots or computers these days, so the interaction between intelligence robot(computer) - human is getting more and more important also the emotion recognition and expression are indispensable for interaction between intelligence robot(computer) - human. In this paper, firstly we extract emotional features at speech signal and facial image. Secondly we apply both BL(Bayesian Learning) and PCA(Principal Component Analysis), lastly we classify five emotions patterns(normal, happy, anger, surprise and sad) also, we experiment with decision fusion and feature fusion to enhance emotion recognition rate. The decision fusion method experiment on emotion recognition that result values of each recognition system apply Fuzzy membership function and the feature fusion method selects superior features through SFS(Sequential Forward Selection) method and superior features are applied to Neural Networks based on MLP(Multi Layer Perceptron) for classifying five emotions patterns. and recognized result apply to 2D facial shape for express emotion.

A New Image Analysis Method based on Regression Manifold 3-D PCA (회귀 매니폴드 3-D PCA 기반 새로운 이미지 분석 방법)

  • Lee, Kyung-Min;Lin, Chi-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.2
    • /
    • pp.103-108
    • /
    • 2022
  • In this paper, we propose a new image analysis method based on regression manifold 3-D PCA. The proposed method is a new image analysis method consisting of a regression analysis algorithm with a structure designed based on an autoencoder capable of nonlinear expansion of manifold 3-D PCA and PCA for efficient dimension reduction when entering large-capacity image data. With the configuration of an autoencoder, a regression manifold 3-DPCA, which derives the best hyperplane through three-dimensional rotation of image pixel values, and a Bayesian rule structure similar to a deep learning structure, are applied. Experiments are performed to verify performance. The image is improved by utilizing the fine dust image, and accuracy performance evaluation is performed through the classification model. As a result, it can be confirmed that it is effective for deep learning performance.

Cooperative Bayesian Compressed Spectrum Sensing for Correlated Signals in Cognitive Radio Networks (인지 무선 네트워크에서 상관관계를 갖는 다중 신호를 위한 협력 베이지안 압축 스펙트럼 센싱)

  • Jung, Honggyu;Kim, Kwangyul;Shin, Yoan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.9
    • /
    • pp.765-774
    • /
    • 2013
  • In this paper, we present a cooperative compressed spectrum sensing scheme for correlated signals in decentralized wideband cognitive radio networks. Compressed sensing is a signal processing technique that can recover signals which are sampled below the Nyquist rate with high probability, and can solve the necessity of high-speed analog-to-digital converter problem for wideband spectrum sensing. In compressed sensing, one of the main issues is to design recovery algorithms which accurately recover original signals from compressed signals. In this paper, in order to achieve high recovery performance, we consider the multiple measurement vector model which has a sequence of compressed signals, and propose a cooperative sparse Bayesian recovery algorithm which models the temporal correlation of the input signals.

Development of Facial Emotion Recognition System Based on Optimization of HMM Structure by using Harmony Search Algorithm (Harmony Search 알고리즘 기반 HMM 구조 최적화에 의한 얼굴 정서 인식 시스템 개발)

  • Ko, Kwang-Eun;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.3
    • /
    • pp.395-400
    • /
    • 2011
  • In this paper, we propose an study of the facial emotion recognition considering the dynamical variation of emotional state in facial image sequences. The proposed system consists of two main step: facial image based emotional feature extraction and emotional state classification/recognition. At first, we propose a method for extracting and analyzing the emotional feature region using a combination of Active Shape Model (ASM) and Facial Action Units (FAUs). And then, it is proposed that emotional state classification and recognition method based on Hidden Markov Model (HMM) type of dynamic Bayesian network. Also, we adopt a Harmony Search (HS) algorithm based heuristic optimization procedure in a parameter learning of HMM in order to classify the emotional state more accurately. By using all these methods, we construct the emotion recognition system based on variations of the dynamic facial image sequence and make an attempt at improvement of the recognition performance.

Development of Bond Strength Model for FRP Plates Using Back-Propagation Algorithm (역전파 학습 알고리즘을 이용한 콘크리트와 부착된 FRP 판의 부착강도 모델 개발)

  • Park, Do-Kyong
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.10 no.2
    • /
    • pp.133-144
    • /
    • 2006
  • In order to catch out such Bond Strength, the preceding researchers had ever examined the Bond Strength of FRP Plate through their experimentations by setting up of various fluent. However, since the experiment for research on such Bond Strength takes much of expenditure for equipment structure and time-consuming, also difficult to carry out, it is conducting limitedly. This Study purposes to develop the most suitable Artificial Neural Network Model by application of various Neural Network Model and Algorithm to the adhering experiment data of the preceding researchers. Output Layer of Artificial Neural Network Model, and Input Layer of Bond Strength were performed the learning by selection as the variable of the thickness, width, adhered length, the modulus of elasticity, tensile strength, and the compressive strength of concrete, tensile strength, width, respectively. The developed Artificial Neural Network Model has applied Back-Propagation, and its error was learnt to be converged within the range of 0.001. Besides, the process for generalization has dissolved the problem of Over-Fitting in the way of more generalized method by introduction of Bayesian Technique. The verification on the developed Model was executed by comparison with the resulted value of Bond Strength made by the other preceding researchers which was never been utilized to the learning as yet.

Extensions of X-means with Efficient Learning the Number of Clusters (X-means 확장을 통한 효율적인 집단 개수의 결정)

  • Heo, Gyeong-Yong;Woo, Young-Woon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.4
    • /
    • pp.772-780
    • /
    • 2008
  • K-means is one of the simplest unsupervised learning algorithms that solve the clustering problem. However K-means suffers the basic shortcoming: the number of clusters k has to be known in advance. In this paper, we propose extensions of X-means, which can estimate the number of clusters using Bayesian information criterion(BIC). We introduce two different versions of algorithm: modified X-means(MX-means) and generalized X-means(GX-means), which employ one full covariance matrix for one cluster and so can estimate the number of clusters efficiently without severe over-fitting which X-means suffers due to its spherical cluster assumption. The algorithms start with one cluster and try to split a cluster iteratively to maximize the BIC score. The former uses K-means algorithm to find a set of optimal clusters with current k, which makes it simple and fast. However it generates wrongly estimated centers when the clusters are overlapped. The latter uses EM algorithm to estimate the parameters and generates more stable clusters even when the clusters are overlapped. Experiments with synthetic data show that the purposed methods can provide a robust estimate of the number of clusters and cluster parameters compared to other existing top-down algorithms.

Implementation and Experimental Results of Neural Network and Genetic Algorithm based Spam Filtering Technique (신경망과 운전자 알고리즘을 이용한 스팸 메일 필터링 기법에 구현과 성능평가)

  • Kim Bum-Bae;Choi Hyoung-Kee
    • The KIPS Transactions:PartC
    • /
    • v.13C no.2 s.105
    • /
    • pp.259-266
    • /
    • 2006
  • As the volume of spam has increased to extreme levels, many anti-spam filtering techniques have been proposed. Among these techniques, the machine-Loaming filtering technique is one of the most popular filtering techniques. In this paper, we propose a machine-learning spam filtering technique based on the neural network, the genetic algorithm and the $X^2$-statistic. This proposed filtering technique is designed to overcome the problems in existing filtering techniques, and to achieve high spam filtering accuracy. It is able to classify spam and legitimate emil with 95.25 percent and 95.31 percent accuracy. This accuracy of the sum filtering is 7.75 percent and the 12.44 percent higher than rule-based filtering and the Bayesian filtering technique, respectively.