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 631 records · Page 35

In situ Detection of Plasma Induced Surface Interaction based on Deep Learning based Visual Diagnostics (Technical Report)

It is characteristic for many plasma devices to undergo plasma-material interaction leading to surface erosion. These processes, often not easily detectable, lead to changes in device performance and lifespan. State-of-the-art lifetime tests and wear experiments require over 1000s hours. A self-consistent model for accurately predicting the erosion's effects is not available. In situ detection of these processes is not a trivial task since the surface variations at the early stages have a micron scale. Such limitations not only restrict testing and prediction capabilities but also slow the development of new thrusters and limit mission duration. To address these challenges, an in-situ diagnostic for real-time erosion assessment has been developed, aiming to expedite lifetime testing and broaden experimental campaigns. Several works were dedicated to real-time and in situ monitoring of material erosion during plasma exposure using laser holography, microscopy, and with telemicroscopes. However, the applicability of these approaches is limited due to complexity, cost and less flexibility as they often require placing diagnostic equipment inside the vacuum chamber. In collaboration with Princeton Collaborative Research Facility (PCRF), Princeton Plasma Physics Laboratory (PPPL), a new diagnostic approach is developed, where geometry modifications to the ceramic channel walls were introduced that would result in accelerated channel erosion. We employed Long-distance microscope (LDM) imagery, combined with Deep-Learning based Shape from focus or depth from focus (DFF or SFF) approach, that provides an accessible and cost-effective solution. LDM employs focus variation techniques to continuously capture multiple images of the target object at distinct focal planes. DFF, an optical focus variation method, generates a 3D topographical surface depth map from a sequence of variably focused images. Combined with the developed diagnostic, this approach offers a controllable means to study erosion under accelerated conditions. In this work, we develop Neural Network-based DFF algorithm applicable for LDM data to quantitatively evaluate plasma induced surface modification from LDM data. Next, we develop Deep Learning-based super-resolution depth map image reconstruction technique to increase the resolution of depth maps obtained from DFF algorithm to improve the accuracy of erosion measurements. Thirdly, we develop several image processing techniques to remove noise and improve the quality of depth map image. Here we report the results of initial tests for this approach. An experimental setup designed and built in PPPL was employed that consists of a 3-cm gridded ion source that produces a neutralized argon beam with energies up to 600 eV. A hexagonal boron nitride (h-BN) ceramic target, designed based on computational predictions, was used. Tests were conducted to reconstruct the complex geometry of the target under the lighting conditions of the operated ion source.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Livermore tomography tools: Accurate, fast, and flexible software for tomographic science

Livermore Tomography Tools (LTT) is a customizable scientific software package that enables a broad range of research and development efforts into computed tomography (CT). Here, it was developed to process x-ray and neutron CT data accurately and rapidly from raw detector counts to reconstructed volumes with the flexibility to handle many special cases. LTT fulfills long-term CT software goals to provide quantitatively accurate results reported in physical units (e.g., mm -1 or cm -1 ) while exploiting all available computational advantages to maximize speed. Written in C/C++ with support for multiple CPUs and GPUs, LTT runs on many computing platforms (Linux/Unix, Windows, and Mac; laptops to supercomputers). As a result, LTT can:process data acquired from various custom-built and commercially available CT scanners, model and simulate x-ray and neutron interactions to encourage algorithm prototyping, and allow for rapid insertion of the latest algorithms.We describe LTT’s software architecture, user interfaces, and its 88 algorithms (as of this writing) for pre-processing, reconstruction, post-processing, and simulation that support many scanner geometries (parallel-, fan-, cone-beam, and custom). Several applications are presented that illustrate LTT’s accuracy, speed, and flexibility relative to other solutions.

36 MATERIALS SCIENCE↗

Efficient ptychographic phase retrieval via a matrix-free Levenberg-Marquardt algorithm

The phase retrieval problem, where one aims to recover a complex-valued image from far-field intensity measurements, is a classic problem encountered in a range of imaging applications. Modern phase retrieval approaches usually rely on gradient descent methods in a nonlinear minimization framework. Calculating closed-form gradients for use in these methods is tedious work, and formulating second order derivatives is even more laborious. Additionally, second order techniques often require the storage and inversion of large matrices of partial derivatives, with memory requirements that can be prohibitive for data-rich imaging modalities. We use a reverse-mode automatic differentiation (AD) framework to implement an efficient matrix-free version of the Levenberg-Marquardt (LM) algorithm, a longstanding method that finds popular use in nonlinear least-square minimization problems but which has seen little use in phase retrieval. Furthermore, we extend the basic LM algorithm so that it can be applied for more general constrained optimization problems (including phase retrieval problems) beyond just the least-square applications. Since we use AD, we only need to specify the physics-based forward model for a specific imaging application; the first and second-order derivative terms are calculated automatically through matrix-vector products, without explicitly forming the large Jacobian or Gauss-Newton matrices typically required for the LM method. We demonstrate that this algorithm can be used to solve both the unconstrained ptychographic object retrieval problem and the constrained “blind” ptychographic object and probe retrieval problems, under the popular Gaussian noise model as well as the Poisson noise model. We compare this algorithm to state-of-the-art first order ptychographic reconstruction methods to demonstrate empirically that this method outperforms best-in-class first-order methods: it provides excellent convergence guarantees with (in many cases) a superlinear rate of convergence, all with a computational cost comparable to, or lower than, the tested first-order algorithms.

36 MATERIALS SCIENCE↗

Sensitivity of modelled passive margin stratigraphy to variations in sea level, sediment supply and subsidence

Abstract We produced a 10 Myr synthetic stratigraphic section using a forward stratigraphic model that generates marine deltaic stratigraphy over geological timescales. We recursively fit the model using a Bayesian inversion algorithm to test: (1) if it could be accurately reconstructed; (2) if the parameters used to create it could be recovered; and (3) the sensitivity of the model output to given model parameters and the attendant physical processes. The original synthetic stratigraphic section was produced with cyclical sea‐level variations of 40 and 30 m with 2.4 and 10 Myr periods respectively. Sediment was also supplied cyclically, in 2.4 and 10 Myr cycles with amplitudes of 30 and 80 tons/100 kyr, respectively, varying from a mean of 232 tons/100 kyr. Parameter values were sampled to fit the model using a Markov chain Monte Carlo algorithm, resulting in a ±5 m (1σ) variation between the experimental output and the original. Sea level varied by ±7 m (1σ) within the posterior distribution of parameters. As a result, both the 10 Myr and 2.4 Myr sea‐level cycles could be extracted from the original output. The variation in sediment supply was approximately ±38 tons/100 kyr (1σ) and, as a result, only the larger long‐term supply variations could be accurately recovered in refitting the model. The variation in thermal, flexural and total subsidence across those parameter sets is less than ±10 m (1σ). The original section experienced 150 m of total subsidence at the depocentre. Our results demonstrate the distinct and interpretable imprint of sea level and subsidence on continental margin stratigraphy can be quantified. Moreover, we conclude that sea‐level change produces a defined effect on the geometries of stratigraphic architecture, and that techniques applied for the purpose of delineating sea‐level variation from continental margin strata have a well‐founded conceptual basis.

Schmelz, William J.↗

Joint iterative reconstruction and 3D rigid alignment for X-ray tomography

X-ray tomography is widely used for three-dimensional structure determination in many areas of science, from the millimeter to the nanometer scale. The resolution and quality of the 3D reconstruction is limited by the availability of alignment parameters that correct for the mechanical shifts of the sample or sample stage for the images that constitute a scan. In this paper we describe an algorithm for marker-free, fully automated and accurately aligned and reconstructed X-ray tomography data. Our approach solves the tomographic reconstruction jointly with projection data alignment based on a rigid-body deformation model. We demonstrate the robustness of our method on both synthetic phantom and experimental data and show that our method is highly efficient in recovering relatively large alignment errors without prior knowledge of a low resolution approximation of the 3D structure or a reasonable estimate of alignment parameters.

36 MATERIALS SCIENCE↗

An Image Processing Algorithm Based On FMAT

Information deleted in ways minimizing adverse effects on reconstructed images. New grey-scale generalization of medial axis transformation (MAT), called FMAT (short for Fuzzy MAT) proposed. Formulated by making natural extension to fuzzy-set theory of all definitions and conditions (e.g., characteristic function of disk, subset condition of disk, and redundancy checking) used in defining MAT of crisp set. Does not need image to have any kind of priori segmentation, and allows medial axis (and skeleton) to be fuzzy subset of input image. Resulting FMAT (consisting of maximal fuzzy disks) capable of reconstructing exactly original image.

Wang, Lui↗

An unsupervised machine-learning checkpoint-restart algorithm using Gaussian mixtures for particle-in-cell simulations

We propose an unsupervised machine-learning checkpoint-restart (CR) algorithm for particle-in-cell (PIC) algorithms using Gaussian mixtures (GM). The algorithm compresses the particle population per spatial cell by constructing a velocity distribution function using GM. Particles are reconstructed at restart time by local resampling of the Gaussians. To guarantee fidelity of the CR process, we ensure the exact preservation of invariants such as charge, momentum, and energy for both compression and reconstruction stages, everywhere on the mesh. We also ensure the preservation of Gauss' law after particle reconstruction by exactly matching the density profile at restart time. As a result, the GM CR algorithm is shown to provide a clean, conservative restart capability while potentially affording orders of magnitude savings in input/output requirements. Here, we demonstrate the algorithm using a recently developed exactly energy- and charge-conserving PIC algorithm using both electrostatic and electromagnetic tests. The tests demonstrate not only a high-fidelity CR capability, but also its potential for enhancing the fidelity of the PIC solution for a given particle resolution.

97 MATHEMATICS AND COMPUTING↗

Single-Shot Reconstruction of Electron Beam Longitudinal Phase Space in a Laser Wakefield Accelerator

We report on a single-shot longitudinal phase-space reconstruction diagnostic for electron beams in a laser wakefield accelerator via the experimental observation of distinct periodic modulations in the angularly resolved spectra. Such modulated angular spectra arise as a result of the direct interaction between the ultrarelativistic electron beam and the laser driver in the presence of the wakefield. A constrained theoretical model for the coupled oscillator, assisted by a genetic algorithm, can recreate the experimental electron spectra and, thus, fully reconstructs the longitudinal phase-space distribution of the electron beam with a temporal resolution of approximately 1.3 fs. In particular, it reveals the slice energy spread of the electron beam, which is important to measure for applications such as x-ray free electron lasers. In our experiment, the root-mean-square energy spread retrieved is bounded at 9.9 MeV, corresponding to a 0.9%–3.0% relative spread, despite the overall GeV energy beam having approximately 100% relative energy spread.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Highly Scalable Matching Pursuit Signal Decomposition Algorithm

Matching Pursuit Decomposition (MPD) is a powerful iterative algorithm for signal decomposition and feature extraction. MPD decomposes any signal into linear combinations of its dictionary elements or atoms . A best fit atom from an arbitrarily defined dictionary is determined through cross-correlation. The selected atom is subtracted from the signal and this procedure is repeated on the residual in the subsequent iterations until a stopping criterion is met. The reconstructed signal reveals the waveform structure of the original signal. However, a sufficiently large dictionary is required for an accurate reconstruction; this in return increases the computational burden of the algorithm, thus limiting its applicability and level of adoption. The purpose of this research is to improve the scalability and performance of the classical MPD algorithm. Correlation thresholds were defined to prune insignificant atoms from the dictionary. The Coarse-Fine Grids and Multiple Atom Extraction techniques were proposed to decrease the computational burden of the algorithm. The Coarse-Fine Grids method enabled the approximation and refinement of the parameters for the best fit atom. The ability to extract multiple atoms within a single iteration enhanced the effectiveness and efficiency of each iteration. These improvements were implemented to produce an improved Matching Pursuit Decomposition algorithm entitled MPD++. Disparate signal decomposition applications may require a particular emphasis of accuracy or computational efficiency. The prominence of the key signal features required for the proper signal classification dictates the level of accuracy necessary in the decomposition. The MPD++ algorithm may be easily adapted to accommodate the imposed requirements. Certain feature extraction applications may require rapid signal decomposition. The full potential of MPD++ may be utilized to produce incredible performance gains while extracting only slightly less energy than the standard algorithm. When the utmost accuracy must be achieved, the modified algorithm extracts atoms more conservatively but still exhibits computational gains over classical MPD. The MPD++ algorithm was demonstrated using an over-complete dictionary on real life data. Computational times were reduced by factors of 1.9 and 44 for the emphases of accuracy and performance, respectively. The modified algorithm extracted similar amounts of energy compared to classical MPD. The degree of the improvement in computational time depends on the complexity of the data, the initialization parameters, and the breadth of the dictionary. The results of the research confirm that the three modifications successfully improved the scalability and computational efficiency of the MPD algorithm. Correlation Thresholding decreased the time complexity by reducing the dictionary size. Multiple Atom Extraction also reduced the time complexity by decreasing the number of iterations required for a stopping criterion to be reached. The Course-Fine Grids technique enabled complicated atoms with numerous variable parameters to be effectively represented in the dictionary. Due to the nature of the three proposed modifications, they are capable of being stacked and have cumulative effects on the reduction of the time complexity.

Christensen, Daniel↗

BigNeuron: a resource to benchmark and predict performance of algorithms for automated tracing of neurons in light microscopy datasets

BigNeuron is an open community bench-testing platform with the goal of setting open standards for accurate and fast automatic neuron tracing. We gathered a diverse set of image volumes across several species that is representative of the data obtained in many neuroscience laboratories interested in neuron tracing. Here, we report generated gold standard manual annotations for a subset of the available imaging datasets and quantified tracing quality for 35 automatic tracing algorithms. The goal of generating such a hand-curated diverse dataset is to advance the development of tracing algorithms and enable generalizable benchmarking. Together with image quality features, we pooled the data in an interactive web application that enables users and developers to perform principal component analysis, t-distributed stochastic neighbor embedding, correlation and clustering, visualization of imaging and tracing data, and benchmarking of automatic tracing algorithms in user-defined data subsets. The image quality metrics explain most of the variance in the data, followed by neuromorphological features related to neuron size. Furthermore, we observed that diverse algorithms can provide complementary information to obtain accurate results and developed a method to iteratively combine methods and generate consensus reconstructions. The consensus trees obtained provide estimates of the neuron structure ground truth that typically outperform single algorithms in noisy datasets. However, specific algorithms may outperform the consensus tree strategy in specific imaging conditions. Finally, to aid users in predicting the most accurate automatic tracing results without manual annotations for comparison, we used support vector machine regression to predict reconstruction quality given an image volume and a set of automatic tracings.

97 MATHEMATICS AND COMPUTING↗

Cost-efficient finite-volume high-order schemes for compressible magnetohydrodynamics

We present an efficient dimension-by-dimension finite-volume method which solves the adiabatic magnetohydrodynamics equations at high discretization order, using the constrained-transport approach on Cartesian grids. Results are presented up to tenth order of accuracy. The algorithmic architecture of this method is very close to that of commonly employed second-order schemes: it requires only one reconstructed value per face for each computational cell, independently of the scheme's order. This property is highly beneficial for the numerical efficiency. It results from reusing the required values already available in neighboring grid cells, in contrast to standard algorithms that require a number of reconstructions and evaluations which increases with the scheme's order of accuracy. At a given resolution, these high-order schemes present significantly less numerical dissipation than commonly employed lower-order approaches. Thus, results of comparable accuracy are achievable at a substantially coarser resolution, yielding overall performance gains. We also present a way to include physical dissipative terms: viscosity, magnetic diffusivity and cooling functions, respecting the finite-volume and constrained-transport frameworks. Benefits of this method are shown through applications in turbulent flows.

97 MATHEMATICS AND COMPUTING↗

Learning of networked spreading models from noisy and incomplete data

Recent years have seen a lot of progress in algorithms for learning parameters of spreading dynamics from both full and partial data. Some of the remaining challenges include model selection under the scenarios of unknown network structure, noisy data, missing observations in time, as well as an efficient incorporation of prior information to minimize the number of samples required for an accurate learning. Here, in this work, we introduce a universal learning method based on a scalable dynamic message-passing technique that addresses these challenges often encountered in real data. The algorithm leverages available prior knowledge on the model and on the data, and reconstructs both network structure and parameters of a spreading model. We show that a linear computational complexity of the method with the key model parameters makes the algorithm scalable to large network instances.

97 MATHEMATICS AND COMPUTING↗

A comparison of deep-learning-based inpainting techniques for experimental X-ray scattering

The implementation is proposed of image inpainting techniques for the reconstruction of gaps in experimental X-ray scattering data. The proposed methods use deep learning neural network architectures, such as convolutional autoencoders, tunable U-Nets, partial convolution neural networks and mixed-scale dense networks, to reconstruct the missing information in experimental scattering images. In particular, the recovered pixel intensities are evaluated against their corresponding ground-truth values using the mean absolute error and the correlation coefficient metrics. The results demonstrate that the proposed methods achieve better performance than traditional inpainting algorithms such as biharmonic functions. Overall, tunable U-Net and mixed-scale dense network architectures achieved the best reconstruction performance among all the tested algorithms, with correlation coefficient scores greater than 0.9980.

97 MATHEMATICS AND COMPUTING↗

TRINIDI (Time-of-Flight Resonance Imaging with Neutrons for Isotopic Density Inference)

This software is an open-source Python library that provides tools for processing hyperspectral neutron time-of-flight radiography data. This type of data allows material decomposed reconstructions to be generated with the use of material characteristic spectral responses and the algorithms provided in this code library. The software library will contain tools for pre-processing the neutron measurement data, estimating measurement system parameters, reconstructing material decomposed radiographs, and computing material decomposed computed tomography (CT). Furthermore, it will have capability to generate and process simulated neutron time-of-flight data with the goal of benchmarking and demonstrating the tools that are provided. The software will include thorough documentation and application examples.

Balke, Thilo↗

Calorimetric classification of track-like signatures in liquid argon TPCs using MicroBooNE data

The MicroBooNE liquid argon time projection chamber located at Fermilab is a neutrino experiment dedicated to the study of short-baseline oscillations, the measurements of neutrino cross sections in liquid argon, and to the research and development of this novel detector technology. Accurate and precise measurements of calorimetry are essential to the event reconstruction and are achieved by leveraging the TPC to measure deposited energy per unit length along the particle trajectory, with mm resolution. We describe the non-uniform calorimetric reconstruction performance in the detector, showing dependence on the angle of the particle trajectory. Such non-uniform reconstruction directly affects the performance of the particle identification algorithms which infer particle type from calorimetric measurements. This work presents a new particle identification method which accounts for and effectively addresses such non-uniformity. The newly developed method shows improved performance compared to previous algorithms, illustrated by a 93.7% proton selection efficiency and a 10% muon mis-identification rate, with a fairly loose selection of tracks performed on beam data. The performance is further demonstrated by identifying exclusive final states in ν μ CC interactions. While developed using MicroBooNE data and simulation, this method is easily applicable to future LArTPC experiments, such as SBND, ICARUS, and DUNE.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Medium-induced modification of groomed and ungroomed jet mass and angularities in Pb–Pb collisions at $\sqrt{s_{NN}}$ = 5.02 TeV

The ALICE Collaboration presents a new suite of jet substructure measurements in Pb–Pb and pp collisions at a center-of-mass energy per nucleon pair $\sqrt{s_{NN}}$ = 5.02 TeV. These measurements provide access to the internal structure of jets via the momentum and angle of their constituents, probing how the quark–gluon plasma modifies jets, an effect known as jet quenching. Jet grooming additionally removes soft wide-angle radiation to enhance perturbative accuracy and reduce experimental uncertainties. We report the groomed and ungroomed jet mass m jet and jet angularities λ$^{κ}_{α}$ using κ = 1 and α > 0. Charged-particle jets are reconstructed at midrapidity using the anti-k T algorithm with resolution parameter R = 0.2. A narrowing of the jet mass and angularity distributions in Pb–Pb collisions with respect to pp is observed and is enhanced for groomed results, confirming modification of the jet core. By using consistent jet definitions and kinematic cuts between the mass and angularities for the first time, previous inconsistencies in the interpretation of quenching measurements are resolved, rectifying a hurdle for understanding how jet quenching arises from first principles and highlighting the importance of a well-controlled baseline. These results are compared with a variety of theoretical models of jet quenching, providing constraints on jet energy-loss mechanisms in the quark–gluon plasma.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Flow and heat transfer in the wake of a triangular arrangement of spheres

This research work seeks to investigate the influence of spacing and heat transfer on the wake behavior of a triangular arrangement of spheres. Four experimental configurations have been investigated at three Reynolds numbers, Re 1 = 350, Re 2 = 700, and Re 3 = 1050. Two isothermal cases were investigated with spacing between the spheres of zero and one sphere diameter, and two cases were investigated with an applied heat flux at the same spacing conditions. The time resolved particle image velocimetry results revealed various flow phenomena including flow separations, von Karman vortex shedding, and Kelvin–Helmholtz instabilities. The turbulent statistics reveal the effect of proximity and heat transfer on the time averaged values of the wake size, turbulent strengths, and Reynolds shear stress in the wake of each sphere, namely, the laminarization effects from the addition of heat and the suppression of the lead sphere wake from the proximity of the trailing spheres. These results are complemented by the application of proper orthogonal decomposition (POD) to the flow fields, which extracts the coherent structures from the flow. Here the modes that describe the coherent structures are extracted and described in detail, which provide further insight into effects of the experimental conditions on the temporal behavior of the flow. Many of the low order modes are found to be associated in pairs, corresponding to asymmetric structures or advection of a given structure downstream. The capability of POD to produce reduced order models of the flow is then utilized to facilitate vortex identification analysis. A turbulent kinetic energy based mode truncation criteria, which has been found to enhance vortex identification capability, is applied to select the POD modes and temporal coefficients to be used in the reduced order modeling. The reconstructed velocity fields are then analyzed with vortex identification algorithms to extract the vortex cores and boundaries. The combination of these approaches allows the study of the effect of proximity and heat transfer on the vortex characteristics, such as size, strength, and distribution.

42 ENGINEERING↗

Retrieval of energy spectra for all flavours of neutrinos from core-collapse supernova with multiple detectors

ABSTRACT We present a new method by which to retrieve energy spectrum for all falvours of neutrinos from core-collapse supernova (CCSN). In the retrieval process, we do not assume any analytic formulas to express the energy spectrum of neutrinos but rather take a direct way of spectrum reconstruction from the observed data; the singular value decomposition algorithm with a newly developed adaptive energy-gridding technique is adopted. We employ three independent reaction channels having different flavour sensitivity to neutrinos. Two reaction channels, inverse beta decay on proton and elastic scattering on electrons, from a water Cherenkov detector such as Super-Kamiokande (SK) and Hyper-Kamiokande (HK), and a charged current reaction channel with Argon from the Deep Underground Neutrino Experiment (DUNE) are adopted. Given neutrino oscillation models, we iteratively search the neutrino energy spectra at the CCSN source until they provide the consistent event counts in the three reaction channels. We test the capability of our method by demonstrating the spectrum retrieval to a theoretical neutrino data computed by our recent three-dimensional CCSN simulation. Although the energy spectrum with either electron-type or electron-type antineutrinos at the CCSN source has relatively large error compared to that of other species, the joint analysis with HK + DUNE or SK + DUNE will provide precise energy spectrum of all flavours of neutrinos at the source. Finally, we discuss perspectives for improvements of our method by using neutrino data of other detectors.

79 ASTRONOMY AND ASTROPHYSICS↗