Graph Partitioning Based Normalized Cut Methods
S. D. Kapade *
Suresh Gyan Vihar University, Jaipur – 302025, India.
S. M. Khairnar
Maharashtra Academy of Engineering, Alandi, Pune – 412105, India.
B. S. Chaudhari
International Institute of Information Technology, Pune – 411057, India.
*Author to whom correspondence should be addressed.
Abstract
The process of image segmentation is one of the most important steps in computer vision for image retrieval, visual summary, image based modeling and in many other processes. The goal of segmentation is typically to locate certain objects of interest. In this paper, we have studied and investigated graph based normalized cut segmentation methods and proposed a technique for adding flexibility to the parameters for performance improvement. These methods are examined analytically and tested their performance for the standard images. The results obtained for the important metrics show that these methods perform better than others approaches and are computationally efficient, and useful for precise image segmentation.
Keywords: Normalized cut, two-way cut, k-way cut, watershed based regions