<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Exploiting voice signal decomposition in expert system for Parkinson's disease detection</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Aivaras Šimulis</string-name>
          <email>aivaras.simulis@ktu.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Information Systems Kaunas University of Technology Kaunas</institution>
          ,
          <country country="LT">Lithuania</country>
        </aff>
      </contrib-group>
      <fpage>49</fpage>
      <lpage>54</lpage>
      <abstract>
        <p>-The goal of this research is the robust detection of Parkinson's disease by acoustic analysis of sustained voice recordings. Application of signal decomposition into intrinsic mode functions (IMFs) is investigated as a novel type of audio features and a custom solution for decision-level fusion, employing statistical functionals to compress decisions from all IMFs. Proposed audio features are perceptual linear predictive cepstral coefficients (PLPCCs) estimated on the extracted components from one or several equally-spaced windows of audio signal. Decompositions used are empirical mode decomposition (EMD) and variational mode decomposition (VMD). Random forest (RF) is used as a base detector as well as meta learner for decision-level fusion. Cost of log-likelihood ratio and equal error rate (EER) were used to measure goodness-of-detection. Baseline solution using PLPCCs from all frames was compared to several types of decision-level fusion (EMD, VMD, and EMD+VMD) using 1-3 windows of various sizes (10-100 ms). Decomposition-based PLPCCs and EMD+VMD fusion from three 30 ms sized windows resulted in detection performance with an average EER of 6.5% and clearly outperformed the baseline solution of decompositionless PLPCCs, having EER of 32.9%. Variable importance from meta RF found both decompositions as useful and variancerelated statistics of base RF decisions as the most important.</p>
      </abstract>
      <kwd-group>
        <kwd>Parkinson's disease</kwd>
        <kwd>voice analysis</kwd>
        <kwd>empirical mode decomposition</kwd>
        <kwd>variational mode decomposition</kwd>
        <kwd>PLPCC</kwd>
        <kwd>random forest</kwd>
        <kwd>medical decision support</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>I. INTRODUCTION</p>
      <p>Parkinson’s disease (PD) is the second most common
neurodegenerative disease after Alzheimer’s [1] and it is
expected that the prevalence of PD is going to increase due to
population ageing. If it is detected early, the progression of PD
may be more researched using neuroprotective strategies, which
could result in increased life span and improved living
conditions.</p>
      <p>
        Amongst many various symptoms, PD induces speech
disorders, which can be observed as early as 5 years before the
diagnosis [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Investigations show that Parkinsonian vocal
dysfunction can be characterized by: reduced vocal tract volume
and reduced tongue flexibility, significantly narrower pitch
range, longer pauses and smaller variations in pitch range, voice
intensity level, and articulation rate. Therefore, acoustic analysis
is considered by many researchers as an important non-invasive
      </p>
    </sec>
    <sec id="sec-2">
      <title>Copyright © 2017 held by the authors 49</title>
      <p>
        approach for PD detection. Detailed review of the related work
can be found in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        Most of the studies use audio features obtained from the
entire record (global attributes) directly or calculated from
shortterm frames (local attributes). Frame-based features usually are
compressed with the statistical functionals or the Gaussian
mixture model [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Some studies use large feature sets aiming to
obtain comprehensive characterization of the voice signal, while
others rely on “clinically useful” set of measures or perform
feature selection to collect a compact set of audio descriptors. In
this work, we investigate if applying signal decomposition of a
few short-term frames of a sustained voice recording and
calculating perceptual linear predictive cepstral coefficients
(PLPCCs) for extracted components can outperform a simple
decomposition-less approach of using PLPCCs from all frames.
      </p>
      <p>
        Small size of previously used databases and data samples
(less than 60 PD subjects) is a major deficiency resulting in
unreliable estimates of reported performance. Incorrect
assessment of accuracy is another common deficiency – studies
often lack conformity to leave-one-subject-out [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] or
leave-oneindividual-out [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] validation scheme. The need for such scheme
arises when subject has several recordings, where all recordings
of a subject should be included either in a training or in a testing
fold, but not in both.
      </p>
      <p>This work explores application of two techniques for voice
signal decomposition into intrinsic mode functions, namely,
empirical mode decomposition (EMD) and variational mode
decomposition (VMD), introduces a novel decision-level fusion
approach using EMD and VMD base detectors and addresses the
aforementioned deficiencies by using relatively large database
and leave-one-subject-out validation for a task of PD detection.</p>
      <p>The organization of this paper is as follows: voice recordings
database is described in section 2, feature extraction in section
3, detection methodology is presented by section 4, results of
experiments are in section 5, while conclusions are drawn in
section 6.</p>
    </sec>
    <sec id="sec-3">
      <title>II. FEATURE EXTRACTION</title>
      <p>Audio features of choice were PLPCC, which were extracted
either from all frames of recording and compressed using
statistical functionals (baseline solution) or from a few frames
after applying decomposition and extracting IMFs (researched
solution). Two approaches for decomposition were considered –
empirical mode decomposition (EMD) and variational mode
decomposition (VMD). Therefore, the researched
solution
proposes EMD-PLPCC and VMD-PLPCC as audio descriptors.</p>
      <sec id="sec-3-1">
        <title>A. Signal decomposition</title>
        <p>
          Empirical mode decomposition is a recent method for
nonstationary signal analysis which has found extensive application
in
many
areas of science and
engineering [
          <xref ref-type="bibr" rid="ref6">5, 6</xref>
          ]. EMD
decomposes signals into functions of time, from which spectral
information may also be obtained. Therefore, EMD lends itself
well to extraction of temporal as well as spectral descriptors
from the original signal [7]. Application of EMD to analysis of
speech signals is scarce. It is an adaptive technique that allows
decomposition
of non-linear and
non-stationary
data into
intrinsic mode functions. An intrinsic mode function (IMF)
satisfies the following two conditions [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]:
        </p>
        <p>The number of maxima, which are strictly positive, and
the number of minima, which are strictly negative, for
each IMF, are either equal, or differ at most by one.
The mean value of the envelope, as defined by the
maxima and the minima, for each IMF, is zero.</p>
        <p>The technique for decomposition of the data into IMFs is
known as sifting, a brief description of which follows:
For a given discrete time signal  [ ], all the local
minima and maxima of  [ ] are identified.</p>
        <p>The upper envelope   is calculated by using a cubic
spline to connect all the local maxima. Similarly, the
lower envelope   is calculated from the local minima.
The upper and lower envelopes should cover all the
data in  [ ] between them.</p>
        <p>The mean</p>
        <p>=   +   /2 of the upper and lower
envelopes is calculated, and  [ ] is updated by
subtracting the mean from it  [ ] ←  [ ] −  
.</p>
        <p>The previous three steps are executed till  [ ] is
reduced to an IMF  1[ ], which conforms to the
properties of IMFs described previously. The first IMF
contains the highest oscillation frequencies found in
the original data  [ ].</p>
        <p>The first IMF  1[ ] is subtracted from  [ ] to get the
residue  1[ ].
residue</p>
        <p>The residue  1[ ] is now taken as the starting point
instead of  [ ], and the previously mentioned steps are
repeated to find all the IMFs  1[ ] so that the final
either becomes a constant, a monotonic
function, or a function with a single maximum and
minimum from which no further IMF can be extracted.

 =1
 [ ] = ∑   [ ] +   [ ]</p>
        <p>Therefore, at the end of the decomposition, we can represent
 [ ] as the sum of K IMFs and a residue   :
The EMD algorithm variant used is ensemble empirical mode
decomposition with adaptive noise (CEEMDAN) [7], which
(1)
automatically selects the number of intrinsic mode functions
(IMFs). According to the selected number of IMFs for EMD, the
same number of IMFs was used in the VMD algorithm.</p>
        <p>
          Variational mode decomposition [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] decomposes the signal
into various modes or intrinsic mode functions using calculus of
variation. Each mode of the signal is assumed to have compact
frequency support around a central frequency. VMD tries to find
out these central frequencies and intrinsic
mode functions
centered
on
those
frequencies
concurrently
using
an
optimization methodology called alternate direction method of
multipliers (ADMM13).
        </p>
        <p>
          The
original formulation
of the
optimization problem is continuous in time domain. The
constrained formulation is given in [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ].
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>B. PLPCC</title>
        <p>The idea of a perceptual front end for determining linear
prediction cepstral coefficients (PLPCCs) has been applied in
different ways to improve speech detection and coding, as well
as
noise
reduction, reverberation
suppression,
and
cancellation.</p>
        <p>
          Linear prediction of a signal is done
echo
via
autoregressive moving average (ARMA) modeling of the time
series. In an ARMA model, the current sample is expressed as:
 [ ] = ∑    [ −  ] + ∑    [ −  ]
(2)

 =0

 =1
where  [ ] is the current input signal, and  [ ] is the current
output. The perceptual linear prediction coefficients are created
from the linear prediction coefficients by performing perceptual
processing before performing the autoregressive modeling [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ].
The main sequence of steps for PLPCC calculation is provided
by a diagram in Fig. 1.
        </p>
        <p>Voice database had 383 speakers (141 men and 242 women),
where each speaker was represented by 3 recordings (419
recordings for men and 715 recordings for women) of sustained
voicing of vowel /a/, each at least 2 seconds in length. Speaker
age range was from 16 to 82 for HC and from 39 to 85 for PD.
Detailed summary of voice recording database is in Table I.
Recordings were collected in a sound-proof chamber using
acoustic cardioid microphone (AKG Perception 220) placed at a
distance of 10 cm from the mouth. Audio format was “.wav”
(16-bit mono PCM</p>
        <p>
          with 44.1 kHz sampling frequency). HC
voice subgroup encompassed healthy volunteer individuals who
considered their voice as normal, had no complaints concerning
their voice and no history of chronic laryngeal diseases or other
long-lasting voice disorders. Voices of these individuals were
also confirmed as healthy by clinical specialists. Furthermore,
no pathological alterations in the larynx of the subjects from HC
voice subgroup were found during video laryngostroboscopy.
decision trees, where the final decision is obtained by majority
voting. The core idea of RF is to combine many (
in total)
decision trees, built using different bootstrap samples of the
original data set, and a random subset (of predetermined size  )
of features  1, … ,   . RF is known to be robust against
overfitting and as the number of trees increases, the generalization
error converges to a limit [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. For our experiments 
5000, several specific values of q (√ , 2 ∙ √ ,
tested and the best performing  setting retained.
1
2
        </p>
        <p>was set to
∙ √ ) were</p>
        <p>
          The generalization performance of RF was evaluated using
internal out-of-bag (OOB) validation, where each observation is
classified only by the trees which did not have this observation
in bootstrap sample during construction. It is well known that
OOB validation provides an unbiased estimate of a test set error,
similar to leave-one-out scheme. Because of the “repeated
measures”
aspect in
voice
data,
where
each
subject is
represented by several recordings of sustained vowel, sampling
part of the RF algorithm [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] had to be modified to ensure that
all recordings of each subject are either included in a bootstrap
sample or left aside as OOB. Such modification corresponds to
leave-one-subject-out scheme, which helps to avoid speaker
detection intermingling with pathology detection. Additionally,
RF setting of stratified sampling was configured to preserve
class ratio and gender balance of the full dataset in each drawn
bootstrap sample.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Individual</title>
      <p>RFs
were
built independently
for
each
decomposition variant (EMD or VMD) and each frame location
(center frame only or 3 frames in equally-spaced locations) and
decisions of these individual experts were combined in a
metalearner fashion. RF was used both as a base learner and as a meta
learner. This implies that outputs from RF models from the first
stage after compression of decisions for all IMFs of a single
recording using statistical functionals are treated as inputs
(meta-features) for another RF in the second stage.</p>
      <p>For the detection task, a decision from base RF is the
difference between class posteriori. Given a trained RF, this
difference or variant of soft decision is estimated as:

∑
 ( 1, … ,   ) =  =1  (  ,  ,  = 2)

−  =1  (  ,  ,  = 1)
∑</p>
      <p>,


into which  falls in the  th tree   of the forest:
where  is the object being classified,  is the number of trees
 2, . . . ,   in the RF for which observation  is OOB,  is a class
label (label number 1 corresponds to HC and 2 to PD), and
 (  ,  ,  ) stands for the  th class frequency in the leaf node,
 (  ,  ,  ) =</p>
      <p>(  ,  ,  )
∑
 =1  (  ,  ,  )
,
(3)
(4)
where  is the number of classes and  (   ,  ) is the number of
training data from class  and falling into the same leaf node of
  as  .</p>
      <p>For a baseline solution, there was no need of decision-level
fusion and a single base RF was enough. For a researched
solution,
decision-level fusion
used
decisions
from
the
decomposition-based base RFs. Base RF was constructed using
all components (IMFs) resulting from EMD or VMD in a
specific frame. The number of decisions from a base RF
corresponded to the number of extracted components. This
varied number of base decisions was compressed into
metafeatures using the following statistical functionals: min, max,
mean, median, trimean, standard deviation, inter-quartile range
(IQR), lower quartile (Qlo), upper quartile (Qup), lower range
(IQlo), upper range (IQup), skewness, and kurtosis.</p>
      <p>Meta-features in fusion RF were also investigated by
performing</p>
      <p>permutation-based variable importance analysis
using mean decrease in accuracy as the variable importance
measure. Values of each</p>
      <p>meta-feature are permuted several
times and the mean difference in fusion RF performance on</p>
    </sec>
    <sec id="sec-5">
      <title>OOB data is estimated.</title>
      <sec id="sec-5-1">
        <title>C. Assesing Detection</title>
        <p>To evaluate the goodness of detection, detector’s scores for
OOB data were used. Votes of RF were converted to a proper
score vector by normalizing votes for a specific class through
division by the total number of times the case was OOB, as in
formula (3). A quick way to compare detectors is the equal error
rate
(EER).</p>
        <p>
          The
cost of log-likelihood-ratio
(Cllr) is a
comprehensive detection metric, used here as the main criterion
for model selection. The log-likelihood-ratio is the logarithm of
the ratio between the likelihood that the target (PD) produced the
signal and the likelihood that a non-target (HC) produced the
signal. EER and Cllr measures were estimated using the ROC
convex hull method, available in the BOSARIS toolkit [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. A
well-calibrated and useful detector should have Cllr &lt; 1 and EER
&lt; 50 %.
        </p>
        <p>V. EXPERIMENTS</p>
      </sec>
      <sec id="sec-5-2">
        <title>A. Experimental Setup</title>
        <p>For our frame-based features several window sizes were
tested: 10, 20, 30, 40, 50, 60, 70, 80, 90 and 100 milliseconds.
For a researched solution, different quantity of windows were
extracted and detection performance compared: 1 window from
the center of recording versus 2 or 3 windows placed at
equallyspaced locations to evenly cover all recording. For each setting
of window size and quantity, three decision-level fusion variants
were tested: EMD, VMD and EMD+VMD. The number
PLPCCs used was 12 in both baseline and researched solutions.</p>
        <p>From the results of initial experiments, the single best
window size was selected. Sensitivity analysis was then
performed by repeating decomposition for each recording 5
times. Each of the 5 different collections of IMFs, converted into
EMD-PLPCCs or VMD-PLPCCs, were used in base RF and
construction of base RF repeated 5 times. Finally, each of 25
results from decomposition and base RF runs was fused using
meta RF and the fusion was repeated 5 times. All runs resulted
in 125 detection performance measures (EER and Cllr) and
statistical testing for equality of central tendencies (mean and
median) was performed to compare the setting of using 1 central
window only versus using 3 windows at equally-spaced
locations. Parametric independent samples t-test was used to
compare means. Non-parametric Wilcoxon rank-sum test
(Mann-Whitney U-test) was used to compare medians.</p>
      </sec>
      <sec id="sec-5-3">
        <title>B. Results</title>
        <p>From the results of initial experiment with various window
sizes in Table II we decide that 30 ms window size, 1 or 3
windows and fusion of EMD+VMD could be a recommended
setting for a researched solution. Both window sizes had same
EER of 2.22%, but Cllr was slightly better for 3 windows (0.079)
than 1 window (0.085). VMD consistently outperformed EMD,
but the best overall performance was found when fusing
EMD+VMD. The best window size was difficult to identify,
because the results change from one window size to another
sometimes rather erratically. This could be due to stochastic
nature of EMD and VMD, where optimization results in
suboptimal solutions and not identical IMFs when run repeatedly.</p>
        <p>The summary of results from Table II for 1 and 3 windows
is illustrated in Fig 2–3. Both settings of window quantity were
able to provide the lowest EER of 2.2% with 30 ms window size,
but performance when using 3 windows appear to be more stable
and doesn’t fluctuate that much with respect to window sizes.</p>
        <p>Fig. 3. EMD+VMD detection performance by EER and Cllr using 3 windows.</p>
        <p>Results of the baseline solution (see Fig. 4), when extracting
PLPCCs from all frames (without any decomposition) and
compressing with statistical functionals, were rather stable
irrespective of the window size. The best detection performance
was 32.9% by EER and 0.895 by Cllr.</p>
        <p>Fig. 4. Detection performance by EER and Cllr for the baseline solution.</p>
        <p>Variable importance from the meta RF when using 3
windows and EMD+VMD type of decision-level fusion is
shown in Fig 5. Both EMD and VMD types of decomposition
are useful, but from statistical functionals variance-related
measures (standard deviation and inter-quartile range with its
lower part) of base decisions appear to be the most important for
the detection.</p>
        <p>Sensitivity analysis was performed by repeating detection
task using 30 ms window size and EMD+VMD fusion.
Distribution of the resulting Cllr and EER measures is illustrated
by boxplots in Fig 6 – 7.
Quartiles
Median
Mean
lfr
iiittrsoobunC
D
iiittrsoobEEnuR
f
D</p>
        <p>Due to the lack of normality in Cllr and EER measures (see
Tables III – IV), non-parametric statistical testing was
performed. Medians of Cllr and EER were compared between 1
window and 3 windows setting using Wilcoxon rank-sum test
and results are provided in Table V. Statistically significant
difference with 99% confidence (p-value &lt; 0.01) was indicated
in favor of using 3 windows.</p>
        <p>HYPOTHESIS OF EQUAL CENTRAL TENDENCIES TESTING FOR</p>
        <p>CLLR AND EER USING WILCOXON RANK-SUM TEST</p>
        <p>VI. CONCLUSIONS</p>
        <p>Decomposition-based PLPCC features, namely,
EMDPLPCC and VMD-PLPCC, were found useful for building
expert system for Parkinson’s detection from sustained voice.
The baseline solution without decomposition and decision-level
fusion, where PLPCCs were obtained from all frames and
compressed using statistical functionals, resulted in the lowest
EER of 32.90% for 30 ms windows size. The researched solution
using decision-level fusion of PLPCCs from EMD and VMD,
obtained from 3 windows at equally-spaced locations, resulted
in EER as low as 2.22% for 30 ms window size.</p>
        <p>Sensitivity analysis was performed by fixing window size at
30 ms and repeating detection task 125 times to choose between
fusion of components from 1 or 3 windows. Fusion of
EMD+VMD from 1 window provided an average EER of
12.13%, whereas fusion of EMD+VMD from 3 windows
provided an average EER of 6.48%. Detection performance
when using decision-level fusion of decomposition results from
3 evenly located windows was better than using 1 central
window and the difference in detection performance was
statistically significant, as indicated by statistical tests.</p>
        <p>Main challenge remains lack of numerical stability in
decomposition output, where extracted IMFs were not identical
between runs. This limitation leaves the choice of the window
size questionable, but future work could exploit a multitude of
sub-optimal IMFs and use them for boosting data amounts when
building detectors. Not only the first stage detectors could be
built on more data, but also statistical functionals when
compressing decisions of base detectors for the second stage
would certainly benefit from increased number of decisions –
statistics for decision-level fusion would be obtained not from
6–12 components, as in a current solution, but from several
times more. We speculate that meta-leaner in the second stage
could achieve robustness by using all IMFs of several repeated
decomposition runs.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>ACKNOWLEDGMENT</title>
      <p>Voice database was collected at Lithuanian University of
Health Sciences (LUHS) under a grant (No. MIP-075/2015)
from the Research Council of Lithuania. Authors would like to
thank LUHS specialists – otorhinolaryngologist Evaldas
Padervinskis and neurologist Jolita Čičelienė.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Trenkwalder</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Hofman, “
          <article-title>Prevalence of Parkinson's disease in Europe: a collaborative study of population-based cohorts</article-title>
          ,
          <source>” Neurology</source>
          , vol.
          <volume>54</volume>
          (
          <issue>11 Supply 5</issue>
          ),
          <fpage>S21</fpage>
          -
          <lpage>S23</lpage>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>B.</given-names>
            <surname>Harela</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cannizzaro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Snyder</surname>
          </string-name>
          , “
          <article-title>Variability in fundamental frequency during speech in prodromal and incipient Parkinson's disease: A longitudinal case study,” Brain and Cognition</article-title>
          , vol.
          <volume>56</volume>
          , pp.
          <fpage>24</fpage>
          -
          <lpage>29</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Orozco-Arroyave</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Honig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Arias-Londono</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. F.</given-names>
            <surname>VargasBonilla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Daqrouq</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Skodda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Rusz</surname>
          </string-name>
          , E. Noth, “
          <article-title>Automatic detection of Parkinson's disease in running speech spoken in three different languages</article-title>
          ,
          <source>” J. Acoust. Soc. Am.</source>
          , vol.
          <volume>139</volume>
          (
          <issue>1</issue>
          ), pp.
          <fpage>481</fpage>
          -
          <lpage>500</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>C. O.</given-names>
            <surname>Sakar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Kursun</surname>
          </string-name>
          , “
          <article-title>Telediagnosis of Parkinson's disease using measurements of dysphonia,”</article-title>
          <string-name>
            <given-names>J.</given-names>
            <surname>Med</surname>
          </string-name>
          . Syst., vol.
          <volume>34</volume>
          (
          <issue>4</issue>
          ), pp.
          <fpage>591</fpage>
          -
          <lpage>599</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>M. F. Kaleem</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Sugavaneswaran</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Guergachi</surname>
          </string-name>
          , S. Krishnan, “
          <article-title>Application of empirical mode decomposition and Teager energy operator to EEG signals for mental task classification</article-title>
          ,
          <source>” Proceedings of the International Conference of the IEEE Engineering in Medicine and Biology (EMBC)</source>
          , pp.
          <fpage>4590</fpage>
          -
          <lpage>4593</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>B.</given-names>
            <surname>Mijovic</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. De Vos</surname>
            ,
            <given-names>I. Gligorijevic</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Taelman</surname>
          </string-name>
          ,
          <string-name>
            <surname>S. Van Huffel</surname>
          </string-name>
          , “
          <article-title>Source separation from single-channel recordings by combining empirical mode decomposition and independent component analysis</article-title>
          ,
          <source>” IEEE Trans. Biomed</source>
          . Eng., vol.
          <volume>57</volume>
          (
          <issue>9</issue>
          ), pp.
          <fpage>2188</fpage>
          -
          <lpage>2196</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>M. E. Torres</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          <string-name>
            <surname>Colominas</surname>
          </string-name>
          , G. Schlotthauer, “
          <article-title>A complete Ensemble Empirical Mode decomposition with adaptive noise,”</article-title>
          <source>Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP-11)</source>
          , pp.
          <fpage>4144</fpage>
          -
          <lpage>4147</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N. E.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. R.</given-names>
            <surname>Long</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. C. Wu</surname>
            ,
            <given-names>H. H.</given-names>
          </string-name>
          <string-name>
            <surname>Shih</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          <string-name>
            <surname>Zheng</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Yen</surname>
            ,
            <given-names>C. C.</given-names>
          </string-name>
          <string-name>
            <surname>Tun</surname>
            ,
            <given-names>H. H.</given-names>
          </string-name>
          <string-name>
            <surname>Liu</surname>
          </string-name>
          , “
          <article-title>The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysis</article-title>
          ,
          <source>” Proc. R. Soc. Lond., A</source>
          <volume>454</volume>
          (
          <year>1971</year>
          ), pp.
          <fpage>903</fpage>
          -
          <lpage>995</lpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>K.</given-names>
            <surname>Dragomiretskiy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zosso</surname>
          </string-name>
          , “Variational Mode Decomposition,”
          <source>IEEE Trans. Signal Process</source>
          , vol.
          <volume>62</volume>
          (
          <issue>3</issue>
          ), pp.
          <fpage>531</fpage>
          -
          <lpage>544</lpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>H.</given-names>
            <surname>Hermansky</surname>
          </string-name>
          , “
          <article-title>Perceptual Linear Predictive (PLP) Analysis of Speech,”</article-title>
          <source>J. Acoust. Soc. Am.</source>
          , vol.
          <volume>87</volume>
          (
          <issue>4</issue>
          ), pp.
          <fpage>1738</fpage>
          -
          <lpage>1752</lpage>
          ,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>L.</given-names>
            <surname>Breiman</surname>
          </string-name>
          , “Random forests,” Mach. Learn., vol.
          <volume>45</volume>
          , pp.
          <fpage>5</fpage>
          -
          <lpage>32</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Jaiantilal</surname>
          </string-name>
          , “
          <article-title>Random forest (regression, classification and clustering) implementation for Matlab (and standalone</article-title>
          ),”
          <year>2012</year>
          . http://code.google.com/archive/p/randomforest-matlab/.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>N.</given-names>
            <surname>Brummer</surname>
          </string-name>
          , E. de Villiers, “
          <article-title>The BOSARIS toolkit: Theory, algorithms and code for surviving the new DCF”</article-title>
          .
          <source>arXiv 1304(2865v1)</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>23</lpage>
          , Presented at the
          <source>NIST SRE 2011 Analysis Workshop</source>
          , Atlanta,
          <year>December 2011</year>
          . http://sites.google.com/site/bosaristoolkit.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>