Fast hybrid SPECT simulation including efficient septal penetration modelling (SP-PSF)

Steven Staelens1, Tim de Wit, Freek Beekman

  • 1Department of Nuclear Medicine, Image Sciences Institute, University Medical Center Utrecht, Utrecht, The Netherlands. Steven.Staelens@UGent.be

Summary

This study enhances Monte Carlo simulations for Single Photon Emission Computed Tomography (SPECT) imaging. A new method significantly speeds up the simulation of septal penetrating photons, improving image reconstruction and data generation.

Related Concept Videos

Hybridization of Atomic Orbitals I03:24

Hybridization of Atomic Orbitals I

The mathematical expression known as the wave function, ψ, contains information about each orbital and the wavelike properties of electrons in an isolated atom. When atoms are bound together in a molecule, the wave functions combine to produce new mathematical descriptions that have different shapes. This process of combining the wave functions for atomic orbitals is called hybridization and is mathematically accomplished by the linear combination of atomic orbitals. The new orbitals that...
66.0K
Hybridization of Atomic Orbitals II03:35

Hybridization of Atomic Orbitals II

sp3d and sp3d 2 Hybridization
48.2K
Hybrid Zones02:29

Hybrid Zones

Hybrid zones are narrow regions where two closely related species interact, mate, and produce hybrids. Relative to either parent species, hybrids may possess distinct phenotypic or genetic differences that impact their survival and reproductive success. The genetic variances introduced by hybridization influence species diversity and speciation processes within the hybrid zone.
21.8K
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
918
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
8.0K
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

No description available
3.4K