Image segmentation using normalized cuts and efficient graph-based segmentation

6Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we propose an hybrid segmentation algorithm which incorporates the advantages of the efficient graph based segmentation and normalized cuts partitioning algorithm. The proposed method requires low computational complexity and is therefore suitable for real-time image segmentation processing. Moreover, it provides effective and robust segmentation. For that, our method consists first, at segmenting the input image by the "Efficient Graph-Based" segmentation. The segmented regions are then represented by a graph structure. As a final step, the normalized cuts partitioning algorithm is applied to the resulting graph in order to remove non-significant regions. In the proposed method, the main computational cost is the efficient graph based segmentation cost since the computational cost of partitioning regions using the Ncut method is negligibly small. The efficiency of the proposed method is demonstrated through a large number of experiments using different natural scene images. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Doggaz, N., & Ferjani, I. (2011). Image segmentation using normalized cuts and efficient graph-based segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6979 LNCS, pp. 229–240). https://doi.org/10.1007/978-3-642-24088-1_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free