A Graph-Based Hierarchical Image Segmentation Method Based on a Statistical Merging Predicate
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.
Keywordshierarchical segmentation vertex-edge-weighted graph statistical region merging predicate
- 1.Alpert, S., Galun, M., Basri, R., Brandt, A.: Image segmentation by probabilistic bottom-up aggregation and cue integration. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (June 2007)Google Scholar
- 5.Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient graph-based image segmentation. IJCV 59, 167–181 (2004), http://portal.acm.org/citation.cfm?id=981793.981796 CrossRefGoogle Scholar
- 7.Guimarães, S.J.F., Cousty, J., Kenmochi, Y., Najman, L.: An efficient hierarchical graph based image segmentation. CoRR abs/1206.2807 (2012)Google Scholar
- 8.Guimarães, S.J.F., Cousty, J., Kenmochi, Y., Najman, L.: A hierarchical image segmentation algorithm based on an observation scale. In: Gimel’farb, G., Hancock, E., Imiya, A., Kuijper, A., Kudo, M., Omachi, S., Windeatt, T., Yamada, K. (eds.) SSPR & SPR 2012. LNCS, vol. 7626, pp. 116–125. Springer, Heidelberg (2012)Google Scholar