scholarly journals Statistical Skimming of Feature Films

2010 ◽  
Vol 2010 ◽  
pp. 1-11 ◽  
Author(s):  
Sergio Benini ◽  
Pierangelo Migliorati ◽  
Riccardo Leonardi

We present a statistical framework based on Hidden Markov Models(HMMs)for skimming feature films. A chain ofHMMsis used to model subsequent story units:HMMstates represent different visual-concepts, transitions model the temporal dependencies in each story unit, and stochastic observations are given by single shots. The skim is generated as an observation sequence, where, in order to privilege more informative segments for entering the skim, shots are assigned higher probability of observation if endowed with salient features related to specific film genres. The effectiveness of the method is demonstrated by skimming the first thirty minutes of a wide set of action and dramatic movies, in order to create previews for users useful for assessing whether they would like to see that movie or not, but without revealing the movie central part and plot details. Results are evaluated and compared through extensive user tests in terms of metrics that estimate the content representational value of the obtained video skims and their utility for assessing the user's interest in the observed movie.

2018 ◽  
Vol 16 (05) ◽  
pp. 1850019 ◽  
Author(s):  
Ioannis A. Tamposis ◽  
Margarita C. Theodoropoulou ◽  
Konstantinos D. Tsirigos ◽  
Pantelis G. Bagos

Hidden Markov Models (HMMs) are probabilistic models widely used in computational molecular biology. However, the Markovian assumption regarding transition probabilities which dictates that the observed symbol depends only on the current state may not be sufficient for some biological problems. In order to overcome the limitations of the first order HMM, a number of extensions have been proposed in the literature to incorporate past information in HMMs conditioning either on the hidden states, or on the observations, or both. Here, we implement a simple extension of the standard HMM in which the current observed symbol (amino acid residue) depends both on the current state and on a series of observed previous symbols. The major advantage of the method is the simplicity in the implementation, which is achieved by properly transforming the observation sequence, using an extended alphabet. Thus, it can utilize all the available algorithms for the training and decoding of HMMs. We investigated the use of several encoding schemes and performed tests in a number of important biological problems previously studied by our team (prediction of transmembrane proteins and prediction of signal peptides). The evaluation shows that, when enough data are available, the performance increased by 1.8%–8.2% and the existing prediction methods may improve using this approach. The methods, for which the improvement was significant (PRED-TMBB2, PRED-TAT and HMM-TM), are available as web-servers freely accessible to academic users at www.compgen.org/tools/ .


Author(s):  
Xiaoqiang Wang ◽  
Emilie Lebarbier ◽  
Julie Aubert ◽  
Stéphane Robin

Abstract Hidden Markov models provide a natural statistical framework for the detection of the copy number variations (CNV) in genomics. In this context, we define a hidden Markov process that underlies all individuals jointly in order to detect and to classify genomics regions in different states (typically, deletion, normal or amplification). Structural variations from different individuals may be dependent. It is the case in agronomy where varietal selection program exists and species share a common phylogenetic past. We propose to take into account these dependencies inthe HMM model. When dealing with a large number of series, maximum likelihood inference (performed classically using the EM algorithm) becomes intractable. We thus propose an approximate inference algorithm based on a variational approach (VEM), implemented in the CHMM R package. A simulation study is performed to assess the performance of the proposed method and an application to the detection of structural variations in plant genomes is presented.


2012 ◽  
Vol 134 (3) ◽  
Author(s):  
Zhongsheng Chen ◽  
Yongmin Yang

Accurate identification of faults in gearboxes is of vital importance for the safe operation of helicopters. Although hidden Markov models (HMMs) with Gaussian observations have been successfully used for fault diagnostics of mechanical systems, a Gaussian HMM must assume that the observation sequence is generated from a Gaussian process. Conversely, vibration signals from helicopter gearboxes are often non-Gaussian and non-stationary. Also, it always needs to use multi-sensors for more accurate fault diagnostics in practice. Thus, a classical Gaussian HMM may not meet the need of helicopter gearboxes, and it needs to study novel HMMs to model multi-sensor, non-Gaussian signals. This paper presents a multi-sensor mixtured HMM (MSMHMM), which is built on multi-sensor signals. For a MSMHMM, each sensor signal will be considered as the mixture of non-Gaussian sources, so it can depict non-Gaussian observation sequences very well. Then, learning mechanisms of MSMHMM parameters are formulated in detail based on the expectation-maximization (EM) algorithm and a framework of MSMHMM-based fault diagnostics is proposed. In the end, the proposed method is validated on a helicopter gearbox, and the results are very exciting.


2015 ◽  
Author(s):  
Αναστάσιος Πετρόπουλος

Hidden Markov Models, usually referred to as HMMs, are one of the most successful concepts in statistical modeling conceived and analyzed in the last 40 years. They belong to the stochastic mixture models family and have been broadly implemented in numerous sectors to address the problem of data model fitting and forecasting. Their structure usually is comprised by an observed sequence which is conditioned on an underlying hidden (unobserved) process. This way HMMs provide flexibility to address various complicated problems and can be implemented for modeling univariate and multivariate financial time series. Moreover, based on current literature, economic variables exhibit patterns dependent on different economic regimes which can be successfully captured by HMMs. Their parsimonious structure and attractive properties along with the existence of efficient algorithms for their estimation were the main drivers for the selection of HMM as the main topic of this thesis. Consequently, in this thesis we thoroughly investigate HMMs and their capabilities to simulate financial systems. The contribution of this study is threefold: First we perform an extensive review of HMM theory and applications. Our aim is to summarize the most significant applications of HMM with special focus in the field of finance. We offer a thorough and compact summary of the uses and the results of HMM in the last 40 years. Secondly, we extend the framework of HMMs by proposing a theoretical variation, injecting greater flexibility in their structure. Based on bibliography, in many real-world scenarios the modeled data entail temporal dynamics the patterns of which change over time. We address this problem by proposing a novel HMM formulation, treating temporal dependencies as latent variables over which inference is performed. Specifically, we introduce a hierarchical graphical model comprising two hidden layers: on the first layer, we postulate a chain of latent observation-emitting states, the temporal dependencies between which may change over time; on the second layer, we postulate a latent first-order Markov chain modeling the evolution of temporal dynamics (dependence jumps) pertaining to the first-layer latent process. As a result of this construction, our method allows for effectively modeling non-homogeneous observed financial data. Finally in the third part of this thesis we investigate the HMM efficiency in the problem of corporate credit scoring. We propose a novel corporate credit rating system based on Student’s-t hidden Markov models (SHMMs). Corporate credit scoring is widely used by financial institutions for portfolio risk management, and for pricing financial products designed for corporations. In addition, from a regulatory perspective, internal rating models are commonly used for establishing a more risk-sensitive capital adequacy framework for financial institutions. We evaluate our method against other state of the art statistical techniques like Neural Networks, SVM, and logistic regression and conclude that SHMM offer significant improved forecasting capabilities.


2015 ◽  
Vol 135 (12) ◽  
pp. 1517-1523 ◽  
Author(s):  
Yicheng Jin ◽  
Takuto Sakuma ◽  
Shohei Kato ◽  
Tsutomu Kunitachi

Author(s):  
M. Vidyasagar

This book explores important aspects of Markov and hidden Markov processes and the applications of these ideas to various problems in computational biology. It starts from first principles, so that no previous knowledge of probability is necessary. However, the work is rigorous and mathematical, making it useful to engineers and mathematicians, even those not interested in biological applications. A range of exercises is provided, including drills to familiarize the reader with concepts and more advanced problems that require deep thinking about the theory. Biological applications are taken from post-genomic biology, especially genomics and proteomics. The topics examined include standard material such as the Perron–Frobenius theorem, transient and recurrent states, hitting probabilities and hitting times, maximum likelihood estimation, the Viterbi algorithm, and the Baum–Welch algorithm. The book contains discussions of extremely useful topics not usually seen at the basic level, such as ergodicity of Markov processes, Markov Chain Monte Carlo (MCMC), information theory, and large deviation theory for both i.i.d and Markov processes. It also presents state-of-the-art realization theory for hidden Markov models. Among biological applications, it offers an in-depth look at the BLAST (Basic Local Alignment Search Technique) algorithm, including a comprehensive explanation of the underlying theory. Other applications such as profile hidden Markov models are also explored.


Sign in / Sign up

Export Citation Format

Share Document