Hierarchical image segmentation provides a region-oriented scale-space, i.e., a set of image segmentations at different detail levels in which the segmentations at finer levels are nested with respect to those at coarser 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 criterion popularized by Felzenszwalb and Huttenlocher. Quantitative and qualitative assessments of the method on Berkeley image database shows efficiency, ease of use and robustness of our method. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Guimarães, S. J. F., Cousty, J., Kenmochi, Y., & Najman, L. (2012). A hierarchical image segmentation algorithm based on an observation scale. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7626 LNCS, pp. 116–125). https://doi.org/10.1007/978-3-642-34166-3_13
Mendeley helps you to discover research relevant for your work.