Abstract
In this paper, a new graph-based segmentation method is proposed. Various Regions of Interest (ROIs) can be extracted from digital images/volumes without requiring any processing parameters. Only one point belonging to the region of interest must be given.
The method, starting from a single source element, proceeds with a specific propagation mechanism based on the graph theory, to find a Minimum Path Spanning Tree (MPST).
As compared with other existing segmentation methods, a new cost function is here proposed. It allows the process to be adaptive to both a local and global context, to be optimal and independent from the order of analysis, requiring a single iteration step. The final decision step is based on a threshold value that is automatically selected. Performance evaluation is presented by applying the method in the biomedical field, considering the extraction of wrist bones from real Magnetic Resonance Imaging (MRI) volumes.
Chapter PDF
Similar content being viewed by others
References
Boykov, Y., Funka-Lea, G.: Graph cuts and efficient ND image segmentation. International journal of computer vision 70(2), 109–131 (2006)
Falcão, A.X., Stolfi, J., de Alencar Lotufo, R.: The image foresting transform: Theory, algorithms, and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(1), 19–29 (2004)
Udupa, J.K., Saha, P.K., Lotufo, R.D.A.: Disclaimer: “Relative fuzzy connectedness and object definition: theory, algorithms, and applications in image segmentation”. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(11), I-1500 (2002)
Grady, L.: Random walks for image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 28(11), 1768–1783 (2006)
Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: Thinnings, shortest path forests, and topological watersheds. IEEE Transactions on Pattern Analysis and Machine Intelligence 32(5), 925–939 (2010)
Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: Minimum spanning forests and the drop of water principle. IEEE Transactions on Pattern Analysis and Machine Intelligence 31(8), 1362–1374 (2009)
Włodarczyk, J., Czaplicka, K., Tabor, Z., Wojciechowski, W., Urbanik, A.: Segmentation of bones in magnetic resonance images of the wrist. International Journal of Computer Assisted Radiology and Surgery, 1–13 (2014)
Campos, R., Ricardo, M.: A fast algorithm for computing minimum routing cost spanning trees. Computer Networks 52(17), 3229–3247 (2008)
Barbieri, F., Parascandolo, P., Vosilla, L., Cesario, L., Viano, G., Cimmino, M. A.: Assessing MRI erosions in the rheumatoid wrist: a comparison between RAMRIS and a semiautomated segmentation software. In: Ann. Rheum. Dis, 71 (2012)
Peinhardt, M., Kaibel, V.: On the bottleneck shortest path problem. In: Technical Report ZIB-Report 06–22, Konrad-Zuse-Zentrum für Informationstechnik Berlin (2006)
Turner, L.: Variants of shortest path problems. Algorithmic Operations Research 6(2), 91–104 (2012)
Chang, H.H., Zhuang, A.H., Valentino, D.J., Chu, W.C.: Performance measure characterization for evaluating neuroimage segmentation algorithms. Neuroimage 47(1), 122–135 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Gemme, L., Dellepiane, S. (2015). A New Graph-Based Method for Automatic Segmentation. In: Murino, V., Puppo, E. (eds) Image Analysis and Processing — ICIAP 2015. ICIAP 2015. Lecture Notes in Computer Science(), vol 9279. Springer, Cham. https://doi.org/10.1007/978-3-319-23231-7_54
Download citation
DOI: https://doi.org/10.1007/978-3-319-23231-7_54
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23230-0
Online ISBN: 978-3-319-23231-7
eBook Packages: Computer ScienceComputer Science (R0)