Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 39 for “"Sparse approximation"”.

  1. Topics in sparse approximation

    Sparse approximation problems request a good approximation of an input signal as a linear combination of elementary signals, yet they stipulate that the approximation may involve only a few of the elementary signals. This class of problems arises throughout applied mathematics, statistics, and …

    texas Repository record for Topics in sparse approximation (opens in a new tab)

  2. Sparse Approximation In Banach Spaces

    <p>The sparse approximation problems ask for complete recovery of functions in a given space that are supported by few of the elements of a system of generators for the space or for approximate recovery that involves a limited number of generators.</p> <p>Traditionally, these problems have been …

    south-carolina Repository record for Sparse Approximation In Banach Spaces (opens in a new tab)

  3. A biologically plausible sparse approximation solver on neuromorphic hardware

    … brain-inspired TrueNorth chip to solve for the sparse approximation of a signal, offering the largest LCA dictionaries implemented on neuromorphic hardware to date with perfect precision. We observe low-power consumption in the operation of the LCA on the TrueNorth chip. We also explain methods …

    gatech Repository record for A biologically plausible sparse approximation solver on neuromorphic hardware (opens in a new tab)

  4. Addressing three wireless sensor network challenges using sparse approximation methods

    … we propose and design systems based on sparse recovery or sparse approximation methods to accurately recover various phenomena using the incomplete information collected by the wireless sensing applications. Due to the high level of temporal-spatial correlations amongst the data …

    unsw Repository record for Addressing three wireless sensor network challenges using sparse approximation methods (opens in a new tab)

  5. Configurable analog hardware for neuromorphic Bayesian inference and least-squares solutions

    Sparse approximation is a Bayesian inference program with a wide number of signal processing applications, such as Compressed Sensing recovery used in medical imaging. Previous sparse coding implementations relied on digital algorithms whose power consumption and performance scale poorly with …

    gatech Repository record for Configurable analog hardware for neuromorphic Bayesian inference and least-squares solutions (opens in a new tab)

  6. Methods for Convolutional Sparse Coding and Coupled Feature Learning with Applications to Image Fusion

    The sparse approximation model, also known as the sparse coding model, represents signals as linear combinations of only a small number of elements (atoms) from a dictionary. This model is used in many applications of signal processing, machine learning, and computer vision. In many tasks, the use …

    aalto Repository record for Methods for Convolutional Sparse Coding and Coupled Feature Learning with Applications to Image Fusion (opens in a new tab)

  7. Data driven modeling and state estimation of nonlinear dynamical systems

    … an effective data driven modeling method, the sparse approximation and Global-Local Orthogonal Mapping (GLOMAP) algorithm are used in this dissertation. The sparse approximation based GLOMAP provides a means of constructing independent local models from the input-output data and integrating the …

    buffalo Repository record for Data driven modeling and state estimation of nonlinear dynamical systems (opens in a new tab)

  8. Implementation of the locally competitive algorithm on a field programmable analog array

    Sparse approximation is an important class of optimization problem in signal and image processing applications. This thesis presents an analog solution to this problem, based on the Locally Competitive Algorithm (LCA). A Hopfield-Network-like analog system, operating on sub-threshold currents is …

    gatech Repository record for Implementation of the locally competitive algorithm on a field programmable analog array (opens in a new tab)

  9. Gaussian processes:iterative sparse approximations

    … a two-step solution to construct a probabilistic approximation to the posterior. In the first step we adapt the Bayesian online learning to GPs: the final approximation to the posterior is the result of propagating the first and second moments of intermediate posteriors obtained by combining a new …

    aston Download PDF for Gaussian processes:iterative sparse approximations (opens in a new tab)

  10. Distributed redundant representations in man-made and biological sensing systems

    … the flexibility of redundant representations for sparse approximation. Neuroscience and signal processing both need a sparse approximation algorithm (i.e., representing a signal with few non-zero coefficients) that is physically implementable in a parallel system and produces smooth coefficient …

    rice Repository record for Distributed redundant representations in man-made and biological sensing systems (opens in a new tab)

  11. Image Denoising Via L1 Norm Regularization Over Adaptive Dictionary

    … image over which the image has the optimal sparse approximation. The proposed approach is based on an iterative scheme that alternatively re nes the dictionary and corresponding s- parse approximation of the true image. There are two steps in this approach. One is the sparse coding part …

    nus Repository record for Image Denoising Via L1 Norm Regularization Over Adaptive Dictionary (opens in a new tab) Download file for Image Denoising Via L1 Norm Regularization Over Adaptive Dictionary (opens in a new tab)

  12. DISCRETE FRAMES AND TIGHT FRAMES FOR SPARSE IMAGE REPRESENTATION

    In recent years, sparse approximation has played a fundamental role in various signal processing areas. The Gabor systems have many advantages in sparse representation. In the first part of this dissertation, we study the general theory of discrete Gabor frames by developing the Gramian and dual …

    nus Repository record for DISCRETE FRAMES AND TIGHT FRAMES FOR SPARSE IMAGE REPRESENTATION (opens in a new tab) Download file for DISCRETE FRAMES AND TIGHT FRAMES FOR SPARSE IMAGE REPRESENTATION (opens in a new tab)

  13. Colour image coding with wavelets and matching pursuit

    This thesis considers sparse approximation of still images as the basis of a lossy compression system. The Matching Pursuit (MP) algorithm is presented as a method particularly suited for application in lossy scalable image coding. Its multichannel extension, capable of exploiting inter-channel …

    aston Download PDF for Colour image coding with wavelets and matching pursuit (opens in a new tab)

  14. Sparse representations in multi-kernel dictionaries for in-situ classification of underwater objects

    … multi-kernel classification that makes use of sparse representation theory for automatically selecting the kernel functions and their parameters that best represent a set of training samples. We construct a dictionary of different kernel functions with different parametrizations. Using a sparse …

    colostate Repository record for Sparse representations in multi-kernel dictionaries for in-situ classification of underwater objects (opens in a new tab)

  15. Using prior support information in compressed sensing

    … technique that entails recovering estimates of sparse and compressible signals from n linear measurements, significantly fewer than the signal ambient dimension N. In this thesis we show how we can reduce the required number of measurements even further if we incorporate prior information about …

    ubc Repository record for Using prior support information in compressed sensing (opens in a new tab) Download PDF for Using prior support information in compressed sensing (opens in a new tab)

  16. Shearlet-based Analysis of Image Inpainting and Convolutional Framelets

    … of view of microlocal analysis and the theory of sparse approximation. My most important result provides a new set of theoretical performance guarantees for the exact recovery of missing data in images where the information is dominated by curvilinear singularities. In fact, my study shows that a …

    houston Repository record for Shearlet-based Analysis of Image Inpainting and Convolutional Framelets (opens in a new tab)

  17. Task-specific and interpretable feature learning

    … dissertation starts by showing how the classical sparse coding models could be improved in a task-specific way, by formulating the entire pipeline as bi-level optimization. Then, it mainly illustrates how to incorporate the structure of classical learning models, e.g., sparse coding, into the …

    uiuc Repository record for Task-specific and interpretable feature learning (opens in a new tab)

  18. Acoustical localization techniques in embedded wireless sensor networked devices

    … model for ranging: cross-correlation via sparse representation. Its underlying mechanism, based on the theory of sparse approximation, achieves similar ranging accuracy and precision levels as the standard cross-correlation, but by using approximately one-third of the required information …

    unsw Repository record for Acoustical localization techniques in embedded wireless sensor networked devices (opens in a new tab)

  19. A Resource-Aware Streaming-based Framework for Big Data Analysis

    … an arbitrary matrix-based learning task using a sparse-approximation of the collection that is constantly updated inline with the data arrival. Our work is supported by a set of user-friendly Application Programming Interfaces (APIs) that ensure automated adaptation of the proposed framework to …

    rice Repository record for A Resource-Aware Streaming-based Framework for Big Data Analysis (opens in a new tab)

Page 1 of 2