A Minimal Cost Path and Level Set Evolution Approach for Carotid Bifurcation Segmentation
Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3103
New: Prefer using the following doi: https://doi.org/10.54294/vpdh2e
Published in The MIDAS Journal - MICCAI 2009 Workshop: Carotid Lumen Segmentation and Stenosis Grading (Grand Challenge).
We propose a new approach for semi-automatic segmentation of the carotid bifurcation as part of the Carotid Lumen Segmentation and Stenosis Grading Challenge MICCAI'2009 workshop. Three initial points are provided as input, belonging to the Common, the External and the Internal Carotid Arteries. Our algorithm is divided into two main steps: first, two minimal cost paths are tracked between the CCA and both the ECA and the ICA. The cost functions are based on a multiscale vesselness response. Second, after detecting the junction position and cutting or extending the paths based on the requested lengths, a level set segmentation is initialized as a thin tube around the computed paths and evolves until reaching the vessel wall or a maximal evolution time. Results on training and testing datasets are presented and compared to the manual segmentation by three observers, based on a ground truth and using four quality measures.