Revisiting the Isoperimetric Graph Partitioning Problem

Abstract : Isoperimetric graph partitioning which is also known the Cheeger cut is NP-Hard in its original form. In literature, multiple modifications to this problem have been proposed to obtain approximation algorithms for clustering applications. In the context of image segmentation, a heuristic continuous relaxation to this problem has yielded good quality results. This algorithm is based on solving a linear system of equations involving the Laplacian of the image graph. Further, the same algorithm applied to a maximum spanning tree (MST) of the image graph was shown to produce similar results at a much lesser computational cost. However, the data reduction step (i.e. considering a MST, a much sparser graph compared to the original graph) leading to a faster yet useful algorithm has not been analysed. In this article, we revisit the isoperimetric graph partitioning problem and rectify a few discrepancies in the simplifications of the heuristic continuous relaxation, leading to a better interpretation of what is really done by this algorithm. We then use the Power Watershed (PW) framework to show that is enough to solve the relaxed isoperimetric graph partitioning problem on the graph induced by Union of Maximum Spanning Trees (UMST) with a seed constraint. The UMST has a lesser number of edges compared to the original graph, thus improving the speed of sparse matrix multiplication. Further, given the interest of PW framework in solving the relaxed seeded isoperimetric partitioning problem, we discuss the links between the PW limit of the discrete isoperimetric graph partitioning and watershed cuts. We then illustrate with experiments, a detailed comparison of solutions to the relaxed seeded isoperimetric partitioning problem on the original graph with the ones on the UMST and a MST. Our study opens many research directions which are discussed in the conclusions section.
Liste complète des métadonnées

Littérature citée [6 références]  Voir  Masquer  Télécharger
Contributeur : Sravan Danda <>
Soumis le : jeudi 7 juin 2018 - 16:04:17
Dernière modification le : samedi 28 juillet 2018 - 15:48:01
Document(s) archivé(s) le : samedi 8 septembre 2018 - 14:48:47


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01810249, version 1



Sravan Danda, Aditya Challa, B Daya Sagar, Laurent Najman. Revisiting the Isoperimetric Graph Partitioning Problem. 2018. 〈hal-01810249〉



Consultations de la notice


Téléchargements de fichiers