{"id":2044,"date":"2010-12-13T21:15:00","date_gmt":"2010-12-13T21:15:00","guid":{"rendered":"http:\/\/hgpu.org\/?p=2044"},"modified":"2010-12-13T21:15:00","modified_gmt":"2010-12-13T21:15:00","slug":"seeded-nd-medical-image-segmentation-by-cellular-automaton-on-gpu","status":"publish","type":"post","link":"https:\/\/hgpu.org\/?p=2044","title":{"rendered":"Seeded ND medical image segmentation by cellular automaton on GPU"},"content":{"rendered":"<p>PURPOSE: We present a GPU-based framework to perform organ segmentation in N-dimensional (ND) medical image datasets by computation of weighted distances using the Ford-Bellman algorithm (FBA). Our GPU implementation of FBA gives an alternative and optimized solution to other graph-based segmentation techniques. METHODS: Given a number of K labelled-seeds, the segmentation algorithm evolves and segments the ND image in K objects. Each region is guaranteed to be connected to seeds with the same label. The method uses a Cellular Automata (CA) to compute multiple shortest-path-trees based on the FBA. The segmentation result is obtained by K-cuts of the graph in order to separate it in K sets. A quantitative evaluation of the method was performed by measuring renal volumes of 20 patients based on magnetic resonance angiography (MRA) acquisitions. Inter-observer reproducibility, accuracy and validity were calculated and associated computing times were recorded. In a second step, the computational performances were evaluated with different graphics hardware and compared to a CPU implementation of the method using Dijkstra&#8217;s algorithm. RESULTS: The ICC for inter-observer reproducibility of renal volume measurements was 0.998 (0.997-0.999) for two radiologists and the absolute mean difference between the two readers was lower than 1.2% of averaged renal volumes. The validity analysis shows an excellent agreement of our method with the results provided by a supervised segmentation method, used as reference. CONCLUSIONS: The formulation of the FBA in the form of a CA is simple, efficient and straightforward, and can be implemented in low cost vendor-independent graphics hardware. The method can efficiently be applied to perform organ segmentation and quantitative evaluation in clinical routine.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>PURPOSE: We present a GPU-based framework to perform organ segmentation in N-dimensional (ND) medical image datasets by computation of weighted distances using the Ford-Bellman algorithm (FBA). Our GPU implementation of FBA gives an alternative and optimized solution to other graph-based segmentation techniques. METHODS: Given a number of K labelled-seeds, the segmentation algorithm evolves and segments [&hellip;]<\/p>\n","protected":false},"author":351,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[33,38,3],"tags":[7,916,255,917,774,444,1786,1788,20,910,554,253,182],"class_list":["post-2044","post","type-post","status-publish","format-standard","hentry","category-image-processing","category-medicine","category-paper","tag-ati","tag-ati-radeon-hd-3970","tag-ati-radeon-hd-4870","tag-ati-radeon-x1950","tag-cellular-automata","tag-cg","tag-image-processing","tag-medicine","tag-nvidia","tag-nvidia-geforce-7950-gt","tag-nvidia-geforce-9800-gt","tag-nvidia-geforce-gtx-260","tag-opengl"],"views":2318,"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/2044","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/users\/351"}],"replies":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2044"}],"version-history":[{"count":0,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/2044\/revisions"}],"wp:attachment":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2044"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2044"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2044"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}