Abstract
In this paper, an “auto-framing” method, an algorithmic method to divide stochastic time-series process data into appropriate intervals, is developed based on the approach of hidden Markov model (HMM). While enormous amounts of process time-series data are being measured and collected today, their use is limited by the high costs to gather, store, and analyze them. “Data-framing” refers to the task of dividing stochastic signal data into time frames of distinct patterns so that the data can be stored and analyzed in an efficient manner. Data-framing is typically carried out manually, but doing so can be both laborious and ineffective. For the purpose of automating the data-framing task, stochastic signals of switching patterns are modeled using a hidden Markov model (HMM) based jump linear system (JLS), which switches the stochastic model probabilistically in accordance with the underlying Markov chain. Based on the model, an estimator is constructed to estimate from the collected signal data the state sequence of the underlying Markov chain, which is subsequently used to decide on the framing points. An Expectation Maximization (EM) algorithm, which is composed of two optimal estimators, fixed interval Kalman smoother and Viterbi algorithm, is used to estimate for the state estimation. We demonstrate the effectiveness of the HMM-based approach for auto-framing using simulated data constructed based on real industrial data.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
More From: International Journal of Control, Automation and Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.