Detail publikačního výsledku

Utilizing MFCC for Voice Intensity Determination

YOUNES, D.; ŠTEFFAN, P.

Originální název

Utilizing MFCC for Voice Intensity Determination

Anglický název

Utilizing MFCC for Voice Intensity Determination

Druh

Článek recenzovaný mimo WoS a Scopus

Originální abstrakt

This paper aims to classify speech signals according to their intensities into 3 groups (silent speech, normal speech and very loud speech). In this work, we have used a number of speech recordings, which were stored in a WAV format. These recordings are divided into groups with three different intensities, with each of them at three different distances from the point of entry (microphone). Mel Frequency Cepstral Coefficients and k-Nearest Neighbor classifier based algorithm was tested and implemented in Matlab environment. The intensity classification accuracy achieved was about 85%.

Anglický abstrakt

This paper aims to classify speech signals according to their intensities into 3 groups (silent speech, normal speech and very loud speech). In this work, we have used a number of speech recordings, which were stored in a WAV format. These recordings are divided into groups with three different intensities, with each of them at three different distances from the point of entry (microphone). Mel Frequency Cepstral Coefficients and k-Nearest Neighbor classifier based algorithm was tested and implemented in Matlab environment. The intensity classification accuracy achieved was about 85%.

Klíčová slova

voice intensity, MFCC, cepstrum, k-nn algorithm

Klíčová slova v angličtině

voice intensity, MFCC, cepstrum, k-nn algorithm

Autoři

YOUNES, D.; ŠTEFFAN, P.

Rok RIV

2011

Vydáno

22.09.2010

Místo

Sofia, Bulgaria

ISSN

1313-1842

Periodikum

Electronics

Svazek

4

Číslo

2

Stát

Bulharská republika

Strany od

162

Strany do

164

Strany počet

3

BibTex

@article{BUT50165,
  author="Dina {Younes} and Pavel {Šteffan}",
  title="Utilizing MFCC for Voice Intensity Determination",
  journal="Electronics",
  year="2010",
  volume="4",
  number="2",
  pages="162--164",
  issn="1313-1842"
}