Nonlocal infinity Laplacian equation on graphs with applications in image processing and machine learning

Elmoataz Abderrahim, Desquesnes Xavier, Lakhdari Zakaria and Lézoray Olivier

Mathematics and Computers in Simulation (MATCOM), 2014, vol. 102, issue C, 153-163

Abstract: In this paper, an adaptation of the infinity Laplacian equation to weighted graphs is proposed. This adaptation leads to a nonlocal partial difference equation on graphs, which is an extension of the well-known approximations of the infinity Laplacian equation. To do so, we study the limit as p tends to infinity of minimizers of p-harmonic function on graphs. We also prove the existence and uniqueness of the solution of this equation. Our motivation stems from the extension of the nonlocal infinity Laplacian equation from image processing to machine learning fields, with proposed illustrations for image inpainting and semi-supervised clustering.

Keywords: Nonlocal infinity Laplacian; Partial difference equations; Tug-of-war game; Weighted graphs; Image processing; Semi-supervised data clustering (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475414000421
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:102:y:2014:i:c:p:153-163

DOI: 10.1016/j.matcom.2014.01.007

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().