Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 289 records · Page 16

Effects of photon noise on speckle image reconstruction with the Knox-Thompson algorithm

An analysis of the effects of photon noise on astronomical speckle image reconstruction using the Knox-Thompson algorithm is presented. It is shown that the quantities resulting from the speckle average arre biased, but that the biases are easily estimated and compensated. Calculations are also made of the convergence rate for the speckle average as a function of the source brightness. An illustration of the effects of photon noise on the image recovery process is included.

Nisenson, P.↗

Acoustic Tomography of the Atmosphere: A Large-Eddy Simulation Sensitivity Study

Accurate measurement of atmospheric turbulent fluctuations is critical for understanding environmental dynamics and improving models in applications such as wind energy. Advanced remote sensing technologies are essential for capturing instantaneous velocity and temperature fluctuations. Acoustic tomography (AT) offers a promising approach that utilizes sound travel times between an array of transducers to reconstruct turbulence fields. This study presents a systematic evaluation of the time-dependent stochastic inversion (TDSI) algorithm for AT using synthetic travel-time measurements derived from large-eddy simulation (LES) fields under both neutral and convective atmospheric boundary-layer conditions. Unlike prior work that relied on field observations or idealized fields, the LES framework provides a ground-truth atmospheric state, enabling quantitative assessment of TDSI retrieval reliability, sensitivity to travel-time measurement noise, and dependence on covariance model parameters and temporal data integration. A detailed sensitivity analysis was conducted to determine the best-fit model parameters, identify the tolerance thresholds for parameter mismatch, and establish a maximum spatial resolution. The TDSI algorithm successfully reconstructed large-scale velocity and temperature fluctuations with root mean square errors ( RMSE s) below 0.35 m/s and 0.12 K, respectively. Spectral analysis established a maximum spatial resolution of approximately 1.4 m, and reconstructions remained robust for travel-time measurement uncertainties up to 0.002 s. These findings provide critical insights into the operational limits of TDSI and inform future applications of AT for atmospheric turbulence characterization and system design.

17 WIND ENERGY↗

Going the Distance: Mapping Host Galaxies of LIGO and VIRGO Sources in Three Dimensions using Local Cosmography and Targeted Follow-Up

The Advanced Laser Interferometer Gravitational-wave Observatory (LIGO) discovered gravitational waves (GWs) from a binary black hole merger in 2015 September and may soon observe signals from neutron star mergers. There is considerable interest in searching for their faint and rapidly fading electromagnetic (EM) counterparts, though GW position uncertainties are as coarse as hundreds of square degrees. Because LIGO's sensitivity to binary neutron stars is limited to the local universe, the area on the sky that must be searched could be reduced by weighting positions by mass, luminosity, or star formation in nearby galaxies. Since GW observations provide information about luminosity distance, combining the reconstructed volume with positions and redshifts of galaxies could reduce the area even more dramatically. A key missing ingredient has been a rapid GW parameter estimation algorithm that reconstructs the full distribution of sky location and distance. We demonstrate the first such algorithm, which takes under a minute, fast enough to enable immediate EM follow-up. By combining the three-dimensional posterior with a galaxy catalog, we can reduce the number of galaxies that could conceivably host the event by a factor of 1.4, the total exposure time for the Swift X-ray Telescope by a factor of 2, the total exposure time for a synoptic optical survey by a factor of 2, and the total exposure time for a narrow-field optical telescope by a factor of 3. This encourages us to suggest a new role for small field of view optical instruments in performing targeted searches of the most massive galaxies within the reconstructed volumes.

catalogs – galaxies: distances and redshifts –↗

Sparse optimization of two-dimensional terahertz spectroscopy

Two-dimensional terahertz spectroscopy (2DTS) is a low-frequency analog of two-dimensional optical spectroscopy that is rapidly maturing as a probe of a wide variety of condensed matter systems. However, a persistent problem with 2DTS is the long experimental acquisition times, which prevent its broader adoption. A potential solution, requiring no increase in experimental complexity, is signal reconstruction via compressive sensing. In this work, we apply the sparse exponential mode analysis (SEMA) technique to 2DTS of a cuprate superconductor. We benchmark the performance of the algorithm in reconstructing terahertz nonlinearities and find that SEMA reproduces the asymmetric photon echo line shapes at sampling rates as low as 10%, reaching the reconstruction noise floor at sampling rates beyond 20%–30%. The success of SEMA in reproducing such subtle, asymmetric line shapes confirms compressive sensing as a general method to accelerate 2DTS and multidimensional spectroscopies more broadly.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Abel Inversion of Deflectometric Measurements in Dynamic Flows

We present an Abel-inversion algorithm to reconstruct mean and rms refractive-index profiles from spatially resolved statistical measurements of the beam-deflection angle in time-dependent, axisymmetric flows. An oscillating gas-jet diffusion flame was investigated as a test case for applying the algorithm. Experimental data were obtained across the whole field by a rainbow schlieren apparatus. Results show that simultaneous multipoint measurements are necessary to reconstruct the rms refractive index accurately.

Agrawal, Ajay K.↗

The New CCSDS Image Compression Recommendation

The Consultative Committee for Space Data Systems (CCSDS) data compression working group has recently adopted a recommendation for image data compression, with a final release expected in 2005. The algorithm adopted in the recommendation consists of a two-dimensional discrete wavelet transform of the image, followed by progressive bit-plane coding of the transformed data. The algorithm can provide both lossless and lossy compression, and allows a user to directly control the compressed data volume or the fidelity with which the wavelet-transformed data can be reconstructed. The algorithm is suitable for both frame-based image data and scan-based sensor data, and has applications for near-Earth and deep-space missions. The standard will be accompanied by free software sources on a future web site. An Application-Specific Integrated Circuit (ASIC) implementation of the compressor is currently under development. This paper describes the compression algorithm along with the requirements that drove the selection of the algorithm. Performance results and comparisons with other compressors are given for a test set of space images.

Yeh, Pen-Shu↗

The New CCSDS Image Compression Recommendation

The Consultative Committee for Space Data Systems (CCSDS) data compression working group has recently adopted a recommendation for image data compression, with a final release expected in 2005. The algorithm adopted in the recommendation consists a two dimensional discrete wavelet transform of the image, followed by progressive bit-plane coding of the transformed data. The algorithm can provide both lossless and lossy compression, and allows a user to directly control the compressed data volume or the fidelity with which the wavelet-transformed data can be reconstructed. The algorithm is suitable for both frame-based image data and scan-based sensor data, and has applications for near-earth and deep-space missions. The standard will be accompanied by free software sources on a future web site. An ASIC implementation of the compressor is currently under development. This paper describes the compression algorithm along with the requirements that drove the selection of the algorithm.

image compression↗

Reconstruction of fast neutron direction in segmented organic detectors using deep learning

A method for reconstructing the direction of a fast neutron source using a segmented organic scintillator-based detector and deep learning model is proposed and analyzed. Here, the model is based on recurrent neural network, which can be trained by a sequence of data obtained from an event recorded in the detector and suitably pre-processed. The performance of deep learning-based model is compared with the conventional double-scatter detection algorithm in reconstructing the direction of a fast neutron source. With the deep learning model, the uncertainty in source direction of 0.301 rad is achieved with 100 neutron detection events in a segmented cubic organic scintillator detector with a side length of 46 mm. To reconstruct the source direction with the same angular resolution as the double-scatter algorithm, the deep learning method requires 75% fewer events. Application of this method could augment the operation of segmented detectors operated in the neutron scatter camera configuration for applications such as special nuclear material detection.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

GPU-accelerated multitiered iterative phasing algorithm for fluctuation X-ray scattering

The multitiered iterative phasing (MTIP) algorithm is used to determine the biological structures of macromolecules from fluctuation scattering data. It is an iterative algorithm that reconstructs the electron density of the sample by matching the computed fluctuation X-ray scattering data to the external observations, and by simultaneously enforcing constraints in real and Fourier space. This paper presents the first ever MTIP algorithm acceleration efforts on contemporary graphics processing units (GPUs). The Compute Unified Device Architecture (CUDA) programming model is used to accelerate the MTIP algorithm on NVIDIA GPUs. The computational performance of the CUDA-based MTIP algorithm implementation outperforms the CPU-based version by an order of magnitude. Furthermore, the Heterogeneous-Compute Interface for Portability (HIP) runtime APIs are used to demonstrate portability by accelerating the MTIP algorithm across NVIDIA and AMD GPUs.

97 MATHEMATICS AND COMPUTING↗

ICER-3D Hyperspectral Image Compression Software

Software has been developed to implement the ICER-3D algorithm. ICER-3D effects progressive, three-dimensional (3D), wavelet-based compression of hyperspectral images. If a compressed data stream is truncated, the progressive nature of the algorithm enables reconstruction of hyperspectral data at fidelity commensurate with the given data volume. The ICER-3D software is capable of providing either lossless or lossy compression, and incorporates an error-containment scheme to limit the effects of data loss during transmission. The compression algorithm, which was derived from the ICER image compression algorithm, includes wavelet-transform, context-modeling, and entropy coding subalgorithms. The 3D wavelet decomposition structure used by ICER-3D exploits correlations in all three dimensions of sets of hyperspectral image data, while facilitating elimination of spectral ringing artifacts, using a technique summarized in "Improving 3D Wavelet-Based Compression of Spectral Images" (NPO-41381), NASA Tech Briefs, Vol. 33, No. 3 (March 2009), page 7a. Correlation is further exploited by a context-modeling subalgorithm, which exploits spectral dependencies in the wavelet-transformed hyperspectral data, using an algorithm that is summarized in "Context Modeler for Wavelet Compression of Hyperspectral Images" (NPO-43239), which follows this article. An important feature of ICER-3D is a scheme for limiting the adverse effects of loss of data during transmission. In this scheme, as in the similar scheme used by ICER, the spatial-frequency domain is partitioned into rectangular error-containment regions. In ICER-3D, the partitions extend through all the wavelength bands. The data in each partition are compressed independently of those in the other partitions, so that loss or corruption of data from any partition does not affect the other partitions. Furthermore, because compression is progressive within each partition, when data are lost, any data from that partition received prior to the loss can be used to reconstruct that partition at lower fidelity. By virtue of the compression improvement it achieves relative to previous means of onboard data compression, this software enables (1) increased return of hyperspectral scientific data in the presence of limits on the rates of transmission of data from spacecraft to Earth via radio communication links and/or (2) reduction in spacecraft radio-communication power and/or cost through reduction in the amounts of data required to be downlinked and stored onboard prior to downlink. The software is also suitable for compressing hyperspectral images for ground storage or archival purposes.

Xie, Hua↗

Inference of response functions with the help of machine-learning algorithms

Response functions are a key quantity to describe the near-equilibrium dynamics of strongly interacting many-body systems. Recent techniques that attempt to overcome the challenges of calculating these ab initio have employed expansions in terms of orthogonal polynomials. We employ a neural network prediction algorithm to reconstruct a response function 𝑆⁡(𝜔) defined over a range in frequencies 𝜔. Here, we represent the calculated response function as a truncated Chebyshev series whose coefficients can be optimized to reduce the representation error. We compare the quality of response functions obtained using coefficients calculated using a neural network (NN) algorithm with those computed using the Gaussian integral transform (GIT) method. In the regime where only a small number of terms in the Chebyshev series are retained, we find that the NN scheme outperforms the GIT method.

Kurkcuoglu, Doga Murat [Fermi National Accelerator↗

Variational approach to quantum state tomography based on maximal entropy formalism

Quantum state tomography is an integral part of quantum computation and offers the starting point for the validation of various quantum devices. One of the central tasks in the field of state tomography is to reconstruct, with high fidelity, the quantum states of a quantum system. From an experiment on a real quantum device, one can obtain the mean measurement values of different operators. With such data as input, in this report we employ the maximal entropy formalism to construct the least biased mixed quantum state that is consistent with the given set of expectation values. Even though, in principle, the reported formalism is quite general and should work for an arbitrary set of observables, in practice we shall demonstrate the efficacy of the algorithm on an informationally complete (IC) set of Hermitian operators. Such a set possesses the advantage of uniquely specifying a single quantum state from which the experimental measurements have been sampled and hence renders the rare opportunity not only to construct a least-biased quantum state but even replicate the exact state prepared experimentally within a preset tolerance. Here, the primary workhorse of the algorithm is reconstructing an energy function which we designate as the effective Hamiltonian of the system, and parameterizing it with Lagrange multipliers, according to the formalism of maximal entropy. These parameters are thereafter optimized variationally so that the reconstructed quantum state of the system converges to the true quantum state within an error threshold. To this end, we employ a parameterized quantum circuit and a hybrid quantum-classical variational algorithm to obtain such a target state, making our recipe easily implementable on a near-term quantum device.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Elastic and resonance structures of the nucleon from the hadronic tensor in lattice QCD: Implications for neutrino-nucleon scattering and hadron physics

We compute the Euclidean hadronic tensor from charge density operators and extract elastic and resonance structures by employing exponential fits to the four-point function correlator, as well as a Bayesian reconstruction inverse algorithm to obtain the corresponding spectral density for qualitative comparison. We present the determination of the nucleon’s Sachs electric form factor using the hadronic tensor formalism and verify that it is consistent with that from the conventional three-point function calculation. Beyond the elastic peak, we observe a structure located approximately 0.5–0.7 GeV above the nucleon mass in the Bayesian reconstruction. This structure is interpreted as a mixture of the Roper resonance [𝑁⁡(1440)], and states with both positive and negative parities in this mass region, as well as multihadron states. Assuming the observed structure is dominated by 𝐽 𝑃 = 1/2 ± states, we extract the transition electric form factor 𝐺$^*_𝐸$⁡(𝑄 2 ) and the corresponding longitudinal helicity amplitude 𝑆 1/2 ⁡(𝑄 2 ), and compare them with those determined from the CLAS experimental data of nucleon-to-Roper transition. Although fitting to the four-point correlation function or using the inverse algorithm does not resolve individual resonances, it nevertheless enables the determination of total inclusive lepton–nucleon scattering cross sections in appropriate energy bins. This lattice QCD calculation presents the first major step toward studying the inclusive 𝑁 → 𝑋 contributions within the hadronic tensor formalism.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Physics-assisted generative adversarial network for X-ray tomography

X-ray tomography is capable of imaging the interior of objects in three dimensions non-invasively, with applications in biomedical imaging, materials science, electronic inspection, and other fields. The reconstruction process can be an ill-conditioned inverse problem, requiring regularization to obtain satisfactory results. Recently, deep learning has been adopted for tomographic reconstruction. Unlike iterative algorithms which require a distribution that is known a priori , deep reconstruction networks can learn a prior distribution through sampling the training distributions. In this work, we develop a Physics-assisted Generative Adversarial Network (PGAN), a two-step algorithm for tomographic reconstruction. In contrast to previous efforts, our PGAN utilizes maximum-likelihood estimates derived from the measurements to regularize the reconstruction with both known physics and the learned prior. Compared with methods with less physics assisting in training, PGAN can reduce the photon requirement with limited projection angles to achieve a given error rate. The advantages of using a physics-assisted learned prior in X-ray tomography may further enable low-photon nanoscale imaging.

47 OTHER INSTRUMENTATION↗

Information content of and the ability to reconstruct dichroic X-ray tomography and laminography

Dichroic tomography is a 3D imaging technique in which the polarization of the incident beam is used to induce contrast due to the magnetization or orientation of a sample. The aim is to reconstruct not only the optical density but the dichroism of the sample. The theory of dichroic tomographic and laminographic imaging in the parallel-beam case is discussed as well as the problem of reconstruction of the sample’s optical properties. The set of projections resulting from a single tomographic/laminographic measurement is not sufficient to reconstruct the magnetic moment for magnetic circular dichroism unless additional constraints are applied or data are taken at two or more tilt angles. For linear dichroism, three polarizations at a common tilt angle are insufficient for unconstrained reconstruction. However, if one of the measurements is done at a different tilt angle than the other, or the measurements are done at a common polarization but at three distinct tilt angles, then there is enough information to reconstruct without constraints. Possible means of applying constraints are discussed. Furthermore, it is shown that for linear dichroism, the basic assumption that the absorption through a ray path is the integral of the absorption coefficient, defined on the volume of the sample, along the ray path, is not correct when dichroism or birefringence is strong. This assumption is fundamental to tomographic methods. An iterative algorithm for reconstruction of linear dichroism is demonstrated on simulated data.

Marcus, Matthew A. (ORCID:0000000325277586)↗

Semi-Analytic Reconstruction of Flux in Finite Volume Formulations

Semi-analytic reconstruction uses the analytic solution to a second-order, steady, ordinary differential equation (ODE) to simultaneously evaluate the convective and diffusive flux at all interfaces of a finite volume formulation. The second-order ODE is itself a linearized approximation to the governing first- and second- order partial differential equation conservation laws. Thus, semi-analytic reconstruction defines a family of formulations for finite volume interface fluxes using analytic solutions to approximating equations. Limiters are not applied in a conventional sense; rather, diffusivity is adjusted in the vicinity of changes in sign of eigenvalues in order to achieve a sufficiently small cell Reynolds number in the analytic formulation across critical points. Several approaches for application of semi-analytic reconstruction for the solution of one-dimensional scalar equations are introduced. Results are compared with exact analytic solutions to Burger s Equation as well as a conventional, upwind discretization using Roe s method. One approach, the end-point wave speed (EPWS) approximation, is further developed for more complex applications. One-dimensional vector equations are tested on a quasi one-dimensional nozzle application. The EPWS algorithm has a more compact difference stencil than Roe s algorithm but reconstruction time is approximately a factor of four larger than for Roe. Though both are second-order accurate schemes, Roe s method approaches a grid converged solution with fewer grid points. Reconstruction of flux in the context of multi-dimensional, vector conservation laws including effects of thermochemical nonequilibrium in the Navier-Stokes equations is developed.

Gnoffo, Peter A.↗

3D Shape Reconstruction of Small Bodies from Sparse Features

The autonomous approach of spacecraft to a small body (comet or asteroid) relies on using all available information at each phase of the approach. This paper presents new algorithms for global shape reconstructions from sparse tracked surface points. These methods leverage estimates from earlier phases, such as rotation pole, as well as a priori knowledge, such as a genus-0 body (i.e. without boundaries or topological holes). A mapping algorithm is proposed, which performs faithful reconstructions while enforcing genus-0 output through spherical parameterization. To estimate the shape of permanently shadowed regions of the body, a symmetry reconstruction method is added to the reconstruction algorithms. This method is shown to substantially increase the reconstruction accuracy but is subject to the symmetry of the body perpendicular to the rotation pole. The proposed mapping algorithm is compared to stateof- the-practice surface reconstruction algorithms, assessing their accuracy and ability to correctly generate genus-0 shape models for 2400 datasets and three small bodies. The proposed spherical parameterization algorithm performed consistently with the state-of-the-practice while being the only algorithm to always produce genus-0 shape models.

Nesnas, Issa↗

Low-energy Electron-track Imaging for a Liquid Argon Time-projection-chamber Telescope Concept Using Probabilistic Deep Learning

The GammaTPC is an MeV-scale single-phase liquid argon time-projection-chamber gamma-ray telescope concept with a novel dual-scale pixel-based charge-readout system. It promises to enable a significant improvement in sensitivity to MeV-scale gamma rays over previous telescopes. The novel pixel-based charge readout allows for imaging of the tracks of electrons scattered by Compton interactions of incident gamma rays. The two primary contributors to the accuracy of a Compton telescope in reconstructing an incident gamma-ray’s original direction are its energy and position resolution. In this work, we focus on using deep learning to optimize the reconstruction of the initial position and direction of electrons scattered in Compton interactions, including using probabilistic models to estimate predictive uncertainty. We show that the deep-learning models are able to predict locations of Compton scatters of MeV-scale gamma rays from simulated 500 μm pixel-based data to better than 1 mm rms error and are sensitive to the initial direction of the scattered electron. We compare and contrast different deep-learning uncertainty estimation algorithms for reconstruction applications. Additionally, we show that event-by-event estimates of the uncertainty of the locations of the Compton scatters can be used to select those events that were reconstructed most accurately, leading to improvement in locating the origin of gamma-ray sources on the sky.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗