- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
MRI measurements are natively collected in k-space, yet most MRI reconstruction algorithms require some stage of rasterization and nonuniform Fourier transform to translate between image space and non-Cartesian k-space measurements. Given the rise of Gaussian splatting, and some recent works using Gaussian representations for MRI reconstruction, this paper proposes to represent an MRI volume as a mixture of Gaussians and leverage the efficient analytical Fourier transform of each Gaussian to completely avoid rasterization and discrete Fourier transforms. The key technical innovations are (1) reparameterizing the Gaussian primitives so that their covariance and height parameters are decoupled in Fourier domain rather than image domain, and showing that this reparameterization makes gradient-based MRI reconstruction better-conditioned, (2) more efficiently allocating parameters for multi-coil MRI, so that the number of optimizable parameters does not scale with the number of coils, and (3) constructing a complete MRI reconstruction pipeline, including TV regularization, using only analytical evaluation of the Fourier transform and no rasterization, and demonstrating improved performance both in simulation and with a physical phantom.
Critical strengths
The main ideas of the paper are solid and presented clearly. The proposed method is elegant and effective empirically. I appreciate the inclusion of new understanding (mainly around the effect of the Gaussian scale reparameterization) as well as strong validation including comparison with recent and strong baselines, matched parameter count and generous-to-baseline settings, realistic noise levels, and both digital and physical phantoms.
Critical weaknesses
I do not flag any major weaknesses. Minor weaknesses are listed below; addressing these should strengthen the paper:
- There are scattered minor grammatical mistakes like missing connective words, inconsistent pluralization, missing spaces around citations, and occasional punctuation errors. These generally do not impede comprehension but are worth polishing in the final version.
- In some places notation/jargon is not explicitly defined, though usually in context I am able to infer what was probably intended. Some examples:
- Starting from the abstract, the terms “integral” and “scale” are applied to Gaussian primitives without being clear what is meant, since if one were interpreting “Gaussian” as a probability distribution its integral would always be 1, and “scale” could refer to either spatial extent (covariance) or peak height/amplitude. Later on these terms can be inferred especially after seeing Figure 2, but for the first 3 pages they are used without clear definition.
- Equation 2 uses several notations that are not explicitly defined; I inferred that they are the discretized variants of the corresponding quantities in eq. 1 and that \mathcal{F}_K is the nonuniform Fourier transform operator but it would be better to state these definitions to avoid ambiguity.
- Line 240 writes out the terms of the loss function without definition, but these terms are not defined until later on the same page. A simple “(defined below)” would help to head off potential reader confusion.
- On Line 320 it’s not clear what “matched voxel averaging” means (matched between what and what?)
- On Line 321, the term “complex-LS” is used without definition; is this complex-valued least squares?
- Line 370 introduces the acronym “CSM” without definition.
- Some phrases are worded in a way that could invite misinterpretation, though I believe I know what the intended meaning is. Specific examples:
- Line 116 states “…a single primitive under the Gauss-Newton approximation, … for center-weighted trajectories”. While I am fairly confident that “the Gauss-Newton approximation” refers to the optimization algorithm used for MRI reconstruction, the sentence structure makes it sound like an approximation of the Gaussian primitives themselves. Likewise I believe “center-weighted trajectories” refers to k-space sampling trajectories, but it’s not stated clearly (as stated, this could be referring to optimization trajectories).
- Line 138 starts “We parameterize …” but is describing the amplitude parameterization approach which is a baseline and not the proposed integral parameterization. Starting with “we” makes it sound like this is the proposed approach.
- Section 2.2 serves to explain why IPG works better than APG, which is arguably the most intellectually exciting part of the contribution, but most of its content is references to appendix sections. It would be great to include more of that content in the main paper, to make the theoretical component of the contribution more evident and easier to interpret. For example, the notations in Table 1 (e.g. “energy-scale correlation” and “p”) are not defined in-context. In my view it would be a worthwhile trade to move Figure 5 to the appendix to make space for more detail in Section 2.2.
- I appreciate the inclusion of the ablation study in Section 3.3 and Table 3, but it is not explained clearly enough for me to really tell what was ablated.
Questions for authors
- The objective function terms in equations 7 and 8 contain several hyper parameters and design choices (like the definition of delta in equation 7 and the inclusion of epsilon_TV in equation 8), that are not really justified or explained. Why are these parameters necessary? How do you choose their values?
- The optimization is done in stages, with an initial voxel-based optimization followed by the proposed Gaussian primitive optimization. Why is the first stage needed? It would be simpler to use Gaussians from the start; does that not work for some reason?
- Do the authors have a sense of why B2B’s performance often gets worse when it is allowed more parameters? I realize this is a baseline not the proposed method, but was surprised to see it do worse with more parameters so want to ensure there is no mistake.
I am open to raising my score if these are addressed/answered well (especially the first two bullets).
4 comments
Point-by-Point Clarifications and Evidence Addressing The Questions
We sincerely thank the reviewer syzf again for the encouraging and thoughtful assessment. We particularly appreciate your recognition that the main ideas are solid, the method is mathematically elegant and empirically effective, and that the theoretical understanding of Gaussian reparameterization is a valuable contribution. This recognition means a great deal to us!
Since you kindly indicated openness to reconsidering your score, we provide a concise point-by-point guide to the revised manuscript to facilitate your reassessment.
1. Hyperparameter choices and data-consistency loss
Section 2.4, Eqs. (9)–(11) (p. 6); Appendix I.1, Table 5 (p. 25); Appendix F.5, Table 4 (p. 21).
We clarified the adaptive Huber threshold, defined by median residual magnitude, and explained the numerical safeguards used in the data-consistency and continuous TV terms.
More importantly, we added a controlled Huber/L1/L2 ablation across three noise levels, independently tuning regularization weights on the development subject. Huber achieves the highest PSNR in all three conditions (Holm-adjusted paired tests, p < 0.01), providing direct empirical justification for this design choice.
2. Why voxel initialization and staged optimization?
Section 2.5 (p. 6); Appendix C (pp. 13–14); Appendix I.4, Table 9 (pp. 27–28).
We added controlled ablations comparing voxel-derived initialization against initializing Gaussians directly with uniformly sampled centers, and staged optimization against joint optimization from the beginning.
Starting directly from uniformly initialized Gaussians is feasible but less effective, as the strong coupling between Gaussian coefficients and geometric parameters makes joint optimization particularly challenging.
Voxel-derived initialization provides a spatially informed starting point, while staged optimization progressively releases the coupled parameter groups, first optimizing coefficients, then centers, and finally scales and orientations. This reduces the complexity of the early optimization stages and facilitates a more stable transition to joint refinement.
3. Why can B2B perform worse with more parameters?
Section 3.1 (baseline definitions); Appendix F.4 (parameter budgets); Appendix G, Figures 8–9; Appendix I.5, Table 10 (pp. 28–29).
We clarified the distinction between parameter-matched and primitive-count-matched comparisons. B2B assigns coil-specific coefficients to each Gaussian, so increasing the primitive count from 2,400 to 8,000 increases its trainable parameters from 96k to 320k.
The additional results reveal a clear capacity–sampling interaction: the larger B2B model performs worse under severe undersampling (AF-64), but substantially better when more measurements are available (AF-4). This is consistent with the additional coil-dependent degrees of freedom being harder to constrain under limited sampling, rather than a general failure of increased representation capacity.
4. Theoretical presentation, notation, and ablation clarity
Sections 1.3 and 2.1–2.2, Figure 2 and Table 1 (pp. 2–5); Section 3.3, Table 3 (pp. 9–10).
We carefully addressed your detailed presentation suggestions. In particular, we moved the key conditioning analysis into Section 2.2, explicitly defined the Gaussian integral, scale, sampling-density parameter, and relevant notation, and clarified the assumptions underlying the theoretical results.
We also revised the component analysis to distinguish the effects of Gaussian parameterization, Fourier coil-sensitivity encoding, and continuous MC-TV regularization, and polished terminology and formatting throughout the manuscript.
We believe these revisions make the theoretical contribution more self-contained and accessible, particularly the conditioning advantage that you identified as one of the most intellectually interesting aspects of the paper.
We are especially grateful for your recognition of the mathematical elegance, technical soundness, and empirical effectiveness of our approach. We believe these qualities reflect the central scientific value of the work: a principled continuous formulation that improves optimization conditioning while enabling efficient, grid-free multi-coil Fourier reconstruction.
We also appreciate that you expressed openness to reconsidering your evaluation if the questions were addressed. We believe the additional theoretical explanations and controlled experiments now provide comprehensive answers to those questions, while preserving the core methodology. As the discussion deadline approaches, we would be sincerely grateful if you could revisit the revised manuscript and consider raising your assessment in light of the new evidence, as well as the broader methodological novelty, mathematical foundations, and practical significance of the proposed framework.
Thank you again for your thoughtful, encouraging, and constructive review.
Thanks for the thorough response. I am raising my score.
For what it's worth, I have also experienced cases where voxels are more stable to early optimization compared to Gaussians, though I haven't tried it in k space before.
I also notice that other reviewers requested more real-data or real-patient acquisition. Personally, I am fully satisfied by the inclusion of both digital phantoms and a physical phantom to demonstrate the value of the proposed parameterization and optimization strategy.
Sincere Thanks for Your Encouraging Feedback and Support
We sincerely thank you for revisiting our responses and raising your score. Your recognition and support truly mean a great deal to us.
Indeed, we believe that carefully designed initialization and staged optimization are key practical components that translate our theoretical formulation into an effective and computationally efficient reconstruction framework.
We are also sincerely grateful for your recognition of the value of combining digital and physical phantom validation. This means a great deal to us, particularly because we are already preparing further in-vivo acquisitions, which involve substantial practical and experimental challenges. We believe that the current combination of controlled simulations and real scanner measurements already provides strong experimental support for the core methodological contributions of this work.
More broadly, we are genuinely proud of this work, particularly the combination of mathematical elegance, theoretical understanding, computational efficiency, and empirical effectiveness. Our goal has been not only to introduce a continuous representation, but to develop a principled and practical reconstruction framework that makes analytical Fourier-domain optimization genuinely useful.
Your thoughtful recognition of these contributions is deeply encouraging and motivates us to continue developing this research direction.
Thank you once again for your time, careful consideration, constructive engagement, and generous support. We truly appreciate it.
Clarifications and Experimental Evidence on Optimization and Hyperparameters
We would like to thank the reviewer again for the thoughtful and encouraging assessment, particularly for recognizing the theoretical contribution of our integral parameterization. Developing a mathematically principled continuous representation that can be fitted efficiently to Fourier-domain measurements has been a central motivation of this work.
To facilitate your assessment of the revised manuscript, we summarize the key clarifications and new experimental evidence below, particularly regarding the two questions you highlighted as most important.
1. Why these hyperparameters, and how are they chosen?
Answer: The Huber threshold δ adapts to the median absolute k-space residual during optimization. With αH=1, approximately half of the residual magnitudes fall in the quadratic regime and half in the linear regime. This avoids the behavior of a fixed threshold, which could gradually shift the loss from predominantly L1-like to L2-like as residuals decrease.
The TV parameter ϵTV=10−3 is a small numerical smoothing constant that makes the TV penalty differentiable near zero. We also use ϵH=10−12 to avoid division by zero. These settings were fixed on the development subject.
To further validate the choice of adaptive Huber, we added a controlled comparison against L1 and L2 (Appendix I.1, Table 5), with independently tuned MC-TV weights for each loss and SNR:
AF-16; mean PSNR (dB) over 19 subjects; Huber vs. L1/L2: Holm-adjusted p<0.01.
These results support the adaptive Huber formulation across different noise levels. Interestingly, L1 is more competitive at higher SNR, whereas L2 becomes more competitive as noise increases, illustrating the trade-off between emphasizing smaller residuals and limiting noise sensitivity. Adaptive Huber provides a favorable balance across these regimes.
2. Why voxel initialization and staged optimization instead of fitting Gaussians directly?
Answer: Direct Gaussian fitting is feasible, but considerably less accurate under the same optimization budget. The difficulty lies in jointly optimizing the coupled coefficients, positions, scales, and orientations of Gaussian primitives against undersampled k-space measurements.
Our voxel-derived initialization provides spatially informed Gaussian geometry, while staged optimization progressively introduces the nonlinear geometric parameters, starting from the linear coefficient subproblem.
We added a dedicated ablation (Appendix I.4, Table 9):
AF-16; mean PSNR (dB) over 19 subjects; matched 3,000-epoch budgets.
Removing voxel initialization reduces PSNR by 2.0–2.8 dB, while replacing staged optimization with joint optimization reduces it by 0.2–0.4 dB. Removing both leads to a 3.0–4.0 dB decrease (all Holm-adjusted p<0.01).
These results explain why we retain the additional optimization stages: they make the challenging non-convex Fourier-domain fit more tractable, rather than introducing complexity without measurable benefit.
3. Why does B2B sometimes deteriorate with more parameters?
Answer: The additional coil-dependent degrees of freedom appear increasingly difficult to constrain under severe undersampling, rather than larger Gaussian representations being inherently worse.
Our extended comparison (Appendix G) reveals a clear dependence on acceleration:
Mean PSNR (dB) at 100-dB SNR over 19 subjects.
The larger model performs worse at AF-64 but better at AF-16 and AF-4, consistent with an interaction between representation capacity and the available measurement information. We have clarified this observation in the revised manuscript.
We have also substantially revised Sections 2.1–2.2 to bring the key conditioning analysis into the main text, clarified the notation and ablations, and corrected the presentation issues you identified.
We hope this concise summary facilitates your assessment of the revised manuscript. We would be grateful if you could reconsider your evaluation in light of the additional evidence, and we remain happy to clarify any remaining questions. Thank you again for your time and constructive feedback.