LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

On the game p-Laplacian on weighted graphs with applications in image processing and data clustering†

Game-theoretic p-Laplacian or normalized p-Laplacian operator is a version of classical variational p-Laplacian which was introduced recently in connection with stochastic games called Tug-of-War with noise (Peres et al. 2008,… Click to show full abstract

Game-theoretic p-Laplacian or normalized p-Laplacian operator is a version of classical variational p-Laplacian which was introduced recently in connection with stochastic games called Tug-of-War with noise (Peres et al. 2008, Tug-of-war with noise: A game-theoretic view of the p-laplacian. Duke Mathematical Journal 145(1), 91–120). In this paper, we propose an adaptation and generalization of this operator on weighted graphs for 1 ≤ p ≤ ∞. This adaptation leads to a partial difference operator which is a combination between 1-Laplace, infinity-Laplace and 2-Laplace operators on graphs. Then we consider the Dirichlet problem associated to this operator and we prove the uniqueness and existence of the solution. We show that the solution leads to an iterative non-local average operator on graphs. Finally, we propose to use this operator as a unified framework for interpolation problems in signal processing on graphs, such as image processing and machine learning.

Keywords: weighted graphs; game; operator; image processing

Journal Title: European Journal of Applied Mathematics
Year Published: 2017

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.