The ordered subsets mirror descent optimization method with applications to tomography
There is a tendency in medical diagnostics to include the metabolic changes in the cells of organs and tissues into the anatomical imaging modality [\textit{C. Boesch}, Molecular aspects of magnetic resonance imaging and spectroscopy. Molecular Aspects of Medicine 20, 185-318 (1999); \textit{W.J. Schempp}, Magnetic resonance imaging: Mathematical foundations and applications. (1998; Zbl 0930.92015)]. The paper under review deals with the modality of positron emission tomography (PET) as a clinical diagnostic imaging technique for measuring the metabolic activity of cells in the human body. In contrast to clinical magnetic resonance spectroscopy (MRS), PET imaging depends upon the radioactive tracing of positron emitters and therefore allows to formulate the image reconstruction problem as a parameter estimation problem rather than an inverse problem. The prototype of an approach to an inverse, and as such ill--posed imaging problem, is the filtered back-projection method of \(X\)-ray computerized tomography (CT) whereas MRS reconstruction is based on fast Fourier inversion.NEWLINENEWLINENEWLINEThe goal of the maximum likelihood estimation, as applied to emission tomography, is to find the expected number of annihilations by maximizing the probability of the set of coincidence events registered by the two--fold covering of the circular detector array.NEWLINENEWLINENEWLINEThe mathematical model of the detection process is based on the quantum optical assumption that photon counts represent a Poisson process [\textit{J. Bertoin}, Lévy processes. (1996; Zbl 0938.60005); \textit{K.-i. Sato}, Lévy processes and infinitely divisible distributions. (1999; Zbl 0973.60001)]. The optimal solution to the PET incomplete data problem is the maximum likelihood estimate of the discretized density of the tracer. This approach improves the original filtered back--projection PET image reconstruction method. The most promising method to overcome the tremendous size of the PET image reconstruction data is a gradient descent type method.NEWLINENEWLINENEWLINEThe authors implemented a specific PET algorithm, an accelerated version of the mirror descent method called ordered (OS) subsets technique [\textit{H.M. Hudson} and \textit{R.S. Larkin}, IEEE Trans. Med. Imag. 13, 601-609 (1994); \textit{C. Kamphuis} and \textit{F.J. Beekman}, ibid. 17, 1101-1105 (1998); \textit{S.H. Manglos} et al., Phys. Med. Biol. 40, 1225-1241 (1995)]. They demonstrate that the OS mirror descent approach is suited for solving the PET reconstruction problem of minimizing a convex function of several million variables on the standard simplex. A series of pictures of phantoms and Alzheimer patients illustrate the statistical iterative reconstruction approach which compares favorably with the currently commercially used methods.
- A Benchmark Evaluation of Large-Scale Optimization Approaches to Binary Tomography
- scientific article; zbMATH DE number 839250
- A spectral projected gradient optimization for binary tomography
- First-order geometric multilevel optimization for discrete tomography
- Acceleration of the EM-like reconstruction method for diffuse optical tomography with ordered-subsets method
- Analysis and optimization of an algorithm for discrete tomography
- A convex programming algorithm for noisy discrete tomography
- Discrete tomography by convex--concave regularization and D.C. programming
- Discrete tomography by convex-concave regularization using linear und quadratic optimization.
- Generic iterative subset algorithms for discrete tomography
- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
- Primal-dual subgradient methods for convex problems
- Algorithms of inertial mirror descent in convex problems of stochastic optimization
- A simplified view of first order methods for optimization
- Distributed constrained optimization via continuous-time mirror design
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Some proximal methods for Poisson intensity CBCT and PET
- The effect of deterministic noise in subgradient methods
- Point process estimation with Mirror Prox algorithms
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
- Optimal complexity and certification of Bregman first-order methods
- Augmented Lagrangian method with alternating constraints for nonlinear optimization problems
- Recursive aggregation of estimators by the mirror descent algorithm with averaging
- Nonmonotone projected gradient methods based on barrier and Euclidean distances
- A weighted mirror descent algorithm for nonsmooth convex optimization problem
- Problems of differential and topological diagnostics. II: Problem of differential diagnostics
- Problems of differential and topological diagnostics. III: The checking problem
- A derivative-free comirror algorithm for convex optimization
- An incremental mirror descent subgradient algorithm with random sweeping and proximal step
- Re-examination of Bregman functions and new properties of their divergences
- Efficient learning of discrete graphical models*
- Asymptotically Exact Data Augmentation: Models, Properties, and Algorithms
- Problems of differential and topological diagnostics. V: The case of trajectorial measurements with error
- Accelerated stochastic algorithms for convex-concave saddle-point problems
- Problems of differential and topological diagnostics. VI: Statistical solving of the problem of differential diagnostics
- Problems of differential and topological diagnostics. IV: The case of exact trajectorial measurements
- Problems of differential and topological diagnostics. I: Motion equations and classification of malfunctions
- Universal intermediate gradient method for convex problems with inexact oracle
- Tseng’s Algorithm with Extrapolation from the past Endowed with Variable Metrics and Error Terms
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier
- Distributed mirror descent algorithm over unbalanced digraphs based on gradient weighting technique
- Stochastic EM methods with variance reduction for penalised PET reconstructions
- Stochastic composition optimization of functions without Lipschitz continuous gradient
- The CoMirror algorithm for solving nonsmooth constrained convex problems
- Stochastic incremental mirror descent algorithms with Nesterov smoothing
- Convergence rate analysis of the multiplicative gradient method for PET-type problems
- First-order methods for convex optimization
- Data-Driven Mirror Descent with Input-Convex Neural Networks
- Incremental proximal methods for large scale convex optimization
- Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems
- Bregman methods for large-scale optimization with applications in imaging
- A version of the mirror descent method to solve variational inequalities
- General inertial proximal stochastic mirror descent algorithm beyond Lipschitz smoothness assumption
- Optimal convergence rate for mirror descent methods with special time-varying step sizes rules
- Privacy-preserving distributed online mirror descent for nonconvex optimization
- Mirror descent methods with a weighting scheme for outputs for optimization problems with functional constraints
- Efficient sparse probability measures recovery via Bregman gradient
- An accelerated mirror descent algorithm for constrained nonconvex problems
- Refined diagnostic problem for a model of a moving platform
- VFOSA: variance-reduced fast operator splitting algorithms for generalized equations
- Inexact online proximal mirror descent for time-varying composite optimization
- A mirror descent algorithm for minimization of mean Poisson flow driven losses
This page was built for publication: The ordered subsets mirror descent optimization method with applications to tomography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784404)
