Abstract
This article presents new results concerning the recovery of a signal from the magnitude only measurements where the signal is not sparse in an orthonormal basis but in a redundant dictionary, which we call it phase retrieval with redundant dictionary for short. To solve this phaseless problem, we analyze the \( \ell _1 \)-analysis model. Firstly we investigate the noiseless case with presenting a null space property of the measurement matrix under which the \( \ell _1 \)-analysis model provides an exact recovery. Secondly we introduce a new property (S-DRIP) of the measurement matrix. By solving the \( \ell _1 \)-analysis model, we prove that this property can guarantee a stable recovery of real signals that are nearly sparse in overcomplete dictionaries.
Similar content being viewed by others
References
Aldroubi, A., Chen, X., Powell, A.M.: Perturbations of measurement matrices and dictionaries in compressed sensing. Appl. Comput. Harmon. Anal. 33(2), 282–291 (2012)
Baker, C.A.: A note on sparsification by frames. arXiv:1308.5249 (2013)
Balan, R., Casazza, P., Edidin, D.: On signal reconstruction without phase. Appl. Comput. Harmon. Anal. 20(3), 345–356 (2006)
Bodmann, B.G., Hammen, N.: Stable phase retrieval with low-redundancy frame. Adv. Comput. Math. 41(2), 317–331 (2015)
Cai, T.T., Zhang, A.: Sharp RIP bound for sparse signal and low-rank matrix recovery. Appl. Comput. Harmon. Anal. 35(1), 74–93 (2013)
Cai, T.T., Zhang, A.: Sparse representation of a polytope and recovery of sparse signals and low-rank matrices. IEEE Trans. Inf. Theory 60(1), 122–132 (2014)
Candès, E.J., Eldar, Y.C., Needell, D., Randall, P.: Compressed sensing with coherent and redundant dictionaries. Appl. Comput. Harmon. Anal. 31(1), 59–73 (2011)
Chen, X.M., Wang, H.C., Wang, R.R.: A null space analysis of the \(\ell _1\)-synthesis method in dictionary-based compressed sensing. Appl. Comput. Harmon. Anal. 37(3), 492–515 (2014)
Conca, A., Edidin, D., Hering, M., Vinzant, C.: An algebraic characterization of injectivity in phase retrieval. Appl. Comput. Harmon. Anal. 38(2), 346–356 (2015)
Elad, M., Milanfar, P., Rubinstein, R.: Analysis versus synthesis in signal priors. Inverse Probl. 23(3), 947968 (2007)
Fienup, J.: Reconstruction of a complex-valued object from the modulus of its Fourier transform using a support constraint. J. Opt. Soc. Am. 4(1), 118–123 (1987)
Gao, B., Wang, Y., Xu, Z.Q.: Stable signal recovery from phaseless measurements. J. Fourier Anal. Appl. 22(4), 787–808 (2016)
Herman, M., Strohmer, T.: High resolution radar via compressed sensing. IEEE Trans. Signal Process. 57(6), 22752284 (2009)
Kohler, D., Mandel, L.: Source reconstruction from the modulus of the correlation function: a practical approach to the phase problem of optical coherence theory. J. Opt. Soc. Am. 63(2), 126–134 (1973)
Moravec, M., Romberg, J., Baraniuk, R.: Compressive phase retrieval. Proc. SPIE 6701, 670120–670120 (2007). doi:10.1117/12.736360
Rauhut, H., Schnass, K., Vandergheynst, P.: Compressed sensing and redundant dictionaries. IEEE Trans. Inf. Theory 54(5), 2210–2219 (2008)
Schniter, P., Rangan, S.: Compressive phase retrieval via generalized approximate message passing. IEEE Trans. Signal Process. 63(4), 1043–1055 (2015)
Shechtman, Y., Eldar, Y.C., Szameit, A., Segev, M.: Sparsity based sub-wavelength imaging with partially incoherent light via quadratic compressed sensing. Opt. Express 19(16), 14807–14822 (2011)
Voroninski, V., Xu, Z.Q.: A strong restricted isometry property, with an application to phaseless compressed sensing. Appl. Comput. Harmon. Anal. 40(2), 386–395 (2016)
Wang, Y., Xu, Z.Q.: Phase retrieval for sparse signals. Appl. Comput. Harmon. Anal. 37(3), 531–544 (2014)
Xu, G.W., Xu, Z.Q.: On the \(\ell _1\)-norm invariant convex \( k \)-sparse decomposition of signals. J. Oper. Res. Soc. China 1(4), 537–541 (2013)
Yang, Z., Zhang, C.S., Xie, L.H.,: Robust compressive phase retrieval via L1 minimization with application to image reconstruction. arXiv:1302.0081 (2013)
Acknowledgments
My deepest gratitude goes to Professor Zhiqiang Xu, my academic supervisor, for his guidance and many useful discussions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Roman Vershynin.
Appendix
Appendix
The following two lemmas are useful in the proof of Lemma 4.1.
Lemma 6.1
(Sparse representation of a polytope [6, 21]): Suppose \(\alpha >0\) is a constant and \(s>0\) is an integer. Set
For any \(v\in \mathbb {R}^n\), set
Then \(v\in T(\alpha ,s)\) if and only if v is in the convex hull of \( U (\alpha ,s,v)\). In particular, any \(v\in T(\alpha ,s)\) can be expressed as
Lemma 6.2
(Lemma 5.3 in [5]): Suppose \(m\ge r \), \( a_1\ge a_2\ge \cdots \ge a_m\ge 0 \) and \( \sum _{i=1}^{r}a_i\ge \sum _{i=r+1}^{m}a_i \). Then for all \( \alpha \ge 1 \), we have
Now we are ready to prove Lemma 4.1.
Proof of the Lemma 4.1
We assume that the tight frame \( D\in {\mathbb R}^{n\times N} \) is normalized, i.e., \( DD^*=I \) and \( \Vert y\Vert _2=\Vert D^*y\Vert _2 \) for all \( y\in \mathbb {R}^n \). For a subset \( T\subseteq \{1,2,\ldots ,N\} \), we denote \( D_T \) as the matrix D restricted to the columns indexed by T (replacing other columns by zero vectors).
Set \(h:=\hat{x}-x_0\). Let \(T_0\) denote the index set of the largest k coefficients of \(D^*x_0\) in magnitude. Then
which implies
Suppose \( S_0 \) is the index set of the k largest entries in absolute value of \( D^*h \). We get
Set
We divide \( D^*_{S_0^c }h\) into two parts \( D^*_{S_0^c }h=h^{(1)}+h^{(2)} \), where
Then a simple observation is that \( \Vert h^{(1)}\Vert _1\le \Vert D^*_{S_0^c}h\Vert _1\le \alpha k \). Set
Since all non-zero entries of \( h^{(1)} \) have magnitude larger than \( \alpha /(t-1) \), we have
which implies \( \ell \le (t-1)k \).
Note that
Then in Lemma 6.1, by setting \( s:=k(t-1)-\ell \), we can express \( h^{(2)} \) as a weighted mean:
where \( 0\le \lambda _i\le 1 \), \( \sum _{i=1}^{M}\lambda _i=1\), \( \Vert u_i\Vert _0\le k(t-1)-\ell \), \(\Vert u_i\Vert _\infty \le \alpha /(t-1) \) and \(supp (u_i)\subseteq supp (h^{(2)}) \). Thus
Recall that \(\alpha =\frac{\Vert D^*_{S_0}h\Vert _1+2\sigma _k(D^*x_0)_1+\rho }{k}\). Then
where \( z:=\Vert D^*_{S_0}h+h^{(1)}\Vert _2, \,\, R:=\frac{2\sigma _k(D^*x_0)_1+\rho }{\sqrt{k}}\).
Now we suppose \( 0\le \mu \le 1 \), \( d\ge 0\) are two constants to be determined. Set
Then for any fixed \(i\in [1:M]\),
For \(\sum _{i=1}^M\lambda _i=1\), we have the following identity
In (6.27), we chose \( d=1/2 \) and \( \mu =\sqrt{t(t-1)}-(t-1)< 1/2 \). Then (6.28) implies
We next estimate the three terms in (6.29). First we give the following useful relation:
Noting that \(\Vert D^*_{S_0}h\Vert _0\le k \), \( \Vert h^{(1)}\Vert _0= \ell \le (t-1)k \) and \(\Vert u_i\Vert _0\le s =k(t-1)-\ell \), we obtain
and
Here we assume \( t\cdot k \) as an integer first. Since A satisfies the DRIP of order \(t\cdot k\) with constant \(\delta \), we can obtain
and
Combining the above results with (6.26) and (6.29), we get
which is a quadratic inequality for z. Recall that \( \delta <\sqrt{(t-1)/t} \). So by solving the above inequality, we get
We know \( \Vert D^*_{S_0^c}h\Vert _1\le \Vert D^*_{S_0}h\Vert _1+R\sqrt{k} \). In the Lemma 6.2, if we set \( m=N \), \( r=k \), \( \lambda =R\sqrt{k}\ge 0 \) and \( \alpha =2 \), we can obtain
So
Substituting R into this inequality, we can get the conclusion. For the case where \(t\cdot k\) is not an integer, we set \(t^*:=\lceil tk\rceil / k\), then \(t^*>t\) and \(\delta _{t^*k}=\delta _{tk}<\sqrt{\frac{t-1}{t}}<\sqrt{\frac{t^*-1}{t^*}}\). We can prove the result by working on \(\delta _{t^*k}\). \(\square \)
Rights and permissions
About this article
Cite this article
Gao, B. The \( \ell _1 \)-Analysis in Phase Retrieval with Redundant Dictionary. J Fourier Anal Appl 23, 1097–1117 (2017). https://doi.org/10.1007/s00041-016-9500-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00041-016-9500-z