|
Sampling and Solving Linear Inverse Problems Using the Prior Implicit in a Denoiser| old_uid | 18633 |
|---|
| title | Sampling and Solving Linear Inverse Problems Using the Prior Implicit in a Denoiser |
|---|
| start_date | 2021/01/14 |
|---|
| schedule | 16h-17h |
|---|
| online | no |
|---|
| details | en visioconference : https://data-ens.github.io/seminar/ |
|---|
| summary | Prior probability models are a central component of many image processing problems, but density estimation is a notoriously difficult problem for high dimensional signals such as photographic images. Deep neural networks have provided impressive solutions for problems such as denoising, which implicitly rely on a prior probability model of natural images. I’ll describe our progress in understanding and using this implicit prior. We rely on a little-known statistical result due to Miyasawa (1961), who showed that the least-squares solution for removing additive Gaussian noise can be written directly in terms of the gradient of the log of the noisy signal density. We use this fact to develop a stochastic coarse-to-fine gradient ascent procedure for drawing high-probability samples from the implicit prior embedded within a CNN trained to perform blind (i.e., unknown noise level) least-squares denoising. A generalization of this algorithm to constrained sampling provides a method for using the implicit prior to solve any linear inverse problem, with no additional training. We demonstrate this general form of transfer learning in multiple applications, using the same algorithm to produce high-quality solutions for deblurring, super-resolution, inpainting, and compressive sensing. Joint work with Zahra Kadkhodaie, Sreyas Mohan, and Carlos Fernandez-Granda |
|---|
| responsibles | Krzakala, Mamassian, Mallat |
|---|
| |
|