Search NASA⌕ Search

SEARCH · Search NASA

Results for “sparse”

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 613 records · Page 34

An RFI Detection Algorithm for Microwave Radiometers Using Sparse Component Analysis

Radio Frequency Interference (RFI) is a threat to passive microwave measurements and if undetected, can corrupt science retrievals. The sparse component analysis (SCA) for blind source separation has been investigated to detect RFI in microwave radiometer data. Various techniques using SCA have been simulated to determine detection performance with continuous wave (CW) RFI.

radiometers↗

An RFI Detection Algorithm for Microwave Radiometers Using Sparse Component Analysis

Radio Frequency Interference (RFI) is a threat to passive microwave measurements and if undetected, can corrupt science retrievals. The sparse component analysis (SCA) for blind source separation has been investigated to detect RFI in microwave radiometer data. Various techniques using SCA have been simulated to determine detection performance with continuous wave (CW) RFI.

radiometers↗

Semi-Weekly Monitoring of the Performance and Attitude of Kepler Using a Sparse Set of Targets

The Kepler spacecraft is in a heliocentric Earth-trailing orbit, continuously observing ~160,000 select stars over ~115 square degrees of sky using its photometer containing 42 highly sensitive CCDs. The science data from these stars, consisting of ~6 million pixels at 29.4-minute intervals, is downlinked only every ~30 days. Additional low-rate Xband communications contacts are conducted with the spacecraft twice a week to downlink a small subset of the science data. This paper describes how we assess and monitor the performance of the photometer and the pointing stability of the spacecraft using such a sparse data set.

Attitude reconstruction↗

Application of Sparse Identification of Nonlinear Dynamics for Physics-Informed Learning

Advances in machine learning and deep neural networks has enabled complex engineering tasks like image recognition, anomaly detection, regression, and multi-objective optimization, to name but a few. The complexity of the algorithm architecture, e.g., the number of hidden layers in a deep neural network, typically grows with the complexity of the problems they are required to solve, leaving little room for interpreting (or explaining) the path that results in a specific solution. This drawback is particularly relevant for autonomous aerospace and aviation systems, where certifications require a complete understanding of the algorithm behavior in all possible scenarios. Including physics knowledge in such data-driven tools may improve the interpretability of the algorithms, thus enhancing model validation against events with low probability but relevant for system certification. Such events include, for example, spacecraft or aircraft sub-system failures, for which data may not be available in the training phase. This paper investigates a recent physics-informed learning algorithm for identification of system dynamics, and shows how the governing equations of a system can be extracted from data using sparse regression. The learned relationships can be utilized as a surrogate model which, unlike typical data-driven surrogate models, relies on the learned underlying dynamics of the system rather than large number of fitting parameters. The work shows that the algorithm can reconstruct the differential equations underlying the observed dynamics using a single trajectory when no uncertainty is involved. However, the training set size must increase when dealing with stochastic systems, e.g., nonlinear dynamics with random initial conditions.

Corbetta, Matteo↗

Regional Tropical Aboveground Biomass Mapping with L-Band Repeat-Pass Interferometric Radar, Sparse Lidar, and Multiscale Superpixels

We introduce a multiscale superpixel approach that leverages repeat-pass interferometric coherence and sparse AGB estimates from a simulated spaceborne lidar in order to extend the NISAR mission’s applicable range of aboveground biomass (AGB) in tropical forests. Airborne and spaceborne L-band radar and full-waveform airborne lidar data are used to simulate the NISAR and GEDI mission, respectively. In addition to UAVSAR data, we use spaceborneALOS-2/PALSAR-2 imagery with 14-day temporal baseline, which is comparable to NISAR’s 12-daybaseline. Our reference AGB maps are derived from the airborne LVIS data during the AfriSAR campaign for three sites (Mondah, Ogooue, and Lope). Each tropical site has mean AGB of at least 125 Mg/ha in addition to areas with AGB exceeding 700 Mg/ha. Spatially sampling from these LVIS-derived AGB reference maps, we approximate GEDI AGB estimates. To evaluate our methodology, we perform several different analyses. First, we partition each study site into low(≤100 Mg/ha) and high (>100 Mg/ha) AGB areas, in conformity with the NISAR mission requirement to provide AGB estimates for forests between 0 and 100 Mg/ha with a RMSE below 20 Mg/ha. In the low AGB areas, this RMSE requirement is satisfied in Lope and Mondah and it fell short of the requirement in Ogooue by less 3 Mg/ha with UAVSAR and 6 Mg/ha with PALSAR-2. We note that our maps have finer spatial resolution (50 m) than NISAR requires (1 hectare). In the high AGB areas, the normalized RMSE increases to 51% (i.e.,<90 Mg/ha), but with negligible bias for all three sites. Second, we train a single model to estimate AGB across both high and low AGB regimes simultaneously and obtain a normalized RMSE that is<60% (or<100 Mg/ha). Lastly, we show the use of both (a) multiscale superpixels and (b) interferometric coherence significantly improves the accuracy of the AGB estimates. The InSAR coherence improved the RMSE by approximately 8% at Mondah with both sensors, lowering the RMSE from 59 Mg/ha to 47.4 Mg/h with UAVSAR and from 57.1 Mg/ha to 46 Mg/ha. This work illustrates one of the numerous synergistic relationships between the spaceborne lidars, such as GEDI, with L-band SAR, such as PALSAR-2 and NISAR, in order to produce robust regional AGB in high biomass tropical regions.

NISAR↗

Estimating Bare Earth in Sparse Boreal Forests With WorldView Stereo Imagery

Circumboreal forests are currently experiencing rapid climate warming which is altering their structure, productivity, and status as a carbon sink. Very-high resolution (VHR, <2 m) stereo derived digital surface models are available to monitor these forests, but, a similar resolution digital terrain model (DTM) is required to extract information about tree height, which is often used to estimate carbon content. To our knowledge, no openly available VHR DTM currently exists. To address this need, we developed approaches to extract DTMs by filtering VHR stereo point clouds (PCs) in sparse canopies of Alaska. Our evaluation consisted of two stereo processing methods with three PC search radii, at six different tree canopy cover (TCC) intervals. We found VHR DTMs were robust for estimating bare ground at TCC intervals less than 40% with vertical errors <1.6 m using airborne small footprint light detection and ranging (LiDAR) as reference.

Christopher S R Neigh↗

Estimating Bare Earth in Sparse Boreal Forests With WorldView Stereo Imagery

Circumboreal forests are currently experiencing rapid climate warming which is altering their structure, productivity, and status as a carbon sink. Very-high resolution (VHR, <2 m) stereo derived digital surface models are available to monitor these forests, but, a similar resolution digital terrain model (DTM) is required to extract information about tree height, which is often used to estimate carbon content. To our knowledge, no openly available VHR DTM currently exists. To address this need, we developed approaches to extract DTMs by filtering VHR stereo point clouds (PCs) in sparse canopies of Alaska. Our evaluation consisted of two stereo processing methods with three PC search radii, at six different tree canopy cover (TCC) intervals. We found VHR DTMs were robust for estimating bare ground at TCC intervals less than 40% with vertical errors <1.6 m using airborne small footprint light detection and ranging (LiDAR) as reference.

Christopher S. R. Neigh↗

3D Shape Reconstruction of Small Bodies from Sparse Features

The autonomous approach of spacecraft to a small body (comet or asteroid) relies on using all available information at each phase of the approach. This paper presents new algorithms for global shape reconstructions from sparse tracked surface points. These methods leverage estimates from earlier phases, such as rotation pole, as well as a priori knowledge, such as a genus-0 body (i.e. without boundaries or topological holes). A mapping algorithm is proposed, which performs faithful reconstructions while enforcing genus-0 output through spherical parameterization. To estimate the shape of permanently shadowed regions of the body, a symmetry reconstruction method is added to the reconstruction algorithms. This method is shown to substantially increase the reconstruction accuracy but is subject to the symmetry of the body perpendicular to the rotation pole. The proposed mapping algorithm is compared to stateof- the-practice surface reconstruction algorithms, assessing their accuracy and ability to correctly generate genus-0 shape models for 2400 datasets and three small bodies. The proposed spherical parameterization algorithm performed consistently with the state-of-the-practice while being the only algorithm to always produce genus-0 shape models.

Nesnas, Issa↗

Incorporating ADAPT-VQE with a Sparse Wavefunction Circuit Simulator to Find Compact Quantum Circuits for Chemical Applications

We implemented the ADAPT-VQE algorithm into our recent classical sparse wavefunction circuit simulator to demonstrate that classical resources can (1) efficiently find a physically motivated compact wavefunction ansatz for further refinement on near-term quantum hardware and (2) benchmark expected results of VQE-based algorithms once the quantum hardware is available to study large-scale applications. In particular, we study the role of the ADAPT-VQE operator pool, molecular basis set selection, and variations such as TETRIS-ADAPT-VQE on the performance of our classical circuit simulator. This work demonstrates the promise of using classical resources to generate highly accurate wavefunctions that can be prepared on quantum hardware to initiate other quantum algorithms such as phase estimation. Our approach harnesses the power of high-performance computing resources with the more limited available quantum computers to map a path toward quantum advantage for electronic structure calculations in chemistry and materials science.

Quantum Computing↗

Novel calibration system with sparse wires for CMB polarization receivers

B-modes in the cosmic microwave background (CMB) polarization is a smoking gun signature of the inflationary universe. To achieve better sensitivity to this faint signal, CMB polarization experiments aim to maximize the number of detector elements, resulting in a large focal plane receiver. Detector calibration of the polarization response becomes essential. It is extremely useful to be able to calibrate 'simultaneously' all detectors on the large focal plane. We developed a novel calibration system that rotates a large 'sparse' grid of metal wires, in front of and fully covering the field of view of the focal plane receiver. Polarized radiation is created via the reflection of ambient temperature from the wire surface. Since the detector has a finite beam size, the observed signal is smeared according to the beam property. The resulting smeared polarized radiation has a reasonable intensity (a few Kelvin or less) compared to the sky temperature ({approx}10 K observing condition). The system played a successful role for receiver calibration of QUIET, a CMB polarization experiment located in the Atacama desert in Chile. The successful performance revealed that this system is applicable to other experiments based on different technologies, e.g. TES bolometers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Iterative packing for demand matching and sparse packing.

The main result we will present is a 2k-approximation algorithm for the following 'k-hypergraph demand matching' problem: given a set system with sets of size <=k, where sets have profits & demands and vertices have capacities, find a max-profit subsystem whose demands do not exceed the capacities. The main tool is an iterative way to explicitly build a decomposition of the fractional optimum as 2k times a convex combination of integral solutions. If time permits we'll also show how the approach can be extended to a 3-approximation for 2-column sparse packing. The second result is tight w.r.t the integrality gap, and the first is near-tight as a gap lower bound of 2(k-1+1/k) is known.

99 GENERAL AND MISCELLANEOUS↗

Extending adaptive sparse grids for stochastic collocation to hybrid parallel architectures

We are developing an adaptive sparse grid library tailored for emerging architectures that will allow the solution of stochastic problems of unprecedented size. This paper gives a brief overview of the problem at hand and presents initial results for a small GPU-based cluster. An outlook on large-scale distributed memory parallelization and our hybrid design approach is also included.

99 GENERAL AND MISCELLANEOUS↗

Object detection approach using generative sparse, hierarchical networks with top-down and lateral connections for combining texture/color detection and shape/contour detection

An approach to detecting objects in an image dataset may combine texture/color detection, shape/contour detection, and/or motion detection using sparse, generative, hierarchical models with lateral and top-down connections. A first independent representation of objects in an image dataset may be produced using a color/texture detection algorithm. A second independent representation of objects in the image dataset may be produced using a shape/contour detection algorithm. A third independent representation of objects in the image dataset may be produced using a motion detection algorithm. The first, second, and third independent representations may then be combined into a single coherent output using a combinatorial algorithm.

97 MATHEMATICS AND COMPUTING↗

Object detection approach using generative sparse, hierarchical networks with top-down and lateral connections for combining texture/color detection and shape/contour detection

An approach to detecting objects in an image dataset may combine texture/color detection, shape/contour detection, and/or motion detection using sparse, generative, hierarchical models with lateral and top-down connections. A first independent representation of objects in an image dataset may be produced using a color/texture detection algorithm. A second independent representation of objects in the image dataset may be produced using a shape/contour detection algorithm. A third independent representation of objects in the image dataset may be produced using a motion detection algorithm. The first, second, and third independent representations may then be combined into a single coherent output using a combinatorial algorithm.

97 MATHEMATICS AND COMPUTING↗

Sparse Bayesian Regression with Integrated Feature Selection for Nuclear Reactor Analysis

High-dimensional, nonlinear function estimation using large datasets is a current area of interest in the machine learning community, and applications may be found throughout the analytical sciences, where ever-growing datasets are making more information available to the analyst. In this paper, we leverage the existing relevance vector machine, a sparse Bayesian version of the well-studied support vector machine, and expand the method to include integrated feature selection and automatic function shaping. These innovations produce an algorithm that is able to distinguish variables that are useful for making predictions of a response from variables that are unrelated or confusing. We test the technology using synthetic data, conduct initial performance studies, and develop a model capable of making position-independent predictions of the coreaveraged burnup using a single specimen drawn randomly from a nuclear reactor core.

Dayman, Ken J↗

Context-dependent piano music transcription with convolutional sparse coding

The present disclosure presents a novel approach to automatic transcription of piano music in a context-dependent setting. Embodiments described herein may employ an efficient algorithm for convolutional sparse coding to approximate a music waveform as a summation of piano note waveforms convolved with associated temporal activations. The piano note waveforms may be pre-recorded for a particular piano that is to be transcribed and may optionally be pre-recorded in the specific environment where the piano performance is to be performed. During transcription, the note waveforms may be fixed and associated temporal activations may be estimated and post-processed to obtain the pitch and onset transcription. Experiments have shown that embodiments of the disclosure significantly outperform state-of-the-art music transcription methods trained in the same context-dependent setting, in both transcription accuracy and time precision, in various scenarios including synthetic, anechoic, noisy, and reverberant environments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sparse sampling methods and probe systems for analytical instruments

Sparse sampling approaches and probe systems for analytical instruments are disclosed providing for effective sub-sampling of a specimen and inpainting to reconstruct representations of actual information. The sub-sampling involves serial acquisition of contiguous measured values lying at positions along a scan path extending in a line toward a first direction and having random perturbations in a second direction. The perturbations are limited within a predetermined distance from the line. Inpainting techniques are utilized among the measured values to reconstruct a representation of actual information regarding the specimen.

Kovarik, Libor↗

A GPU-Accelerated Structurally-Symmetric Sparse Multifrontal Solver

In this poster, a GPU-accelerated sparse multifrontal solver for structurally symmetric matrices is described. The implementation is tested on the Summit supercomputer against the current version, which is parallelized via MPI and OpenMP on CPUs. The GPU-accelerated implementation achieves significant speedup from the original code.

Synk, Ryan↗