IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/209814.html
   My bibliography  Save this article

Optimized Audio Classification and Segmentation Algorithm by Using Ensemble Methods

Author

Listed:
  • Saadia Zahid
  • Fawad Hussain
  • Muhammad Rashid
  • Muhammad Haroon Yousaf
  • Hafiz Adnan Habib

Abstract

Audio segmentation is a basis for multimedia content analysis which is the most important and widely used application nowadays. An optimized audio classification and segmentation algorithm is presented in this paper that segments a superimposed audio stream on the basis of its content into four main audio types: pure-speech, music, environment sound, and silence. An algorithm is proposed that preserves important audio content and reduces the misclassification rate without using large amount of training data, which handles noise and is suitable for use for real-time applications. Noise in an audio stream is segmented out as environment sound. A hybrid classification approach is used, bagged support vector machines (SVMs) with artificial neural networks (ANNs). Audio stream is classified, firstly, into speech and nonspeech segment by using bagged support vector machines; nonspeech segment is further classified into music and environment sound by using artificial neural networks and lastly, speech segment is classified into silence and pure-speech segments on the basis of rule-based classifier. Minimum data is used for training classifier; ensemble methods are used for minimizing misclassification rate and approximately 98% accurate segments are obtained. A fast and efficient algorithm is designed that can be used with real-time multimedia applications.

Suggested Citation

  • Saadia Zahid & Fawad Hussain & Muhammad Rashid & Muhammad Haroon Yousaf & Hafiz Adnan Habib, 2015. "Optimized Audio Classification and Segmentation Algorithm by Using Ensemble Methods," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-11, May.
  • Handle: RePEc:hin:jnlmpe:209814
    DOI: 10.1155/2015/209814
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/209814.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2015/209814.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/209814?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:209814. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.