EEL6586: HW#3

Get PDF file Due Wednesday, March 13, 2002 in class. Late homework will lose $e^{\char93  of days late} -1$ percentage points. To see the current late penalty, click on
http://www.cnel.ufl.edu/hybrid/harris/latepoints.html PART A: Cepstrum Problems

A1

Compute the complex cepstrum of $H(z)=1/(1+.25z^{-2})$

A2

Let $x_1(n)$ and $x_2(n)$ denote two sequences and $\hat{x}_1(n)$ and $\hat{x}_2(n)$ their corresponding complex cepstra. If ${x}_1(n) * {x}_2(n) = \delta(n)$ determine the relationship between $\hat{x}_1(n)$ and $\hat{x}_2(n)$.

A3

Suppose the complex cepstrum of of $y(n)$ is $\hat{y}(n)=\hat{s}(n)+2\delta(n)$. Determine $y(n)$ in terms of $s(n)$.

A4

Euclidean distance in complex cepstral space can be related to a RMS log spectral distance measure. Assuming that

$$\log S(\omega) = \sum_{n=-\infty}^{n=+\infty}c_n e^{-jn\omega}$$

where $S(\omega)$ is the power spectrum (magnitude-squared Fourier transform), prove the following:

$$\sum_{n=-\infty}^{n=+\infty} (c_n - c'_n)^2 = \frac{1}{2 \pi} \int \vert\log( S(\omega))-\log(S'( \omega))\vert^2 d \omega$$

where $S(\omega)$ and $S'(\omega)$ are the power spectra for two different signals.

PART B: Phoneme Recognition Utterances of 8 vowel phonemes from 38 speakers from the TIMIT database were extracted (about 2300 utterances total). Your goal for this problem is to achieve the highest recognition accuracy for this speech corpus. to improve recognition accuracy. A demo Matlab program using LPC-10 and 1-NN is provided to demonstrate usage of the database. The following files are provided: hw3Data.mat: Matlab .mat file containing the variables vocab, *Utter, and *Speaker, where * is one of the phonemes in vocab. *Utter is a 512xN (N varies w/ phoneme) matrix where each column is a 512-pt utterance extracted from the center (to minimize coarticulation effects) of a labeled phoneme from the TIMIT database. *Speaker is an Nx5 character matrix w/ each row i is the speaker label for column i in *Utter. *Speaker is provided to ensure that no speaker appears in both the test/train sets. about 9MB uncompressed. hw3Demo.m: Matlab .m file that demonstrates usage of hw3Data.mat. LPC coeffs are extracted in bulk, random test/train speakers are designated for each classifier trial, and the test/train LPC coeffs are used w/ a 1-Nearest Neighbor classifer. Run this program to make sure you have downloaded the database properly. Tweak the following variables to see their effects on accuracy: percentTest, numTrials, vocab (you can shrink the vocab as a sanity check that your program works properly-small vocab means high recognition accuracy). Feel free to modify this code when writing your own solution. hw3Readme.txt: Readme file that describes all files in hw3.zip. All these files are conveniently available in hw3.zip which can be found at:
http://www.cnel.ufl.edu/hybrid/courses/EEL6586/hw3.zip

B1

Choose a robust feature extraction technique that you think will provide best results. You may use any feature extraction techniques you want (energy, zero-crossing, LPC, mfcc, PLP, ...) or any combination of these. You are free to look at several different types of feature sets or to invent your own but do whatever you can to improve the recognition accuracy (without using test data during training). Explain your choice of feature set and why you think that it should perform well.

B2

Use a classification algorithm to classify the test data. Again you are free to use any classifier you like (Nearest Neighbor, Bayes, Neural Network, HMM, ...) Briefly explain why your choice of a classifier is a wise one (even if you decide to stay with the nearest neighbor classifier).

B3

Be sure to include several trials as in hw3Demo.m and report the average over all trials. What is your final accuracy rate? How many trials did you use? What is the standard deviation of your accuracy value?

B4

For you final optimized system, which two phonemes are most likely to be confused with one another?

B5

Comment on why it is important that no speaker appear in both the test/train datasets.

As usual, attach all of your code to the end of the assignment. A total of 5 Bonus points will be awarded to the person(s) with the highest percentage correct classification.