Search NASA⌕ Search

SEARCH · Search NASA

Results for “convolution”

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 901 records · Page 50

Jet charge and machine learning

Modern machine learning techniques, such as convolutional, recurrent and recursive neural networks, have shown promise for jet substructure at the Large Hadron Collider. For example, they have demonstrated effectiveness at boosted top or W boson identification or for quark/gluon discrimination. We explore these methods for the purpose of classifying jets according to their electric charge. We find that both neural networks that incorporate distance within the jet as an input and boosted decision trees including radial distance information can provide significant improvement in jet charge extraction over current methods. Specifically, convolutional, recurrent, and recursive networks can provide the largest improvement over traditional methods, in part by effectively utilizing distance within the jet or clustering history. Furthermore, the advantages of using a fixed-size input representation (as with the CNN) or a small input representation (as with the RNN) suggest that both convolutional and recurrent networks will be essential to the future of modern machine learning at colliders.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Low rank approximation in G 0 W 0 calculations

The single particle energies obtained in a Kohn-Sham density functional theory (DFT) calculation are generally known to be poor approximations to electron excitation energies that are measured in tr ansport, tunneling and spectroscopic experiments such as photo-emission spectroscopy. The correction to these energies can be obtained from the poles of a single particle Green’s function derived from a many-body perturbation theory. From a computational perspective, the accuracy and efficiency of such an approach depends on how a self energy term that properly accounts for dynamic screening of electrons is approximated. The G 0 W 0 approximation is a widely used technique in which the self energy is expressed as the convolution of a noninteracting Green’s function (G 0 ) and a screened Coulomb interaction (W 0 ) in the frequency domain. The computational cost associated with such a convolution is high due to the high complexity of evaluating W 0 at multiple frequencies. In this paper, we discuss how the cost of G 0 W 0 calculation can be reduced by constructing a low rank approximation to the frequency dependent part of W 0 . In particular, we examine the effect of such a low rank approximation on the accuracy of the G 0 W 0 approximation. We also discuss how the numerical convolution of G 0 and W 0 can be evaluated efficiently and accurately by using a contour deformation technique with an appropriate choice of the contour.

97 MATHEMATICS AND COMPUTING↗

ESM data downscaling: a comparison of super-resolution deep learning models

Abstract Climate projections at fine spatial resolutions are required to conduct accurate risk assessment for critical infrastructure and design adaptation planning. Generating these projections using advanced Earth system models (ESM) requires significant computational resources. To address this issue, various statistical downscaling techniques have been introduced to generate fine-resolution data from coarse-resolution simulations. In this study, we evaluate and compare five deep learning-based downscaling techniques, namely, super-resolution convolutional neural networks, fast super-resolution convolutional neural network ESM, efficient sub-pixel convolutional neural network, enhanced deep residual network (EDRN), and super-resolution generative adversarial network (SRGAN). These techniques are applied to a dataset generated by the Energy Exascale Earth System Model (E3SM), focusing on key surface variables such as surface temperature, shortwave heat flux, and longwave heat flux. Models are trained and validated using paired fine-resolution (0.25 $$^{\circ }$$ ∘ ) and coarse-resolution (1 $$^{\circ }$$ ∘ ) monthly data obtained from a 9-year simulation. Next, blind testing is performed using monthly data obtained from two different years outside of the training and validation set. To evaluate the efficiency of each technique, different statistical metrics are used, including mean squared error (MSE), peak signal-to-noise ratio (PSNR), structural similarity index measure (SSIM), and learned perceptual image patch similarity (LPIPS). The results show that EDRN outperforms other algorithms in terms of PSNR, SSIM, and MSE, but struggles to capture fine-scale features in the data. In contrast, SRGAN, a generative model that uses perceptual loss, excels in capturing fine details at boundaries and internal structures, resulting in lower LPIPS than other methods.

Pawar, Nikhil M. (ORCID:0000000211613289)↗

Tensor decomposition in electronic structure calculations on 3D Cartesian grids

In this paper, we investigate a novel approach based on the combination of Tucker-type and canonical tensor decomposition techniques for the efficient numerical approximation of functions and operators in electronic structure calculations. In particular, we study applicability of tensor approximations for the numerical solution of Hartree-Fock and Kohn-Sham equations on 3D Cartesian grids. We show that the orthogonal Tucker-type tensor approximation of electron density and Hartree potential of simple molecules leads to low tensor rank representations. This enables an efficient tensor-product convolution scheme for the computation of the Hartree potential using a collocation-type approximation via piecewise constant basis functions on a uniform nxnxn grid. Combined with the Richardson extrapolation, our approach exhibits O(h{sup 3}) convergence in the grid-size h=O(n{sup -1}). Moreover, this requires O(3rn+r{sup 3}) storage, where r denotes the Tucker rank of the electron density with r=O(logn), almost uniformly in n. For example, calculations of the Coulomb matrix and the Hartree-Fock energy for the CH{sub 4} molecule, with a pseudopotential on the C atom, achieved accuracies of the order of 10{sup -6} hartree with a grid-size n of several hundreds. Since the tensor-product convolution in 3D is performed via 1D convolution transforms, our scheme markedly outperforms the 3D-FFT in both the computing time and storage requirements.

74 ATOMIC AND MOLECULAR PHYSICS↗

Automated correlative segmentation of large Transmission X-ray Microscopy (TXM) tomograms using deep learning

Highlights: • A unique automated segmentation approach for large 3D nanotomography datasets obtained by Transmission X-ray Microscopy (TXM) in an Al-Cu alloy. • Automated segmentation using a Convolutional Neural Network (CNN) architecture based on a deep learning approach was employed. • This extremely versatile technique is capable of emulating the manual segmentation process effectively. • Quantitative comparison between manual segmentation and CNN architecture established the accuracy of this automated technique. • Its ability to robustly process ultra-large volumes of data in relatively small time frames can exponentially accelerate tomographic data analysis. - Abstract: A unique correlative approach for automated segmentation of large 3D nanotomography datasets obtained using Transmission X-ray Microscopy (TXM) in an Al-Cu alloy has been introduced. Automated segmentation using a Convolutional Neural Network (CNN) architecture based on a deep learning approach was employed. This extremely versatile technique is capable of emulating the manual segmentation process effectively. Coupling this technique with post-scanning SEM imaging ensured precise estimation of 3D morphological parameters from nanotomography. The segmentation process as well as subsequent analysis was expedited by several orders of magnitude. Quantitative comparison between segmentation performed manually and using the CNN architecture established the accuracy of this automated technique. Its ability to robustly process ultra-large volumes of data in relatively small time frames can exponentially accelerate tomographic data analysis, possibly opening up novel avenues for performing 4D characterization experiments with finer time steps.

36 MATERIALS SCIENCE↗

Variable rate neural compression for sparse detector data

Particle colliders produce data at extraordinary rates, posing major challenges for transmission and storage. High-throughput compression algorithms are therefore essential. In the sPHENIX experiment taking data at the Relativistic Heavy Ion Collider, a time projection chamber records three-dimensional (3D) particle trajectories that are highly sparse, making conventional learning-free lossy compression ineffective. Convolutional neural networks have surpassed traditional methods in compression ratio and accuracy. However, they fail to exploit sparsity for efficiency. To address these gaps, we present BCAE-VS, a bicephalous convolutional autoencoder with variable compression ratio for sparse data, which adapts compression to input complexity through key-point identification and sparse convolution. BCAE-VS achieves higher accuracy and compression ratios than prior neural approaches while being orders of magnitude smaller. Moreover, its throughput increases with sparsity—a property not observed in other methods. Although it was developed for collider experiments, BCAE-VS readily extends to other sparse data domains, such as light detection and ranging (LiDAR) sensing and 3D microscopy.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Accelerating magnonic simulations with the pseudospectral Landau-Lifshitz equation

The pseudospectral Landau-Lifshitz (PS-LL) model can describe atomic-scale magnetic exchange interactions within a continuum framework. This is achieved by employing a convolution kernel that models the nonlocal interaction in a grid-independent manner. Even though the PS-LL was originally introduced to address atomic exchange, any nonlocal kernel can be modeled. In the field of magnonics, the dipole field is fundamental to describe the dispersion relation of magnons, the quasiparticle representation of angular momentum. Because dipole-dipole interactions are long-range, numerical approaches typically rely on convolutions. Here, we demonstrate that the PS-LL model can be used to perform magnonic simulations with a single convolution kernel derived from analytical solutions. We demonstrate a twofold increase in computational speed compared with the full dipole calculation. This approach is valid insofar as the excitations are linear, which is typically the case for magnons. Our results have the potential to accelerate magnonic research, particularly for the inverse design method, where several simulations must be performed to achieve the desired outcome.

Mathematics and computing↗

Semi-Inclusive Deep Inelastic Scattering and Bessel-Weighted Asymmetries

We consider the cross section in Fourier space, conjugate to the outgoing hadron's transverse momentum, where convolutions of transverse momentum dependent parton distribution functions and fragmentation functions become simple products. Individual asymmetric terms in the cross section can be projected out by means of a generalized set of weights involving Bessel functions. Advantages of employing these Bessel weights are that they suppress (divergent) contributions from high transverse momentum and that soft factors cancel in (Bessel-) weighted asymmetries. Also, the resulting compact expressions immediately connect to previous work on evolution equations for transverse momentum dependent parton distribution and fragmentation functions and to quantities accessible in lattice QCD. Bessel-weighted asymmetries are thus model independent observables that augment the description and our understanding of correlations of spin and momentum in nucleon structure.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Modeled sensitivity of multi-MA accelerator performance to electrode contaminant inventory

Significant particle-in-cell code development has enabled simulations of power flow in multi-MA accelerators to include the desorption of surface contaminants, their ionization into surface plasmas, and the impact of these plasmas on efficiency. The simulations base desorption on an Arrhenius equation, whose most significant unknown is the surface contaminant inventory. The sensitivity of power-flow simulations to this inventory is studied here using Sandia National Laboratories' Z accelerator with a 7-nH MagLIF load [Phys. Plasmas 17, 056303 (2010)]. Simulations are conducted in 3D cylindrical coordinates for the current-adder, or “convolute,” region of Z and in 2D for the final feed only. Simulated contaminant inventories are varied from 1 to 32 monolayers (MLs) in 2D, and 2 to 4 ML in 3D. The results reveal sensitivities to the local ratio of E/B⁠. The high B-field, low E-field region near the short-circuit load is insensitive to the contaminant inventory, where assumed values of 4–32 ML change the load current by ≤ 2%, and agree with experiment to within 2% at peak current. A 1-ML value is the outlier, increasing the load current by 5%, but still within measurement uncertainty. In contrast, the relatively higher E-field, lower B-field convolute region has slower contaminant desorption and higher-magnitude E-field penetration of the surface plasmas. The current loss in the convolute region does increase with contaminant inventory. The loss assuming 4 ML is 12% larger than for 2 ML, with 4 ML being the better match to experiment.

Arrhenius equation↗

Hierarchical-embedding autoencoder with a predictor as efficient architecture for learning time-evolution in multi-scale turbulent flows

We introduce a scale-aware, data-driven deep learning modeling framework for accurately predicting the time evolution of multi-scale turbulent plasma and liquid flows. The approach is motivated by the idea of scale separation. Structures of vastly different length scales emerge in these systems, and interactions between these structures occur only locally. To exploit this structure, the flow state is transformed by a hierarchical, fully convolutional autoencoder, not into a single embedding layer as in conventional convolutional surrogate models, but into a series of embedding layers. A stepwise training strategy ensures that fine-scale features are encoded on a high-resolution grid, while larger structures are represented on progressively coarser layers. The time evolution predictor advances all embedding layers in sync, capturing local interactions between features at the same scale as well as between all scales. This approach enables efficient modeling of multi-scale systems since negligible interactions between distant, small-scale structures do not need to be directly modeled. Our hierarchical-embedding autoencoder with a predictor framework is evaluated on canonical examples of multi-scale turbulence: two-dimensional Kolmogorov flow and Hasegawa–Wakatani plasma turbulence. In both cases, the proposed framework significantly improves predictive accuracy relative to conventional convolutional network architectures. A significant improvement in prediction accuracy was observed for crucial statistical characteristics of the Hasegawa–Wakatani plasma as well as for individual trajectories of the Kolmogorov flow turbulence. Importantly, the model's rollout for the Hasegawa–Wakatani problem demonstrates a four-order-of-magnitude speedup compared to traditional numerical solvers.

Khrabry, Alexander I. [Princeton Univ., NJ (United↗

Orthogonal Polynomials Defined by Self-Similar Measures with Overlaps

Here, we study orthogonal polynomials with respect to self-similar measures, focusing on the class of infinite Bernoulli convolutions, which are defined by iterated function systems with overlaps, especially those defined by the Pisot, Garsia, and Salem numbers. By using an algorithm of Mantica, we obtain graphs of the coefficients of the 3-term recursion relation defining the orthogonal polynomials. We use these graphs to predict whether the singular infinite Bernoulli convolutions belong to the Nevai class. Based on our numerical results, we conjecture that all infinite Bernoulli convolutions with contraction ratios greater than or equal to 1/2 belong to Nevai’s class, regardless of the probability weights assigned to the self-similar measures.

97 MATHEMATICS AND COMPUTING↗

MODELING THE POLLUTION OF PRISTINE GAS IN THE EARLY UNIVERSE

We conduct a comprehensive theoretical and numerical investigation of the pollution of pristine gas in turbulent flows, designed to provide useful new tools for modeling the evolution of the first generation of stars. The properties of such Population III (Pop III) stars are thought to be very different than those of later stellar generations, because cooling is dramatically different in gas with a metallicity below a critical value Z{sub c}, which lies between ∼10{sup –6} and ∼10{sup –3} Z{sub ☉}. The critical value is much smaller than the typical overall average metallicity, , and therefore the mixing efficiency of the pristine gas in the interstellar medium plays a crucial role in determining the transition from Pop III to normal star formation. The small critical value, Z{sub c}, corresponds to the far left tail of the probability distribution function (PDF) of the metal abundance. Based on closure models for the PDF formulation of turbulent mixing, we derive evolution equations for the fraction of gas, P, lying below Z{sub c}, in statistically homogeneous compressible turbulence. Our simulation data show that the evolution of the pristine fraction P can be well approximated by a generalized 'self-convolution' model, which predicts that P-dot = - (n/τ{sub con}) P (1-P{sup 1/n}), where n is a measure of the locality of the mixing or PDF convolution events and the convolution timescale τ{sub con} is determined by the rate at which turbulence stretches the pollutants. Carrying out a suite of numerical simulations with turbulent Mach numbers ranging from M = 0.9 to 6.2, we are able to provide accurate fits to n and τ{sub con} as a function of M, Z{sub c}/(Z), and the length scale, L{sub p}, at which pollutants are added to the flow. For pristine fractions above P = 0.9, mixing occurs only in the regions surrounding blobs of pollutants, such that n = 1. For smaller values of P, n is larger as the mixing process becomes more global. We show how these results can be used to construct one-zone models for the evolution of Pop III stars in a single high-redshift galaxy, as well as subgrid models for tracking the evolution of the first stars in large cosmological numerical simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

FDTD modeling of induced polarization phenomena in transient electromagnetics

The finite-difference time-domain scheme is augmented in order to treat the modelling of transient electromagnetic signals containing induced polarization effects from 3-D distributions of polarizable media. Compared to the non-dispersive problem, the discrete dispersive Maxwell system contains costly convolution operators. Key components to our solution for highly digitized model meshes are Debye decomposition and composite memory variables. We revert to the popular Cole-Cole model of dispersion to describe the frequency-dependent behaviour of electrical conductivity. Its inversely Laplace-transformed Debye decomposition results in a series of time convolutions between electric field and exponential decay functions, with the latter reflecting each Debye constituents' individual relaxation time. Finally, these function types in the discrete-time convolution allow for their substitution by memory variables, annihilating the otherwise prohibitive computing demands. Numerical examples demonstrate the efficiency and practicality of our algorithm.

58 GEOSCIENCES↗

Direct estimation of the density of states for fermionic systems

Simulating time evolution is one of the most natural applications of quantum computers and is thus one of the most promising prospects for achieving practical quantum advantage. Here, we develop quantum algorithms to extract thermodynamic properties by estimating the density of states (DOS), which is a central object in quantum statistical mechanics. We introduce several key innovations that significantly improve the practicality and extend the generality of previous techniques. First, our approach allows one to estimate the DOS only for a specific subspace of the full Hilbert space. This is crucial for fermionic systems, since both canonical and grand canonical ensemble thermal equilibrium properties depend on subspaces of fixed number. Second, in our approach, by time evolving very simple, random initial states, such as randomly chosen computational basis states, we can exactly recover the DOS on average. Third, due to circuit-depth limitations, we only reconstruct the DOS up to a convolution with a Gaussian window—thus all imperfections that shift the energy levels by less than the width of the convolution window will not significantly affect the estimated DOS. For these reasons, we find the approach is a promising candidate for early quantum advantage as even short-time, noisy dynamics can yield a semiquantitative reconstruction of the DOS (convolution with a broad Gaussian window), while early fault-tolerant devices will likely enable higher-resolution DOS reconstruction through longer time evolutions. We demonstrate the practicality of our approach in representative Fermi-Hubbard and spin models and indeed find that our approach is highly robust against algorithmic errors in the time evolution and against gate noise. We further demonstrate that our approach is compatible with noisy intermediate-scale quantum (NISQ) computing NISQ-friendly variational techniques, introducing and leveraging a technique for variational time evolution.

97 MATHEMATICS AND COMPUTING↗

Introducing a multiscale feature integration network for inpainting with applications to enhanced CMB map reconstruction

We introduce a novel neural network, SkyReconNet, which combines the expanded receptive fields of dilated convolutional layers along with standard convolutions, to capture both the global and local features for reconstructing the missing information in an image. We implement our network to inpaint the masked regions in a full-sky cosmic microwave background (CMB) map. Inpainting CMB maps is a particularly formidable challenge when dealing with extensive and irregular masks, such as galactic masks which can obscure substantial fractions of the sky. The hybrid design of SkyReconNet leverages the strengths of standard and dilated convolutions to accurately predict CMB fluctuations in the masked regions by effectively utilizing the information from surrounding unmasked areas. During training, the network optimizes its weights by minimizing a composite loss function that combines the structural similarity index measure (SSIM) and mean squared error (MSE). SSIM preserves the essential structural features of the CMB, ensuring an accurate and coherent reconstruction of the missing CMB fluctuations, while MSE minimizes the pixelwise deviations, thus enhancing the overall accuracy of the predictions. The predicted CMB maps and their corresponding angular power spectra align closely with the targets, achieving the performance limited only by the fundamental uncertainty of cosmic variance. The network’s generic architecture enables application to other physics-based challenges involving data with missing or defective pixels, systematic artifacts, etc. In conclusion, our results demonstrate its effectiveness in addressing the challenges posed by large irregular masks, offering a significant inpainting tool not only for CMB analyses but also for image-based experiments across disciplines where such data imperfections are prevalent.

Cosmic microwave background↗

Dual-Channel Densenet for Hyperspectral Image Classification

Deep neural networks provide deep extracted features for image classification. As a high dimension data, hyperspectral image (HSI) feature extraction is unlike an RGB image whose feature representation could not be simply generated in the spatial domain. To take full advantage of HSI, a dualchannel convolutional neural network (CNN) is applied, 1D convolution for the spectral domain and 2D convolution for spatial domain. For pixel-wise classification of HSI, in our network model, one-dimensional customized DenseNet is for extracting the hierarchical spectral features and another customized DenseNet is applied to extract the hierarchical spatial-related feature. Furthermore, we experimentally tuned the several widen factors and dense-net growth rates to evaluate the impact of hyper-parameter. Furthermore, to compare our proposed method with HSI classification methods, we test other three DNNs based method in two real-world HSI dataset. The result demonstrated our approach outperformed the state-of-art method

97 MATHEMATICS AND COMPUTING↗

Backscatter correction factor for megavoltage photon beam

Purpose: For routine clinical dosimetry of photon beams, it is often necessary to know the minimum thickness of backscatter phantom material to ensure that full backscatter condition exists. Methods: In case of insufficient backscatter thickness, one can determine the backscatter correction factor, BCF(s,d,t), defined as the ratio of absorbed dose measured on the central-axis of a phantom with backscatter thickness of t to that with full backscatter for square field size s and forward depth d. Measurements were performed in SAD geometry for 6 and 15 MV photon beams using a 0.125 cc thimble chamber for field sizes between 10 x 10 and 30 x 30 cm at depths between d{sub max} (1.5 cm for 6 MV and 3 cm for 15 MV) and 20 cm. Results: A convolution method was used to calculate BCF using Monte-Carlo simulated point-spread kernels generated for clinical photon beams for energies between Co-60 and 24 MV. The convolution calculation agrees with the experimental measurements to within 0.8% with the same physical trend. The value of BCF deviates more from 1 for lower energies and larger field sizes. According to our convolution calculation, the minimum BCF occurs at forward depth d{sub max} and 40 x 40 cm field size, 0.970 for 6 MV and 0.983 for 15 MV. Conclusions: The authors concluded that backscatter thickness is 6.0 cm for 6 MV and 4.0 cm for 15 MV for field size up to 10 x 10 cm when BCF = 0.998. If 4 cm backscatter thickness is used, BCF is 0.997 and 0.983 for field size of 10 x 10 and 40 x 40 cm for 6 MV, and is 0.998 and 0.990 for 10 x 10 and 40 x 40 cm for 15 MV, respectively.

43 PARTICLE ACCELERATORS↗

SU-E-T-189: First Experimental Verification of the Accuracy of Absolute Dose Reconstruction From PET-CT Imaging of Yttrium 90 Microspheres

Purpose: In the past few years there have been numerous proposals for 3D dose reconstruction from the PET-CT imaging of patients undergoing radioembolization treatment of the liver with yttrium-90 microspheres. One of the most promising techniques uses convolution of the measured PET activity distribution with a pre-calculated Monte Carlo dose deposition kernel. The goal of the present study is to experimentally verify the accuracy of this method and to analyze the significance of various error sources. Methods: Optically stimulated luminescence detectors (OSLD) were used (NanoDot, Landauer) in this experiment. Two detectors were mounted on the central axis of a cylinder filled with water solution of yttrium-90 chloride. The total initial activity was 90mCi. The cylinder was inserted in a larger water phantom and scanned on a Siemens Biograph 16 Truepoint PET-CT scanner. Scans were performed daily over a period of 20 days to build a calibration curve for the measured absolute activity spanning 7 yttrium-90 half-lives. The OSLDs were mounted in the phantom for a predetermined period of time in order to record 2Gy dose. The measured dose was then compared to the dose reconstructed from the activity density at the location of each dosimeter. Results: Thorough error analysis of the dose reconstruction algorithm takes into account the uncertainties in the absolute PET activity, branching ratios, and nonlinearity of the calibration curve. The measured dose for 105-minute exposure on day 10 of the experiment was 219(11)cGy, while the reconstructed dose at the location of the detector was 215(47)cGy. Conclusion: We present the first experimental verification of the accuracy of the convolution algorithm for absolute dose reconstruction of yttrium-90 microspheres. The excellent agreement between the measured and calculated point doses will encourage the broad clinical adoption of the convolution-based dose reconstruction algorithm, making future quantitative dose/outcome studies possible.

60 APPLIED LIFE SCIENCES↗