• Title/Summary/Keyword: Boltzmann Machine

Search Result 37, Processing Time 0.025 seconds

A Modified Deterministic Boltzmann Machine Learning Algorithm for Networks with Quantized Connection (양자화 결합 네트워크를 위한 수정된 결정론적 볼츠만머신 학습 알고리즘)

  • 박철영
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.7 no.3
    • /
    • pp.62-67
    • /
    • 2002
  • From the view point of VLSI implementation, a new teaming algorithm suited for network with quantized connection weights is desired. This paper presents a new teaming algorithm for the DBM(deterministic Boltzmann machine) network with quantized connection weight. The performance of proposed algorithm is tested with the 2-input XOR problem and the 3-input parity problem through computer simulations. The simulation results show that our algorithm is efficient for quantized connection neural networks.

  • PDF

Infrared and Visible Image Fusion Based on NSCT and Deep Learning

  • Feng, Xin
    • Journal of Information Processing Systems
    • /
    • v.14 no.6
    • /
    • pp.1405-1419
    • /
    • 2018
  • An image fusion method is proposed on the basis of depth model segmentation to overcome the shortcomings of noise interference and artifacts caused by infrared and visible image fusion. Firstly, the deep Boltzmann machine is used to perform the priori learning of infrared and visible target and background contour, and the depth segmentation model of the contour is constructed. The Split Bregman iterative algorithm is employed to gain the optimal energy segmentation of infrared and visible image contours. Then, the nonsubsampled contourlet transform (NSCT) transform is taken to decompose the source image, and the corresponding rules are used to integrate the coefficients in the light of the segmented background contour. Finally, the NSCT inverse transform is used to reconstruct the fused image. The simulation results of MATLAB indicates that the proposed algorithm can obtain the fusion result of both target and background contours effectively, with a high contrast and noise suppression in subjective evaluation as well as great merits in objective quantitative indicators.

Distributed Construction of the Multiple-Ring Topology of the Connected Dominating Set for the Mobile Ad Hoc Networks: Boltzmann Machine Approach (무선 애드혹 망을 위한 연결 지배 집합 다중-링 위상의 분산적 구성-볼츠만 기계적 접근)

  • Park, Jae-Hyun
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.3
    • /
    • pp.226-238
    • /
    • 2007
  • In this paper, we present a novel fully distributed topology control protocol that can construct the multiple-ring topology of Minimal Connected Dominating Set (MCDS) as the transport backbone for mobile ad hoc networks. It makes a topology from the minimal nodes that are chosen from all the nodes, and the constructed topology is comprised of the minimal physical links while preserving connectivity. This topology reduces the interference. The all nodes work as the nodes of the distributed parallel Boltzmann machine, of which the objective function is consisted of two Boltzmann factors: the link degree and the connection domination degree. To define these Boltzmann factors, we extend the Connected Dominating Set into a fuzzy set, and also define the fuzzy set of nodes by which the multiple-ring topology can be constructed. To construct the transport backbone of the mobile ad hoc network, the proposed protocol chooses the nodes that are the strong members of these two fuzzy sets as the clusterheads. We also ran simulations to provide the quantitative comparison against the related works in terms of the packet loss rate and the energy consumption rate. As a result, we show that the network that is constructed by the proposed protocol has far better than the other ones with respect to the packet loss rate and the energy consumption rate.

Neural-network based Computerized Emotion Analysis using Multiple Biological Signals (다중 생체신호를 이용한 신경망 기반 전산화 감정해석)

  • Lee, Jee-Eun;Kim, Byeong-Nam;Yoo, Sun-Kook
    • Science of Emotion and Sensibility
    • /
    • v.20 no.2
    • /
    • pp.161-170
    • /
    • 2017
  • Emotion affects many parts of human life such as learning ability, behavior and judgment. It is important to understand human nature. Emotion can only be inferred from facial expressions or gestures, what it actually is. In particular, emotion is difficult to classify not only because individuals feel differently about emotion but also because visually induced emotion does not sustain during whole testing period. To solve the problem, we acquired bio-signals and extracted features from those signals, which offer objective information about emotion stimulus. The emotion pattern classifier was composed of unsupervised learning algorithm with hidden nodes and feature vectors. Restricted Boltzmann machine (RBM) based on probability estimation was used in the unsupervised learning and maps emotion features to transformed dimensions. The emotion was characterized by non-linear classifiers with hidden nodes of a multi layer neural network, named deep belief network (DBN). The accuracy of DBN (about 94 %) was better than that of back-propagation neural network (about 40 %). The DBN showed good performance as the emotion pattern classifier.

Android malicious code Classification using Deep Belief Network

  • Shiqi, Luo;Shengwei, Tian;Long, Yu;Jiong, Yu;Hua, Sun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.454-475
    • /
    • 2018
  • This paper presents a novel Android malware classification model planned to classify and categorize Android malicious code at Drebin dataset. The amount of malicious mobile application targeting Android based smartphones has increased rapidly. In this paper, Restricted Boltzmann Machine and Deep Belief Network are used to classify malware into families of Android application. A texture-fingerprint based approach is proposed to extract or detect the feature of malware content. A malware has a unique "image texture" in feature spatial relations. The method uses information on texture image extracted from malicious or benign code, which are mapped to uncompressed gray-scale according to the texture image-based approach. By studying and extracting the implicit features of the API call from a large number of training samples, we get the original dynamic activity features sets. In order to improve the accuracy of classification algorithm on the features selection, on the basis of which, it combines the implicit features of the texture image and API call in malicious code, to train Restricted Boltzmann Machine and Back Propagation. In an evaluation with different malware and benign samples, the experimental results suggest that the usability of this method---using Deep Belief Network to classify Android malware by their texture images and API calls, it detects more than 94% of the malware with few false alarms. Which is higher than shallow machine learning algorithm clearly.

Diagnosis of Alzheimer's Disease using Wrapper Feature Selection Method

  • Vyshnavi Ramineni;Goo-Rak Kwon
    • Smart Media Journal
    • /
    • v.12 no.3
    • /
    • pp.30-37
    • /
    • 2023
  • Alzheimer's disease (AD) symptoms are being treated by early diagnosis, where we can only slow the symptoms and research is still undergoing. In consideration, using T1-weighted images several classification models are proposed in Machine learning to identify AD. In this paper, we consider the improvised feature selection, to reduce the complexity by using wrapping techniques and Restricted Boltzmann Machine (RBM). This present work used the subcortical and cortical features of 278 subjects from the ADNI dataset to identify AD and sMRI. Multi-class classification is used for the experiment i.e., AD, EMCI, LMCI, HC. The proposed feature selection consists of Forward feature selection, Backward feature selection, and Combined PCA & RBM. Forward and backward feature selection methods use an iterative method starting being no features in the forward feature selection and backward feature selection with all features included in the technique. PCA is used to reduce the dimensions and RBM is used to select the best feature without interpreting the features. We have compared the three models with PCA to analysis. The following experiment shows that combined PCA &RBM, and backward feature selection give the best accuracy with respective classification model RF i.e., 88.65, 88.56% respectively.

Collaborative Filtering based Recommender System using Restricted Boltzmann Machines

  • Lee, Soojung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.9
    • /
    • pp.101-108
    • /
    • 2020
  • Recommender system is a must-have feature of e-commerce, since it provides customers with convenience in selecting products. Collaborative filtering is a widely-used and representative technique, where it gives recommendation lists of products preferred by other users or preferred by the current user in the past. Recently, researches on the recommendation system using deep learning artificial intelligence technologies are actively being conducted to achieve performance improvement. This study develops a collaborative filtering based recommender system using restricted Boltzmann machines of the deep learning technology by utilizing user ratings. Moreover, a learning parameter update algorithm is proposed for learning efficiency and performance. Performance evaluation of the proposed system is made through experimental analysis and comparison with conventional collaborative filtering methods. It is found that the proposed algorithm yields superior performance than the basic restricted Boltzmann machines.

RBM-based distributed representation of language (RBM을 이용한 언어의 분산 표상화)

  • You, Heejo;Nam, Kichun;Nam, Hosung
    • Korean Journal of Cognitive Science
    • /
    • v.28 no.2
    • /
    • pp.111-131
    • /
    • 2017
  • The connectionist model is one approach to studying language processing from a computational perspective. And building a representation in the connectionist model study is just as important as making the structure of the model in that it determines the level of learning and performance of the model. The connectionist model has been constructed in two different ways: localist representation and distributed representation. However, the localist representation used in the previous studies had limitations in that the unit of the output layer having a rare target activation value is inactivated, and the past distributed representation has the limitation of difficulty in confirming the result by the opacity of the displayed information. This has been a limitation of the overall connection model study. In this paper, we present a new method to induce distributed representation with local representation using abstraction of information, which is a feature of restricted Boltzmann machine, with respect to the limitation of such representation of the past. As a result, our proposed method effectively solves the problem of conventional representation by using the method of information compression and inverse transformation of distributed representation into local representation.

Learning Algorithm for Deterministic Boltzmann Machine with Quantized Connections (양자화결합을 갖는 결정론적 볼츠만 머신 학습 알고리듬)

  • 박철영
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.11a
    • /
    • pp.409-412
    • /
    • 2000
  • 본 논문에서는 기존의 결정론적 볼츠만 머신의 학습알고리듬을 수정하여 양자화결합을 갖는 볼츠만 머신에도 적용할 수 있는 알고리듬을 제안하였다. 제안한 알고리듬은 2-입력 XOR문제와 3-입력 패리티문제에 적용하여 성능을 분석하였다. 그 결과 하중이 대폭적으로 양자화된 네트워크도 학습이 가능하다는 것은 은닉 뉴런수를 증가시키면 한정된 하중값의 범위로 유지할 수 있다는 것을 보여주었다. 또한 1회에 갱신하는 하중의 개수 m$_{s}$를 제어함으로써 학습계수를 제어하는 효과가 얻어지는 것을 확인하였다..

  • PDF

Efficient Watercolor Painting on Mobile Devices

  • Oh, Junkyu;Maeng, SeungRol;Park, Jinho
    • International Journal of Contents
    • /
    • v.8 no.4
    • /
    • pp.36-41
    • /
    • 2012
  • We present a novel watercolor painting drawing system which can work even on low powered computing machine such as tablet PC. Most digital watercolor systems are generated to perform on desktop, not low powered mobile computing system such as iPad. Our system can be utilized for art education besides professional painters. Our system is not a naïve imitation of real watercolor painting, but handles with properties of watercolor such as diffusion, boundary salience, and mixing of water and pigment.