Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-15705-9_60
DC FieldValue
dc.titleJoint registration and segmentation of dynamic cardiac perfusion images using MRFs
dc.contributor.authorMahapatra, D.
dc.contributor.authorSun, Y.
dc.date.accessioned2014-06-19T03:15:40Z
dc.date.available2014-06-19T03:15:40Z
dc.date.issued2010
dc.identifier.citationMahapatra, D.,Sun, Y. (2010). Joint registration and segmentation of dynamic cardiac perfusion images using MRFs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6361 LNCS (PART 1) : 493-501. ScholarBank@NUS Repository. <a href="https://doi.org/10.1007/978-3-642-15705-9_60" target="_blank">https://doi.org/10.1007/978-3-642-15705-9_60</a>
dc.identifier.isbn3642157041
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/70740
dc.description.abstractIn this paper we propose a Markov random field (MRF) based method for joint registration and segmentation of cardiac perfusion images, specifically the left ventricle (LV). MRFs are suitable for discrete labeling problems and the labels are defined as the joint occurrence of displacement vectors (for registration) and segmentation class. The data penalty is a combination of gradient information and mutual dependency of registration and segmentation information. The smoothness cost is a function of the interaction between the defined labels. Thus, the mutual dependency of registration and segmentation is captured in the objective function. Sub-pixel precision in registration and segmentation and a reduction in computation time are achieved by using a multiscale graph cut technique. The LV is first rigidly registered before applying our method. The method was tested on multiple real patient cardiac perfusion datasets having elastic deformations, intensity change, and poor contrast between LV and the myocardium. Compared to MRF based registration and graph cut segmentation, our method shows superior performance by including mutually beneficial registration and segmentation information. © 2010 Springer-Verlag.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/978-3-642-15705-9_60
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1007/978-3-642-15705-9_60
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume6361 LNCS
dc.description.issuePART 1
dc.description.page493-501
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.