Introduction The superior clinical utility of 7T magnetic resonance imaging (MRI) is constrained by high acquisition costs and limited scanner availability. While deep learning-based 3T-to-7T synthesis offers a potential solution, prevailing models typically rely on heavy parameterization, which increases computational redundancy and risk of overfitting on restricted medical datasets. In this paper, we focus on model efficiency and propose LiteMamba-Synth, an architecturally streamlined state space framework designed for high-fidelity MRI translation with minimal resource requirements. Methods Our core contribution is the integration of the ConvMamba block, which utilizes the linear-time complexity of State Space Models (SSMs) to capture expansive spatial dependencies without the prohibitive computational overhead of traditional attention mechanisms. To preserve essential anatomical details during the compression of the feature space, we introduce the Wavelet-Enhanced Skip connection (WES), a module that facilitates multi-scale frequency-domain feature fusion to safeguard high-frequency textures and edge information. Additionally, a lightweight Convolutional Block Attention Module (CBAM) is incorporated to adaptively recalibrate feature responses toward salient neuroanatomical regions. Results Experimental results on the UNC T1w dataset demonstrate that LiteMamba-Synth achieves a competitive PSNR of 20.82 dB and an SSIM of 0.711. Crucially, our model maintains a compact footprint of merely 2.15 million parameters, representing a substantial reduction in complexity compared to contemporary deep learning baselines. Discussion By delivering high-quality synthesis results with minimal parameter overhead, LiteMamba-Synth provides a practical and scalable solution for deploying advanced MRI synthesis in resource-constrained clinical environments.
Zhengrui Zhang, Jie Dong, Haoting Yang et al.· Frontiers in Neuroanatomy· 0 citations
The Traveling Salesman Problem (TSP) is a classic NP-hard combinatorial optimization problem where traditional intelligent algorithms often suffer from slow convergence and premature convergence to local optima. This paper proposes a novel hybrid optimization framework (HGA-PSO-ACO) that integrates the global exploration capability of the Genetic Algorithm (GA), the rapid convergence characteristics of Particle Swarm Optimization (PSO), and the positive feedback mechanism of Ant Colony Optimization (ACO) through a three-stage adaptive coordination model. The key design challenge is to determine when each component should dominate the search and how information should be transferred across stages without causing premature homogenization of the population. To address this issue, the algorithm employs fitness variance (FVD) for real-time population state monitoring and implements dynamic algorithm switching strategies. Experimental validation on a 40-city TSP benchmark demonstrates that the hybrid algorithm achieves a 40% faster convergence speed, a 2.1% lower relative error, and a 58.3% reduction in run-to-run standard deviation compared to individual algorithms, indicating improved solution stability together with favorable parameter sensitivity control.
Xuhang Chen, Zhengrui Zhang, Ze-Hong Chen et al.· 2026 3rd World Conference on...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.