Combination of multiple segmentations by a random walker approach

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

Abstract

In this paper we propose an algorithm for combining multiple image segmentations to achieve a final improved segmentation. In contrast to previous works we consider the most general class of segmentation combination, i.e. each input segmentation can have an arbitrary number of regions. Our approach is based on a random walker segmentation algorithm which is able to provide high-quality segmentation starting from manually specified seeds. We automatically generate such seeds from an input segmentation ensemble. Two applications scenarios are considered in this work: Exploring the parameter space and segmenter combination. Extensive tests on 300 images with manual segmentation ground truth have been conducted and our results clearly show the effectiveness of our approach in both situations. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wattuya, P., Jiang, X., & Rothaus, K. (2008). Combination of multiple segmentations by a random walker approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5096 LNCS, pp. 214–223). https://doi.org/10.1007/978-3-540-69321-5_22

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