We investigate a constrained version of simultaneous iterative reconstruction techniques(SIRT) from the general viewpoint of projected gradient methods. This connection enable us to assess the computational merit of this algorithm class. We borrow a leaf from numerical optimization to cope with the slow convergence of projected gradient methods and propose an acceleration procedure based on the spectral gradient choice of steplength as in [2] and a nonmonotone strategy [17,4]. We compare these schemes and present numerical experiments on some algebraic image reconstruction models with sparsity constraints, with particular attention to tomographic particle image reconstruction. The performance of both constrained SIRT and nonmonotone spectra...
Based on the recent mathematical findings on solving the linear inverse problems with sparsity const...
The Landweber method provides a framework to formulate iterative algorithms for image reconstruction...
The alternating projection algorithms are easy to implement and effective for large-scale complex op...
Algebraic Reconstruction Techniques (ART), on their both successive or simultaneous formulation, hav...
During the last two decades, iterative computerized tomography (CT) algorithms, such as ART (Algebra...
We consider in this paper the problem of reconstructing 3D Computed Tomography images from limited d...
No convergent ordered subsets (OS) type image reconstruction algorithms for transmission tomography ...
Sparse non-negative reconstruction problems arise as part of the tomographic particle image velocime...
We present new algorithms for penalized-likelihood image reconstruction: modified BSREM (block seque...
International audienceThe goal of this article is to study the performance of pursuit algorithms whe...
Abstract—Computed tomography (CT) has been extensively studied for years and widely used in the mode...
No convergent ordered subsets (OS) type image reconstruction algorithms for transmission tomography ...
This work focuses on tomographic image reconstruction in experimental fluid mechanics (TomoPIV), a r...
We present two types of globally convergent relaxed ordered subsets (OS) algorithms for penalized-li...
We study the discrete tomography problem in Experimental Fluid Dynamics - Tomographic Particle Image...
Based on the recent mathematical findings on solving the linear inverse problems with sparsity const...
The Landweber method provides a framework to formulate iterative algorithms for image reconstruction...
The alternating projection algorithms are easy to implement and effective for large-scale complex op...
Algebraic Reconstruction Techniques (ART), on their both successive or simultaneous formulation, hav...
During the last two decades, iterative computerized tomography (CT) algorithms, such as ART (Algebra...
We consider in this paper the problem of reconstructing 3D Computed Tomography images from limited d...
No convergent ordered subsets (OS) type image reconstruction algorithms for transmission tomography ...
Sparse non-negative reconstruction problems arise as part of the tomographic particle image velocime...
We present new algorithms for penalized-likelihood image reconstruction: modified BSREM (block seque...
International audienceThe goal of this article is to study the performance of pursuit algorithms whe...
Abstract—Computed tomography (CT) has been extensively studied for years and widely used in the mode...
No convergent ordered subsets (OS) type image reconstruction algorithms for transmission tomography ...
This work focuses on tomographic image reconstruction in experimental fluid mechanics (TomoPIV), a r...
We present two types of globally convergent relaxed ordered subsets (OS) algorithms for penalized-li...
We study the discrete tomography problem in Experimental Fluid Dynamics - Tomographic Particle Image...
Based on the recent mathematical findings on solving the linear inverse problems with sparsity const...
The Landweber method provides a framework to formulate iterative algorithms for image reconstruction...
The alternating projection algorithms are easy to implement and effective for large-scale complex op...