Hi -
I would have to go back and check the paper to be sure about what matrix
Danny is referring to, but the .mat file is the transformation matrix
between the original and transformed space, and yes it is an affine
transformation matrix.
Cheers
Tim
-------------------------------------------------------------------------------
Tim Behrens
Centre for Functional MRI of the Brain
The John Radcliffe Hospital
Headley Way Oxford OX3 9DU
Oxford University
Work 01865 222782
Mobile 07980 884537
-------------------------------------------------------------------------------
On Fri, 1 Oct 2004, Stamatis Sotiropoulos wrote:
> Hi Tim,
> thanks very much for your answer, they reaaly helped me. One more question:
>
> >There are two other solutions:
> >
> >1) use nearest neighbour interpolation, and rotate the eigenspace of the
> >tensor after the registration. This is described in a paper by
> >Danny Alexander about 4 years ago.
>
> I found the reference you mentioned (IEEE Trans on Med Imaging, 20,
> 2001, 1131-1139). In this paper, an alogorithm is described (PPD) in the
> appendix. A transformation matrix F is needed between the original and
> the transformed image. This matrix is the .mat file that FLIRT produces
> after each registration? The transformation that FLIRT uses is an affine
> one?
>
> Thank you in advance,
> Stamatis
>
|