Neutron penumbral image reconstruction with a convolution neural network using fast Fourier transform

Jianjun Song1, Jianhua Zheng1, Zhongjing Chen1

  • 1Laser Fusion Reacher Center, China Academic of Engineering Physics, Mianyang, SiChuan 621900, China.

PubMed
Summary

A new Fast Fourier Transform Neural Network (FFTNN) reconstructs 2D neutron emission images for Inertial Confinement Fusion (ICF) diagnostics. This method improves hot spot imaging accuracy, especially under high noise conditions.

Related Concept Videos

Electron Microscope Tomography and Single-particle Reconstruction01:07

Electron Microscope Tomography and Single-particle Reconstruction

Transmission electron microscopy (TEM) can be used to determine the 3D structure of biological samples with the help of techniques such as electron microscope tomography and single-particle reconstruction. While single-particle reconstruction can examine macromolecules and macromolecular complexes in vitro conditions only, tomography permits the study of cell components or small cells in vivo.
Electron Tomography
Electron tomography can be performed either in TEM or STEM (scanning transmission...
Continuous -time Fourier Transform01:11

Continuous -time Fourier Transform

The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
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...