Discrete infinity harmonic functions: Towards a unified interpolation framework on graphs

In this paper, we introduce fast and robust digital algorithms for solving the Dirichlet problem with ∞-harmonic functions on graphs. Several PDEs and variational techniques have been proposed for a number of interpolation problems. Our motivation for this work is to extend some of these PDEs on graphs to deal with interpolation problems with a new approach in a discrete framework using the ∞-Laplacian on weighted graphs arbitrary topology. We show the experimental results for some applications of image interpolation that demonstrate the efficiency of our method and point out the interest of the novel algorithm with p = ∞ for interpolation problems.