Search NASA⌕ Search

SEARCH · Search NASA

Results for “Reconstruction algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,153 records · Page 64

TH-E-17A-06: Anatomical-Adaptive Compressed Sensing (AACS) Reconstruction for Thoracic 4-Dimensional Cone-Beam CT

Purpose: The Feldkamp-Davis-Kress (FDK) algorithm currently used for clinical thoracic 4-dimensional (4D) cone-beam CT (CBCT) reconstruction suffers from noise and streaking artifacts due to projection under-sampling. Compressed sensing theory enables reconstruction of under-sampled datasets via total-variation (TV) minimization, but TV-minimization algorithms such as adaptive-steepest-descent-projection-onto-convex-sets (ASD-POCS) often converge slowly and are prone to over-smoothing anatomical details. These disadvantages can be overcome by incorporating general anatomical knowledge via anatomy segmentation. Based on this concept, we have developed an anatomical-adaptive compressed sensing (AACS) algorithm for thoracic 4D-CBCT reconstruction. Methods: AACS is based on the ASD-POCS framework, where each iteration consists of a TV-minimization step and a data fidelity constraint step. Prior to every AACS iteration, four major thoracic anatomical structures - soft tissue, lungs, bony anatomy, and pulmonary details - were segmented from the updated solution image. Based on the segmentation, an anatomical-adaptive weighting was applied to the TV-minimization step, so that TV-minimization was enhanced at noisy/streaky regions and suppressed at anatomical structures of interest. The image quality and convergence speed of AACS was compared to conventional ASD-POCS using an XCAT digital phantom and a patient scan. Results: For the XCAT phantom, the AACS image represented the ground truth better than the ASD-POCS image, giving a higher structural similarity index (0.93 vs. 0.84) and lower absolute difference (1.1*10{sup 4} vs. 1.4*10{sup 4}). For the patient case, while both algorithms resulted in much less noise and streaking than FDK, the AACS image showed considerably better contrast and sharpness of the vessels, tumor, and fiducial marker than the ASD-POCS image. In addition, AACS converged over 50% faster than ASD-POCS in both cases. Conclusions: The proposed AACS algorithm was shown to reconstruct thoracic 4D-CBCT images more accurately and with faster convergence compared to ASD-POCS. The superior image quality and rapid convergence makes AACS promising for future clinical use.

60 APPLIED LIFE SCIENCES↗

The Simons Observatory: Beam Characterization for the Small Aperture Telescopes

Abstract We use time-domain simulations of Jupiter observations to test and develop a beam reconstruction pipeline for the Simons Observatory Small Aperture Telescopes. The method relies on a mapmaker that estimates and subtracts correlated atmospheric noise and a beam fitting code designed to compensate for the bias caused by the mapmaker. We test our reconstruction performance for four different frequency bands against various algorithmic parameters, atmospheric conditions, and input beams. We additionally show the reconstruction quality as a function of the number of available observations and investigate how different calibration strategies affect the beam uncertainty. For all of the cases considered, we find good agreement between the fitted results and the input beam model within an ∼1.5% error for a multipole range ℓ = 30–700 and an ∼0.5% error for a multipole range ℓ = 50–200. We conclude by using a harmonic-domain component separation algorithm to verify that the beam reconstruction errors and biases observed in our analysis do not significantly bias the Simons Observatory r -measurement

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

The Simons Observatory: Beam Characterization for the Small Aperture Telescopes

We use time-domain simulations of Jupiter observations to test and develop a beam reconstruction pipeline for the Simons Observatory Small Aperture Telescopes. The method relies on a mapmaker that estimates and subtracts correlated atmospheric noise and a beam fitting code designed to compensate for the bias caused by the mapmaker. We test our reconstruction performance for four different frequency bands against various algorithmic parameters, atmospheric conditions, and input beams. We additionally show the reconstruction quality as a function of the number of available observations and investigate how different calibration strategies affect the beam uncertainty. For all of the cases considered, we find good agreement between the fitted results and the input beam model within an ∼1.5% error for a multipole range ℓ = 30–700 and an ∼0.5% error for a multipole range ℓ = 50–200. We conclude by using a harmonic-domain component separation algorithm to verify that the beam reconstruction errors and biases observed in our analysis do not significantly bias the Simons Observatory r-measurement.

Cosmic microwave background radiation↗

Fine-tuning machine-learned particle-flow reconstruction for new detector geometries in future colliders

We demonstrate transfer learning capabilities in a machine-learned algorithm trained for particle-flow reconstruction in high energy particle colliders. This paper presents a cross-detector fine-tuning study, where we initially pretrain the model on a large full simulation dataset from one detector design, and subsequently fine-tune the model on a sample with a different collider and detector design. Specifically, we use the Compact Linear Collider detector (CLICdet) model for the initial training set and demonstrate successful knowledge transfer to the CLIC-like detector (CLD) proposed for the Future Circular Collider in electron-positron mode. We show that with an order of magnitude less samples from the second dataset, we can achieve the same performance as a costly training from scratch, across particle-level and event-level performance metrics, including jet and missing transverse momentum resolution. Furthermore, we find that the fine-tuned model achieves comparable performance to the traditional rule-based particle-flow approach on event-level metrics after training on 100,000 CLD events, whereas a model trained from scratch requires at least 1 million CLD events to achieve similar reconstruction performance. To our knowledge, this represents the first full-simulation cross-detector transfer learning study for particle-flow reconstruction. These findings offer valuable insights towards building large foundation models that can be fine-tuned across different detector designs and geometries, helping to accelerate the development cycle for new detectors and opening the door to rapid detector design and optimization using machine learning.

43 PARTICLE ACCELERATORS↗

A Note on Alternating Minimization Algorithm for the Matrix Completion Problem

Here, we consider the problem of reconstructing a low-rank matrix from a subset of its entries and analyze two variants of the so-called alternating minimization algorithm, which has been proposed in the past.We establish that when the underlying matrix has rank one, has positive bounded entries, and the graph underlying the revealed entries has diameter which is logarithmic in the size of the matrix, both algorithms succeed in reconstructing the matrix approximately in polynomial time starting from an arbitrary initialization.We further provide simulation results which suggest that the second variant which is based on the message passing type updates performs significantly better.

97 MATHEMATICS AND COMPUTING↗

Fast Hyperspectral Neutron Tomography

Hyperspectral neutron computed tomography is a tomographic imaging technique in which thousands of wavelength-specific neutron radiographs are measured for each tomographic view. In conventional hyperspectral reconstruction, data from each neutron wavelength bin are reconstructed separately, which is extremely time-consuming. These reconstructions often suffer from poor quality due to low signal-to-noise ratios. Consequently, material decomposition based on these reconstructions tends to produce inaccurate estimates of the material spectra and erroneous volumetric material separation. In this paper, we present two novel algorithms for processing hyperspectral neutron data: fast hyperspectral reconstruction and fast material decomposition. Both algorithms rely on a subspace decomposition procedure that transforms hyperspectral views into low-dimensional projection views within an intermediate subspace, where tomographic reconstruction is performed. The use of subspace decomposition dramatically reduces reconstruction time while reducing both noise and reconstruction artifacts. We apply our algorithms to both simulated and measured neutron data and demonstrate that they reduce computation and improve the quality of the results relative to conventional methods.

Chowdhury, Mohammad Samin Nur [Purdue University]↗

Physics‐based iterative reconstruction for dual‐source and flying focal spot computed tomography

Purpose For single‐source helical Computed Tomography (CT), both Filtered‐Back Projection (FBP) and statistical iterative reconstruction have been investigated. However, for dual‐source CT with flying focal spot (DS‐FFS CT), a statistical iterative reconstruction that accurately models the scanner geometry and acquisition physics remains unknown to researchers. Therefore, our purpose is to present a novel physics‐based iterative reconstruction method for DS‐FFS CT and assess its image quality. Methods Our algorithm uses precise physics models to reconstruct from the native cone‐beam geometry and interleaved dual‐source helical trajectory of a DS‐FFS CT. To do so, we construct a noise physics model to represent data acquisition noise and a prior image model to represent image noise and texture. In addition, we design forward system models to compute the locations of deflected focal spots, the dimension, and sensitivity of voxels and detector units, as well as the length of intersection between x‐rays and voxels. The forward system models further represent the coordinated movement between the dual sources by computing their x‐ray coverage gaps and overlaps at an arbitrary helical pitch. With the above models, we reconstruct images by an advanced Consensus Equilibrium (CE) numerical method to compute the maximum a posteriori estimate to a joint optimization problem that simultaneously fits all models. Results We compared our reconstruction with Siemens ADMIRE, which is the clinical standard hybrid iterative reconstruction (IR) method for DS‐FFS CT, in terms of spatial resolution, noise profile, and image artifacts through both phantoms and clinical scan datasets. Experiments show that our reconstruction has a higher spatial resolution, with a Task‐Based Modulation Transfer Function (MTF task ) consistently higher than the clinical standard hybrid IR. In addition, our reconstruction shows a reduced magnitude of image undersampling artifacts than the clinical standard. Conclusions By modeling a precise geometry and avoiding data rebinning or interpolation, our physics‐based reconstruction achieves a higher spatial resolution and fewer image artifacts with smaller magnitude than the clinical standard hybrid IR.

Wang, Xiao↗

Compressed video camera with a moving patterned disk

A high-speed video system is disclosed that includes a moving image absorbing disk at an image plane. The disk has a pattern that passes and blocks image data. The disk is located between an event and an image sensor, or reflects an image to the image sensor. The disk is rotated at a speed that matches the desired reconstructed image frame rate. The image sensor frame data is processed using image reconstruction techniques, such as the D-AMP or TWIST algorithm, to recover a time sequence of reconstructed images. Additional images can be reconstructed for each image sensor frame if some spatial resolution is sacrificed. For continuous video, the disk speed is adjusted to the sensor frame rate. For burst mode, a single sensor image is acquired and a short image sequence is reconstructed. This image capture system works with a variety of radiations, including infrared, light, UV and X-rays.

42 ENGINEERING↗

Reconstructions from randomly generated longitudinal electron bunch profiles with Gaussian envelopes using the Gerchberg–Saxton algorithm

Knowledge of longitudinal electron bunch profiles is vital to optimize the performance of plasma wakefield accelerators and x-ray free electron laser linacs. Because of their importance to these novel applications, noninvasive frequency domain techniques are often employed to reconstruct longitudinal bunch profiles from coherent synchrotron, transition, or undulator radiation measurements. In this paper, we detail several common reconstruction techniques involving the Kramers–Kronig phase relationship and Gerchberg–Saxton algorithm. Additionally, through statistical analysis, we draw general conclusions about the accuracy of these reconstruction techniques and the most suitable candidate for reconstructing well-isolated longitudinal bunch profiles from spectroscopic data.

47 OTHER INSTRUMENTATION↗

PhaseGAN: a deep-learning phase-retrieval approach for unpaired datasets

Phase retrieval approaches based on deep learning (DL) provide a framework to obtain phase information from an intensity hologram or diffraction pattern in a robust manner and in real-time. However, current DL architectures applied to the phase problem rely on i) paired datasets, i. e., they arc only applicable when a satisfactory solution of the phase problem has been found, and ii) the fact that most of them ignore the physics of the imaging process. Here, we present PhaseGAN, a new DL approach based on Generative Adversarial Networks, which allows the use of unpaired datasets and includes the physics of image formation. The performance of our approach is enhanced by including the image formation physics and a novel Fourier loss function, providing phase reconstructions when conventional phase retrieval algorithms fail, such as ultra-fast experiments. Thus, PhaseGAN offers the opportunity to address the phase problem in real-time when no phase reconstructions but good simulations or data from other experiments are available.

47 OTHER INSTRUMENTATION↗

UROX 2.0: an interactive tool for fitting atomic models into electron-microscopy reconstructions

UROX is software designed for the interactive fitting of atomic models into electron-microscopy reconstructions. The main features of the software are presented, along with a few examples. Electron microscopy of a macromolecular structure can lead to three-dimensional reconstructions with resolutions that are typically in the 30–10 Å range and sometimes even beyond 10 Å. Fitting atomic models of the individual components of the macromolecular structure (e.g. those obtained by X-ray crystallography or nuclear magnetic resonance) into an electron-microscopy map allows the interpretation of the latter at near-atomic resolution, providing insight into the interactions between the components. Graphical software is presented that was designed for the interactive fitting and refinement of atomic models into electron-microscopy reconstructions. Several characteristics enable it to be applied over a wide range of cases and resolutions. Firstly, calculations are performed in reciprocal space, which results in fast algorithms. This allows the entire reconstruction (or at least a sizeable portion of it) to be used by taking into account the symmetry of the reconstruction both in the calculations and in the graphical display. Secondly, atomic models can be placed graphically in the map while the correlation between the model-based electron density and the electron-microscopy reconstruction is computed and displayed in real time. The positions and orientations of the models are refined by a least-squares minimization. Thirdly, normal-mode calculations can be used to simulate conformational changes between the atomic model of an individual component and its corresponding density within a macromolecular complex determined by electron microscopy. These features are illustrated using three practical cases with different symmetries and resolutions. The software, together with examples and user instructions, is available free of charge at http://mem.ibs.fr/UROX/.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Multi-material hydrodynamics with algebraic sharp interface capturing

A finite volume method for Eulerian multi-material hydrodynamics with sharp interface capturing is presented here. The pressure-temperature non-equilibrium multi-material system with finite-rate pressure relaxation in mixed-cells is considered here. This pressure closure facilitates material-property-dependent pressure relaxation, rather than instantaneous pressure equilibration, which in turn allows the use of unsplit high-order time-integrators. A modified tangent of hyperbola for interface capturing (THINC) method is used to reconstruct multi-material (> 2) interfaces, on three-dimensional unstructured meshes. A simple modification which extends the THINC reconstruction to interfaces between more than two materials is proposed. It is demonstrated that the modified THINC can capture multi-material interfaces within 2–4 tetrahedral cells. Since no geometric reconstructions are required by the THINC method, the presented multi-material method is algorithmically simple, and computationally efficient. Consistent reconstructions of conserved quantities at material interfaces ensure that conservation and closure laws are satisfied at the discrete level. Through a suite of test problems solved on unstructured meshes, it is demonstrated that the presented method is a promising candidate for accurate and efficient multi-material hydrodynamics computations.

97 MATHEMATICS AND COMPUTING↗

Validation of the stochastic inversion algorithm for acoustic travel-time tomography: a large eddy simulation study

Acoustic tomography (AT) is explored as a remote sensing technique to obtain instantaneous snapshots of temperature and velocity fluctuations for wind energy applications. This study integrates Large Eddy Simulation (LES) with the Stochastic Inversion (SI) method to validate the algorithm’s capacity for accurate reconstruction of atmospheric fluctuations. The initial findings demonstrate the efficacy of the method in accurately capturing the predominant flow structures. Normalized L2 error evaluations further inform the algorithm’s precision, with errors accentuated in less sampled peripheral regions. The results underscore the method’s promise as a non-intrusive observational tool, with ongoing development poised to improve its precision and reliability.

17 WIND ENERGY↗

SU-E-I-93: Improved Imaging Quality for Multislice Helical CT Via Sparsity Regularized Iterative Image Reconstruction Method Based On Tensor Framelet

Purpose: Inspired by compressive sensing, sparsity regularized iterative reconstruction method has been extensively studied. However, its utility pertinent to multislice helical 4D CT for radiotherapy with respect to imaging quality, dose, and time has not been thoroughly addressed. As the beginning of such an investigation, this work carries out the initial comparison of reconstructed imaging quality between sparsity regularized iterative method and analytic method through static phantom studies using a state-of-art 128-channel multi-slice Siemens helical CT scanner. Methods: In our iterative method, tensor framelet (TF) is chosen as the regularization method for its superior performance from total variation regularization in terms of reduced piecewise-constant artifacts and improved imaging quality that has been demonstrated in our prior work. On the other hand, X-ray transforms and its adjoints are computed on-the-fly through GPU implementation using our previous developed fast parallel algorithms with O(1) complexity per computing thread. For comparison, both FDK (approximate analytic method) and Katsevich algorithm (exact analytic method) are used for multislice helical CT image reconstruction. Results: The phantom experimental data with different imaging doses were acquired using a state-of-art 128-channel multi-slice Siemens helical CT scanner. The reconstructed image quality was compared between TF-based iterative method, FDK and Katsevich algorithm with the quantitative analysis for characterizing signal-to-noise ratio, image contrast, and spatial resolution of high-contrast and low-contrast objects. Conclusion: The experimental results suggest that our tensor framelet regularized iterative reconstruction algorithm improves the helical CT imaging quality from FDK and Katsevich algorithm for static experimental phantom studies that have been performed.

60 APPLIED LIFE SCIENCES↗

Spatial profile reconstruction of individual componentsof the nonlinear susceptibility tensors {chi}-circumflex {sup (3)}(z, {omega}', {omega}' -{omega}, {omega}) and {chi}-circumflex {sup (3)}(z, 2{omega}{+-}{omega}', {+-}{omega}', {omega}, {omega}) of a one-dimensionally inhomogeneous medium

We have proved for the first time and proposed an algorithm of unique spatial profile reconstruction of the components {chi}-circumflex {sup (3)}{sub yyyy} of complex tensors {chi}-circumflex {sup (3)}(z, {omega}', {omega}', -{omega}, {omega}) and {chi}-circumflex {sup (3)}(z, 2{omega}{+-}{omega}', {+-}{omega}', {omega}, {omega}), describing four-photon interaction of light waves in a one-dimensionally inhomogeneous plate, whose medium has a symmetry plane m{sub y} that is perpendicular to its surface. For the media with an additional symmetry axis 2{sub z}, 4{sub z}, 6{sub z} or {infinity}{sub z} that is perpendicular to the plate surface, the proposed method can be used to reconstruct about one-fifth of all independent components of the above tensors. (nonlinear optical phenomena)

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Mid- and long-term runoff predictions by an improved phase-space reconstruction model

In recent years, the phase-space reconstruction method has usually been used for mid- and long-term runoff predictions. However, the traditional phase-space reconstruction method is still needs to be improved. Using the genetic algorithm to improve the phase-space reconstruction method, a new nonlinear model of monthly runoff is constructed. The new model does not rely heavily on embedding dimensions. Recognizing that the rainfall–runoff process is complex, affected by a number of factors, more variables (e.g. temperature and rainfall) are incorporated in the model. In order to detect the possible presence of chaos in the runoff dynamics, chaotic characteristics of the model are also analyzed, which shows the model can represent the nonlinear and chaotic characteristics of the runoff. The model is tested for its forecasting performance in four types of experiments using data from six hydrological stations on the Yellow River and the Yangtze River. Results show that the medium-and long-term runoff is satisfactorily forecasted at the hydrological stations. Not only is the forecasting trend accurate, but also the mean absolute percentage error is no more than 15%. Moreover, the forecast results of wet years and dry years are both good, which means that the improved model can overcome the traditional ‘‘wet years and dry years predictability barrier,’’ to some extent. The model forecasts for different regions are all good, showing the universality of the approach. Compared with selected conceptual and empirical methods, the model exhibits greater reliability and stability in the long-term runoff prediction. Our study provides a new thinking for research on the association between the monthly runoff and other hydrological factors, and also provides a new method for the prediction of the monthly runoff. - Highlights: • The improved phase-space reconstruction model of monthly runoff is established. • Two variables (temperature and rainfall) are incorporated in the model. • Chaotic characteristics of the model are also analyzed. • The forecast results of the mid and long-term runoff in six stations are accurate.

97 MATHEMATICS AND COMPUTING↗

Digital image gathering and minimum mean-square error restoration

Most digital image restoration algorithms are inherently incomplete because they are conditioned on a discrete-input, discrete-output model which only accounts for blurring during image gathering and additive noise. For those restoration applications where sampling and reconstruction are important, the restoration algorithm should be based on a more comprehensive end-to-end model which also accounts for the potentially important noiselike effects of aliasing and the low-pass filtering effects of interpolative reconstruction. It is demonstrated that although the mathematics of this more comprehensive model is more complex, the increase in complexity is not so great as to prevent a complete development and analysis of the associated minimum mean-square error (Wiener) restoration filter.

Park, Stephen K.↗

Reconstruction and identification of $\tau$ lepton decays to hadrons and $\nu_\tau$ at CMS

This paper describes the algorithms used by the CMS experiment to reconstruct and identify τ→ hadrons + v t decays during Run 1 of the LHC. The performance of the algorithms is studied in proton-proton collisions recorded at a centre-of-mass energy of 8 TeV, corresponding to an integrated luminosity of 19.7 fb -1 . The algorithms achieve an identification efficiency of 50–60%, with misidentification rates for quark and gluon jets, electrons, and muons between per mille and per cent levels.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗