BoinJou

Back to Psych 221 Projects 2013

Introduction

You can use subsections if you like. Below is an example of a retinotopic map. Or, to be precise, below will be an example of a retinotopic map once the image is uploaded. To add an image, simply put text like this inside double brackets 'MyFile.jpg | My figure caption'. When you save this text and click on the link, the wiki will ask you for the figure.

Below is another example of a reinotopic map in a different subject.
Figure 2

Once you upload the images, they look like this. Note that you can control many features of the images, like whether to show a thumbnail, and the display resolution.

Figure 3

Motivation

MNI is an abbreviation for Montreal Neurological Institute.

Results

Localization: Clustering

Some text. Some analysis. Some figures.

Classification

Some text. Some analysis. Some figures.

Equations

If you want to use equations, you can use the same formats that are use on wikipedia.
See wikimedia help on formulas for help.
This example of equation use is copied and pasted from wikipedia's article on the DFT.

The sequence of N complex numbers x₀, ..., x_N−1 is transformed into the sequence of N complex numbers X₀, ..., X_N−1 by the DFT according to the formula:

$X_k=\sum _{n=0}^{N-1}{x}_n{e}^{-\frac{2\pi i}{N}kn}k=0,\dots ,N-1$

where i is the imaginary unit and $e^{\frac{2\pi i}{N}}$ is a primitive N'th root of unity. (This expression can also be written in terms of a DFT matrix; when scaled appropriately it becomes a unitary matrix and the X_k can thus be viewed as coefficients of x in an orthonormal basis.)

The transform is sometimes denoted by the symbol $ℱ$, as in $𝐗=ℱ\left\{𝐱\right\}$ or $ℱ\left(𝐱\right)$ or $ℱ𝐱$.

The inverse discrete Fourier transform (IDFT) is given by

$x_n=\frac{1}{N}\sum _{k=0}^{N-1}{X}_k{e}^{\frac{2\pi i}{N}kn}n=0,\dots ,N-1.$

References

References

Software

Appendix I - Code and Data

Code

File:CodeFile.zip

Data

zip file with my data