Abstract
Sparse estimation techniques are widely utilized in diffusion magnetic resonance imaging (DMRI). In this paper, we present an algorithm for solving the ℓ0 sparse-group estimation problem and apply it to the tissue signal separation problem in DMRI. Our algorithm solves the ℓ0 problem directly, unlike existing approaches that often seek to solve its relaxed approximations. We include the mathematical proofs showing that the algorithm will converge to a solution satisfying the firstorder optimality condition within a finite number of iterations. We apply this algorithm to DMRI data to tease apart signal contributions from white matter, gray matter, and cerebrospinal fluid with the aim of improving the estimation of the fiber orientation distribution function (FODF). Unlike spherical deconvolution approaches that assume an invariant fiber response function (RF), our approach utilizes an RF group to span the signal subspace of each tissue type, allowing greater flexibility in accounting for possible variations of the RF throughout space and within each voxel. Our ℓ0 algorithm allows for the natural groupings of the RFs to be considered during signal decomposition. Experimental results confirm that our method yields estimates of FODFs and volume fractions of tissue compartments with improved robustness and accuracy. Our ℓ0 algorithm is general and can be applied to sparse estimation problems beyond the scope of this paper.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.