Audio segmentation is an essential problem in many audio signal processing tasks which tries to segment an audio signal into homogeneous chunks, or segments. Most current approaches rely on a change-point detection phase for finding segment boundaries, followed by a similarity matching phase which identifies similar segments. In this thesis, we focus instead on joint segmentation and clustering...

In this paper, we study large deviations of maximum likelihood and related estimators for hidden Markov models. A hidden Markov model consists of parameterized Markov chains in a Markovian random environment, with the underlying environmental Markov chain viewed as missing data. A difficulty with parameter estimation in this model is the non-additivity of the log-likelihood function. Based on a...

In this work, we propose to improve the neighboring relationship ability of the Hidden Markov Chain (HMC) model, by extending the memory lengthes of both the Markov chain process and the data-driven densities arising in the model. The new model is able to learn more complex noise structures, with respect to the configuration of several previous states and observations. Model parameters estimati...

with regard to the society’s need for complicated software and high level of expenses on its development, it is necessary to take all stakeholders’ requirements and the demands into consideration, before any investments and put on the design and utilization stages. software architecture is a technical description of a software system that indicates components and their relationships between the...

We provide a tutorial on learning and inference in hidden Markov models in the context of the recent literature on Bayesian networks. This perspective makes it possible to consider novel generalizations of hidden Markov models with multiple hidden state variables, multiscale representations, and mixed discrete and continuous variables. Although exact inference in these generalizations is usuall...

Hidden Markov models were introduced in the beginning of the 1970's as a tool in speech recognition. During the last decade they have been found useful in addressing problems in computational biology such as characterising sequence families, gene finding, structure prediction and phylogenetic analysis. In this paper we propose several measures between hidden Markov models. We give an efficient ...

This is the first paper in a series of two papers describing a novel generalization of classical hidden Markov models using fuzzy measures and fuzzy integrals. In this paper, we present the theoretical framework for the generalization and, in the second paper, we describe an application of the generalized hidden Markov models to handwritten word recognition. The main characteristic of the gener...

The basic theory of hidden Markov models was developed and applied to problems in speech recognition in the late 1960s, and has since then been applied to numerous problems, e.g. biological sequence analysis. Most applications of hidden Markov models are based on efficient algorithms for computing the probability of generating a given string, or computing the most likely path generating a given...

The biggest difficulty of hidden Markov model applied to multistep attack is the determination of observations. Now the research of the determination of observations is still lacking, and it shows a certain degree of subjectivity. In this regard, we integrate the attack intentions and hidden Markov model (HMM) and support a method to forecasting multistep attack based on hidden Markov model. Fi...