The paper focusses on a group of segmentation problems dealing with 3D data sets showing thin objects that appear disconnected in the data due to partial volume effects or a large spacing between neighbouring slices. We propose a modification of the speed function for the well-known level set method to bridge these discontinuities. This allows for the segmentation of the object as a whole. In this paper we are concerned with treelike structures, particularly dendrites in microscopic data sets, whose shape is unknown prior to segmentation. Using the modified speed function, our algorithm segments dendrites and their spines, even if parts of the object appear to be disconnected due to artifacts. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Rink, K., & Tönnies, K. (2007). A level set bridging force for the segmentation of dendritic spines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4673 LNCS, pp. 571–578). Springer Verlag. https://doi.org/10.1007/978-3-540-74272-2_71
Mendeley helps you to discover research relevant for your work.