Related papers: An algorithm for constrained one-step inversion of…
Dual-energy computed tomography (DECT) is a promising technology that has shown a number of clinical advantages over conventional X-ray CT, such as improved material identification, artifact suppression, etc. For proton therapy treatment…
This paper concerns iterative reconstruction for low-dose and few-view CT by minimizing a data-fidelity term regularized with the Total Variation (TV) penalty. We propose a very fast iterative algorithm to solve this problem. The algorithm…
We propose and analyse primal-dual interior-point algorithms for convex optimization problems in conic form. The families of algorithms we analyse are so-called short-step algorithms and they match the current best iteration complexity…
Reconstructing an image from its Radon transform is a fundamental computed tomography (CT) task arising in applications such as X-ray scans. In many practical scenarios, a full 180-degree scan is not feasible, or there is a desire to reduce…
Computed Tomographic Imaging Spectrometers (CTIS) capture hyperspectral images in realtime. However, post processing the imagery can require enormous computational resources; thus, limiting its application to non-realtime scenarios. To…
We propose a new modified primal-dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates…
We develop a novel unified randomized block-coordinate primal-dual algorithm to solve a class of nonsmooth constrained convex optimization problems, which covers different existing variants and model settings from the literature. We prove…
In this paper, we present an interior point algorithm with a full-Newton step for solving a linearly constrained convex optimization problem, in which we propose a generalization of the work of Kheirfam and Nasrollahi…
We investigate possibilities to speed up iterative algorithms for non-blind image deconvolution. We focus on algorithms in which convolution with the point-spread function to be deconvolved is used in each iteration, and aim at accelerating…
We demonstrate computerized tomography (CT) reconstructions from absorption, phase and dark-field signals obtained from scans acquired when the x-ray probe light is modulated with speckle. Two different interlaced schemes are proposed to…
Computed Tomography (CT) is widely used in engineering and medicine for imaging the interior of objects, patients, or animals. If the employed X-ray source is monoenergetic, image reconstruction essentially means the inversion of a ray…
When inverting solar spectra, image degradation effects that are present in the data are usually approximated or not considered. We develop a data reduction method that takes these issues into account and minimizes the resulting errors. By…
Neutron Computed Tomography (CT) is an increasingly utilised non-destructive analysis tool in material science, palaeontology, and cultural heritage. With the development of new neutron imaging facilities (such as DINGO, ANSTO, Australia)…
This paper is devoted to the design of efficient primal-dual algorithm (PDA) for solving convex optimization problems with known saddle-point structure. We present a new PDA with larger acceptable range of parameters and correction, which…
Computed tomography (CT) involves a patient's exposure to ionizing radiation. To reduce the radiation dose, we can either lower the X-ray photon count or down-sample projection views. However, either of the ways often compromises image…
The potential huge advantage of spectral computed tomography (CT) is its capability to provide accuracy material identification and quantitative tissue information. This can benefit clinical applications, such as brain angiography, early…
Currently, the engineering of miniature spectrometers mainly faces three problems: the mismatch between the number of filters at the front end of the detector and the spectral reconstruction accuracy; the lack of a stable spectral…
A blind compressive sensing algorithm is proposed to reconstruct hyperspectral images from spectrally-compressed measurements.The wavelength-dependent data are coded and then superposed, mapping the three-dimensional hyperspectral datacube…
In this paper, we consider a nonsmooth convex finite-sum problem with a conic constraint. To overcome the challenge of projecting onto the constraint set and computing the full (sub)gradient, we introduce a primal-dual incremental gradient…
We develop stochastic first-order primal-dual algorithms to solve a class of convex-concave saddle-point problems. When the saddle function is strongly convex in the primal variable, we develop the first stochastic restart scheme for this…