MARS-MD: rejection based image domain material decomposition
C.J. Bateman, D. Knight, B. Brandwacht, J. Mc Mahon, J. Healy, R., Panta, R. Aamir, K. Rajendran, M. Moghiseh, M. Ramyar, D. Rundle, J. Bennett,, N. de Ruiter, D. Smithies, S.T. Bell, R. Doesburg, A. Chernoglazov, V.B.H., Mandalika, M. Walsh, M. Shamshad, M. Anjomrouz

TL;DR
This paper introduces MARS-MD, a rejection-based algorithm for material decomposition in spectral CT that simplifies under-determined problems by splitting, solving, and rejecting solutions, improving sparsity and reducing signal crossover.
Contribution
It presents a novel heuristic approach for material decomposition that handles under-determined problems through sub-problem splitting and rejection, with two specific algorithms.
Findings
Effective in reducing signal crossover between material images
Allows flexible application of constraints to sub-problems
Demonstrates practical utility in spectral CT imaging
Abstract
This paper outlines image domain material decomposition algorithms that have been routinely used in MARS spectral CT systems. These algorithms (known collectively as MARS-MD) are based on a pragmatic heuristic for solving the under-determined problem where there are more materials than energy bins. This heuristic contains three parts: (1) splitting the problem into a number of possible sub-problems, each containing fewer materials; (2) solving each sub-problem; and (3) applying rejection criteria to eliminate all but one sub-problem's solution. An advantage of this process is that different constraints can be applied to each sub-problem if necessary. In addition, the result of this process is that solutions will be sparse in the material domain, which reduces crossover of signal between material images. Two algorithms based on this process are presented: the Segmentation variant, which…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
