Cart (Loading....) | Create Account
Close category search window
 

The Bhattacharyya distance and detection between Markov chains

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

When the statistical structure under each of two hypotheses is time varying, the collection of infinitely many observations does not guarantee an error probability that approaches zero. A recursive formula for the Bhattacharyya distance between two Markov chains is derived, and it is used to derive necessary and sufficient conditions for asymptotically perfect detection (APD). It is shown that the use of incorrect prior probabilities in the Bayes detection rulee does not affect AID. The results are also extended to time-continuons finite-state Markov observations. An application is analyzed, in which the behavior of a message buffer is monitored for the purpose of detecting malfunctions in a computer communication network.

Published in:

Information Theory, IEEE Transactions on  (Volume:24 ,  Issue: 6 )

Date of Publication:

Nov 1978

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.