Discrete Green's Functions for Harmonic and Biharmonic Inpainting with Sparse Atoms

Recent research has shown that inpainting with the Laplace or biharmonic operator has a high potential for image compression, if the stored data is optimised and sufficiently sparse. The goal of our paper is to connect these linear inpainting methods to sparsity concepts. To understand these relations, we explore the theory of Green’s functions. In contrast to most work in the mathematical literature, we derive our Green’s functions in a discrete setting and on a rectangular image domain with homogeneous Neumann boundary conditions. These discrete Green’s functions can be interpreted as columns of the Moore–Penrose inverse of the discretised differential operator. More importantly, they serve as atoms in a dictionary that allows a sparse representation of the inpainting solution. Apart from offering novel theoretical insights, this representation is also simple to implement and computationally efficient if the inpainting data is sparse.

[1]  Yuri A. Melnikov,et al.  Green's Functions: Construction and Applications , 2012 .

[2]  Frank Neumann,et al.  Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting , 2011, SSVM.

[3]  Joachim Weickert,et al.  Compression of Depth Maps with Segment-Based Homogeneous Diffusion , 2013, SSVM.

[4]  Thomas Brox,et al.  iPiano: Inertial Proximal Algorithm for Nonconvex Optimization , 2014, SIAM J. Imaging Sci..

[5]  Joachim Weickert,et al.  From Box Filtering to Fast Explicit Diffusion , 2010, DAGM-Symposium.

[6]  Gene H. Golub,et al.  Matrix computations , 1983 .

[7]  Joachim Weickert,et al.  Understanding, Optimising, and Extending Data Compression with Anisotropic Diffusion , 2014, International Journal of Computer Vision.

[8]  Martin D. Buhmann,et al.  Radial Basis Functions , 2021, Encyclopedia of Mathematical Geosciences.

[9]  Hans-Peter Seidel,et al.  Image Compression with Anisotropic Diffusion , 2008, Journal of Mathematical Imaging and Vision.

[10]  Yunjin Chen,et al.  A bi-level view of inpainting - based image compression , 2014, ArXiv.

[11]  Hans-Peter Seidel,et al.  Towards PDE-Based Image Compression , 2005, VLSM.

[12]  Joachim Weickert,et al.  Universität Des Saarlandes Fachrichtung 6.1 – Mathematik Edge-based Compression of Cartoon-like Images with Homogeneous Diffusion Edge-based Compression of Cartoon-like Images with Homogeneous Diffusion Edge-based Compression of Cartoon-like Images with Homogeneous Diffusion , 2022 .

[13]  David Colton.  Partial Differential Equations: An Introduction , 1988 .

[14]  Shing-Tung Yau,et al.  Discrete Green's Functions , 2000, J. Comb. Theory A.

[15]  Peter D. Yardley,et al.  Analytic Methods for Partial Differential Equations , 2010 .

[16]  Gilbert Strang,et al.  Functions of Difference Matrices Are Toeplitz Plus Hankel , 2014, SIAM Rev..

[17]  Christine Guillemot,et al.  Efficient depth map compression based on lossless edge coding and diffusion , 2012, 2012 Picture Coding Symposium.

[18]  Joachim Weickert,et al.  An Optimal Control Approach to Find Sparse Data for Laplace Interpolation , 2013, EMMCVPR.

[19]  Knut-Andreas Lie,et al.  Scale Space and Variational Methods in Computer Vision, Second International Conference, SSVM 2009, Voss, Norway, June 1-5, 2009. Proceedings , 2009, SSVM.

[20]  J. Miller.  Numerical Analysis , 1966, Nature.

[21]  Nikos Paragios,et al.  Variational, Geometric, and Level Set Methods in Computer Vision, Third International Workshop, VLSM 2005, Beijing, China, October 16, 2005, Proceedings , 2005, VLSM.