A Graph-Based Approach for Image Segmentation

Authors:
Thang V. Le;Casimir A. Kulikowski;Ilya B. Muchnik
Affiliations:
Department of Computer Science, Rutgers University, Piscataway, USA NJ 08854;Department of Computer Science, Rutgers University, Piscataway, USA NJ 08854;DIMACS, Rutgers University, Piscataway, USA NJ 08854
Venue:
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Year:
2008

Citing 4
Cited 0

Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Greedy approximation algorithms for finding dense components in a graph

APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
On clusterings-good, bad and spectral

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
A tutorial on spectral clustering

Statistics and Computing

Quantified Score

Hi-index	0.00

Visualization

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.