Markov-chain Monte Carlo for the performance of a channelized-ideal observer in detection tasks with non-Gaussian lumpy backgrounds

Subok Park; Eric Clarkson

doi:10.1117/12.771704

24 March 2008 Markov-chain Monte Carlo for the performance of a channelized-ideal observer in detection tasks with non-Gaussian lumpy backgrounds

Subok Park, Eric Clarkson

Author Affiliations +

Proceedings Volume 6917, Medical Imaging 2008: Image Perception, Observer Performance, and Technology Assessment; 69170T (2008) https://doi.org/10.1117/12.771704
Event: Medical Imaging, 2008, San Diego, California, United States

Abstract

The Bayesian ideal observer is optimal among all observers and sets an upper bound for observer performance in binary detection tasks. This observer provides a quantitative measure of diagnostic performance of an imaging system, summarized by the area under the receiver operating characteristic curve (AUC), and thus should be used for image quality assessment whenever possible. However, computation of ideal-observer performance is difficult because this observer requires the full description of the statistical properties of the signal-absent and signal-present data, which are often unknown in tasks involving complex backgrounds. Furthermore, the dimension of the integrals that need to be calculated for the observer is huge. To estimate ideal-observer performance in detection tasks with non-Gaussian lumpy backgrounds, Kupinski et al. developed a Markovchain Monte Carlo (MCMC) method, but this method has a disadvantage of long computation times. In an attempt to reduce the computation load and still approximate ideal-observer performance, Park et al. investigated a channelized-ideal observer (CIO) in similar tasks and found that the CIO with singular vectors of the imaging system approximated the performance of the ideal observer. But, in that work, an extension of the Kupinski MCMC was used for calculating the performance of the CIO and it did not reduce the computational burden. In the current work, we propose a new MCMC method, which we call a CIO-MCMC, to speed up the computation of the CIO. We use singular vectors of the imaging system as efficient channels for the ideal observer. Our results show that the CIO-MCMC has the potential to speed up the computation of ideal observer performance with a large number of channels.

Citation Download Citation

Subok Park and Eric Clarkson "Markov-chain Monte Carlo for the performance of a channelized-ideal observer in detection tasks with non-Gaussian lumpy backgrounds", Proc. SPIE 6917, Medical Imaging 2008: Image Perception, Observer Performance, and Technology Assessment, 69170T (24 March 2008); https://doi.org/10.1117/12.771704

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available