Results 131 to 140 of about 609 (157)
Some of the next articles are maybe not open access.
The fast discrete Radon transform. I. Theory
IEEE Transactions on Image Processing, 1993An inversion scheme for reconstruction of images from projections based on the slope-intercept form of the discrete Radon transform is presented. A seminal algorithm for the forward and the inverse transforms proposed by G. Beylkin (1987) demonstrated poor dispersion characteristics for steep slopes and could not invert transforms based on nonlinear ...
V K Madisetti
exaly +3 more sources
New fast algorithms of multidimensional Fourier and Radon discrete transforms
1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258), 1999This paper describes a fast new n-D discrete Radon transform (DRT) and a fast exact inversion algorithm for it, without interpolating from polar to Cartesian coordinates of using the backprojection operator. The new approach is based on the fast Nussbaumer's (1982) polynomial transform (NPT).
Jaakko Astola
exaly +2 more sources
The fast discrete Radon transform
[Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, 1992 An explicit relationship between the continuous and discrete time Radon transforms is derived. A generalized least-squares solution to the inversion problem is proposed, and a new inverse counterpart to the fast Radon transform (FRT) algorithm (IFRT) is derived.
Brian T. Kelley, Vijay K. Madisetti
openaire +2 more sources
A Fast Discrete Approximation Algorithm for the Radon Transform
SIAM Journal on Computing, 1998Summary: This paper addresses fast parallel methods for the computation of the Radon (or Hough) transform. The Radon transform of an image is a set of projections of the image taken at different angles. Its computation is important in image processing and computer vision for problems such as pattern recognition and reconstruction of medical images.
exaly +3 more sources
Fast computation of two-dimensional discrete Fourier transform using fast discrete Radon transform
IEEE TENCON'90: 1990 IEEE Region 10 Conference on Computer and Communication Systems. Conference Proceedings, 2002 The author presents a new decomposition in which the two-dimensional discrete Fourier transform (2-D DFT) can be converted into a series of the odd DFT using the discrete Radon transform (DRT). Moreover, the author presents a fast DRT (FDRT) algorithm for computing DRT with a reduced number of additions.
Yang Dekun
openaire +2 more sources
Fast parallel discrete approximation algorithms for the radon transform
Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, 1992Diese Seminararbeit behandelt eine von Martin L. Brady und Whanki Yong im Jahre 1992 vorgestellte Methode zur effizienten Berechnung der Radon-Transformation. Die Radon-Transformation ist eine mathematische Operation, welche 1917 von dem osterreichischen Mathematiker Johann Radon erstmals vorgestellt wurde.
Martin L. Brady, Whanki Yong
openaire +1 more source
2014 IEEE International Conference on Image Processing (ICIP), 2014
The Discrete Periodic Radon Transform (DPRT) has many important applications in image processing that are associated with reconstructing objects from projections (e.g., computed tomography [1]) or image restoration (e.g., [2]). Thus, there is strong interest in the development of fast algorithms and architectures for computing the DPRT.
Cesar Carranza +2 more
openaire +2 more sources
The Discrete Periodic Radon Transform (DPRT) has many important applications in image processing that are associated with reconstructing objects from projections (e.g., computed tomography [1]) or image restoration (e.g., [2]). Thus, there is strong interest in the development of fast algorithms and architectures for computing the DPRT.
Cesar Carranza +2 more
openaire +2 more sources
[Proceedings] 1992 IEEE International Symposium on Circuits and Systems, 2003
Presents a novel algorithm for the computation of the two-dimensional discrete Fourier transform and discrete Hartley transform. By using the discrete Radon transform (DRT), the algorithm essentially converts the two-dimensional transforms into a number of one-dimensional ones.
D.P.-K. Lun, W.-C. Siu
openaire +1 more source
Presents a novel algorithm for the computation of the two-dimensional discrete Fourier transform and discrete Hartley transform. By using the discrete Radon transform (DRT), the algorithm essentially converts the two-dimensional transforms into a number of one-dimensional ones.
D.P.-K. Lun, W.-C. Siu
openaire +1 more source
2018 25th IEEE International Conference on Image Processing (ICIP), 2018
The Discrete Periodic Radon Transform (DPRT) has many important applications in reconstructing images from their projections and has recently been used in fast and scalable architectures for computing 2D convolutions. Unfortunately, the direct computation of the DPRT involves $O(N^{3})$ additions and memory accesses that can be very costly in single ...
Cesar Carranza +2 more
openaire +1 more source
The Discrete Periodic Radon Transform (DPRT) has many important applications in reconstructing images from their projections and has recently been used in fast and scalable architectures for computing 2D convolutions. Unfortunately, the direct computation of the DPRT involves $O(N^{3})$ additions and memory accesses that can be very costly in single ...
Cesar Carranza +2 more
openaire +1 more source
Fast approximate 4-D/3-D discrete radon transform for lightfield refocusing
Journal of Electronic Imaging, 2012We develop a new algorithm that extends the bidimensional fast digital radon transform from Gotz and Druckmuller (1996) to digitally simulate the refocusing of a 4-D lightfield into a 3-D volume of photographic planes as previously done by Ng et al. (2005) but with the minimum number of operations.
José Gil Marichal-Hernández +3 more
openaire +1 more source