Abstract
Abstract This paper deals with extensions of vector-valued functions on finite graphs fulfilling distinguished minimality properties. We show that so-called $\mathrm{lex}$ and $L\mbox{-}\mathrm{lex}$ minimal extensions are actually the same and call them minimal Lipschitz extensions. Then, we prove that the solution of the graph $p$-Laplacians converge to these extensions as $p\to \infty$. Furthermore, we examine the relation between minimal Lipschitz extensions and iterated weighted midrange filters and address their connection to $\infty$-Laplacians for scalar-valued functions. A convergence proof for an iterative algorithm proposed by Elmoataz et al. (2014) for finding the zero of the $\infty$-Laplacian is given. Finally, we present applications in image inpainting.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
