ModÃ¨les de Markov triplets en restauration des signaux

More documents

Recommendations

Info

BIBLIOGRAPHIE[14] A. Bonin, B. Chalmond, and B. Lavayssière. Monte-carlo simulation of industrialradiography images and experimental designs. NDT et E. International,35(8) :503–510, 2002.[15] G. E. P. Box and G. M. Jenkins. Times Series Analysis Forcasting and Control.Holden Day, 1970.[16] M. Broniatowski, G. Celeux, and J. Diebolt. Reconnaissance de mélange dedensités par un algorithme d’apprentissage probabiliste. Data Analysis andInformatics, 3 :359–373, 1984.[17] N. Brunel. Sur quelques extentions des chaînes de Markov cachées et couples,Applications àla segmentation non-supervisée de signaux radar. Mathématiquesappliquées, Université Paris 6, 2005.[18] O. Cappé, E. Moulines, and T.Ryden. Inference in hidden Markov Models.Springer,Series in Statistics, 2005.[19] G. Celeux, D. Chauveau, and J. Diebolt. A stochastic version of the emalgorithm : an experimental study. Journal of Statistical Computation andSimulation, 55 :287–314, 1996.[20] G. Celeux and J. Diebolt. The sem algorithm : a probabilistic teacher algorithmderived from the em algorithm for the mixture problem. ComputationalStatistics Quarterly, 2(1) :73–82, 1985.[21] G. Celeux and J. Diebolt. L’algorithme sem : un algorithme d’apprentissageprobabiliste pour la reconnaissance de mélanges de densités. Revue de StatistiqueAppliquée, 34, 1986.[22] G. Celeux and J. Diebolt. A stochastic approximation type em algorithm forthe mixture problem. In Stochastics and Stochastics Reports, 41 :119–134,1992.[23] G. Celeux and J. Diebolt. Une version de type recuit simulé de l’algorithmeem. Technical report, INRIA, 2006.[24] B. Chalmond. Eléments de modélisation pour l’analyse d’images. Springer,2000.[25] M. Chen, A. Kundu, and J. Zhou. Off-line handwritten work recognition usinga hidden markov model type stochastic network. IEEE Trans. on PatternAnalysis and Machine Intellegence, 16(5) :481–496, 1994.[26] R. Christensen. Loglinear models. Springer-Verlag, 1990.[27] O. Chryssaphinou, M. Karaliopoulou, and N. Limnios. On discrete time semimarkovchains and applications in words occurences. Communications in Statistics,Theory and Methods, 37 :1306–1322, 2008.[28] O. Chryssaphinoua, M. Karaliopouloua, and N. Limnios. On discrete timesemi-markov chains and applications in words occurrences. Communicationsin statistics. Theory and methods, 37(8) :1306–1322, 2008.[29] G. A. Churchill. Stochastic models for hertergnous dna squences. Bulletin ofMathematic Biology, 51 :79–94, 1989.[30] J. P. Cocquerez and S. Philipp. Analyse d’images :filtrage et segmentation.Masson, 1995.130
BIBLIOGRAPHIE[31] O. L. V. Costa, M. D. Fragoso, and R. P. Marques. Discrete time markovjump linear systems. Springer-Verlag, New York, 2005.[32] Y. Delignon, A. Marzouki, and W. Pieczynski. Estimation of generalized mixtureand its application in image segmentation. IEEE Trans. on Image Processing,6(10) :1364–1375, 1997.[33] J. P. DELMAS. Relations entre les algorithmes d’estimation iteratives em etice avec exemples d’applications. GRETSI Groupe d’Etudes du Traitement duSignal et des Images, pages 185–188, 1995.[34] A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood fromincomplete data via the em algorithm. J. of the Royal Statistical Society SeriesB, 39 :1–38, 1977.[35] S. Derrode and W. Pieczynski. Signal and image segmentation using pairwisemarkov chains. IEEE Trans. on Signal Processing, 6(52) :2477–2489, 2004.[36] F. Desbouvries and W. Pieczynski. Modèles de markov triplet et filtragede kalman, triplet markov models and kalman filtering. Comptes Rendus del’Académie des Sciences, 336(8) :667–670, Février 2003.[37] P. A. Devijver. Baum’s forward-backward algorithm revisited. Pattern Recognition,3(6) :369–373, 1985.[38] A. M. Djafari. Entropie en traitement du signal. cnrs-supélec-ups.[39] A. M. Djafari and G. Demoment. Using entropy in image reconstruction andrestauration. Traitement du signal, 5(4) :235–248, 1988.[40] A. Doucet, A. N. Gordon, and V. Krishnamurthy. Particle filters for stateestimation of jump markov linear systems. IEEE Trans. On Signal Processing,49 :613–624, 2001.[41] Tyrone E. Duncan. Some applications of fractional brownian motion to linearsystems. Springer, 1999.[42] J. B. Durand. Modèles à structure cachée : inférence, sélection des modèles etapplications. Mathématiques appliquées, Université Grenoble I-Joseph Fourier,2003.[43] B. Ait el Fquih and F. Debouvries. Kalman filtering in triplet markov chains.IEEE Trans. on Signal Proccessing, 54(8) :2957–2963, 2006.[44] B. Ait el Fquih and F. Desbouvries. Bayesian smoothing algorithms in pairwiseand triplet markov chains. In Proceedings of the 2005 IEEE Workshop onStatistical Signal Processing, Bordeaux, France, July 17-20 2005.[45] B. Ait el Fquih and F. Desbouvries. Exact and approximate bayesian smoothingalgorithms in partially observed markov chains. In Proceedings of theIEEE Nonlinear Statistical Signal Processing Workshop (NSSPW’06), Cambridge,UK, September 13-15 2006.[46] B. Ait el Fquih and F. Desbouvries. Kalman filtering in triplet markov chains.IEEE Trans. on Signal Processing, 54(8) :57–63, August 2006.[47] B. Ait el Fquih and F. Desbouvries. On bayesian fixed-interval smoothingalgorithms. IEEE Trans. on Automatic Control, 53(10) :2437–2442, November2008.131
Page 1:
École Doctorale SMPCThèse présen
Page 6 and 7:
ABSTRACTis to extend these models t
Page 9 and 10:
Table des matièresRésumé . . . .
Page 11 and 12:
NotationsSymbolesN Nombre des obser
Page 13 and 14:
IntroductionNotre travail se situe
Page 15 and 16:
INTRODUCTIONgénéral que le modèl
Page 17 and 18:
Chapitre IModèles de Markov Classi
Page 19 and 20:
CHAPITRE I. MODÈLES DE MARKOV CLAS
Page 21 and 22:
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35:
Page 38 and 39:
CHAPITRE II. MODÈLE DE MARKOV COUP
Page 40 and 41:
Page 42 and 43:
Page 44 and 45:
Page 46 and 47:
Page 48 and 49:
Page 50 and 51:
Page 53 and 54:
Chapitre IIIEstimation des paramèt
Page 55 and 56:
CHAPITRE III. ESTIMATION DES PARAM
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67:
Page 70 and 71:
CHAPITRE IV. MODÈLE DE MARKOV TRIP
Page 72 and 73:
Page 74 and 75:
Page 76 and 77:
Page 78 and 79:
Page 80 and 81:
Page 82 and 83:
Page 84 and 85:
Page 86 and 87:
Page 88 and 89:
Page 90 and 91:
Page 92 and 93: CHAPITRE IV. MODÈLE DE MARKOV TRIP
Page 96 and 97: •••••••CHAPITRE IV. M
Page 112 and 113: CHAPITRE V. CHAÎNES CONDITIONNELLE
Page 135: Annexe AK-meansL’algorithme K-mea
Page 139 and 140: Annexe CVecteurs gaussiensDéfiniti
Page 141: Bibliographie[1] C. Andrieu, M. Dav
Page 145 and 146: BIBLIOGRAPHIE[66] P. Lanchantin, J.
Page 147 and 148: BIBLIOGRAPHIE[99] W. Pieczynski and
show all

ModÃ¨les de Markov triplets en restauration des signaux

Create successful ePaper yourself

Delete template?

Save as template?