10,191 research outputs found
Automatic alignment for three-dimensional tomographic reconstruction
In tomographic reconstruction, the goal is to reconstruct an unknown object
from a collection of line integrals. Given a complete sampling of such line
integrals for various angles and directions, explicit inverse formulas exist to
reconstruct the object. Given noisy and incomplete measurements, the inverse
problem is typically solved through a regularized least-squares approach. A
challenge for both approaches is that in practice the exact directions and
offsets of the x-rays are only known approximately due to, e.g. calibration
errors. Such errors lead to artifacts in the reconstructed image. In the case
of sufficient sampling and geometrically simple misalignment, the measurements
can be corrected by exploiting so-called consistency conditions. In other
cases, such conditions may not apply and we have to solve an additional inverse
problem to retrieve the angles and shifts. In this paper we propose a general
algorithmic framework for retrieving these parameters in conjunction with an
algebraic reconstruction technique. The proposed approach is illustrated by
numerical examples for both simulated data and an electron tomography dataset
Fixing Nonconvergence of Algebraic Iterative Reconstruction with an Unmatched Backprojector
We consider algebraic iterative reconstruction methods with applications in
image reconstruction. In particular, we are concerned with methods based on an
unmatched projector/backprojector pair; i.e., the backprojector is not the
exact adjoint or transpose of the forward projector. Such situations are common
in large-scale computed tomography, and we consider the common situation where
the method does not converge due to the nonsymmetry of the iteration matrix. We
propose a modified algorithm that incorporates a small shift parameter, and we
give the conditions that guarantee convergence of this method to a fixed point
of a slightly perturbed problem. We also give perturbation bounds for this
fixed point. Moreover, we discuss how to use Krylov subspace methods to
efficiently estimate the leftmost eigenvalue of a certain matrix to select a
proper shift parameter. The modified algorithm is illustrated with test
problems from computed tomography
Inversion of the star transform
We define the star transform as a generalization of the broken ray transform
introduced by us in previous work. The advantages of using the star transform
include the possibility to reconstruct the absorption and the scattering
coefficients of the medium separately and simultaneously (from the same data)
and the possibility to utilize scattered radiation which, in the case of the
conventional X-ray tomography, is discarded. In this paper, we derive the star
transform from physical principles, discuss its mathematical properties and
analyze numerical stability of inversion. In particular, it is shown that
stable inversion of the star transform can be obtained only for configurations
involving odd number of rays. Several computationally-efficient inversion
algorithms are derived and tested numerically.Comment: Accepted to Inverse Problems in this for
Projected Newton Method for noise constrained Tikhonov regularization
Tikhonov regularization is a popular approach to obtain a meaningful solution
for ill-conditioned linear least squares problems. A relatively simple way of
choosing a good regularization parameter is given by Morozov's discrepancy
principle. However, most approaches require the solution of the Tikhonov
problem for many different values of the regularization parameter, which is
computationally demanding for large scale problems. We propose a new and
efficient algorithm which simultaneously solves the Tikhonov problem and finds
the corresponding regularization parameter such that the discrepancy principle
is satisfied. We achieve this by formulating the problem as a nonlinear system
of equations and solving this system using a line search method. We obtain a
good search direction by projecting the problem onto a low dimensional Krylov
subspace and computing the Newton direction for the projected problem. This
projected Newton direction, which is significantly less computationally
expensive to calculate than the true Newton direction, is then combined with a
backtracking line search to obtain a globally convergent algorithm, which we
refer to as the Projected Newton method. We prove convergence of the algorithm
and illustrate the improved performance over current state-of-the-art solvers
with some numerical experiments
Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers
Ptychography has risen as a reference X-ray imaging technique: it achieves
resolutions of one billionth of a meter, macroscopic field of view, or the
capability to retrieve chemical or magnetic contrast, among other features. A
ptychographyic reconstruction is normally formulated as a blind phase retrieval
problem, where both the image (sample) and the probe (illumination) have to be
recovered from phaseless measured data. In this article we address a nonlinear
least squares model for the blind ptychography problem with constraints on the
image and the probe by maximum likelihood estimation of the Poisson noise
model. We formulate a variant model that incorporates the information of
phaseless measurements of the probe to eliminate possible artifacts. Next, we
propose a generalized alternating direction method of multipliers designed for
the proposed nonconvex models with convergence guarantee under mild conditions,
where their subproblems can be solved by fast element-wise operations.
Numerically, the proposed algorithm outperforms state-of-the-art algorithms in
both speed and image quality.Comment: 23 page
Refraction-corrected ray-based inversion for three-dimensional ultrasound tomography of the breast
Ultrasound Tomography has seen a revival of interest in the past decade,
especially for breast imaging, due to improvements in both ultrasound and
computing hardware. In particular, three-dimensional ultrasound tomography, a
fully tomographic method in which the medium to be imaged is surrounded by
ultrasound transducers, has become feasible. In this paper, a comprehensive
derivation and study of a robust framework for large-scale bent-ray ultrasound
tomography in 3D for a hemispherical detector array is presented. Two
ray-tracing approaches are derived and compared. More significantly, the
problem of linking the rays between emitters and receivers, which is
challenging in 3D due to the high number of degrees of freedom for the
trajectory of rays, is analysed both as a minimisation and as a root-finding
problem. The ray-linking problem is parameterised for a convex detection
surface and three robust, accurate, and efficient ray-linking algorithms are
formulated and demonstrated. To stabilise these methods, novel
adaptive-smoothing approaches are proposed that control the conditioning of the
update matrices to ensure accurate linking. The nonlinear UST problem of
estimating the sound speed was recast as a series of linearised subproblems,
each solved using the above algorithms and within a steepest descent scheme.
The whole imaging algorithm was demonstrated to be robust and accurate on
realistic data simulated using a full-wave acoustic model and an anatomical
breast phantom, and incorporating the errors due to time-of-flight picking that
would be present with measured data. This method can used to provide a
low-artefact, quantitatively accurate, 3D sound speed maps. In addition to
being useful in their own right, such 3D sound speed maps can be used to
initialise full-wave inversion methods, or as an input to photoacoustic
tomography reconstructions
- …