JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for SPM Archives


SPM Archives

SPM Archives


SPM@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

SPM Home

SPM Home

SPM  November 2011

SPM November 2011

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

Re: Why the Gaussian FWHM in DARTEL is different from the "Smooth" module?

From:

John Ashburner <[log in to unmask]>

Reply-To:

John Ashburner <[log in to unmask]>

Date:

Tue, 1 Nov 2011 13:47:40 +0000

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (133 lines)

When you smooth, you essentially compute local weighted averages of
the voxel intensities.  For simplicity, lets assume that we are just
computing local averages by summing up the values in a region of
voxels and dividing by the number of voxels.

The smoothing that is part of the normalisation to MNI space computes
these average intensities from the original data, rather than the
warped versions.  When the data are warped, some voxels will grow and
others will shrink.  This will change the regional averages, with more
weighting towards those voxels that have grows.

To compute a regional average from the original data, the algorithm
sums up the values within the region and divides by the number of
voxels, but does it in a way that properly considers the relative
volumes of warped and unwarped voxels.  This gives a different answer
to simply smoothing the warped data.

For those who are interested, I've re-pasted something a bit more
mathematical below.

Best regards,
-John


To get a bit more mathsy, here's a bit of MATLAB code to illustrate
what's going on in 1D.  3D is a lot more complicated.

% Generate a random deformation (y) and its inverse (iy)
N=256;
h=[1 1 1; 1 1 1];
L = toeplitz([2.001 -1 zeros(1,N-3) -1]*4); L(1,1)=1e6; L(N,N)=1e6;
u = L\randn(N,1);
o=ones(N,1);
y=(1:N)'+u/2^8; for k=1:8, y = spm_bsplins(y,y,o,o,h); end;    %
Scaling and squaring
iy = (1:N)'-u/2^8; for k=1:8, iy = spm_bsplins(iy,iy,o,o,h); end %
Scaling and squaring

% Generate a smoothing kernel.  Note that each value in a smoothed image is
% a dot-product between the image and a smoothing kernel.  The same rules apply
% when summing the values in a region of interest.
s= spm_smoothkern(40,(1:N)'-N/2,1);

% Generate a random image
f = toeplitz(spm_smoothkern(5,[0:floor((N-1)/2) floor(-(N-1)/2):-1]
,1))*rand(N,1);

% The deformation can be represented as a matrix multiplication (by G).  Here we
% compute G (and its approximate inverse iG).
G=zeros(N);
iG=zeros(N);
tmp = [1 zeros(1,N-1)];
for i=1:N,
   G(i,:) = spm_bsplins(tmp,o',(y(i)+(N:-1:1)),o',h);
   iG(i,:) = spm_bsplins(tmp,o',(iy(i)+(N:-1:1)),o',h);
end
imagesc(G); hold on; plot(y,(1:N)','r',(1:N)',iy,'g'); hold off; axis xy

% Just to check, plot s(y), as well as G*s
sy=spm_bsplins(s,y,o,o,h);
plot([G*s sy]);

% Note that various approximations mean that iG can not be the exact
inverse of G (crude interpolation, discrete approximation of a
continuous thing etc)
imagesc([G iG; iG*G G*iG])


% What we want in our preprocessed images is a dot-product of the
smoothing kernel
% (or some other definition of a region) with the original data.  So,
we can warp the
% smoothing kernel (or ROI) back to the native image and compute the
dot-product in
% native space:

dot(G*s,f)


% or we can use the adjoint (transpose) of G to push the values in f into
% normalised space and then do our dot-product

dot(G'*f,s)

% These are all equivalent to:

f'*G*s

% Or we can use the inverse of the transform (ie iy) to warp our image into
% normalised space with a change of variables and then do the dot-product

dot((gradient(iy).*spm_bsplins(f,iy,o,o,h)),s)

dot(diag(gradient(iy))*iG*f,s)

% Note that iG'*G' should be roughly identity, so f*G*s is roughly the same as
% f'*iG'*G'*G*s.  This gives the following dot-product:

dot((G'*G)*(iG*f),s)

% G'*G is roughly diagonal, and very approximately the same as
diag(gradient(iy))

imagesc([diag(gradient(iy)) G'*G])

On 31 October 2011 23:03, YAN Chao-Gan <[log in to unmask]> wrote:
> Dear John and DARTEL experts,
>
> Thanks a lot for the excellent tool of DARTEL!
>
> Recently, I am using DARTEL to normalize my functional data into MNI space.
> I found the following two ways would give different results.
>
> 1. DARTEL (Normalize to MNI space): Gaussian FWHM - 8 8 8. I will get the
> swra* images.
>
> 2. DARTEL (Normalize to MNI space): Gaussian FWHM - 0 0 0. I will get the
> wra* images. Then I perform smoothing by the Smooth module in SPM (kernel: 8
> 8 8), and I will get the swra* images.
>
> However, The swra* images of these two approaches are different. From the
> manual: "Note that you can also specify [0 0 0], but any “modulated’ data
> will show aliasing (see eg Wikipedia), which occurs because of the way the
> warped images are generated. "
>
> My images is unmodulated in this case, right? I wonder why this difference
> occurs. Thanks a lot!
>
> Best,
>
> Chao-Gan
>

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager