p-Laplacian regularization of signals on directed graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

p-Laplacian regularization of signals on directed graphs

Résumé

The graph Laplacian plays an important role in describing the structure of a graph signal from weights that measure the similarity between the vertices of the graph. In the literature, three definitions of the graph Laplacian have been considered for undirected graphs: the combinatorial, the normalized and the random-walk Laplacians. Moreover , a nonlinear extension of the Laplacian, called the p-Laplacian, has also been put forward for undirected graphs. In this paper, we propose several formulations for p-Laplacians on directed graphs directly inspired from the Laplacians on undirected graphs. Then, we consider the problem of p-Laplacian regularization of signals on directed graphs. Finally, we provide experimental results to illustrate the effect of the proposed p-laplacians on different types of graph signals.
Fichier principal
Vignette du fichier
isvc_2018_paper24.pdf (7.79 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01923318 , version 1 (15-11-2018)

Identifiants

  • HAL Id : hal-01923318 , version 1

Citer

Zeina Abu Aisheh, Sébastien Bougleux, Olivier Lézoray. p-Laplacian regularization of signals on directed graphs. International Symposium on Visual Computing, Nov 2018, Las Vegas, United States. pp.650-661. ⟨hal-01923318⟩
40 Consultations
197 Téléchargements

Partager

Gmail Facebook X LinkedIn More