Multi-Contrast Magnetic Particle Imaging

Magnetic particle imaging is a tracer-based tomographic imaging technique that uses static and oscillating magnetic fields to generate an image contrast from the spatial distribution of magnetic nanoparticles. Recent investigations have shown that multi-contrast MPI is able to generate additional contrasts from different tracer materials or their environments. In this project we investigate tracer properties and properties of the particle environment that influence the tracer relaxation behavior using multi-contrast MPI, such as

To speed up the multi-contrast MPI image reconstruction, we have introduced an accelerated Kaczmarz algorithm. we have also introduced some potential medical and physical applications of multi-contrast MPI, such as 3D tracking of endovascular devices and balloon catheter imaging

Using the Accelerated Kaczmarz for multi-contrast MPI reconstruction speeds up the convergence.

Publications

[191156]
Title: Sparse Kaczmarz for Convergence Speed-up in Multi-Contrast Magnetic Particle Imaging.
Written by: L. Nawwas, M. Möddel, T. Knopp
in: <em>IEEE INTERNATIONAL SYMPOSIUM ON BIOMEDICAL IMAGING (ISBI 2024)</em>. (2024).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL:
ARXIVID:
PMID:

Note: inproceedings, multi-contrast

Abstract: Magnetic Particle Imaging (MPI) is a tracer-based medical imaging modality with great potential due to its high sensitivity, high spatio-temporal resolution, and capability to quantify the tracer distribution. Image reconstruction in MPI is an ill-posed problem, which regularization methods can address. In MPI, Tikhonov regularization is most commonly used and the corresponding optimization problem is usually solved using the Kaczmarz algorithm. Reconstruction using the Kaczmarz method for single-contrast MPI is very efficient as it produces the desired images fast after a small number of iterations. For multi-contrast MPI, however, the regular Kaczmarz algorithm fails to obtain good-quality images without channel leakage when using a small number of iterations. In this work, we propose a sparsity-promoting regularization term and an associated sparse Kaczmarz method in order to speed up convergence, especially in sparse channels. The proposed method reduces the channel leakage and as a result, speeds up convergence.