• Title/Summary/Keyword: Hidden Markov models

Search Result 191, Processing Time 0.03 seconds

Fire detection in video surveillance and monitoring system using Hidden Markov Models (영상감시시스템에서 은닉마코프모델을 이용한 불검출 방법)

  • Zhu, Teng;Kim, Jeong-Hyun;Kang, Dong-Joong;Kim, Min-Sung;Lee, Ju-Seoup
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.35-38
    • /
    • 2009
  • The paper presents an effective method to detect fire in video surveillance and monitoring system. The main contribution of this work is that we successfully use the Hidden Markov Models in the process of detecting the fire with a few preprocessing steps. First, the moving pixels detected from image difference, the color values obtained from the fire flames, and their pixels clustering are applied to obtain the image regions labeled as fire candidates; secondly, utilizing massive training data, including fire videos and non-fire videos, creates the Hidden Markov Models of fire and non-fire, which are used to make the final decision that whether the frame of the real-time video has fire or not in both temporal and spatial analysis. Experimental results demonstrate that it is not only robust but also has a very low false alarm rate, furthermore, on the ground that the HMM training which takes up the most time of our whole procedure is off-line calculated, the real-time detection and alarm can be well implemented when compared with the other existing methods.

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.

A probabilistic framework for drought forecasting using hidden Markov models aggregated with the RCP8.5 projection

  • Chen, Si;Kwon, Hyun-Han;Kim, Tae-Woong
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2016.05a
    • /
    • pp.197-197
    • /
    • 2016
  • Forecasting future drought events in a region plays a major role in water management and risk assessment of drought occurrences. The creeping characteristics of drought make it possible to mitigate drought's effects with accurate forecasting models. Drought forecasts are inevitably plagued by uncertainties, making it necessary to derive forecasts in a probabilistic framework. In this study, a new probabilistic scheme is proposed to forecast droughts, in which a discrete-time finite state-space hidden Markov model (HMM) is used aggregated with the Representative Concentration Pathway 8.5 (RCP) precipitation projection (HMM-RCP). The 3-month standardized precipitation index (SPI) is employed to assess the drought severity over the selected five stations in South Kore. A reversible jump Markov chain Monte Carlo algorithm is used for inference on the model parameters which includes several hidden states and the state specific parameters. We perform an RCP precipitation projection transformed SPI (RCP-SPI) weight-corrected post-processing for the HMM-based drought forecasting to derive a probabilistic forecast that considers uncertainties. Results showed that the HMM-RCP forecast mean values, as measured by forecasting skill scores, are much more accurate than those from conventional models and a climatology reference model at various lead times over the study sites. In addition, the probabilistic forecast verification technique, which includes the ranked probability skill score and the relative operating characteristic, is performed on the proposed model to check the performance. It is found that the HMM-RCP provides a probabilistic forecast with satisfactory evaluation for different drought severity categories, even with a long lead time. The overall results indicate that the proposed HMM-RCP shows a powerful skill for probabilistic drought forecasting.

  • PDF

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.

Recognizing Hand Digit Gestures Using Stochastic Models

  • Sin, Bong-Kee
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.6
    • /
    • pp.807-815
    • /
    • 2008
  • A simple efficient method of spotting and recognizing hand gestures in video is presented using a network of hidden Markov models and dynamic programming search algorithm. The description starts from designing a set of isolated trajectory models which are stochastic and robust enough to characterize highly variable patterns like human motion, handwriting, and speech. Those models are interconnected to form a single big network termed a spotting network or a spotter that models a continuous stream of gestures and non-gestures as well. The inference over the model is based on dynamic programming. The proposed model is highly efficient and can readily be extended to a variety of recurrent pattern recognition tasks. The test result without any engineering has shown the potential for practical application. At the end of the paper we add some related experimental result that has been obtained using a different model - dynamic Bayesian network - which is also a type of stochastic model.

  • PDF

Emotional States Recognition of Text Data Using Hidden Markov Models (HMM을 이용한 채팅 텍스트로부터의 화자 감정상태 분석)

  • 문현구;장병탁
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10b
    • /
    • pp.127-129
    • /
    • 2001
  • 입력된 문장을 분석하여 미리 정해진 범주에 따라 그 문장의 감정 상태의 천이를 출력해 주는 감정인식 시스템을 제안한다. Naive Bayes 알고리즘을 사용했던 이전 방법과 달리 새로 연구된 시스템은 Hidden Markov Model(HMM)을 사용한다. HMM은 특정 분포로 발생하는 현상에서 그 현상의 원인이 되는 상태의 천이를 찾아내는데 적합한 방법으로서, 하나의 문장에 여러 가지 감정이 표현된다는 가정 하에 감정인식에 관한 이상적인 알고리즘이라 할 수 있다. 본 논문에서는 HMM을 사용한 감정인식 시스템에 관한 개요를 설명하고 이전 버전에 비해 보다 향상된 실험결과를 보여준다.

  • PDF

Face Detection And Recognition using Hidden Markov Models (HMM 을 이용한 얼굴 검출과 인식)

  • 박호석;차영석;최현수;배철수;권오홍;최철재;나상동
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.05a
    • /
    • pp.336-341
    • /
    • 2000
  • Hidden Markov Model(HMM)을 기반으로 한 얼굴 검출과 얼굴 인식에 대한 프레임작업에 대한 것이다. 관찰 벡터는 Karhunen-Loves Transform(KLT)의 상관관계를 이용하여 얻은 HMM의 정역학 특성을 사용하였으며, 본 연구에서 보여준 얼굴인식 방법은 이전의 HMM 기반의 얼굴인식 방법에서 인식률을 약간 개선함으로써 컴퓨터 연산을 훨씬 간단히 할 수 있음을 보여준다

  • PDF

Implementation of the Automatic Speech Editing System Using Keyword Spotting Technique (핵심어 인식을 이용한 음성 자동 편집 시스템 구현)

  • Chung, Ik-Joo
    • Speech Sciences
    • /
    • v.3
    • /
    • pp.119-131
    • /
    • 1998
  • We have developed a keyword spotting system for automatic speech editing. This system recognizes the only keyword 'MBC news' and then sends the time information to the host system. We adopted a vocabulary dependent model based on continuous hidden Markov model, and the Viterbi search was used for recognizing the keyword. In recognizing the keyword, the system uses a parallel network where HMM models are connected independently and back-tracking information for reducing false alarms and missing. We especially focused on implementing a stable and practical real-time system.

  • PDF

The p-Norm of Log-likelihood Difference Estimation Algorithm for Hidden Markov Models (로그 우도 차이의 P-norm에 기반한 은닉 마르코프 파라미터 추정 알고리듬)

  • Yun, Sung-Rack;Yoo, Chang-D.
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.307-308
    • /
    • 2007
  • This paper proposes a discriminative training algorithm for estimating hidden Markov model (HMM) parameters. The proposed algorithm estimates the Parameters by minimizing the p-norm of log-likelihood difference (PLD) between the utterance probability given the correct transcription and the most competitive transcription.

  • PDF

A Novel Algorithm for Fault Type Fast Diagnosis in Overhead Transmission Lines Using Hidden Markov Models

  • Jannati, M.;Jazebi, S.;Vahidi, B.;Hosseinian, S.H.
    • Journal of Electrical Engineering and Technology
    • /
    • v.6 no.6
    • /
    • pp.742-749
    • /
    • 2011
  • Power transmission lines are one of the most important components of electric power system. Failures in the operation of power transmission lines can result in serious power system problems. Hence, fault diagnosis (transient or permanent) in power transmission lines is very important to ensure the reliable operation of the power system. A hidden Markov model (HMM), a powerful pattern recognizer, classifies events in a probabilistic manner based on fault signal waveform and characteristics. This paper presents application of HMM to classify faults in overhead power transmission lines. The algorithm uses voltage samples of one-fourth cycle from the inception of the fault. The simulation performed in EMTPWorks and MATLAB environments validates the fast response of the classifier, which provides fast and accurate protection scheme for power transmission lines.