Fetching the paper…
Reading the bibliography…
Compressive image recovery is a challenging problem that requires fast and accurate algorithms.
D. J. Thouless, P. W. Anderson, and R. G. Palmer, “Solution of ‘Solvable model of a spin glass’,” Philos. Mag. , vol. 35, no. 3, pp. 593–601, 1977
1977
Earlier work this paper cites.
F. J. Śmieja, “Neural network constructive algorithms: Trading generalization for learning efficiency?” Circuits, Systems, and Signal Processing , vol. 12, no. 2, pp. 331–374, 1993
1993
Earlier work this paper cites.
D. Martin, C. Fowlkes, D. Tal, and J. Malik, “A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics,” Proc. Int. Conf. Computer Vision , vol. 2, pp. 416–423, July 2001
2001
Earlier work this paper cites.
I. Daubechies, M. Defrise, and C. D. Mol, “An iterative thresholding algorithm for linear inverse problems with a sparsity constraint,” Comm. on Pure and Applied Math. , vol. 75, pp. 1412–1457, 2004
2004
Earlier work this paper cites.
E. J. Candes, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inform. Theory , vol. 52, no. 2, pp. 489–509, Feb. 2006
2006
Earlier work this paper cites.
R. G. Baraniuk, “Compressive sensing [lecture notes],” IEEE Signal Processing Mag. , vol. 24, no. 4, pp. 118–121, 2007
2007
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 Processing , vol. 16, no. 8, pp. 2080–2095, Aug. 2007
2007
Earlier work this paper cites.
M. Mézard and A. Montanari, Information, Physics, Computation: Probabilistic Approaches . Cambridge University Press, 2008
2008
Earlier work this paper cites.
S. Ramani, T. Blu, and M. Unser, “Monte-Carlo sure: A black-box optimization of regularization parameters for general denoising algorithms,” IEEE Trans. Image Processing , pp. 1540–1554, 2008
2008
Earlier work this paper cites.
D. Needell and J. A. Tropp, “CoSaMP: Iterative signal recovery from incomplete and inaccurate samples,” Appl. Comput. Harmon. Anal. , vol. 26, no. 3, pp. 301–321, 2009
2009
Earlier work this paper cites.
D. L. Donoho, A. Maleki, and A. Montanari, “Message passing algorithms for compressed sensing,” Proc. Natl. Acad. Sci. , vol. 106, no. 45, pp. 18 914–18 919, 2009
2009
Earlier work this paper cites.
C. Li, W. Yin, and Y. Zhang, “User’s guide for TVAL3: TV minimization by augmented Lagrangian and alternating direction algorithms,” Rice CAAM Department report , vol. 20, pp. 46–47, 2009
2009
Earlier work this paper cites.
R. G. Baraniuk, V. Cevher, M. F. Duarte, and C. Hegde, “Model-based compressive sensing,” IEEE Trans. Inform. Theory , vol. 56, no. 4, pp. 1982 –2001, Apr. 2010
2010
Earlier work this paper cites.
P. Vincent, H. Larochelle, I. Lajoie, Y. Bengio, and P.-A. Manzagol, “Stacked denoising autoencoders: Learning useful representations in a deep network with a local denoising criterion,” J. Machine Learning Research , vol. 11, pp. 3371–3408, 2010
2010
Earlier work this paper cites.
K. Gregor and Y. LeCun, “Learning fast approximations of sparse coding,” Proc. Int. Conf. Machine Learning , pp. 399–406, 2010
2010
Earlier work this paper cites.
A. Maleki, “Approximate message passing algorithm for compressed sensing,” Stanford University PhD Thesis , Nov. 2010
2010
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, 2011
2011
Earlier work this paper cites.
H. C. Burger, C. J. Schuler, and S. Harmeling, “Image denoising: Can plain neural networks compete with BM3D?” Proc. IEEE Int. Conf. Comp. Vision, and Pattern Recognition , pp. 2392–2399, 2012
2012
Cited alongside, same era.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” Proc. Adv. in Neural Processing Systems (NIPS) , pp. 1097–1105, 2012
2012
Cited alongside, same era.
T. B. Yakar, P. Sprechmann, R. Litman, A. M. Bronstein, and G. Sapiro, “Bilevel sparse models for polyphonic music transcription.” ISMIR , pp. 65–70, 2013
2013
Cited alongside, same era.
S. V. Venkatakrishnan, C. A. Bouman, and B. Wohlberg, “Plug-and-play priors for model based reconstruction,” Proc. Global Conf. on Signal and Inform. Processing (GlobalSIP) , pp. 945–948, 2013
2013
Cited alongside, same era.
K. Kulkarni, S. Lohit, P. Turaga, R. Kerviche, and A. Ashok, “Reconnet: Non-iterative reconstruction of images from compressively sensed measurements,” Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , pp. 449–458, 2016
2016
Later among the works it cites.
E. W. Tramel, A. Drémeau, and F. Krzakala, “Approximate message passing with restricted Boltzmann machine priors,” Journal of Statistical Mechanics: Theory and Experiment , vol. 2016, no. 7, p. 073401, 2016
2016
Later among the works it cites.
E. W. Tramel, A. Manoel, F. Caltagirone, M. Gabrié, and F. Krzakala, “Inferring sparsity: Compressed sensing using generalized restricted Boltzmann machines,” Proc. IEEE Information Theory Workshop (ITW) , pp. 265–269, 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
W. Dong, G. Shi, X. Li, Y. Ma, and F. Huang, “Compressive sensing via nonlocal low-rank regularization,” IEEE Trans. Image Processing , vol. 23, no. 8, pp. 3618–3632, 2014
2014
Cited alongside, same era.
2014
Cited alongside, same era.
G. Alain and Y. Bengio, “What regularized auto-encoders learn from the data-generating distribution,” J. Machine Learning Research , vol. 15, no. 1, pp. 3563–3593, 2014
2014
Cited alongside, same era.
2014
Cited alongside, same era.
A. Mousavi, A. B. Patel, and R. G. Baraniuk, “A deep learning approach to structured signal recovery,” Proc. Allerton Conf. Communication, Control, and Computing , pp. 1336–1343, 2015
2015
Cited alongside, same era.
L. Theis and M. Bethge, “Generative image modeling using spatial LSTMs,” Proc. Adv. in Neural Processing Systems (NIPS) , pp. 1927–1935, 2015
2015
Cited alongside, same era.
2015
Cited alongside, same era.
A. Vedaldi and K. Lenc, “Matconvnet – Convolutional neural networks for MATLAB,” Proc. ACM Int. Conf. on Multimedia , 2015
2015
Cited alongside, same era.
U. S. Kamilov and H. Mansour, “Learning optimal nonlinearities for iterative thresholding algorithms,” IEEE Signal Process. Lett. , vol. 23, no. 5, pp. 747–751, 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
Y. Yang, J. Sun, H. Li, and Z. Xu, “Deep ADMM-net for compressive sensing MRI,” Proc. Adv. in Neural Processing Systems (NIPS) , vol. 29, pp. 10–18, 2016
2016
Later among the works it cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” Proc. IEEE Int. Conf. Comp. Vision, and Pattern Recognition , pp. 770–778, 2016
2016
Later among the works it cites.
2017
Closest in time.
A. Mousavi and R. G. Baraniuk, “Learning to invert: Signal recovery via deep convolutional networks,” Proc. IEEE Int. Conf. Acoust., Speech, and Signal Processing (ICASSP) , pp. 2272–2276, 2017
2017
Closest in time.
2017
Closest in time.
2017
Closest in time.
J. Rick Chang, C.-L. Li, B. Poczos, B. Vijaya Kumar, and A. C. Sankaranarayanan, “One network to solve them all–Solving linear inverse problems using deep projection models,” Proc. IEEE Int. Conf. Comp. Vision, and Pattern Recognition , pp. 5888–5897, 2017
2017
Closest in time.
C. K. Sønderby, J. Caballero, L. Theis, W. Shi, and F. Huszár, “Amortised map inference for image super-resolution,” Proc. Int. Conf. on Learning Representations (ICLR) , 2017
2017
Closest in time.
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 Processing , 2017
2017
Closest in time.