Discrete universal filtering via hidden Markov modelling

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 1285-1289

  Moon, Taesup ^a   Weissman, Tsachy ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE UNIVERSAL FILTERING; HIDDEN MARKOV PROCESS (HMP); OPTIMUM FILTERING;

APPROXIMATION THEORY; DATA ACQUISITION; MARKOV PROCESSES; MATHEMATICAL MODELS; MAXIMUM LIKELIHOOD ESTIMATION; SIGNAL PROCESSING;

INFORMATION THEORY;

EID: 33749448712     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523549     Document Type: Conference Paper

References (9)

1. L. Finesso, "Consistent Estimation of the Order for Markov and Hidden Markov Chains," Ph.D Dissertation, Univ. Maryland, College Park, 1990
2. N. Merhav and M. Feder, "Universal Prediction," IEEE Trans. Inform. Theory, 44(6):2124-2147, Oct 1998
3. T. Weissman, E. Ordentlich, G. Seroussi, S. Verdu and M. Weinberger, "Universal Discrete Denoising: Known Channel",IEEE Trans. Inform. Theory, 51(1):5-28, Jan 2005
4. Y. Ephraim and N. Merhav, "Hidden Markov Processes", IEEE Trans. Inform. Theory, 48(6):1518-1569, June 2002
5. E. Ordentlich, T. Weissman, M. Weinberger, Anelia Somekh-Baruch and Neri Merhav, "Discrete Universal Filtering Through Incremental Parsing", DCC2004
6. T.M. Cover and J.A. Thomas, "Elements of Information Theory", New York: Wiley, 1991
7. L.E. Baum and T. Petrie, "Statistical Inference for probabilistic functions of finite state Markov chains", Ann. Math. Statist., vol.37, 1554-1563, 1966
8. B.G. Leroux, "Maximum-likelihood estimation for hidden Markov models", Stochastic Processes Their Appic., vol. 40, pp.127-143, 1992
9. T. Moon and T. Weissman, "Discrete Universal Filtering via Hidden Markov Modelling", in preparation