Approximating the Ideal Observer for joint signal detection and localization tasks by use of supervised learning methods

• URL: http://arxiv.org/abs/2006.00112v2
• Date: Wed, 15 Jul 2020 02:01:08 GMT
• Title: Approximating the Ideal Observer for joint signal detection and localization tasks by use of supervised learning methods
• Authors: Weimin Zhou, Hua Li, Mark A. Anastasio
• Abstract summary: Medical imaging systems are commonly assessed and optimized by use of objective measures of image quality (IQ) The Ideal Observer (IO) performance has been advocated to provide a figure-of-merit for use in assessing and optimizing imaging systems. In this paper, the ability of supervised learning-based methods to approximate the IO for joint signal detection and localization tasks is explored.
• Score: 15.226790614827193
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Medical imaging systems are commonly assessed and optimized by use of objective measures of image quality (IQ). The Ideal Observer (IO) performance has been advocated to provide a figure-of-merit for use in assessing and optimizing imaging systems because the IO sets an upper performance limit among all observers. When joint signal detection and localization tasks are considered, the IO that employs a modified generalized likelihood ratio test maximizes observer performance as characterized by the localization receiver operating characteristic (LROC) curve. Computations of likelihood ratios are analytically intractable in the majority of cases. Therefore, sampling-based methods that employ Markov-Chain Monte Carlo (MCMC) techniques have been developed to approximate the likelihood ratios. However, the applications of MCMC methods have been limited to relatively simple object models. Supervised learning-based methods that employ convolutional neural networks have been recently developed to approximate the IO for binary signal detection tasks. In this paper, the ability of supervised learning-based methods to approximate the IO for joint signal detection and localization tasks is explored. Both background-known-exactly and background-known-statistically signal detection and localization tasks are considered. The considered object models include a lumpy object model and a clustered lumpy model, and the considered measurement noise models include Laplacian noise, Gaussian noise, and mixed Poisson-Gaussian noise. The LROC curves produced by the supervised learning-based method are compared to those produced by the MCMC approach or analytical computation when feasible. The potential utility of the proposed method for computing objective measures of IQ for optimizing imaging system performance is explored.

Related papers

• Optimization of Iterative Blind Detection based on Expectation Maximization and Belief Propagation [29.114100423416204]
  We propose a blind symbol detection for block-fading linear inter-symbol channels. We design a joint channel estimation and detection scheme that combines the study expectation algorithm and the ubiquitous belief propagation algorithm. We show that the proposed method can learn efficient schedules that generalize well and even outperform coherent BP detection in high signal-to-noise scenarios.
  arXiv  Detail & Related papers  (2024-08-05T08:45:50Z)
• A novel integrated method of detection-grasping for specific object based on the box coordinate matching [24.954921282245387]
  A novel integrated method of detection-grasping for specific object based on the box coordinate matching is proposed in this paper. Experiments on object detection and grasp estimation are conducted separately to verify the superiority of improved models.
  arXiv  Detail & Related papers  (2023-07-20T12:23:12Z)
• Learning Unnormalized Statistical Models via Compositional Optimization [73.30514599338407]
  Noise-contrastive estimation(NCE) has been proposed by formulating the objective as the logistic loss of the real data and the artificial noise. In this paper, we study it a direct approach for optimizing the negative log-likelihood of unnormalized models.
  arXiv  Detail & Related papers  (2023-06-13T01:18:16Z)
• Ideal Observer Computation by Use of Markov-Chain Monte Carlo with Generative Adversarial Networks [12.521662223741671]
  The Ideal Observer (IO) has been advocated for use as a figure-of-merit (FOM) for evaluating and optimizing medical imaging systems. A sampling-based method that employs Markov-Chain Monte Carlo (MCMC) techniques was previously proposed to estimate the IO performance. In this study, a novel MCMC method that employs a generative adversarial network (GAN)-based SOM, referred to as MCMC-GAN, is described and evaluated.
  arXiv  Detail & Related papers  (2023-04-02T02:51:50Z)
• GEC: A Unified Framework for Interactive Decision Making in MDP, POMDP, and Beyond [101.5329678997916]
  We study sample efficient reinforcement learning (RL) under the general framework of interactive decision making. We propose a novel complexity measure, generalized eluder coefficient (GEC), which characterizes the fundamental tradeoff between exploration and exploitation. We show that RL problems with low GEC form a remarkably rich class, which subsumes low Bellman eluder dimension problems, bilinear class, low witness rank problems, PO-bilinear class, and generalized regular PSR.
  arXiv  Detail & Related papers  (2022-11-03T16:42:40Z)
• Adaptive Local-Component-aware Graph Convolutional Network for One-shot Skeleton-based Action Recognition [54.23513799338309]
  We present an Adaptive Local-Component-aware Graph Convolutional Network for skeleton-based action recognition. Our method provides a stronger representation than the global embedding and helps our model reach state-of-the-art.
  arXiv  Detail & Related papers  (2022-09-21T02:33:07Z)
• Continual Learning with Fully Probabilistic Models [70.3497683558609]
  We present an approach for continual learning based on fully probabilistic (or generative) models of machine learning. We propose a pseudo-rehearsal approach using a Gaussian Mixture Model (GMM) instance for both generator and classifier functionalities. We show that GMR achieves state-of-the-art performance on common class-incremental learning problems at very competitive time and memory complexity.
  arXiv  Detail & Related papers  (2021-04-19T12:26:26Z)
• DEALIO: Data-Efficient Adversarial Learning for Imitation from Observation [57.358212277226315]
  In imitation learning from observation IfO, a learning agent seeks to imitate a demonstrating agent using only observations of the demonstrated behavior without access to the control signals generated by the demonstrator. Recent methods based on adversarial imitation learning have led to state-of-the-art performance on IfO problems, but they typically suffer from high sample complexity due to a reliance on data-inefficient, model-free reinforcement learning algorithms. This issue makes them impractical to deploy in real-world settings, where gathering samples can incur high costs in terms of time, energy, and risk. We propose a more data-efficient IfO algorithm
  arXiv  Detail & Related papers  (2021-03-31T23:46:32Z)
• A Transfer Learning Framework for Anomaly Detection Using Model of Normality [2.9685635948299995]
  Convolutional Neural Network (CNN) techniques have proven to be very useful in image-based anomaly detection applications. We introduce a transfer learning framework for anomaly detection based on similarity measure with a Model of Normality (MoN) We show that with the proposed threshold settings, a significant performance improvement can be achieved.
  arXiv  Detail & Related papers  (2020-11-12T05:26:32Z)
• Statistical control for spatio-temporal MEG/EEG source imaging with desparsified multi-task Lasso [102.84915019938413]
  Non-invasive techniques like magnetoencephalography (MEG) or electroencephalography (EEG) offer promise of non-invasive techniques. The problem of source localization, or source imaging, poses however a high-dimensional statistical inference challenge. We propose an ensemble of desparsified multi-task Lasso (ecd-MTLasso) to deal with this problem.
  arXiv  Detail & Related papers  (2020-09-29T21:17:16Z)
• Markov-Chain Monte Carlo Approximation of the Ideal Observer using Generative Adversarial Networks [14.792685152780795]
  The Ideal Observer (IO) performance has been advocated when optimizing medical imaging systems for signal detection tasks. To approximate the IO test statistic, sampling-based methods that employ Markov-Chain Monte Carlo (MCMC) techniques have been developed. Deep learning methods that employ generative adversarial networks (GANs) hold great promise to learn object models from image data.
  arXiv  Detail & Related papers  (2020-01-26T21:51:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.