A graph-based hierarchical image segmentation method based on a statistical merging predicate

4Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Hierarchical image segmentation provides a set of image segmentations at different detail levels in which coaser details levels can be produced by simple merges of regions from segmentations at finer detail levels. Most image segmentation algorithms, such as region merging algorithms, rely on a criterion for merging that does not lead to a hierarchy. In addition, for image segmentation, the tuning of the parameters can be difficult. In this work, we propose a hierarchical graph-based image segmentation relying on a statistical region merging. Furthermore, we study how the inclusion of hierarchical property have influenced the computation of quality measures in the original method. Quantitative and qualitative assessments of the method on two image databases show efficiency and ease of use of our method. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Guimarães, S. J. F., & Patrocínio, Z. K. G. (2013). A graph-based hierarchical image segmentation method based on a statistical merging predicate. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8156 LNCS, pp. 11–20). https://doi.org/10.1007/978-3-642-41181-6_2

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