
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
W.A. Hashlamoun, P.K. Varshney, V.N.S. Samarasooriya, "A Tight Upper Bound on the Bayesian Probability of Error," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 2, pp. 220224, February, 1994.  
BibTex  x  
@article{ 10.1109/34.273728, author = {W.A. Hashlamoun and P.K. Varshney and V.N.S. Samarasooriya}, title = {A Tight Upper Bound on the Bayesian Probability of Error}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {16}, number = {2}, issn = {01628828}, year = {1994}, pages = {220224}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.273728}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  A Tight Upper Bound on the Bayesian Probability of Error IS  2 SN  01628828 SP220 EP224 EPD  220224 A1  W.A. Hashlamoun, A1  P.K. Varshney, A1  V.N.S. Samarasooriya, PY  1994 KW  pattern recognition; Bayes methods; probability; decision theory; statistical pattern recognition; tight upper bound; Bayesian probability; minimum error probability VL  16 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
In this paper, we present a new upper bound on the minimum probability of error of Bayesian decision systems for statistical pattern recognition. This new bound is continuous everywhere and is shown to be tighter than several existing bounds such as the Bhattacharyya and the Bayesian bounds. Numerical results are also presented.
[1] T. Kailath, "The divegence and Bhattacharyya distance measures in signal detection,"IEEE Trans. Comm. Tech., vol. COM15, pp. 5260, Feb. 1967.
[2] H. Chernoff, "A measure of asymptotic efficiency for tests of a hypothesis based on a sum of observations,"Ann. Math. Stat., vol. 23, pp. 493507, 1952.
[3] C. H. Chen, "Theoretical comparison of a class of feature selection criteria in pattern recognition,"IEEE Trans. Comput., vol. C20, pp. 10541056, Sept. 1971.
[4] C. H. Chen, "On information and distance measures, error bounds, and feature selection,"Inform. Sci., vol. 10, pp. 159171, 1976.
[5] M. E. Hellman, "Probability of error, equivocation, and Chernoff bound,"IEEE Trans. Inform. Theory, vol. 16, pp. 368372, July 1970.
[6] P. A. Devijver, "On a new class of bounds on Bayes risk in multihypothesis pattern recognition,"IEEE Trans. Comput., vol. C23, pp. 7080, Jan. 1974.
[7] D. E. Boekee and J. C. A. Van der Lubbe, "Some aspects of error bounds in feature selection,"Pattern Recognition, vol. 11, pp. 353360, 1979.
[8] T. Ito, "Approximate error bounds in pattern recognition,"Machine Intell., vol. 7, pp. 369376, 1972.
[9] G. T. Toussaint, "On the divergence between two distributions and the probability of misclassification of several decision rules," inProc. Second Int. Joint Conf. Pattern Recognition, Copenhagen, Denmark, Aug. 1974.
[10] M. BenBassat, "Use of distance measures, information measures, and error bounds in feature evaluation," inHandbook of Statistics, vol. 2, P. R. Krishnaiah and L. N. Kanal, Eds. Amsterdam, The Netherlands: NorthHolland, 1982, ch. 35, pp. 773791.
[11] L. Devroye, "On the asymptotic probability of error in nonparametric discrimination,"Ann. Stat., vol. 9, no. 6, pp. 13201327, 1981.
[12] S. M. Ali and S. D. Silvey, "A general class of coefficients of divergence of one distribution from another,"J. Roy. Statist. Soc., series B, vol. 28, pp. 131143, 1966.
[13] H. L. Van Trees,Detection, Estimation, and Modulation Theory, Vol. I. New York: Wiley, 1968.
[14] A. K. Jain, "On an estimate of the Bhattacharyya distance,"IEEE Trans. Syst., Man, Cybern., Nov. 1976.
[15] A. Djouadi, O. Snorrason, and F. D. Garber, "The quality of training sample estimates of the Bhattacharyya coefficient,"IEEE Trans. Pattern Anal. Machine Intell., vol. 12, pp. 9297, Jan. 1990.
[16] J. L. Devore,Probability and Statistics for Engineering and the Sciences. New York: McGrawHill, 1990.
[17] H. V. Poor and J. B. Thomas, "Applications of AliSilvey distance measures in the design of generalized quantizers for binary decision systems,"IEEE Trans. Commun., vol. COM25, pp. 893900, Sept. 1977.
[18] H. V. Poor, "Fine quantization in signal detection and estimation,"IEEE Trans. Inform. Theory, vol. 34, no. 5, Sept. 1988.
[19] W. A. Hashlamoun, "Applications of distance measures and probability of error bounds to distributed detection systems," Ph.D. dissertation, Syracuse Univ., May 1991.