An Efficient Algorithm for Spatial-Spectral Partial Volume Compartment Mapping With Applications to Multicomponent Diffusion and Relaxation MRI

We introduce a new algorithm to solve a regularized spatial-spectral image estimation problem. Our approach is based on the linearized alternating directions method of multipliers (LADMM), which is a variation of the popular ADMM algorithm. Although LADMM has existed for some time, it has not been very widely used in the computational imaging literature. This is in part because there are many possible ways of mapping LADMM to a specific optimization problem, and it is nontrivial to find a computationally efficient implementation out of the many competing alternatives. We believe that our proposed implementation represents the first application of LADMM to the type of optimization problem considered in this work (involving a linear-mixture forward model, spatial regularization, and nonnegativity constraints). We evaluate our algorithm in a variety of multiparametric MRI partial volume mapping scenarios (diffusion-relaxation, relaxation-relaxation, relaxometry, and fingerprinting), where we consistently observe substantial <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mrow><mml:mo>(</mml:mo> <mml:mo>∼</mml:mo> <mml:mstyle><mml:mn>3</mml:mn></mml:mstyle> <mml:mo>×</mml:mo> <mml:mtext>-</mml:mtext> <mml:mstyle><mml:mn>50</mml:mn></mml:mstyle> <mml:mo>×</mml:mo> <mml:mo>)</mml:mo></mml:mrow> </mml:math> speed improvements. We expect this to reduce barriers to using spatially-regularized partial volume compartment mapping methods. Further, the considerable improvements we observed also suggest the potential value of considering LADMM for a broader set of computational imaging problems.