The discrete Radon transform and its approximate inversion via linear programming
نویسندگان
چکیده
منابع مشابه
The Discrete Radon Transform and Its Approximate Inversion Via Linear Programming
Let S be a jinite subset of a lattice and let us(L), the number of points of S IL for each line L, denote the discrete Radon transform of S. The problem is to reconstruct S from a knowledge (possibly noisy) of the restriction of US to a subset Y of the set of all lines in any of a few given directions through the lattice. Reconstructing a density from its line integrals is a well-understood pro...
متن کاملDiscrete radon transform
This paper describes the discrete Radon transform (DRT) and the exact inversion algorithm for it. Similar to the discrete Fourier transform (DFT), the DRT is defined for periodic vector-sequences and studied as a transform in its own right. Casting the forward transform as a matrix-vector multiplication, the key observation is that the matrix-although very large-has a block-circulant structure....
متن کاملApproximate Dynamic Programming via Linear Programming
The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of largescale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach "fits" a linear combination of preselected basis functions to the dynamic programming costtogo function. We develop...
متن کاملRadon Transform Inversion using the Shearlet Representation
The inversion of the Radon transform is a classical ill-posed inverse problem where some method of regularization must be applied in order to accurately recover the objects of interest from the observable data. A well-known consequence of the traditional regularization methods is that some important features to be recovered are lost, as evident in imaging applications where the regularized reco...
متن کاملSampling Rate Conversion in the Discrete Linear Canonical Transform Domain
Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00083-2