Markov random field models for segmentation of PET images

40Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper investigates the segmentation of different regions in PET images based on the feature vector extracted from the timeactivity curve for each voxel. PET image segmentation has applications in PET reference region analysis and activation studies. The segmentation algorithm presented uses a Markov random field model for the voxel class labels. By including the Markov random field model in the expectation-maximisation iteration, the algorithm can be used to simultaneously estimate parameters and segment the image. Hence, the algorithm is able to combine both feature and spatial information for the purpose of segmentation. Experimental results on synthetic and real PET data are presented to demonstrate the performance of the algorithm. The algorithms used in this paper can be used to segment other functional images.

Cite

CITATION STYLE

APA

Chen, J. L., Gunn, S. R., Nixon, M. S., & Gunn, R. N. (2001). Markov random field models for segmentation of PET images. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2082, pp. 468–474). Springer Verlag. https://doi.org/10.1007/3-540-45729-1_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free