2007 4th IEEE International Symposium on Biomedical Imaging: From Nano to Macro 2007
DOI: 10.1109/isbi.2007.357017
|View full text |Cite
|
Sign up to set email alerts
|

Sparse Signal and Image Recovery From Compressive Samples

Abstract: In this paper we present an introduction to Compressive Sampling (CS), an emerging model-based framework for data acquisition and signal recovery based on the premise that a signal having a sparse representation in one basis can be reconstructed from a small number of measurements collected in a second basis that is incoherent with the first. Interestingly, a random noise-like basis will suffice for the measurement process. We will overview the basic CS theory, discuss efficient methods for signal reconstructi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
33
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 54 publications
(33 citation statements)
references
References 11 publications
0
33
0
Order By: Relevance
“…This signal, x, can be represented in terms of a basis of vectors [ ] =1 . Let = [ 1 2 ⋅ ⋅ ⋅ ] be a × orthonormal basis matrix with the vectors as column [4], [13]. The signal, x, can be written as…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…This signal, x, can be represented in terms of a basis of vectors [ ] =1 . Let = [ 1 2 ⋅ ⋅ ⋅ ] be a × orthonormal basis matrix with the vectors as column [4], [13]. The signal, x, can be written as…”
Section: Methodsmentioning
confidence: 99%
“…It can recover signals or images from highly incomplete measurements which are conventionally believed to be insufficient information. For signal and image processing, this has been applied successfully [4], [5].…”
Section: Introductionmentioning
confidence: 99%
“…In practice, the optimal choice for σ , τ and μ may not be obvious, especially when the noise level is not well known in advance. The interesting feature of these solutions is that they yield a sparse v, that is they produce a v with very few non-zero entries and this has been explained and justified in a series of papers, see e.g., [6,9,25] and the references therein.…”
Section: Sparse Representations and 1 -Optimizationmentioning
confidence: 98%
“…Fundamental theoretical contributions from a number of researchers [3,4,5,6,7,8,9,29] has sparked this rapidly developing field which is driven by a wide spectrum of applications from robust statistics, data compression, compressed sensing, image processing, estimation, and high resolution signal analysis. The present work builds on the well-paved paradigm of sparse representations by focusing on a problem of system/source identification known as blind source separation.…”
Section: Introductionmentioning
confidence: 99%
“…If image signals are regarded, it is widely known that they can be sparsely represented in the Fourier domain [37]. That is to say that most signal energy is concentrated into a small number of transform coefficients while all other coefficients are equal or close to zero.…”
Section: A Consequences From Non-regular Subsampling and Frequency Smentioning
confidence: 99%