Finding Optimal Smoothnessnoperators for Inpainting with Bi-level Optimization

Tomasson, Jon Arnar

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Thesis

Finding Optimal Smoothnessnoperators for Inpainting with Bi-level Optimization

MPS-Authors

Tomasson, Jon Arnar
International Max Planck Research School, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Tomasson, J. A. (2017). Finding Optimal Smoothnessnoperators for Inpainting with Bi-level Optimization. Master Thesis, Universität des Saarlandes, Saarbrücken.

Cite as: https://hdl.handle.net/21.11116/0000-0000-7641-2

Abstract

Inpainting and image denoising are two problems in image processing that can be formulated as rather similar partial differential equations or PDE. In this work the effects of higher order smoothness constraints on the results of denoising and inpaintingvwere looked at. Methods from bi-level optimization were used in order to learn optimal smoothness constraints. The differences between the optimal smoothness constraints for the two problems were looked at both for a linear model and a more complex non-linear model. The results for the linear model were that inpainting favoured first order smoothness. For denoising on the other hand all of the different orders of smoothness made up a comparable part of the optimal smoothness constraint. Even with this difference the overall effect on the quality of the results was similar for both problems. For the non-linear model it was much more difficult to find a good smoothness constraint for the inpainting problem than for the denoising problem and the learned smoothness constraints looked very different.