Search

Efficient and accurate whole-brain lesion segmentation remains a challenge in medical image analysis. In this work, we revisit MeshNet, a parameter-efficient segmentation model, and introduce a novel multi-scale dilation pattern with an encoder-decoder structure. This innovation enables capturing broad contextual information and fine-grained details without traditional downsampling, upsampling, or skip-connections. Unlike previous approaches processing subvolumes or slices, we operate directly on whole-brain $256^3$ MRI volumes. Evaluations on the Aphasia Recovery Cohort (ARC) dataset demonstrate that MeshNet achieves superior or comparable DICE scores to state-of-the-art architectures such as MedNeXt and U-MAMBA at 1/1000th of parameters. Our results validate MeshNet's strong balance of efficiency and performance, making it particularly suitable for resource-limited environments such as web-based applications and opening new possibilities for the widespread deployment of advanced medical image analysis tools., Comment: International Symposium on Biomedical Imaging, April 14-17, 2025

Solving large-scale Bayesian inverse problems presents significant challenges, particularly when the exact (discretized) forward operator is unavailable. These challenges often arise in image processing tasks due to unknown defects in the forward process that may result in varying degrees of inexactness in the forward model. Moreover, for many large-scale problems, computing the square root or inverse of the prior covariance matrix is infeasible such as when the covariance kernel is defined on irregular grids or is accessible only through matrix-vector products. This paper introduces an efficient approach by developing an inexact generalized Golub-Kahan decomposition that can incorporate varying degrees of inexactness in the forward model to solve large-scale generalized Tikhonov regularized problems. Further, a hybrid iterative projection scheme is developed to automatically select Tikhonov regularization parameters. Numerical experiments on simulated tomography reconstructions demonstrate the stability and effectiveness of this novel hybrid approach.

In this research, we examine the capabilities of different mathematical models to accurately predict various levels of the English football pyramid. Existing work has largely focused on top-level play in European leagues; however, our work analyzes teams throughout the entire English Football League system. We modeled team performance using weighted Colley and Massey ranking methods which incorporate player valuations from the widely-used website Transfermarkt to predict game outcomes. Our initial analysis found that lower leagues are more difficult to forecast in general. Yet, after removing dominant outlier teams from the analysis, we found that top leagues were just as difficult to predict as lower leagues. We also extended our findings using data from multiple German and Scottish leagues. Finally, we discuss reasons to doubt attributing Transfermarkt's predictive value to wisdom of the crowd.

An individual's opinions about media bias derive from their own independent assessment of media outputs combined with peer pressure from networked political allies and opponents. Here we generalize previous idealized, probabilistic models of the perception formation process, based on a network of Bayesian learners inferring the bias of a coin, by introducing obdurate agents (partisans), whose opinions stay fixed. It is found that even one partisan destabilizes an allies-only network, stopping it from achieving asymptotic learning and forcing persuadable agents to vacillate indefinitely (turbulent nonconvergence) between the true coin bias $\theta_0$ and the partisan's belief $\theta_{\rm p}$. The dwell time $t_{\rm d}$ at the partisan's belief increases, as the partisan fraction $f$ increases, and decreases, when multiple partisans disagree amongst themselves. In opponents-only networks, asymptotic learning occurs, whether or not partisans are present. However, the counterintuitive tendency to reach wrong conclusions first, identified in previous work with zero partisans, does not persist in general for $\theta_0 \neq \theta_{\rm p}$ in complete networks; it is a property of sparsely connected systems (e.g.\ Barab\'{a}si-Albert networks with attachment parameter $\lesssim 10$). In mixed networks containing allies and opponents, partisans drive counterintuitive outcomes, which depend sensitively, on where they reside. A strongly balanced triad exhibits intermittency with a partisan (sudden transitions between long intervals of static beliefs and turbulent nonconvergence) and asymptotic learning without a partisan., Comment: 36 pages, 17 figures