Fetching the paper…
Reading the bibliography…
Learning from unlabeled and noisy data is one of the grand challenges of machine learning.
C. M. Stein, “Estimation of the mean of a multivariate normal distribution,” The annals of Statistics , pp. 1135–1151, 1981
1981
Earlier work this paper cites.
D. L. Donoho and I. M. Johnstone, “Adapting to unknown smoothness via wavelet shrinkage,” Journal of the american statistical association , vol. 90, no. 432, pp. 1200–1224, 1995
1995
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.
N. Ailon and B. Chazelle, “Approximate nearest neighbors and the fast johnson-lindenstrauss transform,” in Proceedings of the thirty-eighth annual ACM symposium on Theory of computing . ACM, 2006, pp. 557–563
2006
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 Transactions on image processing , vol. 16, no. 8, pp. 2080–2095, 2007
2007
Earlier work this paper cites.
T. Blu and F. Luisier, “The sure-let approach to image denoising,” IEEE Transactions on Image Processing , vol. 16, no. 11, pp. 2778–2786, 2007
2007
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 Transactions on Image Processing , vol. 17, no. 9, pp. 1540–1554, 2008
2008
Earlier work this paper cites.
M. Raphan and E. P. Simoncelli, “Optimal denoising in redundant representations,” IEEE Transactions on image processing , vol. 17, no. 8, pp. 1342–1352, 2008
2008
Earlier work this paper cites.
Y. C. Eldar, “Generalized sure for exponential families: Applications to regularization,” IEEE Transactions on Signal Processing , vol. 57, no. 2, pp. 471–481, 2009
2009
Earlier work this paper cites.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proceedings of the National Academy of Sciences , vol. 106, no. 45, pp. 18 914–18 919, 2009
2009
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.
F. Luisier, T. Blu, and M. Unser, “Image denoising in mixed poisson–gaussian noise,” IEEE Transactions on image processing , vol. 20, no. 3, pp. 696–708, 2011
2011
Earlier work this paper cites.
R. Giryes, M. Elad, and Y. C. Eldar, “The projected gsure for automatic parameter tuning in iterative shrinkage methods,” Applied and Computational Harmonic Analysis , vol. 30, no. 3, pp. 407–422, 2011
2011
Earlier work this paper cites.
S. Gleichman and Y. C. Eldar, “Blind compressed sensing,” IEEE Transactions on Information Theory , vol. 57, no. 10, pp. 6958–6975, 2011
2011
Earlier work this paper cites.
D. Baron and M. F. Duarte, “Universal map estimation in compressed sensing,” in Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on . IEEE, 2011, pp. 768–775
2011
Earlier work this paper cites.
M. Raphan and E. P. Simoncelli, “Least squares estimation without priors or supervision,” Neural computation , vol. 23, no. 2, pp. 374–420, 2011
2011
Earlier work this paper cites.
N. Natarajan, I. S. Dhillon, P. K. Ravikumar, and A. Tewari, “Learning with noisy labels,” in Proc. Adv. in Neural Processing Systems (NIPS) , 2013, pp. 1196–1204
2013
Cited alongside, same era.
2013
Cited alongside, same era.
M. Bayati, M. A. Erdogdu, and A. Montanari, “Estimating lasso risk and noise level,” in Advances in Neural Information Processing Systems , 2013, pp. 944–952
2013
Cited alongside, same era.
2014
Cited alongside, same era.
T. Liu and D. Tao, “Classification with noisy labels by importance reweighting,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 38, no. 3, pp. 447–461, 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.
C. A. Metzler, A. Maleki, and R. G. Baraniuk, “From denoising to compressed sensing,” IEEE Transactions on Information Theory , vol. 62, no. 9, pp. 5117–5144, 2016
2016
Later among the works it cites.
T. Moon, S. Min, B. Lee, and S. Yoon, “Neural universal discrete denoiser,” in Advances in Neural Information Processing Systems , 2016, pp. 4772–4780
2016
Later among the works it cites.
K. Upadhya, C. S. Seelamantula, and K. Hari, “A risk minimization framework for channel estimation in ofdm systems,” Signal Processing , vol. 128, pp. 78–87, 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
C. Dong, C. Loy, K. He, and X. Tang, “Learning a deep convolutional network for image super-resolution,” in European Conference on Computer Vision . Springer, 2014, pp. 184–199
2014
Cited alongside, same era.
2014
Cited alongside, same era.
B. K. Panisetti, T. Blu, and C. S. Seelamantula, “An unbiased risk estimator for multiplicative noise—application to 1-d signal denoising,” in 2014 19th International Conference on Digital Signal Processing . IEEE, 2014, pp. 497–502
2014
Cited alongside, same era.
2014
Cited alongside, same era.
S. Jalali, A. Maleki, and R. G. Baraniuk, “Minimum complexity pursuit for universal compressed sensing,” IEEE Transactions on Information Theory , vol. 60, no. 4, pp. 2253–2268, 2014
2014
Cited alongside, same era.
S. R. Krishnan, C. S. Seelamantula, and P. Chakravarti, “Spatially adaptive kernel regression using risk estimation,” IEEE Signal Processing Letters , vol. 21, no. 4, pp. 445–448, 2014
2014
Cited alongside, same era.
G. Alain and Y. Bengio, “What regularized auto-encoders learn from the data-generating distribution,” The Journal of Machine Learning Research , vol. 15, no. 1, pp. 3563–3593, 2014
2014
Cited alongside, same era.
2016
Later among the works it cites.
D. Ulyanov, A. Vedaldi, and V. S. Lempitsky, “Deep image prior,” CoRR , vol. abs/1711.10925, 2017
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 Transactions on Image Processing , vol. 26, no. 7, pp. 3142–3155, 2017
2017
Later among the works it cites.
C. Yang, X. Lu, Z. Lin, E. Shechtman, O. Wang, and H. Li, “High-resolution image inpainting using multi-scale neural patch synthesis,” in The IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , vol. 1, no. 2, 2017, p. 3
2017
Later among the works it cites.
C. Metzler, A. Mousavi, and R. Baraniuk, “Learned d-amp: Principled neural network based compressive image recovery,” in Advances in Neural Information Processing Systems , 2017, pp. 1770–1781
2017
Later among the works it cites.
S. Jalali and H. V. Poor, “Universal compressed sensing for almost lossless recovery,” IEEE Transactions on Information Theory , vol. 63, no. 5, pp. 2933–2953, 2017
2017
Later among the works it cites.
S. Soltanayev and S. Y. Chun, “Training deep learning based denoisers without ground truth data,” in Advances in Neural Information Processing Systems , 2018, pp. 3257–3267
2018
Closest in time.
2018
Closest in time.
S. Cha and T. Moon, “Neural adaptive image denoiser,” in 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 2018, pp. 2981–2985
2018
Closest in time.
A. Bora, E. Price, and A. G. Dimakis, “Ambientgan: Generative models from lossy measurements,” in International Conference on Learning Representations (ICLR) , 2018
2018
Closest in time.
J. Lehtinen, J. Munkberg, J. Hasselgren, S. Laine, T. Karras, M. Aittala, and T. Aila, “Noise2Noise: Learning image restoration without clean data,” in Proceedings of the 35th International Conference on Machine Learning , ser. Proceedings of Machine Learning Research, J. Dy and A. Krause, Eds., vol. 80. Stockholmsmässan, Stockholm Sweden: PMLR, 10–15 Jul 2018, pp. 2971–2980
2018
Closest in time.