Graph Partitioning for Image Segmentation using Iso-Perimetric Algorithm

Abstract

Graph cuts proved to be a useful multidimensional optimization tool which can enforce piecewise smoothness while preserving relevant sharp discontinuities. This paper is mainly intended as an application of isoperimetric algorithm of graph theory for image segmentation and analysis of different parameters used in the algorithm like generating weights, regulates the execution, Connectivity Parameter,cutoff, number of recursions,. We present some basic background information on graph cuts and discussmaj or theoretical results,which helped to reveal both strengths and limitations of this surprisingly versatile combinatorial algorithm.