共 50 条
An Automated Clustering Algorithm for Reference Region Extraction of Brain 11C-PK11195 Studies
被引:0
|作者:
Presotto, Luca
[1
,2
]
Iaccarino, Leonardo
[1
,2
]
Bettinardi, Valentino
[3
]
Gianolli, Luigi
[3
]
Perani, Daniela
[2
,3
,4
]
机构:
[1] Univ Vita Salute San Raffaele, Milan, MI, Italy
[2] IRCCS, San Raffaele Sci Inst, Div Neurosci, In Vivo Human Mol & Struct Neuroimaging Unit, Milan, MI, Italy
[3] IRCCS, San Raffaele Sci Inst, Nucl Med Unit, Milan, MI, Italy
[4] Vita Salute San Raffaele, Milan, MI, Italy
关键词:
D O I:
暂无
中图分类号:
R8 [特种医学];
R445 [影像诊断学];
学科分类号:
1002 ;
100207 ;
1009 ;
摘要:
Background: A convenient way to analyze quantitatively 11C-PK11195 cerebral PET scans is the simplified reference tissue model (SRTM), which fits Time Activity Curves (TACs) to those of a reference non-pathological region. In this work, we present a fully automatic method which makes use of the expected tracer concentration in 4 predefined tissue classes (gray matter, white matter, blood, high specific binding) to automatically produce the TAC of the reference region. Methods: The proposed algorithm starts by removing irrelevant structures (skin and skull) based on activity and shape information, then it classifies the remaining voxels in the 4 tissue classes based on the L-2 distance from pre-defined seeds. Within those classified as "gray matter", those having the greatest L-2 distance from the high specific binding, are selected to build the reference TAC. Seeds were built from scans of 9 healthy controls and from 2 patients with Alzheimer dementia, known to have activated microglia. Binding potential values (BP) were measured in two structures for 9 healthy controls using the SRTM with the output of clustering algorithm or a whole cerebellum reference as input and then compared. Results: The output maps of clusters did not show evident artifacts on visual inspection. The (BP) obtained by the proposed algorithm was close to the one obtained with the cerebellum reference in all cases. Bland-Altman analysis found a mean difference of -0.086 and 95% limits of agreement of -0.17, 0.05. Conclusions: The proposed clustering algorithm is a fully automated one, which showed a reliable performance in the healthy controls and was comparable to the reference method.
引用
收藏
页数:3
相关论文