Deep Image Prior

This article has multiple issues. Please help or discuss these issues on the talk page. (Learn how and when to remove these template messages) This article may be too technical for most readers to understand. Please to make it understandable to non-experts, without removing the technical details. (January 2018) (Learn how and when to remove this template message) This article relies largely or entirely on a single source. Relevant discussion may be found on the talk page. Please help by introducing citations to additional sources. Find sources:  –  ·  ·  · scholar · JSTOR (January 2018) The topic of this article may not meet Wikipedia's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted. Find sources:  –  ·  ·  · scholar · JSTOR (April 2018) (Learn how and when to remove this template message) (Learn how and when to remove this template message)

Deep Image Prior is a type of convolutional neural network used to enhance a given image with no prior training data other than the image itself. A neural network is randomly initialized and used as prior to solve inverse problems such as noise reduction, super-resolution, and inpainting. Image statistics is captured by the structure of a convolutional image generator rather than by any previously learned capabilities.

Method[]

Background[]

Inverse problems such as noise reduction, super-resolution, and inpainting can be formulated as the optimization task ${\displaystyle x^{*}=min_{x}E(x;x_{0})+R(x)}$, where ${\displaystyle x}$ is an image, ${\displaystyle x_{0}}$ a corrupted representation of that image, ${\displaystyle E(x;x_{0})}$ is a task-dependent data term, and R(x) is the regularizer. This forms an energy minimization problem.

Deep neural networks learn a generator/decoder ${\displaystyle x=f_{\theta }(z)}$ which maps a random code vector ${\displaystyle z}$ to an image ${\displaystyle x}$.

The image corruption method used to generate ${\displaystyle x_{0}}$ is selected for the specific application.

Specifics[]

In this approach, the ${\displaystyle R(x)}$ prior is replaced with the implicit prior captured by the neural network (where ${\displaystyle R(x)=0}$ for images that can be produced by a deep neural networks and ${\displaystyle R(x)=+\infty }$ otherwise). This yields the equation for the minimizer ${\displaystyle \theta ^{*}=argmin_{\theta }E(f_{\theta }(z);x_{0})}$ and the result of the optimization process ${\displaystyle x^{*}=f_{\theta ^{*}}(z)}$.

The minimizer ${\displaystyle \theta ^{*}}$ (typically a gradient descent) starts from a randomly initialized parameters and descends into a local best result to yield the ${\displaystyle x^{*}}$ restoration function.

Overfitting[]

A parameter θ may be used to recover any image, including its noise. However, the network is reluctant to pick up noise because it contains high impedance while useful signal offers low impedance. This results in the θ parameter approaching a good-looking local optimum so long as the number of iterations in the optimization process remains low enough not to overfit data.

Applications[]

Denoising[]

The principle of denoising is to recover an image ${\displaystyle x}$ from a noisy observation ${\displaystyle x_{0}}$, where ${\displaystyle x_{0}=x+\epsilon }$. The distribution ${\displaystyle \epsilon }$ is sometimes known (e.g.: profiling sensor and photon noise^[1]) and may optionally be incorporated into the model, though this process works well in blind denoising.

The quadratic energy function ${\displaystyle E(x,x_{0})=||x-x_{0}||^{2}}$ is used as the data term, plugging it into the equation for ${\displaystyle \theta ^{*}}$ yields the optimization problem ${\displaystyle min_{\theta }||f_{\theta }(z)-x_{0}||^{2}}$.

Super-resolution[]

Super-resolution is used to generate a higher resolution version of image x. The data term is set to ${\displaystyle E(x;x_{0})=||d(x)-x_{0}||^{2}}$ where d(·) is a downsampling operator such as Lanczos that decimates the image by a factor t.

Inpainting[]

Inpainting is used to reconstruct a missing area in an image ${\displaystyle x_{0}}$. These missing pixels are defined as the binary mask ${\displaystyle m\in \{0,1\}^{H\times V}}$. The data term is defined as ${\displaystyle E(x;x_{0})=||(x-x_{0})\odot m||^{2}}$ (where ${\displaystyle \odot }$ is the Hadamard product).

Flash-no-flash reconstruction[]

This approach may be extended to multiple images. A straightforward example mentioned by the author is the reconstruction of an image to obtain natural light and clarity from a flash-no-flash pair. Video reconstruction is possible but it requires optimizations to take into account the spatial differences.

Implementations[]

• A reference implementation rewritten in Python 3.6 with the library was released by the author under the Apache 2.0 license: deep-image-prior ^[2]
• A TensorFlow-based implementation written in Python 2 and released under the CC-SA 3.0 license: deep-image-prior-tensorflow
• A Keras-based implementation written in Python 2 and released under the GPLv3: machine_learning_denoising

References[]

• Ulyanov, Dmitry; Vedaldi, Andrea; Lempitsky, Victor (30 November 2017). "Deep Image Prior". arXiv:1711.10925v2 [cs.CV].