misc. questions

ask about

1. FFT on a epoch (frame) using all 64 electrodes
2. Can the current abstract / experiment count as my thesis?
3. how should I go about looking for conferences?
1. ask dr. Keith / any other electrophyisology prof in psych dept.
   
2. ask dr. Tag and Narayan about ANN conferences
   
3. Google!
4. consult magic 8 ball?
   

Wavelet questions

1. Is my data considered 1 dimensional? All that is represented is amplitude but it is amplitude over time?
2. Should I take the fft then try to do PCA? PCA on the raw data is really noisy...
3. A wavelet transform will give me amplitude, frequency, and time but won't I still need a classifier to classify the signal?
   

Exploring: wavelet xforms and other analysis tools

• wavelet xforms
• Wavelet tutorial
  
• http://users.rowan.edu/~polikar/wavelets/wttutorial.html
• MATLAB Cohen-Daubechies-Feauveau 9/7 (CDF 9/7) wavelet transform
• http://www.mathworks.com/matlabcentral/fileexchange/loadFile.do?objectId=6449
• Paper's ordered
• http://lib.bioinfo.pl/pmid:12705422
• http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V18-4MW31YG-1&_user=10&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=b68a247d8cc31b9f06d58f774883bd03
• Wavelets plot frequency,time, and amplitude at the same time.
  
• great for non-stationary signals or signals that change over time
• good for signal pre-processing
  

• Time series outlier detection method
• exponential smoothing

Fast Fourier Transforms VS. Autoregressive Moving Model Average

Recap:

Last week we talked about how Fast Fourier Transforms are used to quickly compute the Discrete Fourier Transform of a time series thereby transforming the time series into its Frequency Domain. This week we will talk about the Autoregressive Moving Model Average and how it compares to Fast Fourier Transforms.

Why FFT or ARMA in the first place?

“Perfect feature extraction would make the job of the classifier trivial, and an omnipotent classifier would not need the help of feature extraction,”

What is the Autoregressive Moving Model Average:

Given a time series of data Xt, the autoregressive moving average model (ARMA), is used as a tool for understanding and possibly predicting future values in the time series (Wikipedia 2006). The ARMA is typically applied to time series data (Wikipedia 2006).

Autoregressive model:

ϕ
1,...ϕp are the parameters and ε is the error term

Moving average model:

w
here the θ1, ..., θq are the parameters of the model and the εt, εt-1,... are the error terms

Autoregressive moving average model:

Taking the AR model and the MA model, we get the ARMA model. The notation ARMA(p, q) refers to a model with p autoregressive terms and q moving average terms (Wikipedia 2006). This model subsumes the AR and MA models,

Autoregressive vs. Fast Fourier

• The ARMA estimate may have very sharp spectral features so one cm evaluate it on a very fine mesh near to those features, and more coarsely farther away from them

• With ARMA Good spectral estimates can be obtained from short EEG segments, where as FFT assumes the function continues to infinity on both sides.

• ARMA is preferred for prediction

• In some ARMA models Coefficients can be analyzed independent of the function.

Power approximations of a 12 Hz sine wave added to a 20 Hz sine wave sampled at 200 Hz for 0.3 seconds. Top part of the figure shows the FFT approximation, and the bottom part shows the AR model of 8th order.

Disadvantages of ARMA:

• Problem of selecting the proper model order:

  • With noisy inputs and the order being too high the result is spurious peaks

  • Too low an order yields a smooth spectra

• ARMA can be an order of magnitude slower than FFT.

  • N = the size of the signal

  • M = model order or magnitude

  • if the magnitude of M is greater then logN then ARMA is slower then FFT (NlogN)

[1] M. J. Polak, "Adaptive Logic Networks in a Brain-Computer Interface System," in Computing Science. vol. Doctor of Philosophy Edmonton, Alberta: University of Alberta, 2000, p. 122.

[2] B. Hodgson ”What is an autoregressive moving average model(ARMA)?” http://cnx.org/content/m13395/latest/

Fast Fourier Transforms

in less than 15 min!

What is 'Fast Fourier Transforms?

Fast Fourier Transform algorithms are used to compute the Discrete Fourier Transform and its inverse.

Ok, so what is 'Discrete Fourier Transform?

Discrete Fourier Transforms are used to transform one function into another that is called the Frequency domain. This makes sense because in Digital Signal processing we don't care nearly as much about the numbers as we do the FREQUENCY they are observed! Plus, the frequency is usually a less complicated number then the original input.

Still with me? Lets talk more about the Frequency Domain!

We can think of the Fourier Transform as converting the signal information to a magnitude and phase component of each frequency. Now instead of the signal input potentially being all over the place (think eye blinks or other artifacts in EEG data) the current signal in influenced by all of the previous signals and therefore cannot leave the bound of the Frequency Domain!

(Drawing time!)

Oh no, close your eyes, now its time for the math...

So this is a basic Discrete Fourier Transform. The most notable aspect is e^ -(2πi/n), this is like a log curve so every point in the signal with be plotted along this curve.

(More Drawing time!)

That wasn't so bad lets close with a list of advantages and disadvantages:

Advantages:

• Fast! Or at least faster than trying to process the un-transformed signal

Disadvantages:

• Loss of precision due to floating point numbers

• Signal segments are discrete and calculated independently. In this aspect this signal isn't very efficient

The next chapter in this exciting series:

Fast Fourier vs Autoregressive analysis