27,208 research outputs found
An Algebraic Framework for Discrete Tomography: Revealing the Structure of Dependencies
Discrete tomography is concerned with the reconstruction of images that are
defined on a discrete set of lattice points from their projections in several
directions. The range of values that can be assigned to each lattice point is
typically a small discrete set. In this paper we present a framework for
studying these problems from an algebraic perspective, based on Ring Theory and
Commutative Algebra. A principal advantage of this abstract setting is that a
vast body of existing theory becomes accessible for solving Discrete Tomography
problems. We provide proofs of several new results on the structure of
dependencies between projections, including a discrete analogon of the
well-known Helgason-Ludwig consistency conditions from continuous tomography.Comment: 20 pages, 1 figure, updated to reflect reader inpu
Optical Tomography on Graphs
We present an algorithm for solving inverse problems on graphs analogous to those arising in diffuse optical tomography for continuous media. In particular, we formulate and analyze a discrete version of the inverse Born series, proving estimates characterizing the domain of convergence, approximation errors, and stability of our approach. We also present a modification which allows additional information on the structure of the potential to be incorporated, facilitating recovery for a broader class of problems
Optical Tomography on Graphs
We present an algorithm for solving inverse problems on graphs analogous to those arising in diffuse optical tomography for continuous media. In particular, we formulate and analyze a discrete version of the inverse Born series, proving estimates characterizing the domain of convergence, approximation errors, and stability of our approach. We also present a modification which allows additional information on the structure of the potential to be incorporated, facilitating recovery for a broader class of problems
A Novel Convex Relaxation for Non-Binary Discrete Tomography
We present a novel convex relaxation and a corresponding inference algorithm
for the non-binary discrete tomography problem, that is, reconstructing
discrete-valued images from few linear measurements. In contrast to state of
the art approaches that split the problem into a continuous reconstruction
problem for the linear measurement constraints and a discrete labeling problem
to enforce discrete-valued reconstructions, we propose a joint formulation that
addresses both problems simultaneously, resulting in a tighter convex
relaxation. For this purpose a constrained graphical model is set up and
evaluated using a novel relaxation optimized by dual decomposition. We evaluate
our approach experimentally and show superior solutions both mathematically
(tighter relaxation) and experimentally in comparison to previously proposed
relaxations
On the Adjoint Operator in Photoacoustic Tomography
Photoacoustic Tomography (PAT) is an emerging biomedical "imaging from
coupled physics" technique, in which the image contrast is due to optical
absorption, but the information is carried to the surface of the tissue as
ultrasound pulses. Many algorithms and formulae for PAT image reconstruction
have been proposed for the case when a complete data set is available. In many
practical imaging scenarios, however, it is not possible to obtain the full
data, or the data may be sub-sampled for faster data acquisition. In such
cases, image reconstruction algorithms that can incorporate prior knowledge to
ameliorate the loss of data are required. Hence, recently there has been an
increased interest in using variational image reconstruction. A crucial
ingredient for the application of these techniques is the adjoint of the PAT
forward operator, which is described in this article from physical, theoretical
and numerical perspectives. First, a simple mathematical derivation of the
adjoint of the PAT forward operator in the continuous framework is presented.
Then, an efficient numerical implementation of the adjoint using a k-space time
domain wave propagation model is described and illustrated in the context of
variational PAT image reconstruction, on both 2D and 3D examples including
inhomogeneous sound speed. The principal advantage of this analytical adjoint
over an algebraic adjoint (obtained by taking the direct adjoint of the
particular numerical forward scheme used) is that it can be implemented using
currently available fast wave propagation solvers.Comment: submitted to "Inverse Problems
- …