Search NASA⌕ Search

SEARCH · Search NASA

Results for “compressive sensing”

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 109 records · Page 6

Kalman-filtered compressive sensing for high resolution estimation of anthropogenic greenhouse gas emissions from sparse measurements.

The estimation of fossil-fuel CO2 emissions (ffCO2) from limited ground-based and satellite measurements of CO2 concentrations will form a key component of the monitoring of treaties aimed at the abatement of greenhouse gas emissions. The limited nature of the measured data leads to a severely-underdetermined estimation problem. If the estimation is performed at fine spatial resolutions, it can also be computationally expensive. In order to enable such estimations, advances are needed in the spatial representation of ffCO2 emissions, scalable inversion algorithms and the identification of observables to measure. To that end, we investigate parsimonious spatial parameterizations of ffCO2 emissions which can be used in atmospheric inversions. We devise and test three random field models, based on wavelets, Gaussian kernels and covariance structures derived from easily-observed proxies of human activity. In doing so, we constructed a novel inversion algorithm, based on compressive sensing and sparse reconstruction, to perform the estimation. We also address scalable ensemble Kalman filters as an inversion mechanism and quantify the impact of Gaussian assumptions inherent in them. We find that the assumption does not impact the estimates of mean ffCO2 source strengths appreciably, but a comparison with Markov chain Monte Carlo estimates show significant differences in the variance of the source strengths. Finally, we study if the very different spatial natures of biogenic and ffCO2 emissions can be used to estimate them, in a disaggregated fashion, solely from CO2 concentration measurements, without extra information from products of incomplete combustion e.g., CO. We find that this is possible during the winter months, though the errors can be as large as 50%.

Ray, Jaideep↗

Phase Imaging: A Compressive Sensing Approach

Since Wolfgang Pauli posed the question in 1933, whether the probability densities |Ψ(r)|² (real-space image) and |Ψ(q)|² (reciprocal space image) uniquely determine the wave function Ψ(r) [1], the so called Pauli Problem sparked numerous methods in all fields of microscopy [2, 3]. Reconstructing the complete wave function Ψ(r) = a(r)e-iφ(r) with the amplitude a(r) and the phase φ(r) from the recorded intensity enables the possibility to directly study the electric and magnetic properties of the sample through the phase. In transmission electron microscopy (TEM), electron holography is by far the most established method for phase reconstruction [4]. Requiring a high stability of the microscope, next to the installation of a biprism in the TEM, holography cannot be applied to any microscope straightforwardly. Recently, a phase retrieval approach was proposed using conventional TEM electron diffractive imaging (EDI). Using the SAD aperture as reciprocal-space constraint, a localized sample structure can be reconstructed from its diffraction pattern and a real-space image using the hybrid input-output algorithm [5]. We present an alternative approach using compressive phase-retrieval [6]. Our approach does not require a real-space image. Instead, random complimentary pairs of checkerboard masks are cut into a 200 nm Pt foil covering a conventional TEM aperture (cf. Figure 1). Used as SAD aperture, subsequently diffraction patterns are recorded from the same sample area. Hereby every mask blocks different parts of gold particles on a carbon support (cf. Figure 2). The compressive sensing problem has the following formulation. First, we note that the complex-valued reciprocal-space wave-function is the Fourier transform of the (also complex-valued) real-space wave-function, Ψ(q) = F[Ψ(r)], and subsequently the diffraction pattern image is given by |Ψ(q)|2 = |F[Ψ(r)]|2. We want to find Ψ(r) given a few differently coded diffraction pattern measurements yn = |F[HnΨ(r)]|2, where the matrices Hn encode the mask structure of the aperture. This is a nonlinear inverse problem, but has been shown to be solvable even in the underdetermined case [6]. Since each diffraction pattern yn contains diffraction information from selected regions of the same sample, the differences in each pattern contain local phase information, which can be combined to form a full estimate of the real-space wave-function[7]. References: [1] W. Pauli in “Die allgemeinen Prinzipien der Wellenmechanik“, ed. H Geiger and W Scheel, (Julius Springer, Berlin). [2] A. Tonomura, Rev. Mod. Phys. 59 (1987), p. 639. [3] J. Miao et al, Nature 400 (1999), p. 342. [4] H. Lichte et al, Annu. Rev. Mater. Res. 37 (2007), p. 539. [5] J. Yamasaki et al, Appl. Phys. Lett. 101 (2012), 234105. [6] P Schniter and S Rangan. Signal Proc., IEEE Trans. on. 64(4), (2015), pp. 1043. [7] Supported by the Chemical Imaging, Signature Discovery, and Analytics in Motion initiatives at PNNL. PNNL is operated by Battelle Memorial Inst. for the US DOE; contract DE-AC05-76RL01830.

Schneider, Sebastian↗

Joint Sparsity Pattern Recovery With 1-b Compressive Sensing in Distributed Sensor Networks

In this paper, we study the problem of joint sparse support recovery with 1-b quantized compressive measurements in a distributed sensor network. Multiple nodes in the network are assumed to observe sparse signals having the same but unknown sparse support. Each node quantizes its measurement vector element-wise to 1 b. First, we consider that all the quantized measurements are available at a central fusion center. We derive performance bounds for sparsity pattern recovery using 1-bit quantized measurements from multiple sensors when the maximum likelihood decoder is employed. We further develop two computationally tractable algorithms for joint sparse support recovery in the centralized setting. One algorithm minimizes a cost function defined as the sum of the likelihood function and the l-∝ quasi-norm, while the other algorithm extends the binary iterative hard thresholding algorithm to the multiple measurement vector case. Second, we consider a decentralized setting where each node transmits 1-b measurements to its one-hop neighbors. The basic idea behind the algorithms developed in the decentralized setting is to embed collaboration among nodes and fusion strategies. We show that even with noisy 1-b compressed measurements, joint support recovery can be carried out accurately in both centralized and decentralized settings. Additionally, we further show that the performance of the proposed 1-bit compressive sensing-based algorithms is very close to that of their real-valued counterparts except when the signal-to-noise ratio is very small.

97 MATHEMATICS AND COMPUTING↗

Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations

The recovery of approximately sparse or compressible coefficients in a polynomial chaos expansion is a common goal in many modern parametric uncertainty quantification (UQ) problems. However, relatively little effort in UQ has been directed toward theoretical and computational strategies for addressing the sparse corruptions problem, where a small number of measurements are highly corrupted. Such a situation has become pertinent today since modern computational frameworks are sufficiently complex with many interdependent components that may introduce hardware and software failures, some of which can be difficult to detect and result in a highly polluted simulation result. In this paper we present a novel compressive sampling--based theoretical analysis for a regularized $\ell^1$ minimization algorithm that aims to recover sparse expansion coefficients in the presence of measurement corruptions. Our recovery results are uniform (the theoretical guarantees hold for all compressible signals and compressible corruptions vectors) and prescribe algorithmic regularization parameters in terms of a user-defined a priori estimate on the ratio of measurements that are believed to be corrupted. We also propose an iteratively reweighted optimization algorithm that automatically refines the value of the regularization parameter and empirically produces superior results. Lastly, our numerical results test our framework on several medium to high dimensional examples of solutions to parameterized differential equations and demonstrate the effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗

Holey-Cavity-Based Compressive Sensing for Ultrasound Imaging

The use of solid cavities around electromagnetic sources has been recently reported as a mechanism to provide enhanced images at microwave frequencies. These cavities are used as measurement randomizers; and they compress the wave fields at the physical layer. As a result of this compression, the amount of information collected by the sensing array through the different excited modes inside the resonant cavity is increased when compared to that obtained by no-cavity approaches. In this work, a two-dimensional cavity, having multiple openings, is used to perform such a compression for ultrasound imaging. Moreover, compressive sensing techniques are used for sparse signal retrieval with a limited number of operating transceivers. As a proof-of-concept of this theoretical investigation, two point-like targets located in a uniform background medium are imaged in the presence and the absence of the cavity. In addition, an analysis of the sensing capacity and the shape of the point spread function is also carried out for the aforementioned cases. The cavity is designed to have the maximum sensing capacity given different materials and opening sizes. It is demonstrated that the use of a cavity, whether it is made of plastic or metal, can significantly enhance the sensing capacity and the point spread function of a focused beam. The imaging performance is also improved in terms cross-range resolution when compared to the no-cavity case

42 ENGINEERING↗

Compressed Sensing of Scanning Transmission Electron Microscopy (STEM) With Nonrectangular Scans

Scanning transmission electron microscopy (STEM) has become the main stay for materials characterization on atomic level, with applications ranging from visualization of localized and extended defects to mapping order parameter fields. In recent years, attention has focused on the potential of STEM to explore beam induced chemical processes and especially manipulating atomic motion, enabling atom-by-atom fabrication. These applications, as well as traditional imaging of beam sensitive materials, necessitate increasing the dynamic range of STEM in imaging and manipulation modes, and increasing the absolute scanning speed which can be achieved by combining sparse sensing methods with nonrectangular scanning trajectories. We have developed a general method for real-time reconstruction of sparsely sampled images from high-speed, noninvasive and diverse scanning pathways, including spiral scan and Lissajous scan. This approach is demonstrated on both the synthetic data and experimental STEM data on the beam sensitive material graphene. This work opens the door for comprehensive investigation and optimal design of dose efficient scanning strategies and real-time adaptive inference and control of e-beam induced atomic fabrication.

47 OTHER INSTRUMENTATION↗

Optimal sensor placement for reconstructing wind pressure field around buildings using compressed sensing

Deciding how to optimally deploy sensors in a large, complex, and spatially extended structure is critical to ensure that the surface pressure field is accurately captured for subsequent analysis and design. In some cases, reconstruction of missing data is required in downstream tasks such as the development of digital twins. Here, this paper presents a data-driven sparse sensor selection algorithm, aiming to provide the most information contents for reconstructing aerodynamic characteristics of wind pressures over tall building structures parsimoniously. The algorithm first fits a set of basis functions to the training data, then applies a computationally efficient QR algorithm that ranks existing pressure sensors in order of importance based on the state reconstruction to this tailored basis. The findings of this study show that the proposed algorithm successfully re- constructs the aerodynamic characteristics of tall buildings from sparse measurement locations, generating stable and optimal solutions across a range of conditions. As a result, this study serves as a promising first step toward leveraging the success of data-driven and machine learning algorithms to supplement traditional genetic algorithms currently used in wind engineering.

42 ENGINEERING↗

Compressed sensing with sparse corruptions: Fault-tolerant sparse collocation approximations

The recovery of approximately sparse or compressible coefficients in a polynomial chaos expansion is a common goal in many modern parametric uncertainty quantification (UQ) problems. However, relatively little effort in UQ has been directed toward theoretical and computational strategies for addressing the sparse corruptions problem, where a small number of measurements are highly corrupted. Such a situation has become pertinent today since modern computational frameworks are sufficiently complex with many interdependent components that may introduce hardware and software failures, some of which can be difficult to detect and result in a highly polluted simulation result. In this paper we present a novel compressive sampling-based theoretical analysis for a regularized t1 minimization algorithm that aims to recover sparse expansion coefficients in the presence of measurement corruptions. Our recovery results are uniform (the theoretical guarantees hold for all compressible signals and compressible corruptions vectors), and prescribe algorithmic regularization parameters in terms of a user-defined a priori estimate on the ratio of measurements that are believed to be corrupted. We also propose an iteratively reweighted optimization algorithm that automatically refines the value of the regularization parameter, and empirically produces superior results. Our numerical results test our framework on several medium-to-high dimensional examples of solutions to parameterized differential equations, and demonstrate the effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗

Compressive sensing optical design and simulation tool

A system or method for designing optical systems includes generating a mathematical model of an imaging system; tracing a plurality of light rays from a source through the model of the imaging system in a forward direction and a backward direction incident upon an arbitrarily defined detector location; calculating the total light rays incident upon the arbitrarily defined detector location in response to the plurality of light rays; tracing a series of calibration images first through the computational or compressive imager mathematical model; measuring an output set of parameters based on a plurality of detected rays calibration images at the defined detector location; storing the output set of parameters in software, and determining an estimated system transfer function.

42 ENGINEERING↗

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 ↗