Skip to main content

Speech Enhancement Based on Bat Algorithm (BA)

  • Chapter
  • First Online:
Metaheuristic Applications to Speech Enhancement

Part of the book series: SpringerBriefs in Electrical and Computer Engineering ((BRIEFSSPEECHTECH))

Abstract

Bat Algorithm (BA) is a recently developed population-based meta-heuristic approach (Yang 2010) which is inspired by the hunting behaviour of the bats. BA is developed by Yang (2010). As a novel feature BA is based on the echolocation behaviour of microbats. BA uses the frequency tuning technique to increase the diversity of the solutions in the population, while at the same time it uses the automatic zooming and tries to balance the exploration and exploitation during the search process by mimicking the pulse emission rate and loudness of bats when searching for a prey. This algorithm turns out to be very efficient for a diverse range of problems, and its binary version has been successfully applied to image processing and classifications. The autozooming ability in microbats is manifested in the BA as automatic adjustment from exploration to exploitation when the global optimality is approaching. This is the first algorithm of its kind in terms of balancing these two key components. As a result it proves to be a very efficient optimization technique than all other meta-heuristic algorithms. This chapter intends to present the BA as an improved approach to adaptive noise cancellation in speech enhancement. Simulation results with BA are compared with the standard PSO (Kennedy et al. 2005), accelerated PSO (Yang 2010), gravitational search algorithm (Rashedi et al. 2009) and hybrid PSOGSA (Mirjalili et al. 2010)-based speech enhancement algorithms that are dealt with in this thesis. Conclusions of the present chapter clearly establish the advantages of the new meta-heuristic BA over the other algorithms in the context of speech enhancement.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  • Colin T (2000) The varienty of life. Oxford University Press, Oxford

    Google Scholar 

  • Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search simulation. 76:60–68

    Google Scholar 

  • Mirjalili S, Mohd Hashim SZ (2010). A new hybrid PSOGSA algorithm for function optimization. In: IEEE International Conference on Computer and Information Application (ICCIA 2010), pp 374–377

    Google Scholar 

  • Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Info Sci 2232–2248

    Google Scholar 

  • Richardson P (2008) Bats natural history museum, London

    Google Scholar 

  • Yang XS (2010) Nature-inspired metaheuristic algorithms. Luniver Press, 2nd edn

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Prajna Kunche .

Rights and permissions

Reprints and permissions

Copyright information

© 2016 The Author(s)

About this chapter

Cite this chapter

Kunche, P., Reddy, K.V.V.S. (2016). Speech Enhancement Based on Bat Algorithm (BA). In: Metaheuristic Applications to Speech Enhancement. SpringerBriefs in Electrical and Computer Engineering(). Springer, Cham. https://doi.org/10.1007/978-3-319-31683-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-31683-3_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-31681-9

  • Online ISBN: 978-3-319-31683-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics