help > NBS and TFCE
Showing 1-6 of 6 posts
Jan 20, 2016 10:01 PM | Christian Clemm
NBS and TFCE
Dear NBS experts,
in the original NBS paper, it is mentioned that NBS could be combined with the Threshold-free Cluster Enhancement method by Smith and Nichols (NeuroImage, 2009), in order to circumvent the problem of arbitrary T-threshold definition.
Has this combination been implemented anywhere yet?
I would be very grateful for some advice.
Cheers,
Christian
in the original NBS paper, it is mentioned that NBS could be combined with the Threshold-free Cluster Enhancement method by Smith and Nichols (NeuroImage, 2009), in order to circumvent the problem of arbitrary T-threshold definition.
Has this combination been implemented anywhere yet?
I would be very grateful for some advice.
Cheers,
Christian
Jan 21, 2016 04:01 AM | Andrew Zalesky
RE: NBS and TFCE
Hi Christian,
A threshold-free version of NBS is under development.
It is not available as part of the current version of the software.
Experimenting with different thresholds is fine.
Andrew
Originally posted by Christian Clemm:
A threshold-free version of NBS is under development.
It is not available as part of the current version of the software.
Experimenting with different thresholds is fine.
Andrew
Originally posted by Christian Clemm:
Dear NBS experts,
in the original NBS paper, it is mentioned that NBS could be combined with the Threshold-free Cluster Enhancement method by Smith and Nichols (NeuroImage, 2009), in order to circumvent the problem of arbitrary T-threshold definition.
Has this combination been implemented anywhere yet?
I would be very grateful for some advice.
Cheers,
Christian
in the original NBS paper, it is mentioned that NBS could be combined with the Threshold-free Cluster Enhancement method by Smith and Nichols (NeuroImage, 2009), in order to circumvent the problem of arbitrary T-threshold definition.
Has this combination been implemented anywhere yet?
I would be very grateful for some advice.
Cheers,
Christian
Jan 21, 2016 05:01 PM | Christian Clemm
RE: NBS and TFCE
Dear Andrew,
many thanks for you quick reply!
Christian
many thanks for you quick reply!
Christian
Oct 25, 2018 07:10 PM | Nate Hall - Penn State Universary
RE: NBS and TFCE
Hi Andrew and Christian,
Just reading this thread after I noticed Baggio et al (2018; HBM) recently published an interesting formalization of the TFCE/NBS mashup you describe. I figured given the recent publication that I'd ask if there is code available for this extension?
Thanks for your time,
Nate
Just reading this thread after I noticed Baggio et al (2018; HBM) recently published an interesting formalization of the TFCE/NBS mashup you describe. I figured given the recent publication that I'd ask if there is code available for this extension?
Thanks for your time,
Nate
Oct 26, 2018 05:10 AM | Andrew Zalesky
RE: NBS and TFCE
Hi Nate,
In addition to other recently published extensions, the TFCE extension described in Baggio et al will be implemented in future versions of the NBS software. I am not sure if Christian made code available for NBS-TFCE.
Andrew
Originally posted by Nate Hall:
In addition to other recently published extensions, the TFCE extension described in Baggio et al will be implemented in future versions of the NBS software. I am not sure if Christian made code available for NBS-TFCE.
Andrew
Originally posted by Nate Hall:
Hi Andrew and Christian,
Just reading this thread after I noticed Baggio et al (2018; HBM) recently published an interesting formalization of the TFCE/NBS mashup you describe. I figured given the recent publication that I'd ask if there is code available for this extension?
Thanks for your time,
Nate
Just reading this thread after I noticed Baggio et al (2018; HBM) recently published an interesting formalization of the TFCE/NBS mashup you describe. I figured given the recent publication that I'd ask if there is code available for this extension?
Thanks for your time,
Nate
Oct 27, 2018 07:10 PM | Nate Hall - Penn State Universary
RE: NBS and TFCE
Hi Andrew,
Thanks for the quick reply!
Best,
Nate
Thanks for the quick reply!
Best,
Nate