Performance of list mode Hotelling observer and comparison to a neural network observer
Affiliation
Department of Applied Mathematics, University of ArizonaOptical Sciences Center, University of Arizona
Issue Date
2022
Metadata
Show full item recordPublisher
SPIECitation
Li, D., & Clarkson, E. (2022). Performance of list mode Hotelling observer and comparison to a neural network observer. Progress in Biomedical Optics and Imaging - Proceedings of SPIE, 12035.Rights
Copyright © 2022 SPIE.Collection Information
This item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu.Abstract
The Hotelling observer (HO) is a commonly used linear observer for detection or classification tasks. The conventional implementation operating on binned data normally involves inversion of covariance matrices and estimation of the difference in means of two vectors. However, the conventional calculation can t be directly applied to list mode data. The situation is salvageable by using the attribute list to construct a Poisson point process in attribute space,1 which makes the computation of HO quite different. In this work, we present an example of computing the HO test statistic on list mode data. The observer performance is measured on a signalknown-exactly and background-known-statistically task. The receiver operating characteristic (ROC) curve of the HO on list mode data is compared to the corresponding approximation by use of supervised learning methods proposed in the paper2 on binned data, where a single-layer neural network (SLNN) is used to approximate the HO test statistic. The comparison shows that the HO on list mode data outperforms the binned data. The result demonstrates the fact again that list mode data contains more information comparing to its binned version. 2022 SPIE. © 2022 SPIE. All rights reserved.Note
Immediate accessISSN
1605-7422ISBN
9781510649453Version
Final published versionae974a485f413a2113503eed53cd6c53
10.1117/12.2613068