Skip to content
Research Article Open access CC BY 4.0

Graph Partitioning Based Normalized Cut Methods

S. D. Kapade, S. M. Khairnar, B. S. Chaudhari

Journal of Advances in Mathematics and Computer Science · pp. 333–340 · Published 4 Nov 2014

10.9734/BJMCS/2015/13592

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.

Normalized cut two-way cut k-way cut watershed based regions

Cited by 2

Topological segmentation for indoor environments from grid maps using an improved NJW algorithm

Yong-Zheng Zhou, Shu-Mei Yu, Rong-Chuan Sun · International Conference on Informatics and Analytics · 2017

Article metrics

Real usage data collected on this platform.

2

Page views

0

PDF downloads

0

Outbound clicks

2

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.