Littérature scientifique sur le sujet « Hidden semi-Markov chains »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Hidden semi-Markov chains ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Hidden semi-Markov chains"
Guédon, Yann. « Hidden hybrid Markov/semi-Markov chains ». Computational Statistics & ; Data Analysis 49, no 3 (juin 2005) : 663–88. http://dx.doi.org/10.1016/j.csda.2004.05.033.
Texte intégralElliott, Robert, Nikolaos Limnios et Anatoliy Swishchuk. « Filtering hidden semi-Markov chains ». Statistics & ; Probability Letters 83, no 9 (septembre 2013) : 2007–14. http://dx.doi.org/10.1016/j.spl.2013.05.007.
Texte intégralGuédon, Yann. « Estimating Hidden Semi-Markov Chains From Discrete Sequences ». Journal of Computational and Graphical Statistics 12, no 3 (septembre 2003) : 604–39. http://dx.doi.org/10.1198/1061860032030.
Texte intégralGuédon, Yann. « Computational methods for discrete hidden semi-Markov chains ». Applied Stochastic Models in Business and Industry 15, no 3 (juillet 1999) : 195–224. http://dx.doi.org/10.1002/(sici)1526-4025(199907/09)15:3<195 ::aid-asmb376>3.0.co;2-f.
Texte intégralLapuyade-Lahorgue, Jérôme, et Wojciech Pieczynski. « Unsupervised segmentation of hidden semi-Markov non-stationary chains ». Signal Processing 92, no 1 (janvier 2012) : 29–42. http://dx.doi.org/10.1016/j.sigpro.2011.06.001.
Texte intégralGuédon, Yann. « Exploring the state sequence space for hidden Markov and semi-Markov chains ». Computational Statistics & ; Data Analysis 51, no 5 (février 2007) : 2379–409. http://dx.doi.org/10.1016/j.csda.2006.03.015.
Texte intégralCrowder, Martin. « Semi-Markov Chains and Hidden Semi-Markov Models Toward Applications by Vlad Stefan Barbu, Nikolaos Limnios ». International Statistical Review 77, no 2 (août 2009) : 307. http://dx.doi.org/10.1111/j.1751-5823.2009.00085_8.x.
Texte intégralVotsi, I., et N. Limnios. « Estimation of the intensity of the hitting time for semi-Markov chains and hidden Markov renewal chains ». Journal of Nonparametric Statistics 27, no 2 (6 février 2015) : 149–66. http://dx.doi.org/10.1080/10485252.2015.1009369.
Texte intégralLapuyade-Lahorgue, Jérôme, et Wojciech Pieczynski. « Unsupervised segmentation of new semi-Markov chains hidden with long dependence noise ». Signal Processing 90, no 11 (novembre 2010) : 2899–910. http://dx.doi.org/10.1016/j.sigpro.2010.04.008.
Texte intégralNegrón, C., M. L. Contador, B. D. Lampinen, S. G. Metcalf, Y. Guédon, E. Costes et T. M. DeJong. « USING HIDDEN SEMI-MARKOV CHAINS TO COMPARE THE SHOOT STRUCTURE OF THREE DIFFERENT ALMOND CULTIVARS ». Acta Horticulturae, no 1068 (février 2015) : 67–75. http://dx.doi.org/10.17660/actahortic.2015.1068.7.
Texte intégralThèses sur le sujet "Hidden semi-Markov chains"
Akbar, Ihsan Ali. « Statistical Analysis of Wireless Systems Using Markov Models ». Diss., Virginia Tech, 2007. http://hdl.handle.net/10919/26089.
Texte intégralPh. D.
Fernandes, Clément. « Chaînes de Markov triplets et segmentation non supervisée d'images ». Electronic Thesis or Diss., Institut polytechnique de Paris, 2022. http://www.theses.fr/2022IPPAS019.
Texte intégralHidden Markov chains (HMC) are widely used in unsupervised Bayesian hidden discrete data restoration. They are very robust and, in spite of their simplicity, they are sufficiently efficient in many situations. In particular for image segmentation, despite their mono-dimensional nature, they are able, through a transformation of the bi-dimensional images into mono-dimensional sequences with Peano scan (PS), to give satisfying results. However, sometimes, more complex models such as hidden Markov fields (HMF) may be preferred in spite of their increased time complexity, for their better results. Moreover, hidden Markov models (the chains as well as the fields) have been extended to pairwise and triplet Markov models, which can be of interest in more complex situations. For example, when sojourn time in hidden states is not geometrical, hidden semi-Markov (HSMC) chains tend to perform better than HMC, and such is also the case for hidden evidential Markov chains (HEMC) when data are non-stationary. In this thesis, we first propose a new triplet Markov chain (TMC), which simultaneously extends HSMC and HEMC. Based on hidden triplet Markov chains (HTMC), the new hidden evidential semi-Markov chain (HESMC) model can be used in unsupervised framework, parameters being estimated with Expectation-Maximization (EM) algorithm. We validate its interest through some experiments on synthetic data. Then we address the problem of mono-dimensionality of the HMC with PS model in image segmentation by introducing the “contextual” Peano scan (CPS). It consists in associating to each index in the HMC obtained from PS, two observations on pixels which are neighbors of the pixel considered in the image, but are not its neighbors in the HMC. This gives three observations on each point of the Peano scan, which leads to a new conditional Markov chain (CMC) with a more complex structure, but whose posterior law is still Markovian. Therefore, we can apply the usual parameter estimation method: Stochastic Expectation-Maximization (SEM), as well as study unsupervised segmentation Marginal Posterior Mode (MPM) so obtained. The CMC with CPS based supervised and unsupervised MPM are compared to the classic scan based HMC-PS and the HMF through experiments on artificial images. They improve notably the former, and can even compete with the latter. Finally, we extend the CMC-CPS to Pairwise Conditional Markov (CPMC) chains and two particular triplet conditional Markov chain: evidential conditional Markov chains (CEMC) and conditional semi-Markov chains (CSMC). For each of these extensions, we show through experiments on artificial images that these models can improve notably their non conditional counterpart, as well as the CMC with CPS, and can even compete with the HMF. Beside they allow the generality of markovian triplets to better play its part in image segmentation, while avoiding the substantial time complexity of triplet Markov fields
Li, Haoyu. « Recent hidden Markov models for lower limb locomotion activity detection and recognition using IMU sensors ». Thesis, Lyon, 2019. http://www.theses.fr/2019LYSEC041.
Texte intégralThe thesis context is that of the quantified self, a movement born in California that consists in getting to know oneself better by measuring data relating to one’s body and activities. The research work consisted in developing algorithms for analyzing signals from an IMU (Inertial Measurement Unit) sensor placed on the leg to recognize different movement activities such as walking, running, stair climbing... These activities are recognizable by the shape of the sensor’s acceleration and angular velocity signals, both tri-axial, during leg movement and gait cycle.To address the recognition problem, the thesis work resulted in the construction of a particular hidden Markov chain, called semi-triplet Markov chain, which combines a semi-Markov model and a Gaussian mixture model in a triplet Markov model. This model is both adapted to the nature of the gait cycle, and to the sequence of activities as it can be carried out in daily life. To adapt the model parameters to the differences in human morphology and behavior, we have developed algorithms for estimating parameters both off-line and on-line.To establish the classification and learning performance of the algorithms, we conducted experiments on the basis of recordings collected during the thesis and on public dataset. The results are systematically compared with state-of-the-art algorithms
Votsi, Irène. « Evaluation des risques sismiques par des modèles markoviens cachés et semi-markoviens cachés et de l'estimation de la statistique ». Thesis, Compiègne, 2013. http://www.theses.fr/2013COMP2058.
Texte intégralThe first chapter describes the definition of the subject under study, the current state of science in this area and the objectives. In the second chapter, continuous-time semi-Markov models are studied and applied in order to contribute to seismic hazard assessment in Northern Aegean Sea (Greece). Expressions for different important indicators of the semi- Markov process are obtained, providing forecasting results about the time, the space and the magnitude of the ensuing strong earthquake. Chapters 3 and 4 describe a first attempt to model earthquake occurrence by means of discrete-time hidden Markov models (HMMs) and hidden semi-Markov models (HSMMs), respectively. A nonparametric estimation method is followed by means of which, insights into features of the earthquake process are provided which are hard to detect otherwise. Important indicators concerning the levels of the stress field are estimated by means of the suggested HMM and HSMM. Chapter 5 includes our main contribution to the theory of stochastic processes, the investigation and the estimation of the discrete-time intensity of the hitting time (DTIHT) for the first time referring to semi-Markov chains (SMCs) and hidden Markov renewal chains (HMRCs). A simple formula is presented for the evaluation of the DTIHT along with its statistical estimator for both SMCs and HMRCs. In addition, the asymptotic properties of the estimators are proved, including strong consistency and asymptotic normality. In chapter 6, a comparison between HMMs and HSMMs in a Markov and a semi-Markov framework is given in order to highlight possible differences in their stochastic behavior partially governed by their transition probability matrices. Basic results are presented in the general case where specific distributions are assumed for sojourn times as well as in the special case concerning the models applied in the previous chapters, where the sojourn time distributions are estimated non-parametrically. The impact of the differences is observed through the calculation of the mean value and the variance of the number of steps that the Markov chain (HMM case) and the EMC (HSMM case) need to make for visiting for the first time a particular state. Finally, Chapter 7 presents concluding remarks, perspectives and future work
Keller, Oliver. « Probabilistic Methods for Computational Annotation of Genomic Sequences ». Doctoral thesis, 2011. http://hdl.handle.net/11858/00-1735-0000-0006-B6A7-D.
Texte intégralLangrock, Roland. « On some special-purpose hidden Markov models ». Doctoral thesis, 2011. http://hdl.handle.net/11858/00-1735-0000-0006-B6AF-E.
Texte intégralLivres sur le sujet "Hidden semi-Markov chains"
Barbu, Vlad Stefan. Semi-Markov chains and hidden semi-Markov models toward applications : Their use in reliability and DNA analysis. New York : Springer, 2008.
Trouver le texte intégralSemi-Markov Chains and Hidden Semi-Markov Models toward Applications. New York, NY : Springer New York, 2008. http://dx.doi.org/10.1007/978-0-387-73173-5.
Texte intégralLimnios, Nikolaos, et Vlad Stefan Barbu. Semi-Markov Chains and Hidden Semi-Markov Models Toward Applications : Their Use in Reliability and DNA Analysis. Springer, 2009.
Trouver le texte intégralChapitres de livres sur le sujet "Hidden semi-Markov chains"
Derouault, Anne-Marie, et Bernard Merialdo. « Language modelling using a hidden Markov chain with application to automatic transcription of French stenotypy ». Dans Semi-Markov Models, 475–85. Boston, MA : Springer US, 1986. http://dx.doi.org/10.1007/978-1-4899-0574-1_29.
Texte intégralVidyasagar, M. « Introduction to Large Deviation Theory ». Dans Hidden Markov Processes. Princeton University Press, 2014. http://dx.doi.org/10.23943/princeton/9780691133157.003.0005.
Texte intégralActes de conférences sur le sujet "Hidden semi-Markov chains"
Barbu, Vlad-Stefan. « Reliability modeling with hidden Markov and semi-Markov chains ». Dans 2013 IEEE Integration of Stochastic Energy in Power Systems Workshop (ISEPS). IEEE, 2013. http://dx.doi.org/10.1109/iseps.2013.6707952.
Texte intégralLapuyade-Lahorgue, Jérôme, et Wojciech Pieczynski. « Unsupervised Segmentation of Hidden Semi-Markov Non Stationary Chains ». Dans Bayesian Inference and Maximum Entropy Methods In Science and Engineering. AIP, 2006. http://dx.doi.org/10.1063/1.2423293.
Texte intégralPieczynski, W. « Modeling non stationary hidden semi-markov chains with triplet markov chains and theory of evidence ». Dans 2005 Microwave Electronics : Measurements, Identification, Applications. IEEE, 2005. http://dx.doi.org/10.1109/ssp.2005.1628689.
Texte intégralLapuyade-Lahorgue, Jérôme, et Wojciech Pieczynski. « Partially Markov models and unsupervised segmentation of semi-Markov chains hidden with long dependence noise ». Dans Recent Advances in Stochastic Modeling and Data Analysis. WORLD SCIENTIFIC, 2007. http://dx.doi.org/10.1142/9789812709691_0029.
Texte intégralPetetin, Yohan, et Francois Desbouvries. « A semi-exact sequential Monte Carlo filtering algorithm in Hidden Markov Chains ». Dans 2012 11th International Conference on Information Sciences, Signal Processing and their Applications (ISSPA). IEEE, 2012. http://dx.doi.org/10.1109/isspa.2012.6310621.
Texte intégralXia, Ning, Aishuang Li, Guizhi Zhu, Xiaoguo Niu, Chunsheng Hou et Yangying Gan. « Study of Branching Responses of One Year Old Branches of Apple Trees to Heading Using Hidden Semi-Markov Chains ». Dans 2009 Third International Symposium on Plant Growth Modeling, Simulation, Visualization and Applications (PMA). IEEE, 2009. http://dx.doi.org/10.1109/pma.2009.10.
Texte intégralZhou, Fan, Qiang Gao, Goce Trajcevski, Kunpeng Zhang, Ting Zhong et Fengli Zhang. « Trajectory-User Linking via Variational AutoEncoder ». Dans Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California : International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/446.
Texte intégral