Jump to content United States-English
HP.com Home Products and Services Support and Drivers Solutions How to Buy
» Contact HP

HP.com home


Information Theory Seminar


printable version
» 

HP Labs

» Research
» News and events
» Technical reports
» About HP Labs
» Careers @ HP Labs
» People
» Worldwide sites
» Downloads
Content starts here


TITLE: Analyticity of Hidden Markov Chains

SPEAKER: Guangyue Han, University of British Columbia

DATE: 2:00 - 3:00 P.M., Friday May 27, 2005

LOCATION: Tioga, 3U (PA)

HOST: Vinay Deolalikar

ABSTRACT:
We prove that under mild assumptions a hidden Markov chain varies analytically, in a strong sense, as a function of the underlying Markov chain parameters. In particular, we show that, under these assumptions, the entropy rate of a hidden Markov chain is an analytic function of the parameters. We give examples to show how this can fail in degenerate cases. And we study two natural special classes of hidden Markov chains in more detail: binary hidden Markov chains with an unambiguous symbol and binary Markov chains corrupted by binary symmetric noise.

Seminars

» Information Theory
» Publications
» People
» Discrete Universal Denoiser (DUDE)
» Elliptic Curve Cryptography
» Image Compression
» Seminars
» Related Links
This is a controller for a color printer. Each chip contains a compressor/decompressor based on an algorithm created by HP Labs.
Privacy statement Using this site means you accept its terms Feedback to HP Labs
© 2009 Hewlett-Packard Development Company, L.P.