In graph-based methods, image segmentation can be seen as a graph partition problem between sets of seed pixels. The core of a seed is the region where it can be moved without altering its segmentation. The larger the core, the greater the robustness of the method in relation to its seed positioning. In this work, we present an algorithm to compute the cores of Oriented Image Foresting Transform (OIFT), an extension of Fuzzy Connectedness and Watersheds to directed weighted graphs, and compare its performance to other methods according to a proposed evaluation measure, the Robustness Coefficient. Our analysis indicates that OIFT has a good balance between accuracy and robustness, being able to overcome several methods in some datasets.
CITATION STYLE
Tavares, A. C. M., Bejar, H. H. C., & Miranda, P. A. V. (2017). Seed robustness of oriented image foresting transform: Core computation and the robustness coefficient. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10225 LNCS, pp. 119–130). Springer Verlag. https://doi.org/10.1007/978-3-319-57240-6_10
Mendeley helps you to discover research relevant for your work.