2016
DOI: 10.1016/j.acha.2016.02.003
|View full text |Cite
|
Sign up to set email alerts
|

Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction

Abstract: This paper explores robust recovery of a superposition of R distinct complex exponential functions with or without damping factors from a few random Gaussian projections. We assume that the signal of interest is of 2N − 1 dimensions and R < 2N − 1. This framework covers a large class of signals arising from real applications in biology, automation, imaging science, etc. To reconstruct such a signal, our algorithm is to seek a low-rank Hankel matrix of the signal by minimizing its nuclear norm subject to the co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
78
1

Year Published

2016
2016
2020
2020

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 63 publications
(81 citation statements)
references
References 30 publications
2
78
1
Order By: Relevance
“…The term "non-stationary" indicates that the point spread functions are potentially different and comes from the field of non-stationary deconvolution [8]; the term "blind" indicates that the point spread functions are unknown. Non-stationary blind super-resolution problems also appear in applications involving radar imaging [9], astronomy [10], photography [11], 3D single-molecule microscopy [12], seismology [8] and nuclear magnetic resonance (NMR) spectroscopy [13,14,15]. Exchanging the roles of time and frequency, the conventional line spectral estimation problem is modified as follows: each complex exponential is modulated (pointwise multiplied) by an unknown waveform, and this waveform can vary from one complex exponential to the next.…”
Section: Introductionmentioning
confidence: 99%
“…The term "non-stationary" indicates that the point spread functions are potentially different and comes from the field of non-stationary deconvolution [8]; the term "blind" indicates that the point spread functions are unknown. Non-stationary blind super-resolution problems also appear in applications involving radar imaging [9], astronomy [10], photography [11], 3D single-molecule microscopy [12], seismology [8] and nuclear magnetic resonance (NMR) spectroscopy [13,14,15]. Exchanging the roles of time and frequency, the conventional line spectral estimation problem is modified as follows: each complex exponential is modulated (pointwise multiplied) by an unknown waveform, and this waveform can vary from one complex exponential to the next.…”
Section: Introductionmentioning
confidence: 99%
“…The second term in Equation is the sum of nuclear norms for the pixel‐wise Hankel matrices i=1NPh(boldRiQx)*, where NP is the number of pixels, * is the nuclear norm, h(·) is the Hankel matrix formation , boldRi is an operator that selects the recovery time course for a pixel i from the data Q x, and Q=(boldD1boldDNT+1) || (boldD2boldDNT+1) |||| (boldDNTboldDNT+1) is an linear operator that performs the subtraction of MP image boldDtx with the reference image boldDNT+1x for every RT t=1NT and every pixel (as shown in Fig. c).…”
Section: Methodsmentioning
confidence: 99%
“…The second term in Equation [4] is the sum of nuclear norms for the pixel-wise Hankel matrices P NP i¼1 jjhðR i QxÞjj à , where N P is the number of pixels, jj Á jj à is the nuclear norm, hðÁÞ is the Hankel matrix formation (25), R i is an operator that selects the recovery time course for a pixel i from the data Q x, and Q ¼ ðD 1 ÀD NT þ1 Þ jj ðD 2 À D NT þ1 Þ jj . .…”
Section: Pixel-wise Hankel Matrix Completion In Combination With Compmentioning
confidence: 99%
“…The nuclear norm minimization for the block‐Hankel matrix completion can be written as argminboldX||H(boldX)||* s.t. M(X)=Y where M is a k‐space undersampling operator, H a 3D sliding window and concatenation operator describing the conversion into a block‐Hankel matrix, X the reconstructed MRSI data set, and Y the undersampled MRSI data set. This nuclear norm minimization can be solved by a singular value thresholding method , as shown in Figure .…”
Section: Methodsmentioning
confidence: 99%
“…Several reconstruction methods have also been used successfully in previous CS MRSI studies, eg, L 1 ‐minimization , total variation minimization , and maximum entropy reconstruction , and group sparsity–based reconstruction . Recently, Hankel or block‐Hankel matrix completion has been used for recovering undersampled spectral data and calibrationless parallel imaging reconstruction . The low‐rank property of dynamic MRI data has also been demonstrated and utilized in accelerated reconstructions .…”
Section: Introductionmentioning
confidence: 99%