Skip to content

Simulation and Design Study of Edge-on GaAs:Cr Detector for Clinical Photon Counting CT.

Sep 2026 · IEEE Transactions on Medical Imaging · Vol PP · 0 citations
Medicine

TL;DR

The results indicate that the GaAs:Cr detector exhibits excellent mono-energetic spectrum response and low material decomposition (MD) noise, and provides lower noise, higher contrast-to-noise ratio (CNR) in VMI results, and more precise concentration measurements in quantitative analysis, compared to existing PCDs.

Abstract

Chromium-compensated Gallium Arsenide (GaAs:Cr) has emerged as a promising sensor material for photon counting detectors (PCDs) due to its excellent resistivity and charge carrier mobility. However, due to the limitations of the Cr compensation process, the GaAs:Cr wafer thickness is less than 1 mm, which distorts its X-ray absorption efficiency and limits its application in clinical computed tomography (CT). This study proposes a GaAs detector with an edge-on structure for clinical photon counting CT (PCCT) applications. To evaluate the performance of the detector, we modeled the spectral response and analyzed material decomposition (MD) noise using a full-chain detector model. In imaging domain study, digital phantoms, such as low contrast phantom, Gammex phantom, and XCAT digital phantoms, were virtually scanned to assess the image uniformity, CT number accuracy, material decomposition, and virtual mono-energetic imaging (VMI) performance, with the detector system modeled to reflect actual PCCT prototypes. The results indicate that the GaAs:Cr detector exhibits excellent mono-energetic spectrum response and low material decomposition (MD) noise. Additionally, the GaAs:Cr detector provides lower noise, higher contrast-to-noise ratio (CNR) in VMI results, and more precise concentration measurements in quantitative analysis, compared to existing PCDs. These findings highlight the feasibility of developing GaAs:Cr detectors for clinical CT applications, offering potential advantages over existing PCDs.

View source

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.