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,171 records · Page 65

Development and evaluation of a Hadamard transform imaging spectrometer and a Hadamard transform thermal imager

A spectrometric imager and a thermal imager, which achieve multiplexing by the use of binary optical encoding masks, were developed. The masks are based on orthogonal, pseudorandom digital codes derived from Hadamard matrices. Spatial and/or spectral data is obtained in the form of a Hadamard transform of the spatial and/or spectral scene; computer algorithms are then used to decode the data and reconstruct images of the original scene. The hardware, algorithms and processing/display facility are described. A number of spatial and spatial/spectral images are presented. The achievement of a signal-to-noise improvement due to the signal multiplexing was also demonstrated. An analysis of the results indicates both the situations for which the multiplex advantage may be gained, and the limitations of the technique. A number of potential applications of the spectrometric imager are discussed.

Harwit, M.↗

Identification and energy calibration of hadronically decaying tau leptons with the ATLAS experiment in pp collisions at $\sqrt{s}=8$ $\,\hbox {TeV}$ TeV

This study describes the trigger and offline reconstruction, identification and energy calibration algorithms for hadronic decays of tau leptons employed for the data collected from pp collisions in 2012 with the ATLAS detector at the LHC center-of-mass energy √s=8 TeV. The performance of these algorithms is measured in most cases with Z decays to tau leptons using the full 2012 dataset, corresponding to an integrated luminosity of 20.3 fb –1 . An uncertainty on the offline reconstructed tau energy scale of 2–4%, depending on transverse energy and pseudorapidity, is achieved using two independent methods. The offline tau identification efficiency is measured with a precision of 2.5% for hadronically decaying tau leptons with one associated track, and of 4% for the case of three associated tracks, inclusive in pseudorapidity and for a visible transverse energy greater than 20 GeV. For hadronic tau lepton decays selected by offline algorithms, the tau trigger identification efficiency is measured with a precision of 2–8%, depending on the transverse energy. The performance of the tau algorithms, both offline and at the trigger level, is found to be stable with respect to the number of concurrent proton–proton interactions and has supported a variety of physics results using hadronically decaying tau leptons at ATLAS.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Reconstruction of the wind velocity profile by the intensity fluctuations of a scattered wave in a receiving telescope

The problem of the wind velocity profile reconstruction from random intensity fluctuations of a laser beam diffusely scattered by a screen and received by a telescope is considered. Expressions for a spatiotemporal correlation function and spectrum of weak intensity fluctuations of the reflected beam are presented. An algorithm is proposed for the reconstruction of the profile and direction of the wind velocity from the intensity fluctuation spectra of reflected radiation received by the telescope. The efficiency of the algorithm is confirmed by the results of numerical experiments. (lidars)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Convolutional Visual Network for Identification and Reconstruction of NOvA Events

In 2016 the NOvA experiment released results for the observation of oscillations in the vμ and ve channels as well as ve cross section measurements using neutrinos from Fermilab’s NuMI beam. These and other measurements in progress rely on the accurate identification and reconstruction of the neutrino flavor and energy recorded by our detectors. This presentation describes the first application of convolutional neural network technology for event identification and reconstruction in particle detectors like NOvA. The Convolutional Visual Network (CVN) Algorithm was developed for identification, categorization, and reconstruction of NOvA events. It increased the selection efficiency of the ve appearance signal by 40% and studies show potential impact to the vμ disappearance analysis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Identifying Defects with Guided Algorithms in Bragg Coherent Diffractive Imaging

In this study, crystallographic defects such as dislocations can significantly alter material properties and functionality. However, imaging these imperfections during operation remains challenging due to the short length scales involved and the reactive environments of interest. Bragg coherent diffractive imaging (BCDI) has emerged as a powerful tool capable of identifying dislocations, twin domains, and other defects in 3D detail with nanometer spatial resolution within nanocrystals and grains in reactive environments. However, BCDI relies on phase retrieval algorithms that can fail to accurately reconstruct the defect network. Here, we use numerical simulations to explore different guided phase retrieval algorithms for imaging defective crystals using BCDI. We explore different defect types, defect densities, Bragg peaks, and guided algorithm fitness metrics as a function of signal-to-noise ratio. Based on these results, we offer a general prescription for phasing of defective crystals with no a prior knowledge.

36 MATERIALS SCIENCE↗

Distributed Automatic Differentiation for Ptychography

Synchrotron radiation light source facilities are leading the way to ultrahigh resolution X-ray imaging. High resolution imaging is essential to understanding the fundamental structure and interaction of materials at the smallest length scale possible. Diffraction based methods achieve nanoscale imaging by replacing traditional objective lenses by pixelated area detectors and computational image reconstruction. Among these methods, ptychography is quickly becoming the standard for sub-30 nanometer imaging of extended samples, but at the expense of increasingly high data rates and volumes. This paper presents a new distributed algorithm for solving the ptychographic image reconstruction problem based on automatic differentiation. Input datasets are subdivided between multiple graphics processing units (GPUs); each subset of the problem is then solved either entirely independent of other subsets (asynchronously) or through sharing gradient information with other GPUs (synchronously). The algorithm was evaluated on simulated and real data acquired at the Advanced Photon Source, scaling up to 192 GPUs. The synchronous variant of our method outperformed an existing multi-GPU implementation in terms of accuracy while running at a comparable execution time.

distributed algorithms↗

Real space iterative reconstruction for vector tomography (RESIRE-V)

Tomography has had an important impact on the physical, biological, and medical sciences. To date, most tomographic applications have been focused on 3D scalar reconstructions. However, in some crucial applications, vector tomography is required to reconstruct 3D vector fields such as the electric and magnetic fields. Over the years, several vector tomography methods have been developed. Here, we present the mathematical foundation and algorithmic implementation of REal Space Iterative REconstruction for Vector tomography, termed RESIRE-V. RESIRE-V uses multiple tilt series of projections and iterates between the projections and a 3D reconstruction. Each iteration consists of a forward step using the Radon transform and a backward step using its transpose, then updates the object via gradient descent. Incorporating with a 3D support constraint, the algorithm iteratively minimizes an error metric, defined as the difference between the measured and calculated projections. The algorithm can also be used to refine the tilt angles and further improve the 3D reconstruction. To validate RESIRE-V, we first apply it to a simulated data set of the 3D magnetization vector field, consisting of two orthogonal tilt series, each with a missing wedge. Our quantitative analysis shows that the three components of the reconstructed magnetization vector field agree well with the ground-truth counterparts. We then use RESIRE-V to reconstruct the 3D magnetization vector field of a ferromagnetic meta-lattice consisting of three tilt series. Our 3D vector reconstruction reveals the existence of topological magnetic defects with positive and negative charges. We expect that RESIRE-V can be incorporated into different imaging modalities as a general vector tomography method. To make the algorithm accessible to a broad user community, we have made our RESIRE-V MATLAB source codes and the data freely available at https://github.com/minhpham0309/RESIRE-V.

47 OTHER INSTRUMENTATION↗

PtychoShelves , a versatile high-level framework for high-performance analysis of ptychographic data

Over the past decade, ptychography has been proven to be a robust tool for non-destructive high-resolution quantitative electron, X-ray and optical microscopy. It allows for quantitative reconstruction of the specimen's transmissivity, as well as recovery of the illuminating wavefront. Additionally, various algorithms have been developed to account for systematic errors and improved convergence. With fast ptychographic microscopes and more advanced algorithms, both the complexity of the reconstruction task and the data volume increase significantly. PtychoShelves is a software package which combines high-level modularity for easy and fast changes to the data-processing pipeline, and high-performance computing on CPUs and GPUs.

97 MATHEMATICS AND COMPUTING↗

Visualization and Analysis-Oriented Reconstruction of Material Interfaces

Reconstructing boundaries along material interfaces from volume fractions is a difficult problem, especially because the under-resolved nature of the input data allows for many correct interpretations. Worse, algorithms widely accepted as appropriate for simulation are inappropriate for visualization. In this paper, we describe a new algorithm that is specifically intended for reconstructing material interfaces for visualization and analysis requirements. The algorithm performs well with respect to memory footprint and execution time, has desirable properties in various accuracy metrics, and also produces smooth surfaces, even when faced with more than two materials per cell.

Meredith, Jeremy S↗

A Pilot Evaluation of a 4-Dimensional Cone-Beam Computed Tomographic Scheme Based on Simultaneous Motion Estimation and Image Reconstruction

Purpose: To evaluate the performance of a 4-dimensional (4-D) cone-beam computed tomographic (CBCT) reconstruction scheme based on simultaneous motion estimation and image reconstruction (SMEIR) through patient studies. Methods and Materials: The SMEIR algorithm contains 2 alternating steps: (1) motion-compensated CBCT reconstruction using projections from all phases to reconstruct a reference phase 4D-CBCT by explicitly considering the motion models between each different phase and (2) estimation of motion models directly from projections by matching the measured projections to the forward projection of the deformed reference phase 4D-CBCT. Four lung cancer patients were scanned for 4 to 6 minutes to obtain approximately 2000 projections for each patient. To evaluate the performance of the SMEIR algorithm on a conventional 1-minute CBCT scan, the number of projections at each phase was reduced by a factor of 5, 8, or 10 for each patient. Then, 4D-CBCTs were reconstructed from the down-sampled projections using Feldkamp-Davis-Kress, total variation (TV) minimization, prior image constrained compressive sensing (PICCS), and SMEIR. Using the 4D-CBCT reconstructed from the fully sampled projections as a reference, the relative error (RE) of reconstructed images, root mean square error (RMSE), and maximum error (MaxE) of estimated tumor positions were analyzed to quantify the performance of the SMEIR algorithm. Results: The SMEIR algorithm can achieve results consistent with the reference 4D-CBCT reconstructed with many more projections per phase. With an average of 30 to 40 projections per phase, the MaxE in tumor position detection is less than 1 mm in SMEIR for all 4 patients. Conclusion: The results from a limited number of patients show that SMEIR is a promising tool for high-quality 4D-CBCT reconstruction and tumor motion modeling.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Support Operators Method for the Diffusion Equation in Multiple Materials

A second-order finite difference scheme for the solution of the diffusion equation on non-uniform meshes is implemented. The method allows the heat conductivity to be discontinuous. The algorithm is formulated on a one dimensional mesh and is derived using the support operators method. A key component of the derivation is that the discrete analog of the flux operator is constructed to be the negative adjoint of the discrete divergence, in an inner product that is a discrete analog of the continuum inner product. The resultant discrete operators in the fully discretized diffusion equation are symmetric and positive definite. The algorithm is generalized to operate on meshes with cells which have mixed material properties. A mechanism to recover intermediate temperature values in mixed cells using a limited linear reconstruction is introduced. The implementation of the algorithm is verified and the linear reconstruction mechanism is compared to previous results for obtaining new material temperatures.

97 MATHEMATICS AND COMPUTING↗

Probe corrected far-field reconstruction from measurements on a cylinder: A novel formulation and efficient algorithm

A novel and numerically efficient method of far field evaluation from measurements taken on a cylinder is based on the representation of both the antenna and the probe fields as superpositions of plane waves. A system of two integral equations are established whose unknown functions are the azimuthal and elevation components of the antenna pattern and whose known terms are the set of measurement data taken with two different probes - the second probe in most practical instances being simply the same probe with a different geometrical orientation. The equations express the known data - for each angular position of the antenna under measurement - as the integrals of the products of the corresponding components of the unknown antenna and known probe patterns multiplied by a phase term. The convolutional nature of the integral equations makes their solutions straight-forward. If, as is virtually always the case, the probe is small or of moderate size so that the axis of rotation of the antenna mount is in the far field of the probe, the intervention of asymptotic techniques makes the solution numerically very efficient. The agreement of calculated and experimental patterns is excellent.

Borgiotti, G. V.↗

Impact and mitigation of angular uncertainties in Bragg coherent x-ray diffraction imaging

Bragg coherent diffraction imaging (BCDI) is a powerful technique to explore the local strain state and morphology of microscale crystals. The method can potentially reach nanometer-scale spatial resolution thanks to the advances in synchrotron design that dramatically increase coherent flux. However, there are experimental bottlenecks that may limit the image reconstruction quality from future high signal-to-noise ratio measurements. In this work we show that angular uncertainty of the sample orientation with respect to a fixed incoming beam is one example of such a factor, and we present a method to mitigate the resulting artifacts. On the basis of an alternative formulation of the forward problem, we design a phase retrieval algorithm which enables the simultaneous reconstruction of the object and determination of the exact angular position corresponding to each diffraction pattern in the data set. We have tested the algorithm performance on simulated data for different degrees of angular uncertainty and signal-to-noise ratio.

36 MATERIALS SCIENCE↗

Development of online pulse-finding algorithms for the Mu2e Stopping Target Monitor and an evaluation of the signal to background ratio for the Mu2e stopped-muon rate determination

This thesis presents a determination of the acceptance of the Mu2e Stopping Target Monitor (STM) detector for both signal and background events. The rate of X-rays of a specific energy in the STM is used to determine the rate of stopped muons in the aluminium stopping target, which is used as the normalisation for all Mu2e measurements, particularly the branching ratio for a charged lepton flavour violating (cLFV) process. The acceptance for the 347\,keV $2p-1s$ aluminium signal X-ray is determined to be $(8.03 \pm 0.05) \times 10^{-10}$\,cm$^{-2}$ and the acceptance for the background photons (at 347\,keV) to be $(3.19 \pm 0.21) \times 10^{-8}$\,cm$^{-2}$. This results in a signal-to-background ratio of approximately two which is significantly higher than had previously been estimated. These signal-to-background rates are used to determine the time required to achieve a statistical uncertainty of 10\% on the number of 347\,keV X-rays as a function of the detector resolution and back ground rate. For a resolution of 2\,keV, and the background rate determined in this thesis, approximately one minute of data is required. The three corrections needed to be applied to the measured 347\,keV rate to determine the rate of stopped muons are also determined and potential sources of bias arising from the background shape, background fit range and energy calibration are investigated and found to be insignificant. The raw energy of the particles in the STM detector comes from a 16-bit ADC digitising at $\sim 300$\,MHz. It is not possible to store all the raw digitisations and online algorithms have been developed to rapidly select pulses in the detector and reconstruct their energy. The performance of these algorithms has been characterised with simulated data as a function of detector rate and resolution and optimum operating points for the algorithms have been defined. The integrity of the algorithms has also been demonstrated and characterised on test-beam data at high r ates and with radioactive sources at low rates.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Parallelizing the Unpacking and Clustering of Detector Data for Reconstruction of Charged Particle Tracks on Multi-core CPUs and Many-core GPUs

We present results from parallelizing the unpacking and clustering steps of the raw data from the silicon strip modules for reconstruction of charged particle tracks. Throughput is further improved by concurrently processing multiple events using nested OpenMP parallelism on CPU or CUDA streams on GPU. The new implementation along with earlier work in developing a parallelized and vectorized implementation of the combinatoric Kalman filter algorithm has enabled efficient global reconstruction of the entire event on modern computer architectures. We demonstrate the performance of the new implementation on Intel Xeon and NVIDIA GPU architectures.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Expediting model-based optoacoustic reconstructions with tomographic symmetries

Purpose: Image quantification in optoacoustic tomography implies the use of accurate forward models of excitation, propagation, and detection of optoacoustic signals while inversions with high spatial resolution usually involve very large matrices, leading to unreasonably long computation times. The development of fast and memory efficient model-based approaches represents then an important challenge to advance on the quantitative and dynamic imaging capabilities of tomographic optoacoustic imaging. Methods: Herein, a method for simplification and acceleration of model-based inversions, relying on inherent symmetries present in common tomographic acquisition geometries, has been introduced. The method is showcased for the case of cylindrical symmetries by using polar image discretization of the time-domain optoacoustic forward model combined with efficient storage and inversion strategies. Results: The suggested methodology is shown to render fast and accurate model-based inversions in both numerical simulations andpost mortem small animal experiments. In case of a full-view detection scheme, the memory requirements are reduced by one order of magnitude while high-resolution reconstructions are achieved at video rate. Conclusions: By considering the rotational symmetry present in many tomographic optoacoustic imaging systems, the proposed methodology allows exploiting the advantages of model-based algorithms with feasible computational requirements and fast reconstruction times, so that its convenience and general applicability in optoacoustic imaging systems with tomographic symmetries is anticipated.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Distributed Stochastic Optimization of a Neural Representation Network for Time-Space Tomography Reconstruction

4D time-space reconstruction of dynamic events or deforming objects using X-ray computed tomography (CT) is an important inverse problem in non-destructive evaluation. Conventional back-projection based reconstruction methods assume that the object remains static for the duration of several tens or hundreds of X-ray projection measurement images (reconstruction of consecutive limited-angle CT scans). However, this is an unrealistic assumption for many in-situ experiments that causes spurious artifacts and inaccurate morphological reconstructions of the object. To solve this problem, we propose to perform a 4D time-space reconstruction using a distributed implicit neural representation (DINR) network that is trained using a novel distributed stochastic training algorithm. Our DINR network learns to reconstruct the object at its output by iterative optimization of its network parameters such that the measured projection images best match the output of the CT forward measurement model. Here, we use a forward measurement model that is a function of the DINR outputs at a sparsely sampled set of continuous valued 4D object coordinates. Unlike previous neural representation architectures that forward and back propagate through dense voxel grids that sample the object's entire time-space coordinates, we only propagate through the DINR at a small subset of object coordinates in each iteration resulting in an order-of-magnitude reduction in memory and compute for training. DINR leverages distributed computation across several compute nodes and GPUs to produce high-fidelity 4D time-space reconstructions. We use both simulated parallel-beam and experimental cone-beam X-ray CT datasets to demonstrate the superior performance of our approach.

36 MATERIALS SCIENCE↗