Search NASA⌕ Search

SEARCH · Search NASA

Results for “sparse representations”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Classification of multispectral or hyperspectral satellite imagery using clustering of sparse approximations on sparse representations in learned dictionaries obtained using efficient convolutional sparse coding

An approach for land cover classification, seasonal and yearly change detection and monitoring, and identification of changes in man-made features may use a clustering of sparse approximations (CoSA) on sparse representations in learned dictionaries. The learned dictionaries may be derived using efficient convolutional sparse coding to build multispectral or hyperspectral, multiresolution dictionaries that are adapted to regional satellite image data. Sparse image representations of images over the learned dictionaries may be used to perform unsupervised k-means clustering into land cover categories. The clustering process behaves as a classifier in detecting real variability. This approach may combine spectral and spatial textural characteristics to detect geologic, vegetative, hydrologic, and man-made features, as well as changes in these features over time.

47 OTHER INSTRUMENTATION↗
DOE OSTI2017

Model's sparse representation based on reduced mixed GMsFE basis methods

In this paper, we propose a model's sparse representation based on reduced mixed generalized multiscale finite element (GMsFE) basis methods for elliptic PDEs with random inputs. A typical application for the elliptic PDEs is the flow in heterogeneous random porous media. Mixed generalized multiscale finite element method (GMsFEM) is one of the accurate and efficient approaches to solve the flow problem in a coarse grid and obtain the velocity with local mass conservation. When the inputs of the PDEs are parameterized by the random variables, the GMsFE basis functions usually depend on the random parameters. This leads to a large number degree of freedoms for the mixed GMsFEM and substantially impacts on the computation efficiency. In order to overcome the difficulty, we develop reduced mixed GMsFE basis methods such that the multiscale basis functions are independent of the random parameters and span a low-dimensional space. To this end, a greedy algorithm is used to find a set of optimal samples from a training set scattered in the parameter space. Reduced mixed GMsFE basis functions are constructed based on the optimal samples using two optimal sampling strategies: basis-oriented cross-validation and proper orthogonal decomposition. Although the dimension of the space spanned by the reduced mixed GMsFE basis functions is much smaller than the dimension of the original full order model, the online computation still depends on the number of coarse degree of freedoms. To significantly improve the online computation, we integrate the reduced mixed GMsFE basis methods with sparse tensor approximation and obtain a sparse representation for the model's outputs. The sparse representation is very efficient for evaluating the model's outputs for many instances of parameters. To illustrate the efficacy of the proposed methods, we present a few numerical examples for elliptic PDEs with multiscale and random inputs. In particular, a two-phase flow model in random porous media is simulated by the proposed sparse representation method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

A Novel Fault Diagnosis Approach for Rolling Bearing Based on CWT and Adaptive Sparse Representation

Extraction and enhancement of weak impulse signature is the key of rolling bearing fault prognostics in which case the features are often weak and covered by noise. Tunable Q-factor wavelet transform (TQWT), as an emerging wavelet construction theory developed in a frequency domain explicitly, has the advantages of matching with the specific oscillation behavior of signal components. In this article, an adaptive sparse representation (ASR) method is proposed, which integrates the sparse code shrinkage (SCS) and parameter optimization into TQWT. However, direct application of ASR is difficult to extract fault signatures at the early stage or low-speed operation due to weak fault symptoms and background noise. A novel fault diagnosis strategy based on continuous wavelet transform (CWT) and ASR is investigated. CWT owns significant advantages on multiscale subdivision and weak signal detection. The results of simulated and experimental vibration signal analyses verify the effectiveness of the proposed method in accurately extracting weak impulse features from the noise environment.

Yuan, Xing↗
DOE OSTI2017

Sparse Representations to Replace TOFD Images in Non-destructive Testing of Materials

This paper describes a proposed method for the selection of relevant samples of ultrasonic signals during automatic material inspection. Instead of the well-known time of flight diffraction (TOFD) images, data are stored as a sparse matrix in which the elements only indicate whether a defect has been detected. This technique avoids storage of useless signals received during probe displacement in cases of low and high signal-to-noise ratios that correspond to coarse-grained and fine-grained materials, respectively. The approach is based on comparing the positions of maximum amplitudes, which are randomly located when signals only consist of noise but are in the same signal range when a defect is detected. The matrix elements are then applied as inputs to a self organizing map by neural networks to produce a normalized sparse matrix as the output, with a constant number of elements. This approach will be beneficial to enable the use of selected data in intelligent systems requiring a fixed number of inputs to characterize defects.

42 ENGINEERING↗
DOE OSTI2019

An Efficient Mixed-Mode Representation of Sparse Tensors

The Compressed Sparse Fiber (CSF) representation for sparse tensors is a generalization of the Compressed Sparse Row (CSR) format for sparse matrices. For a tensor with d modes, typical tensor methods such as CANDECOMP/PARAFAC decomposition (CPD) require a sequence of d tensor computations, where efficient memory access with respect to different modes is required for each of them.The straightforward solution is to use d distinct representations of the tensor, with each one being efficient for one of the d computations. However, a d-fold space overhead is often unacceptable in practice, especially with memory-constrained GPUs. In this paper, we present a mixed-mode tensor representation that partitions the tensor’s nonzero elements into disjoint sections, each of which is compressed to create fibers along a different mode. Experimental results on the latest generation of GPU device demonstrate that better performance can be achieved by using the mixed-mode representation, while utilizing only a small fraction of the space required to keep d distinct CSF representations.

Nisa, Israt↗
DOE OSTI2017

Multivariate quadrature for representing cloud condensation nuclei activity of aerosol populations

Here, sparse representations of atmospheric aerosols are needed for efficient regional- and global-scale chemical transport models. Here we introduce a new framework for representing aerosol distributions, based on the quadrature method of moments. Given a set of moment constraints, we show how linear programming, combined with an entropy-inspired cost function, can be used to construct optimized quadrature representations of aerosol distributions. The sparse representations derived from this approach accurately reproduce cloud condensation nuclei (CCN) activity for realistically complex distributions simulated by a particleresolved model. Additionally, the linear programming techniques described in this study can be used to bound key aerosol properties, such as the number concentration of CCN. Unlike the commonly used sparse representations, such as modal and sectional schemes, the maximum-entropy approach described here is not constrained to pre-determined size bins or assumed distribution shapes. This study is a first step toward a particle-based aerosol scheme that will track multivariate aerosol distributions with sufficient computational efficiency for large-scale simulations.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

Convolutional Dictionary Learning: A Comparative Review and New Algorithms

Convolutional sparse representations are a form of sparse representation with a dictionary that has a structure that is equivalent to convolution with a set of linear filters. Additionally, while effective algorithms have recently been developed for the convolutional sparse coding problem, the corresponding dictionary learning problem is substantially more challenging. Furthermore, although a number of different approaches have been proposed, the absence of thorough comparisons between them makes it difficult to determine which of them represents the current state of the art. The present work both addresses this deficiency and proposes some new approaches that outperform existing ones in certain contexts. A thorough set of performance comparisons indicates a very wide range of performance differences among the existing and proposed methods, and clearly identifies those that are the most effective.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

First- and Second-Order Methods for Online Convolutional Dictionary Learning

Convolutional sparse representations are a form of sparse representation with a structured, translation-invariant dictionary. Most convolutional dictionary learning algorithms to date operate in batch mode, requiring simultaneous access to all training images during the learning process, which results in very high memory usage and severely limits the training data size that can be used. Very recently, however, a number of authors have considered the design of online convolutional dictionary learning algorithms that offer far better scaling of memory and computational cost with training set size than batch methods. This study extends our prior work, improving a number of aspects of our previous algorithm; proposing an entirely new one, with better performance, that supports the inclusion of a spatial mask for learning from incomplete data; and providing a rigorous theoretical analysis of these methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Dictionary Learning with Accumulator Neurons

The Locally Competitive Algorithm (LCA) uses local competition between non-spiking leaky integrator neurons to infer sparse representations, allowing for potentially real-time execution on massively parallel neuromorphic architectures such as Intel's Loihi processor. Here, we focus on the problem of inferring sparse representations from streaming video using dictionaries of spatiotemporal features optimized in an unsupervised manner for sparse reconstruction. Non-spiking LCA has previously been used to achieve unsupervised learning of spatiotemporal dictionaries composed of convolutional kernels from raw, unlabeled video. We demonstrate how unsupervised dictionary learning with spiking LCA (\hbox{S-LCA}) can be efficiently implemented using accumulator neurons, which combine a conventional leaky-integrate-and-fire (\hbox{LIF}) spike generator with an additional state variable that is used to minimize the difference between the integrated input and the spiking output. We demonstrate dictionary learning across a wide range of dynamical regimes, from graded to intermittent spiking, for inferring sparse representations of both static images drawn from the CIFAR database as well as video frames captured from a DVS camera. On a classification task that requires identification of the suite from a deck of cards being rapidly flipped through as viewed by a DVS camera, we find essentially no degradation in performance as the LCA model used to infer sparse spatiotemporal representations migrates from graded to spiking. We conclude that accumulator neurons are likely to provide a powerful enabling component of future neuromorphic hardware for implementing online unsupervised learning of spatiotemporal dictionaries optimized for sparse reconstruction of streaming video from event based DVS cameras.

artificial intelligence↗
DOE OSTI2017

Compressive Classification for TEM-EELS

Acquiring atomic-resolution images of beam sensitive materials or under dynamic conditions (e.g. operando STEM) is very difficult and requires precise dose fractioning to minimize the dose delivered to the sample and acquire the data more rapidly than dynamics present. Typical methods of low-dose STEM imaging include adjusting the beam current, dwell-time, and probe Scanning transmission electron microscopy (STEM) is used routinely to obtain atomic-resolution images of a small selection of radiation tolerant materials under stable conditions.size. All three of these determine the dose over a spatial area in STEM. Recently, compressive sensing [1] has been applied to electron microscopy. The computational imaging method of inpainting [2] has been proposed as a method to reduce dose and increase acquisition speed for STEM. Inpainting is a technique to recover missing pixels in an image. By skipping pixels (randomly) during acquisition, a fourth dose-control mechanism is realized [3]. A few implementations of randomly-subsampled STEM exist (e.g., [4]). To make the concepts of compressive sensing accessible to the microscopy community we begin with an example using atomic resolution images of a GaAs crystal (see Figure 1). Because the crystal is periodic it has a sparse representation in reciprocal space. In fact, a sparse representation is a key component of compressive sensing. If an image is sub-sampled randomly we find that the Fourier transform remains sparse, but becomes increasing noisy as less and less data is acquired. Yet, by finding the peaks in the reciprocal image and removing the noise it is possible to recover atomic resolution images with only 1% of the pixels. Figure 1 shows the reconstruction process for GaAs sub-sampled at 50%, 10%, 5%, and 1%. Periodic images form a special class for which the optimal sampling approach (according to CS theory) is a random selection of pixels. For non-periodic images, such as those arising in in-situ STEM, methods such as dictionary learning are necessary [2,5]. The data can be compressed in time for TEM [5] or pixels can be skipped randomly for STEM. There are several issues that arise in developing a random scan for STEM [4] and a coded aperture for TEM. The remainder of the talk will address these issues. References: [1] E Candes and M Wakin. Signal Processing Magazine, IEEE. 2(25) (2008), pp. 21. [2] A Stevens, Pu Y, Sun Y, et al. Artificial Intelligence & Statistics (AISTATS), 2017. [3] A Stevens, H Yang, L Carin et al. Microscopy 63(1), (2014), pp. 41. [4] L Kovarik, A Stevens, A Liyu et al. Appl. Phys. Lett. 109, 164102 (2016). [5] A Stevens, L Kovarik, P Abellan et al. Adv. Structural and Chemical Imaging 1(10), (2015), pp. 1. [6] 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.

Hao, Weituo↗
DOE OSTI2019

Convolutional Dictionary Regularizers for Tomographic Inversion

There has been a growing interest in the use of data-driven regularizers to solve inverse problems associated with computational imaging systems. The convolutional sparse representation model has recently gained attention, driven by the development of fast algorithms for solving the dictionary learning and sparse coding problems for sufficiently large images and data sets. Nevertheless, this model has seen very limited application to tomographic reconstruction problems. In this paper, we present a model-based tomographic reconstruction algorithm using a learnt convolutional dictionary as a regularizer. The key contribution is the use of a data-dependent weighting scheme for the l 1 regularization to construct an effective denoising method that is integrated into the inversion using the Plug-and-Play reconstruction framework. Using simulated data sets we demonstrate that our approach can improve performance over traditional regularizers based on a Markov random field model and a patch-based sparse representation model for sparse and limited-view tomographic data sets.

Singanallur Vaidyanathan, Venkatakrishnan↗
DOE OSTI2017

Sparse Overcomplete Denoising: Aggregation Versus Global Optimization

Denoising is often addressed via sparse coding with respect to an overcomplete dictionary. There are two main approaches when the dictionary is composed of translates of an orthonormal basis. The first, traditionally employed by techniques such as wavelet cycle spinning, separately seeks sparsity w.r.t. each translate of the orthonormal basis, solving multiple partial optimizations and obtaining a collection of sparse approximations of the noise-free image, which are aggregated together to obtain a final estimate. The second approach, recently employed by convolutional sparse representations, instead seeks sparsity over the entire dictionary via a global optimization. It is tempting to view the former approach as providing a suboptimal solution of the latter. In this letter, we analyze whether global sparsity is a desirable property, and under what conditions the global optimization provides a better solution to the denoising problem. In particular, our experimental analysis shows that the two approaches attain comparable performance in case of natural images and global optimization outperforms the simpler aggregation of partial estimates only when the image admits an extremely sparse representation. Here, we explain this phenomenon by separately studying the bias and variance of these solutions, and by noting that the variance of the global solution increases very rapidly as the original signal becomes less and less sparse.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Quantized Constant-Q Gabor Atoms for Sparse Binary Representations of Cyber-Physical Signatures

Increased data acquisition by uncalibrated, heterogeneous digital sensor systems such as smartphones present new challenges. Binary metrics are proposed for the quantification of cyber-physical signal characteristics and features, and a standardized constant-Q variation of the Gabor atom is developed for use with wavelet transforms. Two different continuous wavelet transform (CWT) reconstruction formulas are presented and tested under different signal to noise ratio (SNR) conditions. A sparse superposition of Nth order Gabor atoms worked well against a synthetic blast transient using the wavelet entropy and an entropy-like parametrization of the SNR as the CWT coefficient-weighting functions. The proposed methods should be well suited for sparse feature extraction and dictionary-based machine learning across multiple sensor modalities.

46 - INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AN↗