3-BOYUTLU bt anjiyografi verilerinde frangi damarlik yöntemi üzerine bölge büyütme yaklasimi

Translated title of the contribution: Region growing on frangi vesselness values in 3-D CTA data

Ilkay Öksüz, Devrim Ünay, Kamuran Kadipasaoglu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

Abstract

In cardiac related diagnostic methods, the shape and curvature of coronary arteries is essential. Consequently, one of the most important requirements for Computer Aided Diagnosis (CAD) Systems is automated segmentation of vasculature. In this paper, we propose a new hybrid algorithm, which segment the coronary arterial tree in CTA images by merging methodologies-, namely, Region Growing and Frangi Approach. The algorithm first runs a region growing on Frangi vesselness values and subsequently optimizes the results with several threshold values. Comparison of the present results with optimal results of existing segmentation algorithms reveals that the proposed approach outperforms its predecessors. The diagnostic accuracy of the algorithm will next be validated on the segmentation of coronary arteries from real CT data.

Translated title of the contributionRegion growing on frangi vesselness values in 3-D CTA data
Original languageTurkish
Title of host publication2013 21st Signal Processing and Communications Applications Conference, SIU 2013
DOIs
Publication statusPublished - 2013
Externally publishedYes
Event2013 21st Signal Processing and Communications Applications Conference, SIU 2013 - Haspolat, Turkey
Duration: 24 Apr 201326 Apr 2013

Publication series

Name2013 21st Signal Processing and Communications Applications Conference, SIU 2013

Conference

Conference2013 21st Signal Processing and Communications Applications Conference, SIU 2013
Country/TerritoryTurkey
CityHaspolat
Period24/04/1326/04/13

Fingerprint

Dive into the research topics of 'Region growing on frangi vesselness values in 3-D CTA data'. Together they form a unique fingerprint.

Cite this