Skip to main content

Uniform, Fast Convergence of Arbitrarily Tight Upper and Lower Bounds on the Bayes Error

  • Chapter
Pattern Recognition and String Matching

Part of the book series: Combinatorial Optimization ((COOP,volume 13))

  • 450 Accesses

Abstract

This chapter studies the convergence behavior of the arbitrarily tight upper and lower bounds on the Bayes error proposed by Avi-Itzhak and Diep [1]. We show that these bounds converge to the Bayes error uniformly with a very fast convergence rate.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Avi-Itzhak and T. Diep, Arbitrarily tight upper and lower bounds on the Bayesian probability of error, IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. 18 No. 1 (Jan. 1996) pp. 89–91.

    Article  Google Scholar 

  2. P. A. Devijver, On a new class of bounds on Bayes risk in multihypothesis pattern recognition, IEEE Trans. ComputersVol. 23 (Jan. 1974) pp. 70–80.

    Article  MATH  MathSciNet  Google Scholar 

  3. W. A. Hashlamoun, P. K. Varshney, and V. N. S. Samarasooriya, A tight upper bound on the Bayesian probability of error, IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. 16, (Feb. 1994) pp. 220–224.

    Article  Google Scholar 

  4. M. E. Hellman and J. Raviv, Probability of error, equivocation, and Chernoff bound, IEEE Trans. Information TheoryVol. 16 (July 1970) pp. 368–372.

    Article  MATH  MathSciNet  Google Scholar 

  5. T. Kailath, The divergence and Bhattacharyya distance measures in signal selection, IEEE Trans. Communication TechnologyVol. 15 (Feb. 1967) pp. 52–60.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Kluwer Academic Publishers

About this chapter

Cite this chapter

Chen, D., Fries, M.A., Xiang, Y. (2003). Uniform, Fast Convergence of Arbitrarily Tight Upper and Lower Bounds on the Bayes Error. In: Chen, D., Cheng, X. (eds) Pattern Recognition and String Matching. Combinatorial Optimization, vol 13. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0231-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0231-5_5

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7952-2

  • Online ISBN: 978-1-4613-0231-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics