Fetching the paper…
Reading the bibliography…
Estimating a vector $\mathbf{x}$ from noisy linear measurements $\mathbf{Ax}+\mathbf{w}$ often requires use of prior knowledge or structural constraints on $\mathbf{x}$ for accurate reconstruction.
C. Stein, “A bound for the error in the normal approximation to the distribution of a sum of dependent random variables,” in Proc. Sixth Berkeley Symposium on Mathematical Statistics and Probability , Berkeley, CA, 1972
1972
Earlier work this paper cites.
L. L. Scharf and C. Demeure, Statistical Signal Processing: Detection, Estimation, and Time Series Analysis . Addison-Wesley Reading, MA, 1991, vol. 63
1991
Earlier work this paper cites.
S. S. Haykin, Ed., Blind Deconvolution . Upper Saddle River, NJ: Prentice-Hall, 1994
1994
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” J. Royal Stat. Soc., Ser. B , vol. 58, no. 1, pp. 267–288, 1996
1996
Earlier work this paper cites.
M. Opper and O. Winther, “Expectation consistent approximate inference,” J. Mach. Learning Res. , vol. 1, pp. 2177–2204, 2005
2005
Earlier work this paper cites.
K. Dabov, A. Foi, V. Katkovnik, and K. Egiazarian, “Image denoising by sparse 3-D transform-domain collaborative filtering,” IEEE Trans. Image Process. , vol. 16, no. 8, pp. 2080–2095, 2007
2007
Earlier work this paper cites.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proc. Nat. Acad. Sci. , vol. 106, no. 45, pp. 18 914–18 919, Nov. 2009
2009
Earlier work this paper cites.
J.-F. Cai, E. J. Candès, and Z. Shen, “A singular value thresholding algorithm for matrix completion,” SIAM J. Optim. , vol. 20, no. 4, pp. 1956–1982, 2010
2010
Earlier work this paper cites.
S. Rangan, “Generalized approximate message passing for estimation with random linear mixing,” in Proc. IEEE ISIT , 2011, pp. 2174–2178
2011
Earlier work this paper cites.
M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing,” IEEE Trans. Inform. Theory , vol. 57, no. 2, pp. 764–785, Feb. 2011
2011
Earlier work this paper cites.
H. Zhu, G. Leus, and G. B. Giannakis, “Sparsity-cognizant total least-squares for perturbed compressive sampling,” IEEE Trans. Signal Process. , vol. 59, no. 5, pp. 2002–2016, 2011
2011
Earlier work this paper cites.
J. Xie, L. Xu, and E. Chen, “Image denoising and inpainting with deep neural networks,” in Advances in Neural Information Processing Systems , 2012, pp. 341–349
2012
Earlier work this paper cites.
S. Rangan and A. K. Fletcher, “Iterative estimation of constrained rank-one matrices in noise,” in Proc. IEEE ISIT , Cambridge, MA, Jul. 2012, pp. 1246–1250
2012
Earlier work this paper cites.
S. Rangan, P. Schniter, E. Riegler, A. Fletcher, and V. Cevher, “Fixed points of generalized approximate message passing with arbitrary matrices,” in Proc. IEEE ISIT , Jul. 2013, pp. 664–668
2013
Earlier work this paper cites.
A. Javanmard and A. Montanari, “State evolution for general approximate message passing algorithms, with applications to spatial coupling,” Information and Inference , vol. 2, no. 2, pp. 115–144, 2013
2013
Earlier work this paper cites.
D. Donoho, I. Johnstone, and A. Montanari, “Accurate prediction of phase transitions in compressed sensing via a connection to minimax denoising,” IEEE Trans. Info. Thy. , vol. 59, no. 6, pp. 3396–3433, 2013
2013
Earlier work this paper cites.
S. V. Venkatakrishnan, C. A. Bouman, and B. Wohlberg, “Plug-and-play priors for model based reconstruction,” in Proc. IEEE Global Conference on Signal and Information Processing (GlobalSIP) , 2013, pp. 945–948
2013
Earlier work this paper cites.
2013
Cited alongside, same era.
E. J. Candès, T. Strohmer, and V. Voroninski, “PhaseLift: Exact and stable signal recovery from magnitude measurements via convex programming,” Commun. Pure Appl. Math. , vol. 66, no. 8, pp. 1241–1274, 2013
2013
Cited alongside, same era.
R. Matsushita and T. Tanaka, “Low-rank matrix reconstruction and clustering via approximate message passing,” in Proc. NIPS , 2013, pp. 917–925
2013
Cited alongside, same era.
E. J. Candes, C. A. Sing-Long, and J. D. Trzasko, “Unbiased risk estimates for singular value thresholding and spectral estimators,” IEEE Trans. Signal Process. , vol. 61, no. 19, pp. 4643–4657, 2013
2013
Cited alongside, same era.
M. A. Davenport and J. Romberg, “An overview of low-rank matrix recovery from incomplete observations,” IEEE J. Sel. Topics Signal Process. , vol. 10, no. 4, pp. 608–622, 2016
2016
Later among the works it cites.
J. Parker and P. Schniter, “Parametric bilinear generalized approximate message passing,” IEEE J. Sel. Topics Signal Proc. , vol. 10, no. 4, pp. 795–808, 2016
2016
Later among the works it cites.
2017
Later among the works it cites.
K. Zhang, W. Zuo, Y. Chen, D. Meng, and L. Zhang, “Beyond a Gaussian denoiser: Residual learning of deep CNN for image denoising,” IEEE Trans. Image Process. , vol. 26, no. 7, pp. 3142–3155, 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Rangan, P. Schniter, and A. K. Fletcher, “On the convergence of approximate message passing with arbitrary matrices,” in Proc. IEEE ISIT , Jul. 2014, pp. 236–240
2014
Cited alongside, same era.
F. Caltagirone, L. Zdeborová, and F. Krzakala, “On convergence of approximate message passing,” in Proc. IEEE ISIT , Jul. 2014, pp. 1812–1816
2014
Cited alongside, same era.
U. S. Kamilov, S. Rangan, A. K. Fletcher, and M. Unser, “Approximate message passing with consistent parameter estimation and applications to sparse learning,” IEEE Trans. Info. Theory , vol. 60, no. 5, pp. 2969–2985, Apr. 2014
2014
Cited alongside, same era.
M. R. Andersen, O. Winther, and L. K. Hansen, “Bayesian inference for structured spike and slab priors,” in Advances in Neural Information Processing Systems , 2014, pp. 1745–1753
2014
Cited alongside, same era.
L. Xu, J. S. Ren, C. Liu, and J. Jia, “Deep convolutional neural network for image deconvolution,” in Advances in Neural Information Processing Systems , 2014, pp. 1790–1798
2014
Cited alongside, same era.
A. Ahmed, B. Recht, and J. Romberg, “Blind deconvolution using convex programming,” IEEE Trans. Inform. Theory , vol. 60, no. 3, pp. 1711–1732, 2014
2014
Cited alongside, same era.
Y. Deshpande and A. Montanari, “Information-theoretically optimal sparse PCA,” in Proc. ISIT , 2014, pp. 2197–2201
2014
Cited alongside, same era.
S. Ling and T. Strohmer, “Self-calibration and biconvex compressive sensing,” Inverse Problems , vol. 31, no. 11, p. 115002, 2015
2015
Cited alongside, same era.
Y. Ma, C. Rush, and D. Baron, “Analysis of approximate message passing with a class of non-separable denoisers,” in Proc. ISIT , 2017, pp. 231–235
2017
Later among the works it cites.
X. Wang and S. H. Chan, “Parameter-free plug-and-play ADMM for image restoration,” in Proc. IEEE Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 2017, pp. 1323–1327
2017
Later among the works it cites.
S. Rangan, P. Schniter, and A. K. Fletcher, “Vector approximate message passing,” in Proc. IEEE ISIT , 2017, pp. 1588–1592
2017
Later among the works it cites.
J. Ma and L. Ping, “Orthogonal amp,” IEEE Access , vol. 5, pp. 2020–2033, 2017
2017
Later among the works it cites.
K. Takeuchi, “Rigorous dynamics of expectation-propagation-based signal recovery from unitarily invariant measurements,” in Proc. ISIT , 2017, pp. 501–505
2017
Later among the works it cites.
A. K. Fletcher, M. Sahraee-Ardakan, S. Rangan, and P. Schniter, “Rigorous dynamics and consistent estimation in arbitrarily conditioned linear systems,” in Proc. NIPS , 2017, pp. 2542–2551
2017
Later among the works it cites.
P. Schniter, A. K. Fletcher, and S. Rangan, “Denoising-based vector AMP,” in Proc. Intl. Biomedical and Astronomical Signal Process. (BASP) Workshop , 2017, p. 77
2017
Later among the works it cites.
S. Rangan, A. K. Fletcher, V. K. Goyal, E. Byrne, and P. Schniter, “Hybrid approximate message passing,” IEEE Transactions on Signal Processing , vol. 65, no. 17, pp. 4577–4592, Sept 2017
2017
Later among the works it cites.
M. Borgerding, P. Schniter, and S. Rangan, “AMP-inspired deep networks for sparse linear inverse problems,” IEEE Trans. Signal Process. , vol. 65, no. 16, pp. 4293–4308, 2017
2017
Later among the works it cites.
P. Sun, Z. Wang, and P. Schniter, “Joint channel-estimation and equalization of single-carrier systems via bilinear AMP,” IEEE Trans. Signal Process. , vol. 66, no. 10, pp. 2772–2785, 2018
2018
Closest in time.
J. Vila, P. Schniter, S. Rangan, F. Krzakala, and L. Zdeborová, “Adaptive damping and mean removal for the generalized approximate message passing algorithm,” in Proc. IEEE ICASSP , 2015, pp. 2021–2025
2025
Closest in time.
S. Chen, C. Luo, B. Deng, Y. Qin, H. Wang, and Z. Zhuang, “BM3D vector approximate message passing for radar coded-aperture imaging,” in PIERS-FALL , 2017, pp. 2035–2038
2038
Closest in time.