Revisiting the Isoperimetric Graph Partitioning Problem

Revisiting the Isoperimetric Graph Partitioning Problem

Isoperimetric graph partitioning, which is also known as the Cheeger cut, is NP-hard in its original form. In the literature, multiple modifications to this problem have been proposed to obtain approximation algorithms for clustering applications. In the context of image segmentation, a heuristic co...

Full description

Bibliographic Details
Main Authors: Sravan Danda, Aditya Challa, B. S. Daya Sagar, Laurent Najman
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Image segmentation
isoperimetric partitioning
Cheeger cut
spectral clustering
power watersheds
Online Access:https://ieeexplore.ieee.org/document/8694009/

Internet

https://ieeexplore.ieee.org/document/8694009/

Similar Items