2017
DOI: 10.1007/s11760-017-1177-5
|View full text |Cite
|
Sign up to set email alerts
|

Sparse fast Fourier transform for exactly sparse signals and signals with additive Gaussian noise

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 22 publications
0
1
0
Order By: Relevance
“…Established compressed sensing strategies include random sampling [16][17][18] , uniformly spaced sampling 17,[19][20][21] , sampling based on a model of a sample 22,23 , partials scans with fixed paths 14 , dynamic sampling to minimize entropy [24][25][26][27] and dynamic sampling based on supervised learning 28 . Complete signals can be extrapolated from partial scans by an infilling algorithm, estimating their fast Fourier transforms 29 or inferred by an artificial neural network 14,21 (ANN). The best sampling strategy varies, for example, uniformly spaced sampling is often better than spiral paths for oversampled STEM images 14 .…”
Section: Introductionmentioning
confidence: 99%
“…Established compressed sensing strategies include random sampling [16][17][18] , uniformly spaced sampling 17,[19][20][21] , sampling based on a model of a sample 22,23 , partials scans with fixed paths 14 , dynamic sampling to minimize entropy [24][25][26][27] and dynamic sampling based on supervised learning 28 . Complete signals can be extrapolated from partial scans by an infilling algorithm, estimating their fast Fourier transforms 29 or inferred by an artificial neural network 14,21 (ANN). The best sampling strategy varies, for example, uniformly spaced sampling is often better than spiral paths for oversampled STEM images 14 .…”
Section: Introductionmentioning
confidence: 99%