The reviewed record of science sign in
Pith

arxiv: 2404.18699 · v2 · pith:EM5W5P4B · submitted 2024-04-29 · cs.LG · cs.CV· eess.IV

Convergence Properties of Score-Based Models for Linear Inverse Problems Using Graduated Optimisation

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:EM5W5P4Brecord.jsonopen to challenge →

classification cs.LG cs.CVeess.IV
keywords graduatedoptimisationinversemodelsproblemsconvergenceexperimentsframework
0
0 comments X
read the original abstract

The incorporation of generative models as regularisers within variational formulations for inverse problems has proven effective across numerous image reconstruction tasks. However, the resulting optimisation problem is often non-convex and challenging to solve. In this work, we show that score-based generative models (SGMs) can be used in a graduated optimisation framework to solve inverse problems. We show that the resulting graduated non-convexity flow converge to stationary points of the original problem and provide a numerical convergence analysis of a 2D toy example. We further provide experiments on computed tomography image reconstruction, where we show that this framework is able to recover high-quality images, independent of the initial value. The experiments highlight the potential of using SGMs in graduated optimisation frameworks. The source code is publicly available on GitHub.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.