Intelligent Computing in Signal Processing and Pattern Recognition
DOI: 10.1007/11816515_48
|View full text |Cite
|
Sign up to set email alerts
|

Robust Feature Extraction for Mobile-Based Speech Emotion Recognition System

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 0 publications
0
5
0
Order By: Relevance
“…Several codecs have been developed to meet various applications with different quality requirements (Siegert et al, 2016a). More details about the degradation of acoustic characteristics under compressed speech can be found in (Byrne and Foulkes, 2004;Lee et al, 2006;Siegert et al, 2016b).…”
Section: Audio Codecsmentioning
confidence: 99%
“…Several codecs have been developed to meet various applications with different quality requirements (Siegert et al, 2016a). More details about the degradation of acoustic characteristics under compressed speech can be found in (Byrne and Foulkes, 2004;Lee et al, 2006;Siegert et al, 2016b).…”
Section: Audio Codecsmentioning
confidence: 99%
“…Therefore, there are several types of data sources such as speech, text, facial expression, body movement, and physiological measurement like EEG, finger temperature, skin conductance level, heart rate, and muscle activity [11,13,14,69]–[73]. There is a mass of emotion data for speech, text, and facial expression as these are details that can be easily gathered from devices used by people on a daily basis, such as cellphones and computers [75,76]. On the other hand, physiological signals can also be a good source of information since they could be collected continuously without participants interfering [77,78].…”
Section: Eegmentioning
confidence: 99%
“…For minimization of (4), we implemented the algorithm by Lee and Seung [31], which iteratively modifies W and H using "multiplicative update" rules. With matrix-matrix multiplication being its core operation, the computational cost of this algorithm largely depends on the matrix dimensions: assuming a naive implementation of matrixmatrix multiplication, the cost per iteration step is O(mnr) for the minimization of c d from (4). However, in practice, computation time can be drastically reduced by using optimized linear algebra routines.…”
Section: Factorization Algorithms a Factorization According Tomentioning
confidence: 99%
“…Table 3); "+" denotes the union of feature sets. "Mel" are functionals of 26 Mel frequency bands and "MFCC" functionals of the corresponding MFCCs (1)(2)(3)(4)(5)(6)(7)(8)(9)(10)(11)(12). Classification was performed by SVM (trained with SMO, complexity C = 0.1).…”
Section: Interspeech 2009 Emotion Challenge Taskmentioning
confidence: 99%
See 1 more Smart Citation