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

Help for FSL Archives


FSL Archives

FSL Archives


FSL@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

FSL Home

FSL Home

FSL  May 2010

FSL May 2010

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

Re: flirt schedule file problems

From:

"Crum, Bill" <[log in to unmask]>

Reply-To:

FSL - FMRIB's Software Library <[log in to unmask]>

Date:

Fri, 14 May 2010 10:51:27 +0100

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (194 lines)

Hi Mark,

Sorry this is a little lengthy again - I'm trying to be as clear as possible.

Everything you say makes sense and squares with what I thought but my experience differs a little. With your help, I think my problem boils down to how the cost function is evaluated. Couple of clarifications first.

Just to be clear. I know the init matrix is added to everything - I want to see whether FLIRT improves matters starting from the init. So when I talked about doing "nothing" or an identity transform I meant this in addition to the init.

My optimise command with 0 max iterations was just an attempt to measure the cost associated with the init matrix (by not allowing optimise to perform any iterations). I now do this directly by using setrow and measurecost and get the same results.

I concede some confusion on my part over cost versus similarity in FLIRT. I agree that sort functions as advertised and that from a cost-function perspective it does the right thing. I think my problem actually stems from *how* the cost function is computed.

If you have any further advice much appreciated.

Here's my FLIRT command:
-----------------------
flirt -v -dof 9 -bins 64 -cost normmi -schedule ../test.sch -init test_proc_TYPHOON_213213-to-1.mat -refweight proc_NIMROD_1616-mask-norm.nii.gz -ref proc_NIMROD_1616.nii.gz -in proc_TYPHOON_213213.nii.gz -omat test-reg-213213.mat -out test-reg-213213.nii.gz

Here's part of the FLIRT output - the result of optimise is in the first row of UF and the identity is in the second row:
----------------------------------
>> measurecost MAXDOF UF:1-2  0.0   0.0    0.0    0.0    0.0    0.0  0.0  0.0  0.0  rel
 >> print U
-0.008305 0.945402 0.305760 0.100657 0.000000 -0.306213 0.854226 0.281214 0.000000 0.000000 -0.312695 0.949854 0.000000 55.184867 18.229680 -22.503618 1.000000
-0.004685 1.000000 0.000000 0.000000 0.000000 0.000000 1.000000 0.000000 0.000000 0.000000 0.000000 1.000000 0.000000 0.000000 0.000000 0.000000 1.000000

Which from what you say means that the first row (result from optimise) has the lowest cost and is therefore output. The confusion is that if I compute NMI outside FLIRT using the same number of bins, same mask and same images I get the following:

UNreg
(cnscompare.py)  cnscompare:    ssd 665.736004758 ma 3.0332 mb 3.1016 je 6.0847 mi 0.0501 nmi 1.0082
With init only
(cnscompare.py)  cnscompare:    ssd 444.313641584 ma 3.0332 mb 3.2428 je 5.7635 mi 0.5126 nmi 1.0889
FLIRT
(cnscompare.py)  cnscompare:    ssd 683.167758922 ma 3.0332 mb 3.0764 je 6.0440 mi 0.0656 nmi 1.0109

The exact values of NMI aren't important - I guess there's some transformation to the cost-function. However the ranking is different between the different transformation cases inside and outside FLIRT - hence the confusion. Visually the init-only case is an excellent result and has the highest NMI outside FLIRT. But the FLIRT result is catastrophically wrong and has a much lower NMI computed outside FLIRT but also a lower cost function computed inside FLIRT. I also tried running with different numbers of bins and allowing optimise to run more iterations but get the same results. Any ideas?

Thanks for ploughing through this.

Best Wishes

-Bill

---
Dr Bill Crum, Senior Lecturer,
King's College London,
Centre for NeuroImaging Sciences (PO89)
Institute of Psychiatry, De Crespigny Park, London, SE5 8AF
tel: +44 (0)20 3228 3043, fax: +44 (0)20 3228 2116

> -----Original Message-----
> From: FSL - FMRIB's Software Library [mailto:[log in to unmask]] On
> Behalf Of Mark Jenkinson
> Sent: 14 May 2010 00:41
> To: [log in to unmask]
> Subject: Re: [FSL] flirt schedule file problems
> 
> Hi Bill,
> 
> The -init matrix is added to everything, so that this becomes
> the new point of reference.  Hence an "identity" matrix in
> the schedule file would actually be the same transformation
> as the -init matrix.  I hope that makes sense.  Effectively,
> any matrix inside the schedule file will have the init matrix
> post-multiplied with it at the beginning of the optimisation.
> 
> I'm a bit puzzled about your problem with sort.  All values
> used by FLIRT (and this is also true of the documentation
> for schedule files and the terminology in general) is *cost*
> function value - not similarity values.  So ascending order
> means that the lowest values ends up in row 1.  However,
> lowest cost is the best value, so this is what should be
> used by FLIRT later on.
> 
> As for your optimisation problem - is it related to the
> *cost* vs *similiarity* function issue?  It is certainly
> possible that starting with a different transformation
> can lead to a better solution (especially when bypassing
> the search/perturbation phases) but your identity
> matrix will be the same as just using the -init matrix,
> so I don't see how you currently have two different
> starting points anyway.  I'm also not sure what the code
> does when you specify 0 as the last value in the optimise
> call, as this is the maximum number of iterations, and
> zero doesn't make much sense.  So maybe this is a
> problem?
> 
> Anyway, I hope this is enough info to help you solve
> the problem.
> 
> All the best,
> 	Mark
> 
> 
> 
> On 13 May 2010, at 10:29, Crum, Bill wrote:
> 
> > Hi,
> >
> > I'm having some problems with a custom FLIRT schedule file and need
> > a sanity check.
> >
> > Essentially I want to run with a very good initialisation matrix and
> > just do a fine-scale (1mm) adjustment. My initialisation matrix
> > seems to load OK.
> >
> > Problem 1:
> > The optimise command can result in a worse result than doing
> > nothing. It doesn't seem to start from the identity transform even
> > with zero perturbation. Not sure if this is a consequence of using
> > an init matrix, a bug, a feature or a misunderstanding on my part?
> >
> > Fudge 1:
> > So I explicitly measure the cost for the identity transform and use
> > sort to see whether this gives a better result than optimise.
> >
> > Problem 2:
> > The sort command behaves as advertised by sorting in ascending order
> > of similarity. However the first row (least similar) of the matrix
> > gets passed back to flirt rather than the last row (most similar).
> > So in my case it discards the best result.
> >
> > Unfortunately I can't figure out a Fudge for 2. I need to either
> > change the sort order or selectively delete matrix rows. Of course
> > even better if optimise behaved better in the first place ...
> >
> > Below is my schedule file and flirt command. I've tried it a number
> > of different ways but always get the same result.
> > I tested this by commenting/uncommenting out the sort command below
> > and varying the order of the optimise commands.
> >
> > Are these real problems or have I just broken the schedule handler
> > by doing something non-standard further up?
> >
> > Any help greatfully received - this is driving me nuts!
> >
> > Many Thanks
> >
> > -Bill Crum
> >
> > test.sch
> > ---------------------------------------------------------------------
> > # 8mm scale
> > setscale 8
> > clear S
> > clear P
> >
> > # 4mm scale
> > setscale 4
> >
> > # 2mm scale
> > setscale 2
> >
> > # 1mm scale
> > setscale 1
> > setoption smoothing 1
> > setoption boundguess 1
> >
> > # Optimise from this position
> > clear UF
> > setrow UF  1 0 0 0  0 1 0 0  0 0 1 0  0 0 0 1
> >
> > clear U
> > # Dummy optimise with 0 iterations
> > # I also tried just adding an identity row to UF directly but get
> > the same result
> > optimise MAXDOF UF:1  0.0   0.0   0.0   0.0   0.0   0.0   0.0  0.0
> > 0.0  rel 0
> > # Optimise from this position
> > optimise MAXDOF UF:1  0.0   0.0   0.0   0.0   0.0   0.0   0.0  0.0
> > 0.0  rel 1
> >
> > clear UF
> > copy U UF
> > clear U
> > measurecost MAXDOF UF:1-2  0.0   0.0    0.0    0.0    0.0    0.0
> > 0.0  0.0  0.0  rel
> > print U
> > sort U
> > print  U
> > ---------------------------------------------------------------------
> >
> > flirt -cost normcorr -schedule ../test.sch -nosearch -v -dof 9 -
> > refweight proc_NIMROD_1616-mask-norm-d2.nii.gz -ref
> > proc_NIMROD_1616.nii.gz -in proc_TYPHOON_212212.nii.gz -init
> > test_proc_TYPHOON_213213-to-1.mat -omat test-reg-213213.mat -out
> > test-reg-213213.nii.gz
> >
> > ---
> > Dr Bill Crum, Senior Lecturer,
> > King's College London,
> > Centre for NeuroImaging Sciences (PO89)
> > Institute of Psychiatry, De Crespigny Park, London, SE5 8AF
> >

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


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