Total Variation, Cheeger Cuts
نویسندگان
چکیده
In this work, inspired by (Bühler & Hein, 2009), (Strang, 1983), and (Zhang et al., 2009), we give a continuous relaxation of the Cheeger cut problem on a weighted graph. We show that the relaxation is actually equivalent to the original problem. We then describe an algorithm for finding good cuts suggested by the similarities of the energy of the relaxed problem and various well studied energies in image processing. Finally we provide experimental validation of the proposed algorithm, demonstrating its efficiency in finding high quality cuts.
منابع مشابه
A Total Variation-based Graph Clustering Algorithm for Cheeger Ratio Cuts
In this work, inspired by [3] and [13], we give a continuous relaxation of the Cheeger cut problem on a weighted graph. We show that the relaxation is actually equivalent to the original problem, and based on [8, 16], we give an algorithm which experimentally is very efficient on some clustering benchmarks. We also give a heuristic variant of the algorithm which is faster but often gives just a...
متن کاملConsistency of Cheeger and Ratio Graph Cuts
This paper establishes the consistency of a family of graph-cut-based algorithms for clustering of data clouds. We consider point clouds obtained as samples of a ground-truth measure. We investigate approaches to clustering based on minimizing objective functionals defined on proximity graphs of the given sample. Our focus is on functionals based on graph cuts like the Cheeger and ratio cuts. W...
متن کاملTotal Variation and Cheeger sets in Gauss space
The aim of this paper is to study the isoperimetric problem with fixed volume inside convex sets and other related geometric variational problems in the Gauss space, in both the finite and infinite dimensional case. We first study the finite dimensional case, proving the existence of a maximal Cheeger set which is convex inside any bounded convex set. We also prove the uniqueness and convexity ...
متن کاملA Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
We give an improved local partitioning algorithm using heat kernel pagerank, a modified version of PageRank. For a subset S with Cheeger ratio (or conductance) h, we show that there are at least a quarter of the vertices in S that can serve as seeds for heat kernel pagerank which lead to local cuts with Cheeger ratio at most O( √ h), improving the previously bound by a factor of p log |S|.
متن کاملSubmodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering
We introduce submodular hypergraphs, a family of hypergraphs that have different submodular weights associated with different cuts of hyperedges. Submodular hypergraphs arise in clustering applications in which higher-order structures carry relevant information. For such hypergraphs, we define the notion of p-Laplacians and derive corresponding nodal domain theorems and k-way Cheeger inequaliti...
متن کامل