A graph-based approach for image segmentation

3Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a novel graph-based approach to image segmentation. The objective is to partition images such that nearby pixels with similar colors or greyscale intensities belong to the same segment. A graph representing an image is derived from the similarity between the pixels and partitioned by a computationally efficient graph clustering method, which identifies representative nodes for each cluster and then expands them to obtain complete clusters of the graph. Experiments with synthetic and natural images are presented. A comparison with the well known graph clustering method of normalized cuts shows that our approach is faster and produces segmentations that are in better agreement with visual assessment on original images. © Springer-Verlag Berlin Heidelberg 2008.

Cite

CITATION STYLE

APA

Le, T. V., Kulikowski, C. A., & Muchnik, I. B. (2008). A graph-based approach for image segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5358 LNCS, pp. 278–287). https://doi.org/10.1007/978-3-540-89639-5_27

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