Publication:
An improved TvMin plus DART algorithm to reconstruct multilabel images

dc.contributor.authorDemircan Türeyen, Ezgi
dc.contributor.authorKamaşak, Mustafa Erşel
dc.contributor.authorID237397tr_TR
dc.contributor.authorID27148tr_TR
dc.date.accessioned2018-07-17T08:06:29Z
dc.date.available2018-07-17T08:06:29Z
dc.date.issued2015
dc.description.abstractFrom the algebraic point of view, image reconstruction is an under-determined problem, due to the fact that the projection measurements are a lot fewer than the unknown pixels. Discrete algebraic reconstruction technique (DART) is an algorithm used to cope with this situation. DART solves a discrete linear inverse problem by combining an algebraic reconstruction procedure with a threshold segmentation. In order to improve accuracy, the TvMin+DART algorithm modified the subroutines of DART by exploiting total variation minimization technique (TvMin). However, this algorithm was developed for only binary images. In this paper, our TvMin+DART algorithm will be generalized to handle multilabel images as well, and an experimental research to compare the proposed method with the original DART and the conventional filtered backprojection (FBP) will be presented.tr_TR
dc.identifier.isbn978-1-4673-7765-2
dc.identifier.urihttps://hdl.handle.net/11413/2140
dc.identifier.urihttps://doi.org/10.1109/TIPTEKNO.2015.7374561
dc.identifier.wos380505200043
dc.language.isoen
dc.publisherIEEE, 345 E 47th St, New York, Ny 10017 USA
dc.relation2015 Medical Technologies National Conference (Tiptekno)tr_TR
dc.subjectdiscrete tomographytr_TR
dc.subjectalgebraic reconstruction techniquestr_TR
dc.subjectthreshold segmentationtr_TR
dc.subjectcompressed sensingtr_TR
dc.subjecttotal variation minimizationtr_TR
dc.titleAn improved TvMin plus DART algorithm to reconstruct multilabel imagestr_TR
dc.typeArticle
dspace.entity.typePublication
local.indexed.atWOS

Files

License bundle

Now showing 1 - 1 of 1
Placeholder
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: