2009
DOI: 10.1007/s10440-009-9474-9
|View full text |Cite
|
Sign up to set email alerts
|

Reconstructing Signals with Finite Rate of Innovation from Noisy Samples

Abstract: A signal is said to have finite rate of innovation if it has a finite number of degrees of freedom per unit of time. Reconstructing signals with finite rate of innovation from their exact average samples has been studied in Sun (SIAM J. Math. Anal. 38, 1389-1422. In this paper, we consider the problem of reconstructing signals with finite rate of innovation from their average samples in the presence of deterministic and random noise. We develop an adaptive Tikhonov regularization approach to this reconstructio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
19
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 23 publications
(19 citation statements)
references
References 32 publications
0
19
0
Order By: Relevance
“…In our formulation, the problem of recovering the EPI from a single swiped image is mapped to that of reconstructing signals with a finite rate of innovation (FRI) [22][23][24][25][26] . We demonstrate that the exact recovery of the EPI is possible when the scene is made of a single fronto-parallel plane with a texture pasted onto it that is a sum of sinusoids.…”
Section: 3mentioning
confidence: 99%
See 1 more Smart Citation
“…In our formulation, the problem of recovering the EPI from a single swiped image is mapped to that of reconstructing signals with a finite rate of innovation (FRI) [22][23][24][25][26] . We demonstrate that the exact recovery of the EPI is possible when the scene is made of a single fronto-parallel plane with a texture pasted onto it that is a sum of sinusoids.…”
Section: 3mentioning
confidence: 99%
“…I I (v) is a piecewise signal in which each segment is a sum of sinusoids; it can therefore be recovered from the pixels p[k] using FRI theory [22][23][24][25][26][27] . It is assumed here that the point spread function ϕ(v) is an exponential reproducing kernel, as in FRI theory 25 , but less restrictive choices are also available 26 .…”
Section: Epi Recovery From a Swiped Imagementioning
confidence: 99%
“…Unlike the compressed sampling or learning theory discussed earlier, in this situation the class C consists of infinite dimensional subspaces of H = 2 and therefore are more difficult to deal with even for a single shift-invariant subspace model ( = 1) [68]. The case in which a signal model is not a single subspace but a union of several of such subspaces is natural as in the case of signals with finite rate of innovation [69][70][71][72][73].…”
Section: Connection To Signalmentioning
confidence: 99%
“…The locally finitely-generated space V( ) in (2.6) was introduced in [44] to model signals with finite rate of innovations (see [8,34,43,47] and extensive references therein for the study of sampling for signals with finite rate of innovations). A model space of locally finitely-generated spaces is the shiftinvariant space V(φ 1 , .…”
Section: Theorem 21 Let V Be a Linear Space Of Functions On The Linementioning
confidence: 99%