BHATTACHARYYA DISTANCE AND DETECTION BETWEEN MARKOV-CHAINS

被引:16
作者
KAZAKOS, D
机构
关键词
D O I
10.1109/TIT.1978.1055967
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:747 / 754
页数:8
相关论文
共 21 条
[1]  
Bartlett MS, 1956, INTRO STOCHASTIC PRO
[2]  
BELLMAN R, 1957, P CAMBRIDGE PHILOS S, V53, P257
[3]  
Bellman R., 1970, INTRO MATRIX ANAL
[4]   INDEPENDENCE, MEASUREMENT COMPLEXITY, AND CLASSIFICATION PERFORMANCE [J].
CHANDRASEKARAN, B ;
JAIN, AK .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1975, SMC5 (02) :240-244
[5]  
CHANDRASEKARAN B, 1977, IEEE T SYST MAN CYB, V7, P564
[6]   COMMENTS ON INDEPENDENCE, MEASUREMENT COMPLEXITY, AND CLASSIFICATION PERFORMANCE [J].
DUIN, RPW .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1977, 7 (07) :559-560
[7]  
Gourlay Alexander Robertson, 1973, COMPUTATIONAL METHOD
[8]   GENERALIZATION OF ORNSTEINS D DISTANCE WITH APPLICATIONS TO INFORMATION-THEORY [J].
GRAY, RM ;
NEUHOFF, DL ;
SHIELDS, PC .
ANNALS OF PROBABILITY, 1975, 3 (02) :315-328
[9]   ON BEST FINITE SET OF LINEAR OBSERVABLES FOR DISCRIMINATING 2 GAUSSIAN SIGNALS [J].
KADOTA, TT ;
SHEPP, LA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (02) :278-+
[10]  
KAUFMAN JS, BELL SYST TECH J, V56, P919