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 79 for “"sparse recovery"”.

  1. Endogenous Sparse Recovery

    … and machine learning. In all of these settings, sparse recovery methods are employed to recover signals that admit sparse representations in a pre-specified basis. Recently, sparse recovery methods have been employed in an entirely new way; instead of finding a sparse representation of a signal …

    rice Repository record for Endogenous Sparse Recovery (opens in a new tab)

  2. Lower bounds for sparse recovery problems

    Sparse recovery or compressed sensing is the problem of estimating a signal from noisy linear measurements of that signal. Sparse recovery has traditionally been used in areas like image acquisition, streaming algorithms, genetic testing, and, more recently, for image recovery tasks. Over the last …

    texas Repository record for Lower bounds for sparse recovery problems (opens in a new tab)

  3. Convex optimization for generalized sparse recovery

    … of compressed sensing as a way of acquiring sparsely representable signals in a compressed form. These developments have greatly motivated research in sparse signal recovery, which lies at the heart of compressed sensing, and which has recently found its use in altogether new applications. In …

    ubc Repository record for Convex optimization for generalized sparse recovery (opens in a new tab) Download PDF for Convex optimization for generalized sparse recovery (opens in a new tab)

  4. SPARSE RECOVERY BY NONCONVEX LIPSHITZIAN MAPPINGS

    … processing fields. The general framework of sparse representation is now a mature concept with solid basis in relevant mathematical fields, such as probability, geometry of Banach spaces, harmonic analysis, theory of computability, and information-based complexity. Together with theoretical …

    milano Repository record for SPARSE RECOVERY BY NONCONVEX LIPSHITZIAN MAPPINGS (opens in a new tab)

  5. Discrete and Continuous Sparse Recovery Methods and Their Applications

    … space can be exploited to aid in the recovery of the signal of interest. Among all the different forms of low di- mensionality, in this dissertation we focus on the synthesis and analysis models of sparse recovery. This dissertation comprises two major topics. For the first topic, we …

    wustl Repository record for Discrete and Continuous Sparse Recovery Methods and Their Applications (opens in a new tab)

  6. Mathematical analysis of a dynamical system for sparse recovery

    … analysis of a continuous-times system for sparse signal recovery. Sparse recovery arises in Compressed Sensing (CS), where signals of large dimension must be recovered from a small number of linear measurements, and can be accomplished by solving a complex optimization program. While many …

    gatech Repository record for Mathematical analysis of a dynamical system for sparse recovery (opens in a new tab)

  7. Sparse Recovery: Fundamental Limits, Measurement Constructions And Graph Constraints

    Sparse recovery explores the sparsity structure inside data and aims to find a low-dimensional representation for a high-dimensional sparse object. Since some form of signal sparsity naturally exists in many applications, sparse recovery can benefit areas like imaging, communication, network …

    cornell Repository record for Sparse Recovery: Fundamental Limits, Measurement Constructions And Graph Constraints (opens in a new tab)

  8. Distributed Data Aggregation for Sparse Recovery in Wireless Sensor Networks

    <p>We consider the approximate sparse recovery problem in Wireless Sensor Networks (WSNs) using Compressed Sensing/Compressive Sampling (CS). The goal is to recover the $n \mbox{-}$dimensional data values by querying only $m \ll n$ sensors based on some linear projection of sensor readings. To …

    ut-knoxville Repository record for Distributed Data Aggregation for Sparse Recovery in Wireless Sensor Networks (opens in a new tab)

  9. Greedy sparse recovery algorithms: from weighted generalizations to deep unrolling

    Sparse recovery is a clear manifestation of Occam’s razor in the mathematics of data thanks to its ability to favor the simplest explanation. A prominent example is the reconstruction of a sparse vector (i.e., one with mostly zero or negligible coefficients) from linear measurements, possibly …

    concordia Download PDF for Greedy sparse recovery algorithms: from weighted generalizations to deep unrolling (opens in a new tab)

  10. Applications of Coding Theory to Sub-Linear Time Sparse Recovery Problems

    … connection between coding theory and classical sparse recovery problems like sparse Fourier and Hadamard transform computations to understand properties of existing recovery algorithms under various signal models, propose improvements, and adopt them to interesting applications in theoretical …

    tamu Repository record for Applications of Coding Theory to Sub-Linear Time Sparse Recovery Problems (opens in a new tab)

  11. Dynamic compressive sensing: sparse recovery algorithms for streaming signals and video

    … algorithms that utilize system dynamics in the sparse signal recovery process. These dynamics may arise due to a time-varying signal, streaming measurements, or an adaptive signal transform. Compressive sensing theory has shown that under certain conditions, a sparse signal can be recovered from …

    gatech Repository record for Dynamic compressive sensing: sparse recovery algorithms for streaming signals and video (opens in a new tab)

  12. Sparse Recovery, Classification, and Data Compression via Improved Maximum Feasible Subsystem Algorithms

    … reduction, classification, and sparse recovery problems are converted to MAX FS problems. This approach is used for sparse recovery in Compressive Sensing (CS) and data compression via Nonnegative Matrix Factorization (NNMF) for the first time in this thesis. In CS, the new …

    carleton Repository record for Sparse Recovery, Classification, and Data Compression via Improved Maximum Feasible Subsystem Algorithms (opens in a new tab)

  13. Recursive robust PCA or recursive sparse recovery in large but structured noise

    … of recursively recovering a time sequence of sparse vectors, S<sub>t</sub>, from measurements M<sub>t</sub> := S<sub>t</sub> + L<sub>t</sub> that are corrupted by structured noise L<sub>t</sub> which is dense and can have large magnitude. The structure that we require is that L<sub>t</sub> …

    iastate Repository record for Recursive robust PCA or recursive sparse recovery in large but structured noise (opens in a new tab)

  14. SUB-NYQUIST SENSING AND SPARSE RECOVERY OF WIDE-BAND INTENSITY MODULATED OPTICAL SIGNALS

    … within the fields of compressive sensing and sparse signal recovery and will be applied to the detection of objects illuminated with wide-band intensity modulated optical signals. The underlying assumption is that given the directive nature of laser propagation, the illuminated scene is …

    maryland Repository record for SUB-NYQUIST SENSING AND SPARSE RECOVERY OF WIDE-BAND INTENSITY MODULATED OPTICAL SIGNALS (opens in a new tab)

  15. Fast dynamic magnetic resonance imaging using sparse recovery methods and novel signal encoding formulations

    … This dissertation starts with presenting a sparse signal recovery based fast MRI method. This method synergistically combines a data redundancy scheme for high frequency details with a novel and physically realizable MR signal encoding formulation. The new signal encoding formulation uses …

    texas Repository record for Fast dynamic magnetic resonance imaging using sparse recovery methods and novel signal encoding formulations (opens in a new tab)

  16. Sparse Recovery with Partial Support and Signal Value Knowledge and Applications in Dynamic MRI

    … work, we study the problem of reconstructing a sparse signal from a limited number of its linear projections when the following knowledge is available. (1) We are given partial, and partly</p> <p>erroneous, knowledge of the signal's support, denoted by T. (2) We are also given an erroneous …

    iastate Repository record for Sparse Recovery with Partial Support and Signal Value Knowledge and Applications in Dynamic MRI (opens in a new tab)

  17. Compressive power systems: applications of compressive sensing and sparse recovery in the analysis of smart power grids

    … In this thesis, we aim to exploit the inherent sparse nature of both structure and data in SGs to introduce new, fast and reliable techniques to address the challenges related to real time data analysis, monitoring and security in smart power systems. Our work is primarily inspired by a new …

    colo-mines Repository record for Compressive power systems: applications of compressive sensing and sparse recovery in the analysis of smart power grids (opens in a new tab)

  18. Sparse and low rank signal recovery with partial knowledge

    <p>In the first part of this work, we study sparse recovery problem in the presence of bounded noise. We obtain performance guarantees for modified-CS and for its improved version, modified-CS-Add-LS-Del, for recursive reconstruction of a time sequence of sparse signals from a reduced set of noisy …

    iastate Repository record for Sparse and low rank signal recovery with partial knowledge (opens in a new tab)

  19. Discovery of low-dimensional structure in high-dimensional inference problems

    … for instance they can often be represented sparsely in some basis or domain. The discovery of an underlying low-dimensional structure is important to develop more robust and efficient analysis and processing algorithms. The first part of the dissertation investigates the statistical …

    bu Repository record for Discovery of low-dimensional structure in high-dimensional inference problems (opens in a new tab)

  20. A Lensless Epi-fluorescence Computational Microendoscope

    … is highly adapted to compressed sensing and sparse recovery algorithms by replacing the lens with a coded-aperture. The coded aperture allows for an epifluorescent imaging arrangement and pseudorandom multiplexing of the image information for compressed sensing. For image recovery, we develop …

    jhu Repository record for A Lensless Epi-fluorescence Computational Microendoscope (opens in a new tab)

Page 1 of 4