1974
DOI: 10.1109/t-c.1974.223779
|View full text |Cite
|
Sign up to set email alerts
|

On a New Class of Bounds on Bayes Risk in Multihypothesis Pattern Recognition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
32
0

Year Published

1991
1991
2012
2012

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 61 publications
(32 citation statements)
references
References 6 publications
0
32
0
Order By: Relevance
“…I missed the 1973 ICPR in Washington DC where Pierre first introduced his ideas about the relationship of the Bayes Risk to the Mean Square Error [2]. He published an article on error bounds the following year in the IEEE Transactions on Computers (where the best papers on pattern recognition were published before PAMI came along) [3]. So even before I ever met him I had studied some of his work.…”
Section: Pierre Devijvermentioning
confidence: 99%
“…I missed the 1973 ICPR in Washington DC where Pierre first introduced his ideas about the relationship of the Bayes Risk to the Mean Square Error [2]. He published an article on error bounds the following year in the IEEE Transactions on Computers (where the best papers on pattern recognition were published before PAMI came along) [3]. So even before I ever met him I had studied some of his work.…”
Section: Pierre Devijvermentioning
confidence: 99%
“…We therefore need an entropy measure that weights the lower-valued coefficients less than the higher-valued ones. This is a property of a Bayes entropy function (Devijver, 1974), defined as…”
Section: Entropy Of a Normalized Spectrummentioning
confidence: 99%
“…A number of upper and lower bounds have been proposed in the literature [51][52][53][54][55][56][57][58][59][60][61][62][63].…”
Section: Bounds On the Probability Of Error Of Optimum Receiversmentioning
confidence: 99%
“…A tighter bound on the probability of error than the Bhattacharyya bound is in terms of the equivocation function [55,53]. Devijver [56] introduced another bound in terms of the so called Bayesian distance. This bound is known to be tighter than both the Bhattacharyya bound and the equivocation bound.…”
Section: Bounds On the Probability Of Error Of Optimum Receiversmentioning
confidence: 99%
See 1 more Smart Citation