Segmentation of Carotid Arteries By Graph-Cuts Using Centerline Models
Gulsun M.A., Tek H.
Siemens Corporate Research
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!

Statistics
backyellow
Global rating: starstarstarstarstar
Review rating: starstarstarstarstar [review]
Views: 914
Downloads: 275

Send a message to the author

Information
backyellow
Paper Id: 699
Categories: Filtering, Segmentation
Keywords: graph-cuts, centerline extraction, medialness filters,
Revision: 1 (07-20-2009)
Status: Open for public review
View license
Loading license...

Data
backyellow
Full download: .zip
Paper: view, .pdf

Share
backyellow
Facebook Digg delicious StumbleUpon dzone Furl Technorati Reddit

Associated Publications
backyellow
Flux driven medial curve extraction
3D Interactive Centerline Extraction
Two Point Minimum Cost Path Approach for CTA Coronary Centerline Extraction

main_flat
main_bottom
Powered by Midas