The workflow of the E2E-DEcomp algorithm at inference is shown in Fig. 1, and the structure of E2EDEcomp algorithm for inference is reported in Table 1. In Fig. 2 it is shown the qualitative comparison on a test material image of the adipose tissue using filtered back projection (FBP) and E2 E-DE Comp. Infig. 3 is is reported the PSNR error for a set of 10 testing images for the 2 material decomposition.The workflow of the E2E-DEcomp algorithm at inference is shown in Fig. 1, and the structure of E2EDEcomp algorithm for inference is reported in Table 1. In Fig. 2 it is shown the qualitative comparison on a test material image of the adipose tissue using filtered back projection (FBP) and E2 E-DE Comp. Infig. 3 is is reported the PSNR error for a set of 10 testing images for the 2 material decomposition.

End-to-End Deep Learning Improves CT Material Decomposition

2025/10/01 20:00

Abstract and 1 Introduction

  1. Dual-Energy CT Forward Model
  2. [Model-based Optimization Problem]()
  3. End-to-End Model-based Deep Learning for Material Decomposition (E2E-Decomp)
  4. Numerical Results
  5. Conclusion
  6. Compliance with Ethical Standards and References

4 End-to-End Model-based Deep Learning for Material Decomposition (E2E-Decomp)

\

\

\

\ The workflow of the E2E-DEcomp algorithm at inference is shown in Fig. 1, and the structure of the E2EDEcomp algorithm for inference is reported in Table 1.

\

5 Numerical Results

\ In order to reduce the number of learnable parameters we utilise the same architecture for the denoising module D at each iteration k with shared parameters ρ. In Fig. 2 it is shown the qualitative comparison on a test material image of the adipose tissue using filtered back projection (FBP) and E2E-DEcomp while in Fig. 3 is is reported the PSNR error for a set of 10 testing images for the 2 material decomposition.

\ Figure 2: Qualitative comparison between the material decomposition for adipose using E2E-DEcomp and FBP using different number of angular projections.

\

\ It is worth noting that the improvement in the decomposition accuracy are consistent, around 5 dB, across different levels of dose, i.e. from sparse views to higher number of projections. We have also compared the E2E-DEcomp framework with the FBP ConvNet method Jin et al. [2017] and Fig. 4 shows how E2E-DEcomp can achieve a faster convergence in training using fewer epochs.

6 Conclusion

This work proposed a direct method for DECT material decomposition using a model-based optimization able to decouple the learning in the measurement and image domain. Numerical results show the effectiveness

\ Figure 4: Comparison of the PSNR training error between the FBP ConvNet and the E2E-DEcomp algorithms.

\ of the proposed E2E-DEcomp compared to other supervised approaches since it has fast convergence and excellent performance on low-dose DECT which can lead to further study with clinical dataset.

\

7 Compliance with Ethical Standards

This is a numerical simulation study for which no ethical approval was required.

References

Hemant K Aggarwal, Merry P Mani, and Mathews Jacob. Modl: Model-based deep learning architecture for inverse problems. IEEE transactions on medical imaging, 38(2):394–405, 2018.

\ Robert E Alvarez and Albert Macovski. Energy-selective reconstructions in x-ray computerised tomography. Physics in Medicine & Biology, 21(5):733, 1976.

\ Caifang Cai, Thomas Rodet, Samuel Legoupil, and Ali Mohammad-Djafari. A full-spectral bayesian reconstruction approach based on the material decomposition model applied in dual-energy computed tomography. Medical physics, 40(11):111916, 2013.

\ A. Eguizabal, O. Öktem, and M. Persson. A deep learning one-step solution to material image reconstruction in photon counting spectral CT. In Wei Zhao and Lifeng Yu, editors, Medical Imaging 2022: Physics of Medical Imaging, volume 12031, page 120310Y. International Society for Optics and Photonics, 2022. doi:10.1117/12.2612426.

\ W. Fang, D. Wu, K. Kim, M.K. Kalra, R. Singh, L. Li, and Q. Li. Iterative material decomposition for spectral CT using self-supervised Noise2Noise prior. Phys Med Biol, 66(15):155013, July 2021. doi:10.1088/1361- 6560/ac0afd.

\ Kyong Hwan Jin, Michael T McCann, Emmanuel Froustey, and Michael Unser. Deep convolutional neural network for inverse problems in imaging. IEEE transactions on image processing, 26(9):4509–4522, 2017.

\ Thorsten RC Johnson, Bernhard Krauss, Martin Sedlmair, Michael Grasruck, Herbert Bruder, Dominik Morhard, Christian Fink, Sabine Weckbach, Miriam Lenhard, Bernhard Schmidt, et al. Material differentiation by dual energy ct: initial experience. European radiology, 17:1510–1517, 2007.

\ Yong Long and Jeffrey A Fessler. Multi-material decomposition using statistical image reconstruction for spectral ct. IEEE transactions on medical imaging, 33(8):1614–1626, 2014.

\ Clemens Maaß, Matthias Baer, and Marc Kachelrieß. Image-based dual energy ct using optimized precorrection functions: A practical new approach of material decomposition in image domain. Medical physics, 36(8): 3818–3829, 2009.

\ Korbinian Mechlem, Thorsten Sellerer, Sebastian Ehn, Daniela Münzel, Eva Braig, Julia Herzen, Peter B Noël, and Franz Pfeiffer. Spectral angiography material decomposition using an empirical forward model and a dictionary-based regularization. IEEE transactions on medical imaging, 37(10):2298–2309, 2018.

\ Paulo RS Mendonça, Peter Lamb, and Dushyant V Sahani. A flexible method for multi-material decomposition of dual-energy ct images. IEEE transactions on medical imaging, 33(1):99–116, 2013.

\ Rohan Nadkarni, Alex Allphin, Darin P Clark, and Cristian T Badea. Material decomposition from photoncounting ct using a convolutional neural network and energy-integrating ct training labels. Physics in Medicine & Biology, 67(15):155003, 2022.

\ John L Nazareth. Conjugate gradient method. Wiley Interdisciplinary Reviews: Computational Statistics, 1(3): 348–353, 2009.

\ A. Perelli and M.S. Andersen. Regularization by denoising sub-sampled newton method for spectral CT multi-material decomposition. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 379(2200):20200191, 2021. doi:10.1098/rsta.2020.0191.

\ Zaifeng Shi, Huilong Li, Qingjie Cao, Zhongqi Wang, and Ming Cheng. A material decomposition method for dual-energy ct via dual interactive wasserstein generative adversarial networks. Medical Physics, 48(6): 2891–2905, 2021.

\ Emil Y Sidky and Xiaochuan Pan. Report on the AAPM deep-learning spectral CT grand challenge. Medical Physics, 2023.

\ Wim Van Aarle, Willem Jan Palenstijn, Jeroen Cant, Eline Janssens, Folkert Bleichrodt, Andrei Dabravolski, Jan De Beenhouwer, K Joost Batenburg, and Jan Sijbers. Fast and flexible x-ray tomography using the astra toolbox. Optics express, 24(22):25129–25147, 2016.

\ Ruoqiao Zhang, Jean-Baptiste Thibault, Charles A Bouman, Ken D Sauer, and Jiang Hsieh. Model-based iterative reconstruction for dual-energy x-ray ct using a joint quadratic likelihood model. IEEE transactions on medical imaging, 33(1):117–134, 2013.

\

:::info Authors:

(1) Jiandong Wang, Shenzhen Xilaiheng Medical Electronics, (HORRON), China and Centre for Medical Engineering and Technology, University of Dundee, DD1 4HN, UK (jack@horron.com);

(2) Alessandro Perelli, Centre for Medical Engineering and Technology, University of Dundee, DD1 4HN, UK (aperelli001@dundee.ac.uk).

:::


:::info This paper is available on arxiv under CC BY 4.0 DEED license.

:::

\

Disclaimer: The articles reposted on this site are sourced from public platforms and are provided for informational purposes only. They do not necessarily reflect the views of MEXC. All rights remain with the original authors. If you believe any content infringes on third-party rights, please contact service@support.mexc.com for removal. MEXC makes no guarantees regarding the accuracy, completeness, or timeliness of the content and is not responsible for any actions taken based on the information provided. The content does not constitute financial, legal, or other professional advice, nor should it be considered a recommendation or endorsement by MEXC.
Share Insights

You May Also Like

PEPE ($PEPE) Leads Top MEME Projects by Social Activity

PEPE ($PEPE) Leads Top MEME Projects by Social Activity

The post PEPE ($PEPE) Leads Top MEME Projects by Social Activity appeared on BitcoinEthereumNews.com. LunarCrush, a known platform for real-time metrics for crypto and Web3 projects, has released the list of rankings of the Top 10 meme projects based on their social activity over the last 24 hours. PEPE ($PEPE) leads to other top memecoins based on social activity. Fundamentally, social activity consists of engaging with posts and interactions with posts. TOP #MEME PROJECTS BY SOCIAL ACTIVITY$PEPE $DOGE $TRUMP $PUMP $APE $SHIB $PENGU #FARTCOIN $GIGA $BONK pic.twitter.com/wgJ4S30fxi — PHOENIX – Crypto News & Analytics (@pnxgrp) October 5, 2025 PEPE ($PEPE) is leading with 35.6K Engaged Posts and 5.8M Interaction-based posts, according to the last 24-hour record on LunarCrush. It can be seen that $PEPE is leading with a minor difference of 0.1K in Engaged Posts to its contemporary project Dogecoin ($DOGE) with 35.5K and 4.3M by Engaged posts and Interactions, respectively.  Phoenix has released this news through its official X account. $TRUMP, $PUMP, and $APE Battle for Attention OFFICIAL TRUMP ($TRUMP) and PUMP. fun ($PUMP) are closely fighting each other with 26.9K and 20.2K Engaged posts and 4.3M and 6.6M with Interactions. This closeness shows a strong competition between these two AI projects based on social activity on different platforms. Furthermore, ApeCoin ($APE) shows 15.0K Engaged posts with 977.5K Interactions, while Shiba Inu ($SHIB) is surviving with 12.1K Engaged posts and 1.3M Interactions. In addition, Pudgy Penguins ($PENGU) is also struggling with 8.1K and 1.8M, as well as engaged posts and interactions through social activity. FARTCOIN Slightly Outpaces GIGA in Engagement Race FARTCOIN ($FARTCOIN) shows 7.0K Engaged posts with 22.9M in Interactions. In the same way, Gigachad ($GIGA) also shows 6.6K Engaged posts and 7.5M Interactions. This negligible difference shows that they are very close to each other, with only a 0.4K difference in Engaged posts. According to the ranking by Top MEME Projects,…
Share
BitcoinEthereumNews2025/10/06 07:00
Share
How Solana Intends to Become an Even Stronger Competitor in the Blockchain Space

How Solana Intends to Become an Even Stronger Competitor in the Blockchain Space

The post How Solana Intends to Become an Even Stronger Competitor in the Blockchain Space appeared on BitcoinEthereumNews.com. Solana is preparing for a major overhaul that could make its famously fast blockchain even faster — and a lot easier to run. In its “Crypto Monthly Recap for September 2025” research report published Oct. 3, global asset manager VanEck says Solana’s upcoming Alpenglow upgrade marks the biggest change to the network’s core software since launch. The firm calls it “the largest upgrade to Solana’s consensus in its history,” pointing to six key changes that together promise faster performance, lower costs, and greater reliability. For readers less familiar with Solana’s design, Alpenglow essentially changes how the network’s thousands of validators agree on which transactions are valid. That process, known as consensus, is being streamlined so data moves through the system more efficiently and validators can operate with less friction. What VanEck highlighted Faster finality. Today, Solana takes around 12 seconds to finalize a transaction, meaning to confirm it permanently. Alpenglow cuts that to about 150 milliseconds — roughly the time it takes to blink. Faster finality makes trades, payments and app interactions feel instantaneous, bringing Solana closer to web-level responsiveness. Off-chain voting. Validators currently vote on every new block by submitting thousands of small transactions on-chain. That keeps the network secure but clogs bandwidth. Alpenglow moves voting off-chain, letting validators exchange votes privately and later post a single proof. This clears space for regular user transactions and helps keep network fees low. Simpler validator costs. Instead of paying transaction fees for every vote, validators will submit a single Validator Admission Ticket each cycle. This reduces costs and makes it easier for smaller operators to run validators, which strengthens decentralization and network security. Streamlined communication. Solana’s nodes constantly share messages to stay in sync, a process known as “gossip.” Alpenglow reduces this background traffic so validators spend less time and bandwidth…
Share
BitcoinEthereumNews2025/10/06 07:39
Share