Though graph cut based segmentation is a widely-used technique, it is known that segmentation of a thin, elongated structure is challenging due to the "shrinking problem". On the other hand, many segmentation targets in medical image analysis have such thin structures. Therefore, the conventional graph cut method is not suitable to be applied to them. In this study, we developed a graph cut segmentation method with novel Riemannian metrics. The Riemannian metrics are determined from the given "initial contour," so that any level-set surface of the distance transformation of the contour has the same surface area in the Riemannian space. This will ensure that any shape similar to the initial contour will not be affected by the shrinking problem. The method was evaluated with clinical CT datasets and showed a fair result in segmenting vertebral bones. © 2011 Springer-Verlag.
CITATION STYLE
Hanaoka, S., Fritscher, K., Welk, M., Nemoto, M., Masutani, Y., Hayashi, N., … Schubert, R. (2011). 3-D graph cut segmentation with Riemannian metrics to avoid the shrinking problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6893 LNCS, pp. 554–561). https://doi.org/10.1007/978-3-642-23626-6_68
Mendeley helps you to discover research relevant for your work.