Search NASASearch

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

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

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

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.

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

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

OPEN ALPHADIFFRACT

Open-source release of the AlphaDiffract data generation and training system. Includes only the public Materials Project dataset retrievers.AlphaDiffract is a deep learning framework that achieves state-of-the-art performance in predicting the crystal system, space group, and lattice parameters directly from PXRD patterns. AlphaDiffract utilizes a 1D adaptation of the ConvNeXt architecture, a modern convolutional neural network that integrates key design principles from transformers, coupledwith dedicated prediction heads for each crystallographic property.

Prince, Michael [Argonne National Laboratory (ANL)

Neural architecture search via similarity adaptive guidance

Evolutionary neural network architecture search (ENAS) has attracted the attention of many experts due to its global optimization capabilities to automatically search for convolutional neural network architectures based on the target task. The current search space for ENAS is not to design a fully structured network, but to search for smaller cell architectures to reduce search costs. However, blind search strategies do not effectively utilize the potential experience of the population. In order to utilize the potential experience learned by the current population to guide the evolutionary search of the population, we propose a similarity guided neural network architecture search algorithm based on cell architecture, which utilizes the similarity between pairwise architectures in the population as empirical knowledge learned by the population. Our proposed algorithm provides a novel method for calculating architecture similarity, which calculates architecture similarity separately from the cell and macro-structure. Then we decouple the connections and operations in the cell and calculate connection and operation similarity separately. In addition, we propose adaptive similarity selection and binary tournament selection strategies to enhance the algorithm’s global and local search capabilities and effectively explore the search space. Finally, we design an improved single-point crossover operator to enhance the local search ability of the evolutionary operator. The experimental results show that SAGNAS is a competitive algorithm that achieves 97.44% and 81.60% in CIFAR10 and CIFAR100 with only 1.9 GPU-days spent.

97 MATHEMATICS AND COMPUTING

An algebraic convolution formulation for multiple-scattering correction in small-angle neutron scattering

Multiple scattering in small-angle neutron scattering (SANS) redistributes spectral weight and distorts structural interpretation, particularly for thick or strongly scattering samples. We develop a finite-dimensional spectral desmearing framework that corrects multiple scattering without resorting to integral transforms or model-dependent extrapolation. The primary intensity is expanded in an orthonormal basis adapted to the isotropic transverse-momentum measure, under which convolution reduces to a recursive tensor contraction, allowing the Poisson-weighted multiple-scattering series to be evaluated directly in a finite-dimensional basis representation. This formulation yields a stable forward–inverse mapping between apparent and primary spectra. Numerical tests demonstrate convergence under repeated convolution and accurate recovery of the single-scattering intensity. Application to SANS measurements collected at multiple neutron facilities, including the Spallation Neutron Source, the High Flux Isotope Reactor, and the Institut Laue-Langevin, shows the quantitative reconstruction of the underlying primary spectrum across a wide range of transmission conditions, including strongly attenuating samples. Here, the method provides a stable, model-agnostic framework for multiple-scattering correction in SANS and enables consistent structural interpretation across instruments and scattering regimes.

Tung, Chi-Huan [Oak Ridge National Laboratory (ORN

Deep Learning-Based Dynamic Modeling of Three-Phase Voltage Source Inverters

Inverter-based resource (IBR) models are necessary to analyze modern power system stability and create effective control strategies. Modeling IBRs in converter-rich power systems is crucial, yet challenging due to the lack of commercial information on converter topologies and control parameters. This paper proposes novel convolutional neural network (CNN)–based data-driven techniques for modeling IBRs, addressing adaptability and proprietary concerns without requiring internal system physics knowledge. The proposed method is tested using real grid-tied commercial IBR transient data and demonstrates effectiveness and accuracy. Furthermore, the developed modeling approach is integrated and implemented in the open-source power distribution simulation and analysis tool, GridLAB-D, to illustrate the potentiality of dynamic analysis of large-scale power systems with high IBRs.

deep learning, artificial intelligence

On-board image compression for the RAE lunar mission

The requirements, design, implementation, and flight performance of an on-board image compression system for the lunar orbiting Radio Astronomy Explorer-2 (RAE-2) spacecraft are described. The image to be compressed is a panoramic camera view of the long radio astronomy antenna booms used for gravity-gradient stabilization of the spacecraft. A compression ratio of 32 to 1 is obtained by a combination of scan line skipping and adaptive run-length coding. The compressed imagery data are convolutionally encoded for error protection. This image compression system occupies about 1000 cu cm and consumes 0.4 W.

Miller, W. H.

PDE-constrained high-order mesh optimization

Here, we present a novel framework for PDE-constrained r-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality metric and a measure of the accuracy of the PDE solution obtained via finite element discretization. The proposed formulation achieves optimized, well-defined high-order meshes by integrating mesh quality control, PDE solution accuracy, and robust gradient regularization. We adopt the Target-Matrix Optimization Paradigm to control geometric properties across the mesh, independent of the PDE of interest. To incorporate the accuracy of the PDE solution, we introduce error measures that control the finite element discretization error. The implicit dependence of these error measures on the mesh nodal positions is accurately captured by adjoint sensitivity analysis. Additionally, a convolution-based gradient regularization strategy is used to ensure stable and effective adaptation of high-order meshes. We demonstrate that the proposed framework can improve mesh quality and reduce the error by up to 10 times for the solution of Poisson and linear elasto-static problems. The approach is general with respect to the dimensionality, the order of the mesh, the types of mesh elements, and can be applied to any PDE that admits well-defined adjoint operators.

Computer science