Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections.

Int Trans Oper Res

Department of Computer Science, Graduate Center, City University of New York, New York, NY 10016, USA.

Published: July 2009

A block-iterative projection algorithm for solving the consistent convex feasibility problem in a finite-dimensional Euclidean space that is resilient to bounded and summable perturbations (in the sense that convergence to a feasible point is retained even if such perturbations are introduced in each iterative step of the algorithm) is proposed. This resilience can be used to steer the iterative process towards a feasible point that is superior in the sense of some functional on the points in the Euclidean space having a small value. The potential usefulness of this is illustrated in image reconstruction from projections, using both total variation and negative entropy as the functional.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3529939PMC
http://dx.doi.org/10.1111/j.1475-3995.2009.00695.xDOI Listing

Publication Analysis

Top Keywords

block-iterative projection
8
image reconstruction
8
reconstruction projections
8
euclidean space
8
feasible point
8
perturbation-resilient block-iterative
4
projection methods
4
methods application
4
application image
4
projections block-iterative
4

Similar Publications

. Deep image prior (DIP) has recently attracted attention owing to its unsupervised positron emission tomography (PET) image reconstruction method, which does not require any prior training dataset. In this paper, we present the first attempt to implement an end-to-end DIP-based fully 3D PET image reconstruction method that incorporates a forward-projection model into a loss function.

View Article and Find Full Text PDF

Iterative reconstruction of density pixel images from measured projections in computed tomography has attracted considerable attention. The ordered-subsets algorithm is an acceleration scheme that uses subsets of projections in a previously decided order. Several methods have been proposed to improve the convergence rate by permuting the order of the projections.

View Article and Find Full Text PDF

The Ettention software package.

Ultramicroscopy

February 2016

German Research Center for Artificial Intelligence GmbH (DFKI), 66123 Saarbrücken, Germany; Saarland University, 66123 Saarbrücken, Germany.

We present a novel software package for the problem "reconstruction from projections" in electron microscopy. The Ettention framework consists of a set of modular building-blocks for tomographic reconstruction algorithms. The well-known block iterative reconstruction method based on Kaczmarz algorithm is implemented using these building-blocks, including adaptations specific to electron tomography.

View Article and Find Full Text PDF

Large-field high-resolution electron tomography enables visualizing detailed mechanisms under global structure. As field enlarges, the distortions of reconstruction and processing time become more critical. Using the curvilinear projection model can improve the quality of large-field ET reconstruction, but its computational complexity further exacerbates the processing time.

View Article and Find Full Text PDF

The block cyclic projection method in the compressed sensing framework (BCPCS) was introduced for image reconstruction in computed tomography and its convergence had been proven in the case of unity relaxation (λ=1). In this paper, we prove its convergence with underrelaxation parameters λ∈(0,1). As a result, the convergence of compressed sensing based block component averaging algorithm (BCAVCS) and block diagonally-relaxed orthogonal projection algorithm (BDROPCS) with underrelaxation parameters under a certain condition are derived.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!