Infinity Laplacian on graphs with gradient terms for image and data clustering ?
New PdEs-based operators on graphs with data dependent parameters. Combination of infinity Laplacian equation with discrete gradient terms. The proof of existence and uniqueness and a simple digital algorithm are given. The approach is illustrated for both image segmentation and database clustering. First time that infinity Laplacian with gradient are proposed for clustering.
laplacian segmentation weighted graphs pde unsupervised classification