Optimizing spatial and tonal data for PDE-based inpainting

MaRDI QIDQ4556128zbMATH OpenFDO

Authors Laurent Hoeltgen, Markus Meinberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Daniel Johannsen, F. Neumann, Benjamin Doerr, S. Setzer

Publication date 23 November 2018

Full work available at URL https://arxiv.org/abs/1506.04566

zbMATH Keywords

approximationdiffusionfree knot problemimage compressioninpaintinginterpolationoptimizationpartial differential equations

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Abstract: Some recent methods for lossy signal and image compression store only a few selected pixels and fill in the missing structures by inpainting with a partial differential equation (PDE). Suitable operators include the Laplacian, the biharmonic operator, and edge-enhancing anisotropic diffusion (EED). The quality of such approaches depends substantially on the selection of the data that is kept. Optimising this data in the domain and codomain gives rise to challenging mathematical problems that shall be addressed in our work. In the 1D case, we prove results that provide insights into the difficulty of this problem, and we give evidence that a splitting into spatial and tonal (i.e. function value) optimisation does hardly deteriorate the results. In the 2D setting, we present generic algorithms that achieve a high reconstruction quality even if the specified data is very sparse. To optimise the spatial data, we use a probabilistic sparsification, followed by a nonlocal pixel exchange that avoids getting trapped in bad local optima. After this spatial optimisation we perform a tonal optimisation that modifies the function values in order to reduce the global reconstruction error. For homogeneous diffusion inpainting, this comes down to a least squares problem for which we prove that it has a unique solution. We demonstrate that it can be found efficiently with a gradient descent approach that is accelerated with fast explicit diffusion (FED) cycles. Our framework allows to specify the desired density of the inpainting mask a priori. Moreover, is more generic than other data optimisation approaches for the sparse inpainting problem, since it can also be extended to nonlinear inpainting operators such as EED. This is exploited to achieve reconstructions with state-of-the-art quality. We also give an extensive literature survey on PDE-based image compression methods.

Recommendations

• Variational, Geometric, and Level Set Methods in Computer Vision
• Inpainting for compressed images
• Image compression with anisotropic diffusion
• Denoising by inpainting
• Total variation wavelet inpainting

Cited in

(11)

• Theoretical foundation of the weighted Laplace inpainting problem.
• Reconstruction of smooth 3D color functions from keypoints: application to lossy compression and exemplar-based generation of color LUTs
• Variational, Geometric, and Level Set Methods in Computer Vision
• Computer Vision - ECCV 2004
• Sparse inpainting with smoothed particle hydrodynamics
• Spherical Image Inpainting with Frame Transformation and Data-Driven Prior Deep Networks
• Pseudodifferential inpainting: the missing link between PDE- and RBF-based interpolation
• Sparsification scale-spaces
• Optimal Interpolation Data for PDE-based Compression of Images with Noise
• Title not available (Why is no real title available?)
• Quantisation scale-spaces

This page was built for publication: Optimizing spatial and tonal data for PDE-based inpainting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4556128)