Skip to main content

Sketched Learning for Image Denoising

  • Conference paper
  • First Online:
Scale Space and Variational Methods in Computer Vision (SSVM 2021)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 12679))

Abstract

The Expected Patch Log-Likelihood algorithm (EPLL) and its extensions have shown good performances for image denoising. It estimates a Gaussian mixture model (GMM) from a training database of image patches and it uses the GMM as a prior for denoising. In this work, we adapt the sketching framework to carry out the compressive estimation of Gaussian mixture models with low rank covariances for image patches. With this method, we estimate models from a compressive representation of the training data with a learning cost that does not depend on the number of items in the database. Our method adds another dimension reduction technique (low-rank modeling of covariances) to the existing sketching methods in order to reduce the dimension of model parameters and to add flexibility to the modeling. We test our model on synthetic data and real large-scale data for patch-based image denoising. We show that we can produce denoising performance close to the models estimated from the original training database, opening the way for the study of denoising strategies using huge patch databases.

This work was partly funded by ANR project EFFIREG - ANR-20-CE40-0001.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Balakrishnan, S., Wainwright, M.J., Yu, B., et al.: Statistical guarantees for the EM algorithm: from population to sample-based analysis. Ann. Stat. 45(1), 77–120 (2017)

    Article  MathSciNet  Google Scholar 

  2. Buades, A., Coll, B., Morel, J.M.: A review of image denoising algorithms, with a new one. Multiscale Model. Simul. 4(2), 490–530 (2005)

    Article  MathSciNet  Google Scholar 

  3. Burer, S., Monteiro, R.D.: Local minima and convergence in low-rank semidefinite programming. Math. Program. 103(3), 427–444 (2005)

    Article  MathSciNet  Google Scholar 

  4. Chatalic, A., Gribonval, R., Keriven, N.: Large-scale high-dimensional clustering with fast sketching. In: 2018 International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 4714–4718. IEEE (2018)

    Google Scholar 

  5. Chi, Y., Lu, Y.M., Chen, Y.: Nonconvex optimization meets low-rank matrix factorization: an overview. IEEE Trans. Signal Process. 67(20), 5239–5269 (2019)

    Article  MathSciNet  Google Scholar 

  6. Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55(1), 58–75 (2005)

    Article  MathSciNet  Google Scholar 

  7. Criminisi, A., Pérez, P., Toyama, K.: Region filling and object removal by exemplar-based image inpainting. IEEE Trans. Image Process. 13(9), 1200–1212 (2004)

    Article  Google Scholar 

  8. Danielyan, A., Foi, A., Katkovnik, V., Egiazarian, K.: Image upsampling via spatially adaptive block-matching filtering. In: 2008 16th European Signal Processing Conference, pp. 1–5. IEEE (2008)

    Google Scholar 

  9. Dasgupta, S., Schulman, L.J.: A probabilistic analysis of EM for mixtures of separated, spherical gaussians. J. Mach. Learn. Res. 8, 203–226 (2007)

    MathSciNet  MATH  Google Scholar 

  10. Deledalle, C.A., Parameswaran, S., Nguyen, T.Q.: Image denoising with generalized gaussian mixture model patch priors. SIAM J. Imag. Sci. 11(4), 2568–2609 (2018)

    Article  MathSciNet  Google Scholar 

  11. Foucart, S., Rauhut, H.: A Mathematical Introduction to Compressive Sensing. Springer, New York (2013). https://doi.org/10.1007/978-0-8176-4948-7

    Book  MATH  Google Scholar 

  12. Glasner, D., Bagon, S., Irani, M.: Super-resolution from a single image. In: 2009 12th International Conference on Computer Vision, pp. 349–356. IEEE (2009)

    Google Scholar 

  13. Gribonval, R., Chatalic, A., Keriven, N., Schellekens, V., Jacques, L., Schniter, P.: Sketching datasets for large-scale learning (long version). arXiv preprint arXiv:2008.01839 (2020)

  14. Gribonval, R., Blanchard, G., Keriven, N., Traonmilin, Y.: Compressive statistical learning with random feature moments (2020)

    Google Scholar 

  15. Gribonval, R., Blanchard, G., Keriven, N., Traonmilin, Y.: Statistical learning guarantees for compressive clustering and compressive mixture modeling (2020)

    Google Scholar 

  16. Katkovnik, V., Egiazarian, K.: Nonlocal image deblurring: variational formulation with nonlocal collaborative l 0-norm prior. In: 2009 International Workshop on Local and Non-Local Approximation in Image Processing, pp. 46–53. IEEE (2009)

    Google Scholar 

  17. Keriven, N., Bourrier, A., Gribonval, R., Pérez, P.: Sketching for large-scale learning of mixture models. Inf. Inf. J. IMA 7(3), 447–508 (2018)

    MathSciNet  MATH  Google Scholar 

  18. Lebrun, M., Buades, A., Morel, J.M.: A nonlocal Bayesian image denoising algorithm. SIAM J. Imag. Sci. 6(3), 1665–1688 (2013)

    Article  MathSciNet  Google Scholar 

  19. Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proceedings 8th International Conference on Computer Vision. ICCV 2001, vol. 2, pp. 416–423. IEEE (2001)

    Google Scholar 

  20. Parameswaran, S., Deledalle, C.A., Denis, L., Nguyen, T.Q.: Accelerating GMM-based patch priors for image restoration: three ingredients for a \(100\times \) speed-up. IEEE Trans. Image Process. 28(2), 687–698 (2018)

    Article  MathSciNet  Google Scholar 

  21. Traonmilin, Y., Aujol, J.F.: The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem. Inverse Probl. 36(4), 045003 (2020)

    Google Scholar 

  22. Traonmilin, Y., Aujol, J.F., Leclaire, A.: Projected gradient descent for non-convex sparse spike estimation. IEEE Signal Process. Lett. 27, 1110–1114 (2020)

    Article  Google Scholar 

  23. Traonmilin, Y., Aujol, J.F., Leclaire, A.: The basins of attraction of the global minimizers of non-convex inverse problems with low-dimensional models in infinite dimension (2020)

    Google Scholar 

  24. Wang, Y.Q., Morel, J.M.: Sure guided gaussian mixture image denoising. SIAM J. Imag. Sci. 6(2), 999–1034 (2013)

    Article  MathSciNet  Google Scholar 

  25. Wu, C.J.: On the convergence properties of the EM algorithm. Ann. Stat. 95–103 (1983)

    Google Scholar 

  26. Zoran, D., Weiss, Y.: From learning models of natural image patches to whole image restoration. In: 2011 International Conference on Computer Vision, pp. 479–486. IEEE (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hui Shi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Shi, H., Traonmilin, Y., Aujol, JF. (2021). Sketched Learning for Image Denoising. In: Elmoataz, A., Fadili, J., Quéau, Y., Rabin, J., Simon, L. (eds) Scale Space and Variational Methods in Computer Vision. SSVM 2021. Lecture Notes in Computer Science(), vol 12679. Springer, Cham. https://doi.org/10.1007/978-3-030-75549-2_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-75549-2_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-75548-5

  • Online ISBN: 978-3-030-75549-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics