Paper List

期刊: NeuroImage
发布日期: 2026-03-11
NeuroimagingComputational Statistics

Hybrid eTFCE–GRF: Exact Cluster-Size Retrieval with Analytical pp-Values for Voxel-Based Morphometry

University of Cambridge | National University of Singapore | University of Dundee

Don Yin, Hao Chen, Takeshi Miki, Boxing Liu, Enyu Yang
Figure
Figure
Figure
Figure
Figure

30秒速读

IN SHORT: This paper addresses the computational bottleneck in voxel-based neuroimaging analysis by providing a method that delivers exact cluster-size retrieval and analytical inference simultaneously, eliminating the need for slow permutation testing while removing discretization errors.

核心创新

  • Methodology Proposes a hybrid algorithm that combines eTFCE's union-find data structure for exact cluster-size retrieval with pTFCE's analytical Gaussian Random Field (GRF) inference, achieving both properties for the first time.
  • Methodology Introduces a six-experiment Monte Carlo validation protocol demonstrating nominal family-wise error rate (FWER) control (0/200 rejections, 95% CI [0.0%, 1.9%]), no power loss (Dice ≥0.999), and high cross-variant concordance (r > 0.99).
  • Software Develops and releases pytfce, an open-source, pure-Python package that achieves 4.6x to 75x speedup over the reference R implementation and is more than three orders of magnitude faster than permutation-based TFCE.

主要结论

  • The hybrid eTFCE-GRF method successfully controls the family-wise error rate at the nominal level, with 0 false positives out of 200 tests (95% CI [0.0%, 1.9%]).
  • Statistical power is preserved with Dice coefficients ≥0.999 compared to baseline pTFCE at sufficient signal strength, and cross-variant concordance exceeds r=0.99.
  • Runtime improvements are substantial: the baseline implementation is 75x faster than R pTFCE (~5 seconds vs. ~375 seconds), while the hybrid variant is 4.6x faster (~85 seconds) with the added benefit of exact cluster-size retrieval.
研究空白： Existing neuroimaging statistical methods face a trade-off: pTFCE is fast but approximate due to discretization errors from fixed threshold grids, while eTFCE is exact but slow due to its reliance on permutation testing. No single method offered both exact cluster-size retrieval and fast analytical inference.

摘要: Threshold-free cluster enhancement (TFCE) improves sensitivity in voxel-wise neuroimaging inference by integrating cluster extent across all thresholds, but its reliance on permutation testing makes it prohibitively slow for large datasets. Probabilistic TFCE (pTFCE) replaces permutations with analytical Gaussian random field (GRF) pp-values, which reduces runtime by more than an order of magnitude, yet relies on a fixed threshold grid that introduces discretisation error. Exact TFCE (eTFCE) eliminates this discretisation by computing the integral exactly via a union-find data structure, but still requires permutations for inference. We propose a hybrid method that combines eTFCE’s union-find data structure for exact cluster-size retrieval with pTFCE’s analytical GRF inference. The union-find builds the full cluster hierarchy in a single pass over sorted voxels and enables exact cluster-size queries at any threshold in near-constant time; GRF theory then converts these sizes into analytical pp-values without permutations. We validate the method through a six-experiment Monte Carlo study on synthetic phantoms (64364^{3}, 80 subjects): null family-wise error rate is controlled at the nominal level (0/200 rejections, 95% CI [0.0%,1.9%][0.0\%,1.9\%]); power curves match baseline pTFCE (Dice ≥0.999\geq 0.999 at sufficient signal); smoothness estimation error is below 1%; and cross-variant concordance exceeds r=0.99r=0.99. On real brain data from UK Biobank (N=500N=500, within-vendor) and IXI (N=563N=563, cross-vendor), the method detects biologically plausible scanner, age, and sex effects; on IXI, significance maps form strict subsets of the reference R pTFCE output, which supports conservative family-wise error control. Both methods are implemented in pytfce, a pure-Python package with no R or FSL dependencies, available on PyPI. The baseline reimplementation completes whole-brain voxel-based morphometry in ∼5{\sim}5 s (75×75\times faster than R pTFCE), while the hybrid variant completes in ∼85{\sim}85 s (4.6×4.6\times faster) with the advantage of exact cluster-size retrieval; both are more than three orders of magnitude faster than permutation-based TFCE.