Search NASA⌕ Search

SEARCH · Search NASA

Results for “adaptive 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 19 records

Adaptive 3D convolutional neural network-based reconstruction method for 3D coherent diffraction imaging

We present a novel adaptive machine-learning based approach for reconstructing three-dimensional (3D) crystals from coherent diffraction imaging. We represent the crystals using spherical harmonics (SH) and generate the corresponding synthetic diffraction patterns. We utilize 3D convolutional neural networks (CNNs) to learn a mapping between 3D diffraction volumes and the SH, which describe the boundary of the physical volumes from which they were generated. We use the 3D CNN-predicted SH coefficients as the initial guesses, which are then fine-tuned using adaptive model-independent feedback for improved accuracy. We also adaptively tune the locations, intensities, and decay rates of collections of radial basis functions in order to reproduce the non-uniform internal structure of 3D objects and demonstrate the method for a synthetic volume that has an internal void and a density ramp.

36 MATERIALS SCIENCE↗

Domain Adaptation for Convolutional Neural Networks Based Remote Sensing Scene Classification

Remote sensing (RS) scene classification plays an important role in the field of earth observation. With the rapid development of the remote sensing techniques, a large number of RS scene images are available. Since manually labeling largescale RS scene images is both labor and time consuming, when a new unlabeled dataset is obtained, how to use the existing labeled datasets to classify the new unlabeled images is an important research direction. Different RS scene image datasets may be taken from different type of sensors, and the images may vary from imaging modalities, spatial resolutions and image scales, so the distribution discrepancy exists among different image datasets. As a result, simply applying Convolutional Neural Networks (CNN) trained on source domain cannot accurately classify the images on target domain. Domain Adaptation (DA) can be helpful to solve this problem. In this paper, we design a Subspace Alignment (SA) and CNN based framework to solve the DA problem in RS scene image classification. A new SA layer is proposed and added into CNN models for DA, which could align the source and target domains in some feature subspace. Finetuning the modified CNN model with the added SA layer is able to make the CNN model adapt to the aligned feature subspace and helps to relieve the domain distribution discrepancy. The experiments conducted on two public datasets show that adding the SA layer into CNN can improve the scene classification on target domain.

97 MATHEMATICS AND COMPUTING↗

Multi-Level Structural Damage Characterization Using Sparse Acoustic Sensor Networks and Knowledge Transferred Deep Learning

Standard structural health monitoring techniques face well-known difficulties for comprehensive defect diagnosis in real-world structures that have structural, material, or geometric complexity. This motivates the exploration of machine-learning-based structural health monitoring methods in complex structures. However, creating sufficient training data sets with various defects is an ongoing challenge for data-driven machine (deep) learning algorithms. The ability to transfer the knowledge of a trained neural network from one component to another or to other sections of the same component would drastically reduce the required training data set. Also, it would facilitate computationally inexpensive machine learning based inspection systems. In this work, a machine-learning-based multi-level damage characterization is demonstrated with the ability to transfer trained knowledge within the sparse sensor network. A novel network spatial assistance and an adaptive convolution technique are proposed for efficient knowledge transfer within the deep learning algorithm. Proposed structural health monitoring method is experimentally evaluated on an aluminum plate with artificially induced defects. It was observed that the method improves the performance of knowledge transferred damage characterization by 50% during localization and 24% during severity assessment. Further, experiments using time windows with and without multiple edge reflections are studied. Results reveal that multiply scattered waves contain rich and deterministic defect signatures that can be mined using deep learning neural networks, improving the accuracy of both identification and quantification. In the case of a fixed sensor network, using multiply scattered waves shows 100% prediction accuracy at all levels of damage characterization.

36 MATERIALS SCIENCE↗

Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators

We present an adaptive grid matrix-free operator approximation scheme based on a "product-convolution" interpolation of convolution operators. This scheme is appropriate for operators that are locally translation-invariant, even if these operators are high rank or full rank. Such operators arise in Schur complement methods for solving partial differential equations (PDEs), as Hessians in PDE-constrained optimization and inverse problems, as integral operators, as covariance operators, and as Dirichlet-to-Neumann maps. Constructing the approximation requires computing the impulse responses of the operator to point sources centered on nodes in an adaptively refined grid of sample points. A randomized a posteriori error estimator drives the adaptivity. Once constructed, the approximation can be efficiently applied to vectors using the fast Fourier transform. The approximation can be efficiently converted to hierarchical matrix (H-matrix) format, then inverted or factorized using scalable H-matrix arithmetic. The quality of the approximation degrades gracefully as fewer sample points are used, allowing cheap lower quality approximations to be used as preconditioners. Furthermore, this yields an automated method to construct preconditioners for locally translation-invariant Schur complements. We directly address issues related to boundaries and prove that our scheme eliminates boundary artifacts. We test the scheme on a spatially varying blurring kernel, on the nonlocal component of an interface Schur complement for the Poisson operator, and on the data misfit Hessian for an advection dominated advection-diffusion inverse problem. Numerical results show that the scheme outperforms existing methods.

97 MATHEMATICS AND COMPUTING↗

Flavor Classification in ICARUS Using Convolutional Visual Networks

In this work, we adapt the Convolutional Visual Network (CVN) approach [1] to the ICARUS detector by incorporating TPC stitching methods inspired by NuGraph[8]. The stitching technique used here is unique to ICARUS, designed specifically to handle its distinct detector segmentations. We then retrain the network using ICARUS-specific data. This study underscores the flexibility of deep learning models in high-energy physics and the importance of accounting for detector-specific features when transferring machine learning techniques between experiments. This poster presents the methods, classification performance, and insights gained from applying CVN to ICARUS data.

Wieler, Felipe [Tech. Fed. Parana U.]↗

Neutrino Flavor Classification in ICARUS Experiment Using Convolutional Visual Networks

In this work, I adapt the Convolutional Visual Network (CVN) approach to the ICARUS detector by incorporating TPC stitching methods inspired by NuGraph. The stitching technique used here is unique to ICARUS, designed specifically to handle its distinct detector segmentation s. I then retrain the network using ICARUS-specific data. This study underscores the flexibility of deep learning models in high-energy physics and the importance of accounting for detector-specific features when transferring machine learning techniques between experiments. This dissertation presents the methods, classification performance, and insights gained from applying CVN to ICARUS data.

Wieler, Felipe Andre [Parana Tech. Fed. U., Toledo↗

Identification of tau leptons using a convolutional neural network with domain adaptation

A tau lepton identification algorithm,DeepTau, based on convolutional neural network techniques, has been developed in the CMS experiment to discriminate reconstructed hadronic decays of tau leptons (τ h ) from quark or gluon jets and electrons and muons that are misreconstructed as τ h candidates. The latest version of this algorithm, v2.5, includes domain adaptation by backpropagation, a technique that reduces discrepancies between collision data and simulation in the region with the highest purity of genuine τh candidates. Additionally, a refined training workflow improves classification performance with respect to the previous version of the algorithm, with a reduction of 30–50% in the probability for quark and gluon jets to be misidentified as τ h candidates for given reconstruction and identification efficiencies. This paper presents the novel improvements introduced in theDeepTau algorithm and evaluates its performance in LHC proton-proton collision data at √(s) = 13 and 13.6 TeV collected in 2018 and 2022 with integrated luminosities of 60 and 35 fb -1 , respectively. Techniques to calibrate the performance of the τ h identification algorithm in simulation with respect to its measured performance in real data are presented, together with a subset of results among those measured for use in CMS physics analyses.

Large detector-systems performance↗

Graph convolutional networks applied to unstructured flow field data

Abstract Many scientific and engineering processes produce spatially unstructured data. However, most data-driven models require a feature matrix that enforces both a set number and order of features for each sample. They thus cannot be easily constructed for an unstructured dataset. Therefore, a graph based data-driven model to perform inference on fields defined on an unstructured mesh, using a graph convolutional neural network (GCNN) is presented. The ability of the method to predict global properties from spatially irregular measurements with high accuracy is demonstrated by predicting the drag force associated with laminar flow around airfoils from scattered velocity measurements. The network can infer from field samples at different resolutions, and is invariant to the order in which the measurements within each sample are presented. The GCNN method, using inductive convolutional layers and adaptive pooling, is able to predict this quantity with a validation R 2 above 0.98, and a Normalized Mean Squared Error below 0.01, without relying on spatial structure.

Ogoke, Francis (ORCID:0000000224327783)↗

The Cosmic Evolution of C IV Absorbers at 1.4 < z < 4.5: Insights from 100,000 Systems in DESI Quasars

We present the largest catalog to date of triply ionized carbon (C IV ) absorbers detected in quasar spectra from the Dark Energy Spectroscopic Instrument. Using an automated matched-kernel convolution method with adaptive signal-to-noise thresholds, we identify 101,487 C IV systems in the redshift range 1.4 < z < 4.5 from 300,637 quasar spectra. Completeness is estimated via Monte Carlo simulations, and the catalog is 50% complete at EW C IV ≥ 0.4 Å. The differential equivalent width frequency distribution declines exponentially and shows weak redshift evolution. The absorber incidence per unit comoving path increases by a factor of 2–5 from z ≈ 4.5 to z ≈ 1.4, with stronger redshift evolution for strong systems. Using column densities derived from the apparent optical depth method, we constrain the cosmic mass density of C IV , Ω C IV , which increases by a factor of ∼3.8 from (0.82 ± 0.05) × 10 −8 at z ≈ 4.5 to (3.16 ± 0.2) × 10 −8 at z ≈ 1.4. From Ω C IV , we estimate a lower limit on intergalactic medium metallicity ${\mathrm{log}}({Z}_{{\rm{IGM}}}/{Z}_{\odot })\gtrsim -3.25$ at z ∼ 2.3, with a smooth decline at higher redshifts. These trends trace the cosmic star formation history and He II photoheating rate, suggesting a link between C IV enrichment, star formation, and UV background over ∼3 Gyr. The catalog also provides a critical resource for future studies connecting circumgalactic metals to galaxy evolution, especially near cosmic noon.

79 ASTRONOMY AND ASTROPHYSICS↗

Image reconstruction by parametric cubic convolution

Cubic convolution, which has been discussed by Rifman and McKinnon (1974), was originally developed for the reconstruction of Landsat digital images. In the present investigation, the reconstruction properties of the one-parameter family of cubic convolution interpolation functions are considered and thee image degradation associated with reasonable choices of this parameter is analyzed. With the aid of an analysis in the frequency domain it is demonstrated that in an image-independent sense there is an optimal value for this parameter. The optimal value is not the standard value commonly referenced in the literature. It is also demonstrated that in an image-dependent sense, cubic convolution can be adapted to any class of images characterized by a common energy spectrum.

Park, S. K.↗

QuCNN : A Quantum Convolutional Neural Network with Entanglement Based Backpropagation

Quantum Machine Learning continues to be a highly active area of interest within Quantum Computing. Many of these approaches have adapted classical approaches to the quantum settings, such as QuantumFlow, etc. We push forward this trend, and demonstrate an adaption of the Classical Convolutional Neural Networks to quantum systems - namely QuCNN. QuCNN is a parameterised multi-quantum-state based neural network layer computing similarities between each quantum filter state and each quantum data state. With QuCNN, back propagation can be achieved through a single-ancilla qubit quantum routine. QuCNN is validated by applying a convolutional layer with a data state and a filter state over a small subset of MNIST images, comparing the backpropagated gradients, and training a filter state against an ideal target state.

high performance computing, quantum computing↗

Personal Computer (PC) based image processing applied to fluid mechanics

A PC based image processing system was employed to determine the instantaneous velocity field of a two-dimensional unsteady flow. The flow was visualized using a suspension of seeding particles in water, and a laser sheet for illumination. With a finite time exposure, the particle motion was captured on a photograph as a pattern of streaks. The streak pattern was digitized and processed using various imaging operations, including contrast manipulation, noise cleaning, filtering, statistical differencing, and thresholding. Information concerning the velocity was extracted from the enhanced image by measuring the length and orientation of the individual streaks. The fluid velocities deduced from the randomly distributed particle streaks were interpolated to obtain velocities at uniform grid points. For the interpolation a simple convolution technique with an adaptive Gaussian window was used. The results are compared with a numerical prediction by a Navier-Stokes computation.

Cho, Y.-C.↗

Personal computer (PC) based image processing applied to fluid mechanics research

A PC based image processing system was employed to determine the instantaneous velocity field of a two-dimensional unsteady flow. The flow was visualized using a suspension of seeding particles in water, and a laser sheet for illumination. With a finite time exposure, the particle motion was captured on a photograph as a pattern of streaks. The streak pattern was digitized and processsed using various imaging operations, including contrast manipulation, noise cleaning, filtering, statistical differencing, and thresholding. Information concerning the velocity was extracted from the enhanced image by measuring the length and orientation of the individual streaks. The fluid velocities deduced from the randomly distributed particle streaks were interpolated to obtain velocities at uniform grid points. For the interpolation a simple convolution technique with an adaptive Gaussian window was used. The results are compared with a numerical prediction by a Navier-Stokes commputation.

Cho, Y.-C.↗

Seamless data-range change using punctured convolutional codes for time-varying signal-to-noise ratios

In a time-varying signal-to-noise ration (SNR) environment, symbol rate is often changed to maximize data return. However, the symbol-rate change has some undesirable effects, such as changing the transmission bandwidth and perhaps causing the receiver symbol loop to lose lock temporarily, thus losing some data. In this article, we are proposing an alternate way of varying the data rate without changing the symbol rate and, therefore, the transmission bandwidth. The data rate change is achieved in a seamless fashion by puncturing the convolutionally encoded symbol stream to adapt to the changing SNR environment. We have also derived an exact expression to enumerate the number of distinct puncturing patterns. To demonstrate this seamless rate change capability, we searched for good puncturing patterns for the Galileo (14,1/4) convolutional code and changed the data rates by using the punctured codes to match the Galileo SNR profile of November 9, 1997. We show that this scheme reduces the symbol-rate changes from nine to two and provides a comparable data return in a day and a higher symbol SNR during most of the day.

Feria, Y.↗

Seamless Data-Rate Change Using Punctured Convolutional Codes for Time-Varying Signal-to-Noise Ratio

In a time-varying signal-to-noise (SNR) environment, symbol rate is often changed to maximize ata return. However, the symbol-rate change has some undesirable effects such as changing the ransmission bandwidth and perhaps causing the receiver symbol loop to lose lock temporarily, thus osing some data. In this article, we are proposing an alternate way of varying the data rate without hanging the symbol rate and therefore the transmission bandwidth. The data rate change is achieved n a seamless fashion by puncturing the convolutionally encoded symbol stream to adapt to the hanging SNR environment. We have also derived an exact expression to enumerate the number of nique puncturing patterns. To demonstrate this seamless rate-change capability, we searched for good uncturing patterns for the Galileo (14, 1/4) convolutional code and changed the data rates by using the unctured codes to match the Galileo SNR profile of November 9, 1997.

Seamless Data-Rate↗