Segmentation of Carotid Arteries By Graph-Cuts Using Centerline Models
logo

Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3095
In this paper, we present a semi-automtic method for segmenting carotid arteries in contrast enhanced (CE)-CT angiography (CTA) scans.
The segmentation algorithm extracts the lumen of carotid arteries between user specfied locations. Specifically, the algorithm first
detects the centerline representations between the user placed seed points. This centerline extraction algorithm is based on a minimal path
detection algorithm which operates on a {em medialness} map. The lumen of corotid arteries is extracted by using
the global optimal graph-cuts algorithm~cite{boykov:01} using the centerlines as input. The radius information contained
in the centerline representation
is used to normalize the gradient based weights of the graph. It is shown that this algorithm can sucessfully segment the carotid arteries without
including calcified and non-calcified plaques in the segmentation results.

Reviews
There is no review at this time. Be the first to review this publication!

Quick Comments


Resources
backyellow
Download All
Download Paper , View Paper

Statistics more
backyellow
Global rating: starstarstarstarstar
Review rating: starstarstarstarstar [review]
Paper Quality: plus minus

Information more
backyellow
Categories: Filtering, Segmentation
Keywords: graph-cuts, centerline extraction, medialness filters
Export citation:

Share
backyellow
Share

Linked Publications more
backyellow
Diffeomorphic Demons Using ITK's Finite Difference Solver Hierarchy Diffeomorphic Demons Using ITK's Finite Difference Solver Hierarchy
by Vercauteren T., Pennec X., Perchant A., Ayache N.
Reader/Writer for Analyze Object Maps for ITK Reader/Writer for Analyze Object Maps for ITK
by Hawley J., Johnson H.

View license
Loading license...

Send a message to the author
main_flat
Powered by Midas