• Title/Summary/Keyword: 마르코프 모델

Search Result 243, Processing Time 0.031 seconds

Arrival Time Estimation for Bus Information System Using Hidden Markov Model (은닉 마르코프 모델을 이용한 버스 정보 시스템의 도착 시간 예측)

  • Park, Chul Young;Kim, Hong Geun;Shin, Chang Sun;Cho, Yong Yun;Park, Jang Woo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.4
    • /
    • pp.189-196
    • /
    • 2017
  • BIS(Bus Information System) provides the different information related to buses including predictions of arriving times at stations. BIS have been deployed almost all cities in our country and played active roles to improve the convenience of public transportation systems. Moving average filters, Kalman filter and regression models have been representative in forecasting the arriving times of buses in current BIS. The accuracy in prediction of arriving times depends largely on the forecasting algorithms and traffic conditions considered when forecasting in BIS. In present BIS, the simple prediction algorithms are used only considering the passage times and distances between stations. The forecasting of arrivals, however, have been influenced by the traffic conditions such as traffic signals, traffic accidents and pedestrians ets., and missing data. To improve the accuracy of bus arriving estimates, there are big troubles in building models including the above problems. Hidden Markov Models have been effective algorithms considering various restrictions above. So, we have built the HMM forecasting models for bus arriving times in the current BIS. When building models, the data collected from Sunchean City at 2015 have been utilized. There are about 2298 stations and 217 routes in Suncheon city. The models are developed differently week days and weekend. And then the models are conformed with the data from different districts and times. We find that our HMM models can provide more accurate forecasting than other existing methods like moving average filters, Kalmam filters, or regression models. In this paper, we propose Hidden Markov Model to obtain more precise and accurate model better than Moving Average Filter, Kalman Filter and regression model. With the help of Hidden Markov Model, two different sections were used to find the pattern and verified using Bootstrap process.

Estimating the Behavior Path of Seafarer Involved in Marine Accidents by Hidden Markov Model (은닉 마르코프 모델을 이용한 해양사고에 개입된 선원의 행동경로 추정)

  • Yim, Jeong-Bin
    • Journal of Navigation and Port Research
    • /
    • v.43 no.3
    • /
    • pp.160-165
    • /
    • 2019
  • The conduct of seafarer is major cause of marine accidents. This study models the behavior of the seafarer based on the Hidden Markov Model (HMM). Additionally, through the path analysis of the behavior estimated by the model, the kind of situations, procedures and errors that may have caused the marine accidents were interpreted. To successfully implement the model, the seafarer behaviors were observed by means of the summarized verdict reports issued by the Korean Maritime Safety Tribunal, and the observed results converted into behavior data suitable for HMM learning through the behavior classification framework based on the SRKBB (Skill-, Rule-, and Knowledge-Based Behavior). As a result of modeling the seafarer behaviors by the type of vessels, it was established that there was a difference between the models, and the possibility of identifying the preferred path of the seafarer behaviors. Through these results, it is expected that the model implementation technique proposed in this study can be applied to the prediction of the behavior of the seafarer as well as contribute to the prioritization of the behavior correction among seafarers, which is necessary for the prevention of marine accidents.

Activity Recognition based on Accelerometer using Self Organizing Maps and Hidden Markov Model (자기 구성 지도와 은닉 마르코프 모델을 이용한 가속도 센서 기반 행동 인식)

  • Hwang, Keum-Sung;Cho, Sung-Bae
    • 한국HCI학회:학술대회논문집
    • /
    • 2008.02a
    • /
    • pp.245-250
    • /
    • 2008
  • 최근 동작 및 행동 인식에 대한 연구가 활발하다. 특히, 센서가 소형화되고 저렴해지면서 그 활용을 위한 관심이 증가하고 있다. 기존의 많은 행동 인식 연구에서 사용되어 온 정적 분류 기술 기반 동작 인식 방법은 연속적인 데이터 분류 기술에 비해 유연성 및 활용성이 부족할 수 있다. 본 논문에서는 연속적인 데이터의 패턴 분류 및 인식에 효과적인 확률적 추론 기법인 은닉 마르코프 모델(Hidden Markov Model)과 사전 지식 없이도 자동 학습이 가능하며 의미 깊은 궤적 패턴을 클러스터링하고 효과적인 양자화가 가능한 자기구성지도(Self Organizing Map)를 이용한 동작 인식 기술을 소개한다. 또한, 그 유용성을 입증하기 위해 실제 가속도 센서를 이용하여 다양한 동작에 대한 데이터를 수집하고 분류 성능을 분석 및 평가한다. 실험에서는 실제 가속도 센서를 통해 수집된 숫자를 그리는 동작의 성능 평가 결과를 보이고, 행동 인식기 별 성능과 전체 인식기별 성능을 비교한다.

  • PDF

Robust estimation of HMM parameters Based on the State-Dependent Source-Quantization for Speech Recognition (상태의존 소스 양자화에 기반한 음성인식을 위한 은닉 마르코프 모델 파라미터의 견고한 추정)

  • 최환진;박재득
    • The Journal of the Acoustical Society of Korea
    • /
    • v.17 no.1
    • /
    • pp.66-75
    • /
    • 1998
  • 최근 음성인식을 위한 대표적인 방법으로써 은닉 마르코프 모델이 사용되고 있으며, 이러한 방법은 음성의 특성을 잘 표현하도록 하는 음향적인 모델링 방법에 따라서 성능이 좌우된다. 본 논문에서는 상태에서의 출력확률은 견고히 추정하기 위한 방법으로 상태에서 의 출력활률을 소스들의 분포와 그들의 빈도로 가중한 출력분포로 표시하는 상태 의존 소스 양자화 모델링 방법을 제안한다. 이 방법은 한 상태 내에서 특징 파라미터들이 유사한 특성 을 가지며, 그들의 변이가 다른 상태에 있는 특징 파라미터들에 비해서 작다는 사실에 기반 한다. 실험결과에 의하면, 제안된 방법이 기존의 baseline시스템보다 단어 인식율의 경우는 2.7%, 문장 인식율의 경우 3.6%의 향상을 보였다. 이러한 결과로부터 제안된 SDSQ-DHMM이 인식율 향상면에서 유효하며, HMM에 있어서 상태별 출력확률의 견고한 추정을 위한 대안으로 사용될 수 있을 것으로 판단된다.

  • PDF

Condition Monitoring Of Rotating Machine With Mass Unbalance Using Hidden Markov Model (은닉 마르코프 모델을 이용한 질량 편심이 있는 회전기기의 상태진단)

  • Ko, Jungmin;Choi, Chankyu;Kang, To;Han, Soonwoo;Park, Jinho;Yoo, Honghee
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2014.10a
    • /
    • pp.833-834
    • /
    • 2014
  • In recent years, a pattern recognition method has been widely used by researchers for fault diagnoses of mechanical systems. A pattern recognition method determines the soundness of a mechanical system by detecting variations in the system's vibration characteristics. Hidden Markov model has recently been used as pattern recognition methods in various fields. In this study, a HMM method for the fault diagnosis of a mechanical system is introduced, and a rotating machine with mass unbalance is selected for fault diagnosis. Moreover, a diagnosis procedure to identity the size of a defect is proposed in this study.

  • PDF

Two-Dimensional Model of Hidden Markov Lattice (이차원 은닉 마르코프 격자 모형)

  • 신봉기
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.6
    • /
    • pp.566-574
    • /
    • 2000
  • Although a numbed of variants of 2D HMM have been proposed in the literature, they are, in a word, too simple to model the variabilities of images for diverse classes of objects; they do not realize the modeling capability of the 1D HMM in 2D. Thus the author thinks they are poor substitutes for the HMM in 2D. The new model proposed in this paper is a hidden Markov lattice or, we can dare say, a 2D HMM with the causality of top-down and left-right direction. Then with the addition of a lattice constraint, the two algorithms for the evaluation of a model and the maximum likelihood estimation of model parameters are developed in the theoretical perspective. It is a more natural extension of the 1D HMM. The proposed method will provide a useful way of modeling highly variable patterns such as offline cursive characters.

  • PDF

Learning Multi-Character Competition in Markov Games (마르코프 게임 학습에 기초한 다수 캐릭터의 경쟁적 상호작용 애니메이션 합성)

  • Lee, Kang-Hoon
    • Journal of the Korea Computer Graphics Society
    • /
    • v.15 no.2
    • /
    • pp.9-17
    • /
    • 2009
  • Animating multiple characters to compete with each other is an important problem in computer games and animation films. However, it remains difficult to simulate strategic competition among characters because of its inherent complex decision process that should be able to cope with often unpredictable behavior of opponents. We adopt a reinforcement learning method in Markov games to action models built from captured motion data. This enables two characters to perform globally optimal counter-strategies with respect to each other. We also extend this method to simulate competition between two teams, each of which can consist of an arbitrary number of characters. We demonstrate the usefulness of our approach through various competitive scenarios, including playing-tag, keeping-distance, and shooting.

  • PDF

A Markov Game based QoS Control Scheme for the Next Generation Internet of Things (미래 사물인터넷을 위한 마르코프 게임 기반의 QoS 제어 기법)

  • Kim, Sungwook
    • Journal of KIISE
    • /
    • v.42 no.11
    • /
    • pp.1423-1429
    • /
    • 2015
  • The Internet of Things (IoT) is a new concept associated with the future Internet, and it has recently become a popular concept to build a dynamic, global network infrastructure. However, the deployment of IoT creates difficulties in satisfying different Quality of Service (QoS) requirements and achieving rapid service composition and deployment. In this paper, we propose a new QoS control scheme for IoT systems. The Markov game model is applied in our proposed scheme to effectively allocate IoT resources while maximizing system performance. The results of our study are validated by running a simulation to prove that the proposed scheme can promptly evaluate current IoT situations and select the best action. Thus, our scheme approximates the optimum system performance.

Throughput analysis of DCF protocol for packet applied to the nonmarkov process in the wireless LAN (비 마르코프 과정을 적용한 무선 LAN의 DCF 패킷 처리율 분석)

  • Ha, Eun-Sil
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.6
    • /
    • pp.1410-1418
    • /
    • 2007
  • This paper analyzes the throughput of DCF protocol at the MAC layer in the 802.11a wireless LAN. The throughput of DCF protocol is related on probability of backoff, depends on retransmission of each terminal. This paper applied to nonmarcov discrete model for each terminal BER in the base station versus the packet throughput is progressing with the data rate of 6,12,24,54 Mbps, We find the fact that the less the data rate be the higher the throughput. We also find from the throughput calculation by means of traffic intensity in OFDM wireless LAN.

  • PDF