Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sparse data”

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 667 records · Page 37
All sourcesNASA NTRSDOE OSTI
DOE OSTI2014

Land cover classification in multispectral imagery using clustering of sparse approximations over learned feature dictionaries

We present results from an ongoing effort to extend neuromimetic machine vision algorithms to multispectral data using adaptive signal processing combined with compressive sensing and machine learning techniques. Our goal is to develop a robust classification methodology that will allow for automated discretization of the landscape into distinct units based on attributes such as vegetation, surface hydrological properties, and topographic/geomorphic characteristics. We use a Hebbian learning rule to build spectral-textural dictionaries that are tailored for classification. We learn our dictionaries from millions of overlapping multispectral image patches and then use a pursuit search to generate classification features. Land cover labels are automatically generated using unsupervised clustering of sparse approximations (CoSA). We demonstrate our method on multispectral WorldView-2 data from a coastal plain ecosystem in Barrow, Alaska. We explore learning from both raw multispectral imagery and normalized band difference indices. We explore a quantitative metric to evaluate the spectral properties of the clusters in order to potentially aid in assigning land cover categories to the cluster labels. In this study, our results suggest CoSA is a promising approach to unsupervised land cover classification in high-resolution satellite imagery.

42 ENGINEERING↗
DOE OSTI2026

Identifying Differential Equations in Fourier Domain (FourierIdent)

We investigate identifying differential equations in the frequency domain. Fourier analysis is an important tool in theoretical analysis and numerical solvers of differential equations, yet there is limited work in exploring this connection in the identification of differential equations. This paper aims to identify the underlying differential equation in the frequency domain, from a given single realization of the differential equation perturbed by noise. Such setting imposes difficulties which are different from other identification methods where computation is carried out in the physical domain. We propose several ways to mitigate the challenges arising from noise in data and large differences in the magnitudes of frequency responses. The main takeaways are that identifying differential equations solely in the frequency domain is challenging, the method we propose is based on a form of domain partitions in the frequency domain, and this method shows benefits for complex data even with high level of noise. We introduce a Fourier feature denoising, and define the meaningful data region and the core regions of features to reduce the effect of noise in the frequency domain and to enhance the accuracy in coefficient identification. The proposed method is tested on various differential equations with linear, nonlinear, and high-order derivative feature terms, and shows advantages on complex data with many frequency modes, even under high level of noise.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Sparse approximation of fitting surface by elastic net

The goal of this paper is to develop a computational model and corresponding efficient algorithm for obtaining a sparse representation of the fitting surface to the given scattered data. The basic idea of the model is to utilize the principal shift invariant space and the balanced l{sub 1},l{sub 2} norm minimization (named elastic net). The elastic net can be solved efficiently by an adapted split Bregman iteration algorithm. Numerical experiments indicate that by choosing appropriate regularization parameters, the model can efficiently provide an acceptable compromise between the minimization of the data mismatch term and the sparsity of the solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Imaging particle collision data for event classification using machine learning

We propose a method to organize experimental data from particle collision experiments in a general format which can enable a simple visualisation and effective classification of collision data using machine learning techniques. The method is based on sparse fixed-size matrices with single- and two-particle variables containing information on identified particles and jets. As a result, we illustrate this method using an example of searches for new physics at the LHC experiments.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

Machine learning methods for probabilistic locked-mode predictors in tokamak plasmas

A rotating tokamak plasma can interact resonantly with the external helical magnetic perturbations, also known as error fields. This can lead to locking and then to disruptions. We leverage machine learning (ML) methods to predict the locking events. We use a coupled third-order nonlinear ordinary differential equation model to represent the interaction of the magnetic perturbation and the plasma rotation with the error field. This model is sufficient to describe qualitatively the locking and unlocking bifurcations. Here, we explore using ML algorithms with the simulation data and experimental data, focusing on the methods that can be used with sparse datasets. These methods lead to the possibility of the avoidance of locking in real-time operations. We describe the operational space in terms of two control parameters: the magnitude of the error field and the rotation frequency associated with the momentum source that maintains the plasma rotation. The outcomes are quan- tified by order parameters that completely characterize the state, whether locked or unlocked. We use unsupervised ML methods to classify locked/unlocked states and note the usefulness of a certain normalization of the order parameters. Three supervised ML classifiers are used in suite to estimate the probability of locking in the region of control parameter space with hysteresis, i.e., the set of control parameters for which both locked and unlocked states can exist. The results show that a neural network gives the best estimate of the locking probability. An analogy of the present locking model with the van der Waals equation of state is also provided.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Robust Group Subspace Recovery: A New Approach for Multi-Modality Data Fusion

Robust Subspace Recovery (RoSuRe) algorithm was recently introduced as a principled and numerically efficient algorithm that unfolds underlying Unions of Subspaces (UoS) structure, present in the data. The union of Subspaces (UoS) is capable of identifying more complex trends in data sets than simple linear models. In this work, we build on and extend RoSuRe to prospect the structure of different data modalities individually. We propose a novel multi-modal data fusion approach based on group sparsity which we refer to as Robust Group Subspace Recovery (RoGSuRe). Relying on a bi-sparsity pursuit paradigm and non-smooth optimization techniques, the introduced framework learns a new joint representation of the time series from different data modalities, respecting an underlying UoS model. We subsequently integrate the obtained structures to form a unified subspace structure. The proposed approach exploits the structural dependencies between the different modalities data to cluster the associated target objects. The resulting fusion of the unlabeled sensors’ data from experiments on audio and magnetic data has shown that our method is competitive with other state of the art subspace clustering methods. The resulting UoS structure is employed to classify newly observed data points, highlighting the abstraction capacity of the proposed method.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

Semantic segmentation with a sparse convolutional neural network for event reconstruction in MicroBooNE

We present the performance of a semantic segmentation network, SparseSSNet, that provides pixel-level classification of MicroBooNE data. The MicroBooNE experiment employs a liquid argon time projection chamber for the study of neutrino properties and interactions. SparseSSNet is a submanifold sparse convolutional neural network, which provides the initial machine learning based algorithm utilized in one of MicroBooNE's ν e -appearance oscillation analyses. The network is trained to categorize pixels into five classes, which are re-classified into two classes more relevant to the current analysis. The output of SparseSSNet is a key input in further analysis steps. This technique, used for the first time in liquid argon time projection chambers data and is an improvement compared to a previously used convolutional neural network, both in accuracy and computing resource utilization. Here, the accuracy achieved on the test sample is ≥ 99%. For full neutrino interaction simulations, the time for processing one image is ≈ 0.5 sec, the memory usage is at 1 GB level, which allows utilization of most typical CPU worker machine.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2018

Communication-avoiding optimization methods for distributed massive-scale sparse inverse covariance estimation

Across a variety of scientific disciplines, sparse inverse covariance estimation is a popular tool for capturing the underlying dependency relationships in multivariate data. Unfortunately, most estimators are not scalable enough to handle the sizes of modern high-dimensional data sets (often on the order of terabytes), and assume Gaussian samples. To address these deficiencies, we introduce HP-CONCORD, a highly scalable optimization method for estimating a sparse inverse covariance matrix based on a regularized pseudolikelihood framework, without assuming Gaussianity. Our parallel proximal gradient method uses a novel communication-avoiding linear algebra algorithm and runs across a multi-node cluster with up to 1k nodes (24k cores), achieving parallel scalability on problems with up to ≈819 billion parameters (1.28 million dimensions); even on a single node, HP-CONCORD demonstrates scalability, outperforming a state-of-the-art method. We also use HP-CONCORD to estimate the underlying dependency structure of the brain from fMRI data, and use the result to identify functional regions automatically. The results show good agreement with a clustering from the neuroscience literature.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Communication-Avoiding Optimization Methods for Distributed Massive-Scale Sparse Inverse Covariance Estimation.

Across a variety of scientific disciplines, sparse inverse covariance estimation is a popular tool for capturing the underlying dependency relationships in multivariate data. Unfortunately, most estimators are not scalable enough to handle the sizes of modern high-dimensional data sets (often on the order of terabytes), and assume Gaussian samples. To address these deficiencies, we introduce HP-CONCORD, a highly scalable optimization method for estimating a sparse inverse covariance matrix based on a regularized pseudolikelihood framework, without assuming Gaussianity. Our parallel proximal gradient method uses a novel communication-avoiding linear algebra algorithm and runs across a multi-node cluster with up to 1k nodes (24k cores), achieving parallel scalability on problems with up to ~819 billion parameters (1.28 million dimensions); even on a single node, HP-CONCORD demonstrates scalability, outperforming a state-of-the-art method. We also use HP-CONCORD to estimate the underlying dependency structure of the brain from fMRI data, and use the result to identify functional regions automatically. The results show good agreement with a clustering from the neuroscience literature.

Koanantakool, Penporn↗
DOE OSTI2015

Group‐sparsity regularization for ill‐posed subsurface flow inverse problems

Abstract Sparse representations provide a flexible and parsimonious description of high‐dimensional model parameters for reconstructing subsurface flow property distributions from limited data. To further constrain ill‐posed inverse problems, group‐sparsity regularization can take advantage of possible relations among the entries of unknown sparse parameters when: (i) groups of sparse elements are either collectively active or inactive and (ii) only a small subset of the groups is needed to approximate the parameters of interest. Since subsurface properties exhibit strong spatial connectivity patterns they may lead to sparse descriptions that satisfy the above conditions. When these conditions are established, a group‐sparsity regularization can be invoked to facilitate the solution of the resulting inverse problem by promoting sparsity across the groups. The proposed regularization penalizes the number of groups that are active without promoting sparsity within each group. Two implementations are presented in this paper: one based on the multiresolution tree structure of Wavelet decomposition, without a need for explicit prior models, and another learned from explicit prior model realizations using sparse principal component analysis (SPCA). In each case, the approach first classifies the parameters of the inverse problem into groups with specific connectivity features, and then takes advantage of the grouped structure to recover the relevant patterns in the solution from the flow data. Several numerical experiments are presented to demonstrate the advantages of additional constraining power of group‐sparsity in solving ill‐posed subsurface model calibration problems.

Golmohammadi, Azarang↗
DOE OSTI2026

GPU-Accelerated Analytic Simulation of Sparse Ionization Signal Formation in Pixelated Projection Detector

This paper presents a GPU-accelerated simulation package, TRED, for next-generation neutrino detectors with pixelated charge readout, leveraging community-driven software ecosystems to ensure adaptability and extensibility. We introduce two generic contributions: (i) an effective-charge representation based on Gaussian quadrature rules, in which the linear- interpolation factors for the field response inside each voxel are absorbed into the effective charge, and (ii) a sparse, block- binned tensor representation that enables efficient FFT-based computation of induced signals on readout electrodes for sparsely activated detector volumes. The former captures structure inside a voxel without dense sampling, while the latter achieves low memory usage and scalable runtime, as demonstrated in bench- mark studies. The underlying data representation is applicable to large-scale detectors and to other computational problems involving sparse activity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

A massively parallel and scalable multi-CPU material point method

Harnessing the power of modern multi-GPU architectures, we present a massively parallel simulation system based on the Material Point Method (MPM) for simulating physical behaviors of materials undergoing complex topological changes, self-collision, and large deformations. Our system makes three critical contributions. First, we introduce a new particle data structure that promotes coalesced memory access patterns on the GPU and eliminates the need for complex atomic operations on the memory hierarchy when writing particle data to the grid. Second, we propose a kernel fusion approach using a new Grid-to-Particles-to-Grid (G2P2G) scheme, which efficiently reduces GPU kernel launches, improves latency, and significantly reduces the amount of global memory needed to store particle data. Finally, we introduce optimized algorithmic designs that allow for efficient sparse grids in a shared memory context, enabling us to best utilize modern multi-GPU computational platforms for hybrid Lagrangian-Eulerian computational patterns. We demonstrate the effectiveness of our method with extensive benchmarks, evaluations, and dynamic simulations with elastoplasticity, granular media, and fluid dynamics. In comparisons against an open-source and heavily optimized CPU-based MPM codebase [Fang et al. 2019] on an elastic sphere colliding scene with particle counts ranging from 5 to 40 million, our GPU MPM achieves over 100x per-time-step speedup on a workstation with an Intel 8086K CPU and a single Quadro P6000 GPU, exposing exciting possibilities for future MPM simulations in computer graphics and computational science. Moreover, compared to the state-of-the-art GPU MPM method [Hu et al. 2019a], we not only achieve 2x acceleration on a single GPU but our kernel fusion strategy and Array-of-Structs-of-Array (AoSoA) data structure design also generalizes to multi-GPU systems. Our multi-GPU MPM exhibits near-perfect weak and strong scaling with 4 GPUs, enabling performant and large-scale simulations on a 10243 grid with close to 100 million particles with less than 4 minutes per frame on a single 4-GPU workstation and 134 million particles with less than 1 minute per frame on an 8-GPU workstation.

Wang, Xinlei↗
DOE OSTI2020

A Sparse Tensor Benchmark Suite for CPUs and GPUs

Tensor computations present significant performance chal- lenges that impact a wide spectrum of applications ranging from machine learning, healthcare analytics, social network analysis, data mining to quantum chemistry and signal processing. Efforts to improve the perfor- mance of tensor computations include exploring data layout, execution scheduling, and parallelism in common tensor kernels. This work presents a benchmark suite for arbitrary-order sparse tensor kernels using state- of-the-art tensor formats: coordinate (COO) and hierarchical coordinate (HiCOO) on CPUs and GPUs. It presents a set of reference tensor kernel implementations that are compatible with real-world tensors and power law tensors extended from synthetic graph generation techniques. We also propose Roofline performance models for these kernels to provide insights of computer platforms from sparse tensor view. This benchmark suite along with the synthetic tensor generator is publicly available.

Li, Jiajia↗
DOE OSTI2022

Enhanced detection of paramagnetic fluorine-19 magnetic resonance imaging agents using zero echo time sequence and compressed sensing

Fluorine-19 ( 19 F) magnetic resonance imaging (MRI) is an emerging technique offering specific detection of labeled cells in vivo. Lengthy acquisition times and modest signal-to-noise ratio (SNR) makes three-dimensional spin-density–weighted 19 F imaging challenging. Recent advances in tracer paramagnetic metallo-perfluorocarbon (MPFC) nanoemulsion probes have shown multifold SNR improvements due to an accelerated 19 F T 1 relaxation rate and a commensurate gain in imaging speed and averages. However, 19 F T 2 -reduction and increased linewidth limit the amount of metal additive in MPFC probes, thus constraining the ultimate SNR. To overcome these barriers, we describe a compressed sampling (CS) scheme, implemented using a “zero” echo time (ZTE) sequence, with data reconstructed via a sparsity-promoting algorithm. Our CS-ZTE scheme acquires k-space data using an undersampled spherical radial pattern and signal averaging. Image reconstruction employs off-the-shelf sparse solvers to solve a joint total variation and -norm regularized least square problem. To evaluate CS-ZTE, we performed simulations and acquired 19 F MRI data at 11.7 T in phantoms and mice receiving MPFC-labeled dendritic cells. For MPFC-labeled cells in vivo, we show SNR gains of ~6.3 × with 8-fold undersampling. We show that this enhancement is due to three mechanisms including undersampling and commensurate increase in signal averaging in a fixed scan time, denoising attributes from the CS algorithm, and paramagnetic reduction of T 1 . Importantly, 19 F image intensity analyses yield accurate estimates of absolute quantification of 19 F spins. Overall, the CS-ZTE method using MPFC probes achieves ultrafast imaging, a substantial boost in detection sensitivity, accurate 19 F spin quantification, and minimal image artifacts.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

Using Multiple Geophysical Methods to Refine a Stratigraphic Conceptual Site Model at a Nuclear Waste Site

At contaminated sites, there is a critical reliance on conceptual site models of which a key component is the geologic framework model (GFM), which is used to build predictive fate and transport modeling in support of remediation goals. Here, we detail an ongoing study at a nuclear waste site (Hanford Site, Washington, USA) where surface geophysical methods were used to complement existing borehole information and to help site new boreholes to update and refine the GFM. Ground-based electrical resistivity tomography (ERT), time-domain electromagnetics (TEM), and seismic data was acquired on the Hanford Site’s Central Plateau, where the presence of a hydraulically transmissive subsurface feature, or paleochannel, was suspected but uncertain based on contaminant concentrations at sparsely located boreholes. To assess and compare ERT, TEM, and seismic geophysical datasets, co-located data was acquired in an area where the existing GFM was more certain. Surrounding the suspected paleochannel, ERT and seismic refraction tomography showed similar subsurface structures consistent with a channelized feature. While TEM interpretation was limited in the suspected paleochannel area due to a thick resistive top layer and high electromagnetic noise, TEM showed greater utility in a different area where these factors were less prevalent. Based on the results of quasi-3D ERT inversions, we propose updates to the GFM, including identifying a paleochannel. Further, we evaluate the utility of geophysical methods and examine lessons learned that will be used as a basis for continued characterization efforts to support site management decisions and implementation efforts.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2019

A communication-avoiding 3D sparse triangular solver

We present a novel distributed memory algorithm to improve the strong scalability of the solution of a sparse triangular system. This operation appears in the solve phase of direct methods for solving general sparse linear systems, Ax = b. Our 3D sparse triangular solver employs several techniques, including a 3D MPI process grid, elimination tree parallelism, and data replication, all of which reduce the per-process communication when combined. We present analytical models to understand the communication cost of our algorithm and show that our 3D sparse triangular solver can reduce the per-process communication volume asymptotically by a factor of O(n1/4) and O(n1/6) for problems arising from the finite element discretizations of 2D "planar" and 3D "non-planar" PDEs, respectively. We implement our algorithm for use in SuperLU_DIST3D, using a hybrid MPI+OpenMP programming model. Our 3D triangular solve algorithm, when run on 12k cores of Cray XC30, outperforms the current state-of-the-art 2D algorithm by 7.2x for planar and 2.7x for the non-planar sparse matrices, respectively.

Sao, Piyush↗
DOE OSTI2020

Distributed Many-to-Many Protein Sequence Alignment using Sparse Matrices

Identifying similar protein sequences is a core step in many computational biology pipelines such as detection of homologous protein sequences, generation of similarity protein graphs for downstream analysis, functional annotation, and gene location. Performance and scalability of protein similarity search have proven to be a bottleneck in many bioinformatics pipelines due to increase in cheap and abundant sequencing data. This work presents a new distributed-memory software PASTIS. PASTIS relies on sparse matrix computations for efficient identification of possibly similar proteins. We use distributed sparse matrices for scalability and show that the sparse matrix infrastructure is a great fit for protein similarity search when coupled with a fully-distributed dictionary of sequences that allow remote sequence requests to be fulfilled. Our algorithm incorporates the unique bias in amino acid sequence substitution in search without altering basic sparse matrix model, and in turn, achieves ideal scaling up to millions of protein sequences.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

High-resolution lithospheric structure of continental China from joint inversion of surface wave and gravity data

The lithospheric structure of continental China has been previously determined by seismic travel time tomography, surface wave tomography, and joint inversion of body wave and surface wave data. However, due to the inherent limitations of seismic data, the lithospheric structure of continental China is still not well resolved in the shallow part and in some regions where the station coverage is relatively sparse. In this study, we aim at improving the lithospheric structure by joint inversion of seismic surface wave data and satellite gravity data to take advantage of the uniform distribution and complementary strength of the gravity data. Here, the empirical relationship between velocity and density is used as a bridge for joint inversion of surface wave and gravity data. The joint inversion shear-wave velocity Vs (density) model, named as USTClitho1.0g, can fit both surface wave and gravity data well. This high-resolution Vs model can better fit the active airgun source seismic arrival times and better delineate some features in continental China, such as the velocity contrast across the north–south gravity lineament (NSGL), the lithosphere thinning in eastern China, the crustal footprint of the Hainan mantle plume, the likely magma chamber beneath volcanos in northeast China, the middle-lower crust low velocity layer beneath the Tibetan plateau, and the tearing of subducted Indian mantle lithosphere. Our joint inversion Vs model can provide a reference model for geosciences in continental China and surrounding areas.

58 GEOSCIENCES↗