Segmentation using iso-perimetric algorithm

Authors:
Arti Khaparde;J. Saritha;R. R. Vishnuvardhan
Affiliations:
Department of Electronics and Communication Engineering, Aurora's Technological and Research Institute, Hyderabad, India;Department of Electronics and Communication Engineering, CVR College of Engineering, Hyderabad, India;Department of Electronics and Communication Engineering, Vignan Institute of Technology and Science, Hyderabad, India
Venue:
TELE-INFO'11/MINO'11/SIP'11 Proceedings of the 10th WSEAS international conference on Telecommunications and informatics and microelectronics, nanoelectronics, optoelectronics, and WSEAS international conference on Signal processing
Year:
2011

Citing 5
Cited 0

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Fast Approximate Energy Minimization via Graph Cuts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Computing Geodesics and Minimal Surfaces via Graph Cuts

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
What Energy Functions Can Be Minimizedvia Graph Cuts?

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

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 discuss major theoretical results, which helped to reveal both strengths and limitations of this surprisingly versatile combinatorial algorithm.