• Title/Summary/Keyword: Markov 확률과정

Search Result 95, Processing Time 0.023 seconds

A Use of Expectation Maximization Clustering for Constructing a Markov Chain of Human Mobility Model (기대치 최대화 기반의 군집화를 통한 인간 이동 패턴의 마르코프 연쇄모델 도출)

  • Kim, Hyunuk;Song, Ha Yoon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.04a
    • /
    • pp.864-867
    • /
    • 2012
  • 사람들이 휴대용 위치정보 수집 장비나 혹은 스마트폰을 사용하면서 사람의 이동 정보인 위치정보들을 모으는 일이 가능해 졌다. 이러한 위치정보들을 가지고 본 논문에서는 사람의 이동 모델을 나타내고자 하였다. 이동 정보들은 머물러 있는(Stay)상태와 이동하는(Moving) 상태로 나눌 수 있는데 이러한 상태 중 머물러 있는 상태가 군집화가 되어 연쇄 모델속의 하나의 상태(State)로 나타나 질 수 있다. 물론 이동 정보들을 통해 연쇄모델 속 각 상태간의 전이 확률 또한 계산 할 수 있다. 이러한 일련의 과정을 본 논문에서는 기대치 최대화 기반 군집화 과정을 통해 연속시간 연쇄 모델의 형태로 인간의 이동성을 표현하였다. 또한 이러한 모델에서 대표 군집(macro)과 그 부속 군집(micro)을 표현할 수 있었고 이러한 모습은 대표적인 큰 군집 속의 작은 군집의 형태로 나타나게 된다.

Determination of Optimal Checkpoint Intervals for Real-Time Tasks Using Distributed Fault Detection (분산 고장 탐지 방식을 이용한 실시간 태스크에서의 최적 체크포인터 구간 선정)

  • Kwak, Seong Woo;Yang, Jung-Min
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.26 no.3
    • /
    • pp.202-207
    • /
    • 2016
  • Checkpoint placement is an effective fault tolerance technique against transient faults in which the task is re-executed from the latest checkpoint when a fault is detected. In this paper, we propose a new checkpoint placement strategy separating data saving and fault detection processes that are performed together in conventional checkpoints. Several fault detection processes are performed in one checkpoint interval in order to decrease the latency between the occurrence and detection of faults. We address the placement method of fault detection processes to maximize the probability of successful execution of a task within the given deadline. We develop the Markov chain model for a real-time task having the proposed checkpoints, and derive the optimal fault detection and checkpoint interval.

Locational Characteristics of Knowledge Service Industry and Related Employment Opportunity Estimation in the Seoul Metropolitan Area (서울대도시권 지식서비스산업의 입지적 특성과 관련 업종별 고용기회 예측)

  • Park, So Hyun;Lee, Keumsook
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.19 no.4
    • /
    • pp.694-711
    • /
    • 2016
  • This study analyzes the spatial characteristics of knowledge industry which has shown relatively rapid growth in the low-growth economy situation in recent years. In particular, we catch hold of the locational characteristics of the knowledge service industry which occupies the highest ratio by professional-expert jobs favoured by young generations, as well as estimate their occupational employment opportunities. By applying Location Quotient(LQ) and LISA, we reveal the spatial distribution patterns of publishing business, information service business and education service business in the Seoul Metropolitan area, and examine the changes in the spatial patterns during the last ten years. In order to understand the socio-economic factors which explain their locations, we apply the stepwise multiple regression analysis. Furthermore, we predict the changes distribution of Knowledge service industrial employment by applying Markov Chain Model. As the result, we found their clusters at the specific locations, while there is the significant variations in the socio-economic variables related their locations respectively. The related job opportunities of the knowledge service businesses in the Seoul Metropolitan area are predicted steady growth trend for the next four years, even though dull or stagnant trend is expected for other industries. This study provides basic resources to the planning for young generation employment problem.

Emotion recognition in speech using hidden Markov model (은닉 마르코프 모델을 이용한 음성에서의 감정인식)

  • 김성일;정현열
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.3
    • /
    • pp.21-26
    • /
    • 2002
  • This paper presents the new approach of identifying human emotional states such as anger, happiness, normal, sadness, or surprise. This is accomplished by using discrete duration continuous hidden Markov models(DDCHMM). For this, the emotional feature parameters are first defined from input speech signals. In this study, we used prosodic parameters such as pitch signals, energy, and their each derivative, which were then trained by HMM for recognition. Speaker adapted emotional models based on maximum a posteriori(MAP) estimation were also considered for speaker adaptation. As results, the simulation performance showed that the recognition rates of vocal emotion gradually increased with an increase of adaptation sample number.

  • PDF

A Study on VQ/HMM using Nonlinear Clustering and Smoothing Method (비선형 집단화와 완화기법을 이용한 VQ/HMM에 관한 연구)

  • 정희석;강철호
    • The Journal of the Acoustical Society of Korea
    • /
    • v.18 no.3
    • /
    • pp.35-42
    • /
    • 1999
  • In this paper, a modified clustering algorithm is proposed to improve the discrimination of discrete HMM(Hidden Markov Model), so that it has increased recognition rate of 2.16% in comparison with the original HMM using the K-means or LBG algorithm. And, for preventing the decrease of recognition rate because of insufficient training data at the training scheme of HMM, a modified probabilistic smoothing method is proposed, which has increased recognition rate of 3.07% for the speaker-independent case. In the experiment applied the two proposed algorithms, the average rate of recognition has increased 4.66% for the speaker-independent case in comparison with that of original VQ/HMM.

  • PDF

Bayesian Computation for Superposition of MUSA-OKUMOTO and ERLANG(2) processes (MUSA-OKUMOTO와 ERLANG(2)의 중첩과정에 대한 베이지안 계산 연구)

  • 최기헌;김희철
    • The Korean Journal of Applied Statistics
    • /
    • v.11 no.2
    • /
    • pp.377-387
    • /
    • 1998
  • A Markov Chain Monte Carlo method with data augmentation is developed to compute the features of the posterior distribution. For each observed failure epoch, we introduced latent variables that indicates with component of the Superposition model. This data augmentation approach facilitates specification of the transitional measure in the Markov Chain. Metropolis algorithms along with Gibbs steps are proposed to preform the Bayesian inference of such models. for model determination, we explored the Pre-quential conditional predictive Ordinate(PCPO) criterion that selects the best model with the largest posterior likelihood among models using all possible subsets of the component intensity functions. To relax the monotonic intensity function assumptions, we consider in this paper Superposition of Musa-Okumoto and Erlang(2) models. A numerical example with simulated dataset is given.

  • PDF

Region Decision Using Modified ICM Method (변형된 ICM 방식에 의한 영역판별)

  • Hwang Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.5 s.311
    • /
    • pp.37-44
    • /
    • 2006
  • In this paper, a new version of the ICM method(MICM, modified ICM) in which the contextual information is modelled by Markov random fields (MRF) is introduced. To extract the feature, a new local MRF model with a fitting block neighbourhood is proposed. This model selects contextual information not only from the relative intensity levels but also from the geometrically directional position of neighbouring cliques. Feature extraction depends on each block's contribution to the local variance. They discriminates it into several regions, for example context and background. Boundaries between these regions are also distinctive. The proposed algerian performs segmentation using directional block fitting procedure which confines merging to spatially adjacent elements and generates a partition such that pixels in unified cluster have a homogeneous intensity level. From experiment with ink rubbed copy images(Takbon, 拓本), this method is determined to be quite effective for feature identification. In particular, the new algorithm preserves the details of the images well without over- and under-smoothing problem occurring in general iterated conditional modes (ICM). And also, it may be noted that this method is applicable to the handwriting recognition.

A study on performance improvement of neural network using output probability of HMM (HMM의 출력확률을 이용한 신경회로망의 성능향상에 관한 연구)

  • Pyo Chang Soo;Kim Chang Keun;Hur Kang In
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.1 no.1
    • /
    • pp.1-6
    • /
    • 2000
  • In this paper, the hybrid system of HMM and neural network is proposed and show better recognition rate of the post-process procedure which minimizes the process error of recognition than that of HMM(Hidden Markov Model) only used. After the HMM training by training data, testing data that are not taken part in the training are sent to HMM. The output probability from HMM output by testing data is used for the training data of the neural network, post processor. After neural network training, the hybrid system is completed. This hybrid system makes the recognition rate improvement of about $4.5\%$ in MLP and about $2\%$ in RBFN and gives the solution to training time of conventional hybrid system and to decrease of the recognition rate due to the lack of training data in real-time speech recognition system.

  • PDF

A Recognition Framework for Facial Expression by Expression HMM and Posterior Probability (표정 HMM과 사후 확률을 이용한 얼굴 표정 인식 프레임워크)

  • Kim, Jin-Ok
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.3
    • /
    • pp.284-291
    • /
    • 2005
  • I propose a framework for detecting, recognizing and classifying facial features based on learned expression patterns. The framework recognizes facial expressions by using PCA and expression HMM(EHMM) which is Hidden Markov Model (HMM) approach to represent the spatial information and the temporal dynamics of the time varying visual expression patterns. Because the low level spatial feature extraction is fused with the temporal analysis, a unified spatio-temporal approach of HMM to common detection, tracking and classification problems is effective. The proposed recognition framework is accomplished by applying posterior probability between current visual observations and previous visual evidences. Consequently, the framework shows accurate and robust results of recognition on as well simple expressions as basic 6 facial feature patterns. The method allows us to perform a set of important tasks such as facial-expression recognition, HCI and key-frame extraction.

Analysis of Uncertainty of Rainfall Frequency Analysis Including Extreme Rainfall Events (극치강우사상을 포함한 강우빈도분석의 불확실성 분석)

  • Kim, Sang-Ug;Lee, Kil-Seong;Park, Young-Jin
    • Journal of Korea Water Resources Association
    • /
    • v.43 no.4
    • /
    • pp.337-351
    • /
    • 2010
  • There is a growing dissatisfaction with use of conventional statistical methods for the prediction of extreme events. Conventional methodology for modeling extreme event consists of adopting an asymptotic model to describe stochastic variation. However asymptotically motivated models remain the centerpiece of our modeling strategy, since without such an asymptotic basis, models have no rational for extrapolation beyond the level of observed data. Also, this asymptotic models ignored or overestimate the uncertainty and finally decrease the reliability of uncertainty. Therefore this article provide the research example of the extreme rainfall event and the methodology to reduce the uncertainty. In this study, the Bayesian MCMC (Bayesian Markov Chain Monte Carlo) and the MLE (Maximum Likelihood Estimation) methods using a quadratic approximation are applied to perform the at-site rainfall frequency analysis. Especially, the GEV distribution and Gumbel distribution which frequently used distribution in the fields of rainfall frequency distribution are used and compared. Also, the results of two distribution are analyzed and compared in the aspect of uncertainty.