Results 1 
7 of
7
Explicit constructions for compressed sensing of sparse signals
 In Proceedings of the 19th Annual ACMSIAM Symposium on Discrete Algorithms
, 2008
"... Over the recent years, a new approach for obtaining a succinct approximate representation of ndimensional ..."
Abstract

Cited by 33 (3 self)
 Add to MetaCart
Over the recent years, a new approach for obtaining a succinct approximate representation of ndimensional
Temlyakov, A remark on compressed sensing
, 2007
"... Recently, Compressed Sensing (Compressive Sampling) has attracted a lot of attention of both mathematicians and computer scientists. Compressed Sensing refers to a problem of economical recovery of an unknown vector u ∈ R m from the information provided by linear measurements 〈u, ϕj〉, ϕj ∈ R m, j = ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
Recently, Compressed Sensing (Compressive Sampling) has attracted a lot of attention of both mathematicians and computer scientists. Compressed Sensing refers to a problem of economical recovery of an unknown vector u ∈ R m from the information provided by linear measurements 〈u, ϕj〉, ϕj ∈ R m, j = 1,..., n. The goal is to design an algorithm
Sparse representations and approximation theory
, 2011
"... This paper is an attempt to both expound and expand upon, from an approximation theorist’s point of view, some of the theoretical results that have been obtained in the sparse representation (compressed sensing) literature. In particular, we consider in detail ℓm 1approximation, which is fundamenta ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper is an attempt to both expound and expand upon, from an approximation theorist’s point of view, some of the theoretical results that have been obtained in the sparse representation (compressed sensing) literature. In particular, we consider in detail ℓm 1approximation, which is fundamental in the theory of sparse representations, and the connection between the theory of sparse representations and certain nwidth concepts. We try to illustrate how the theory of sparse representation leads to new and interesting problems in approximation theory, while the results and techniques of approximation theory can further add to the theory of sparse representations.
On the size of incoherent systems ⋆
"... This paper concerns special redundant systems, namely, incoherent systems or systems with small coherence parameter. Simple greedytype algorithms perform well on these systems. For example, known results show that the smaller the coherence parameter, the better the performance of the Orthogonal Gre ..."
Abstract
 Add to MetaCart
This paper concerns special redundant systems, namely, incoherent systems or systems with small coherence parameter. Simple greedytype algorithms perform well on these systems. For example, known results show that the smaller the coherence parameter, the better the performance of the Orthogonal Greedy Algorithm. These systems with small coherence parameter are also useful in the construction of compressed sensing matrices. Therefore, it is very desirable to build dictionaries with small coherence parameter. We discuss the following problem for both R n and C n: How large can a system with coherence parameter not exceeding a fixed number µ be? We obtain upper and lower bounds for the maximal cardinality of such systems. Although the results herein are either known or simple corollaries of known results, our objective is to demonstrate how fundamental results from different areas of mathematics–linear algebra, probability, and number theory–collaborate on this important approximation theoretic problem.
Derivative Compressive Sampling with Application to Inverse Problems and Imaging
"... c ○ Mahdi S. Hosseini 2010I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ..."
Abstract
 Add to MetaCart
c ○ Mahdi S. Hosseini 2010I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public.
A REVIEW OF NUMERICAL METHODS FOR NONLINEAR PARTIAL DIFFERENTIAL EQUATIONS
"... To HeinzOtto Kreiss with friendship and appreciation Abstract. Numerical methods were first put into use as an effective tool for solving partial differential equations (PDEs) by John von Neumann in the mid1940s. In a 1949 letter von Neumann wrote “the entire computing machine is merely one compon ..."
Abstract
 Add to MetaCart
To HeinzOtto Kreiss with friendship and appreciation Abstract. Numerical methods were first put into use as an effective tool for solving partial differential equations (PDEs) by John von Neumann in the mid1940s. In a 1949 letter von Neumann wrote “the entire computing machine is merely one component of a greater whole, namely, of the unity formed by the computing machine, the mathematical problems that go with it, and the type of planning which is called by both. ” The “greater whole ” is viewed today as scientific computation: over the past sixty years, scientific computation has emerged as the most versatile tool to complement theory and experiments, and numerical methods for solving PDEs are at the heart of many of today’s advanced scientific computations. Numerical solutions found their way from financial models on Wall Street to traffic models on Main Street. Here we provide a bird’s eye view on the development of these numerical methods with
unknown title
, 804
"... On the reconstruction of blocksparse signals with an optimal number of measurements ..."
Abstract
 Add to MetaCart
On the reconstruction of blocksparse signals with an optimal number of measurements