Results 61 to 70 of about 609 (157)

Fast oped algorithm for reconstruction of images from radon data.

, 2007
A fast implementation of the OPED algorithm, a reconstruction algorithm for Radon data introduced recently, is proposed and tested. The new implementation uses FFT for discrete sine transform and an interpolation step.
Tischenko, O., Xu, Y.
core  

An efficient algorithm for computing two-dimensional discrete cosine transforms [PDF]

, 1991
A fast algorithm for computing the two-dimensional discrete cosine transform (2-D DCT) is proposed. In this algorithm the 2-D DCT is converted into a form of 2-D DFT (discrete Fourier transform) which is called the odd DFT.
Crebbin, G., Ta, N., Attikiouzel, Y.
core  

Fourier inversion of the mojette transform [PDF]

, 2015
The Mojette transform is a form of discrete Radon transform that maps a 2D image (P ×Q pixels) to a set of I 1D projections. Several fast inversion methods exist that require O(PQI) operations but those methods are ill-conditioned.
Normand, Nicolas, Li, Heyang (Thomas), Svalbe, Imants D, Kingston, Andrew   +3 more
core  

Circulant theory of the Radon transform

, 2010
This thesis presents original work on the construction of a Circulant Theory of the Radon Transform (RT). The RT allows one to determine or reconstruct the internal structure of an object from its "projected" views.
Chandra, Shekhar Suresh
core  

Fast slant stack: A notion of Radon transform for data in a Cartesian grid which is rapidly computible, algebraically exact, geometrically faithful and invertible

, 2001
. We define a notion of Radon Transform for data in an n by n grid. It is based on summation along lines of absolute slope less than 1 (as a function either of x or of y), with values at non-Cartesian locations defined using trigonometric interpolation ...
R. R. Coifman, D. L. Donoho, A. Averbuch, J. Waldén, M. Israeli   +4 more
core  

Fourier inversion of the Mojette transform

, 2014
International audienceThe Mojette transform is a form of discrete Radon transform that maps a 2D image (P×Q pixels) to a set of I 1D projections. Several fast inversion methods exist that require O(PQI) operations but those methods are ill-conditioned ...
Li, Heyang, Normand, Nicolas, Nicolas Normand, Heyang Li, Svalbe, Imants, Imants Svalbe, Kingston, Andrew, Andrew Kingston   +7 more
core   +1 more source

Robust and secure perceptual image hashing in the transform domain

The rapid development of multimedia devices such as computers, network technologies, and cell phones have made it easier for users to create, broadcast, convey, share, store, and distribute multimedia data including images, videos and audio files on a ...
Prungsinchai, Supakorn
core  

Invariant pattern recognition using the RFM descriptor

, 2012
International audienceA pattern descriptor invariant to rotation, scaling, translation (RST), and robust to additive noise is proposed by using the Radon, Fourier, and Mellin transforms.
Salvatore Tabbone, Hoang, Thai V., Thai V. Hoang, Tabbone, Salvatore   +3 more
core   +1 more source

Drifting discrete Jovian radio bursts reveal acceleration processes related to Ganymede and the main aurora. [PDF]

Nat Commun, 2023
Mauduit E, Zarka P, Lamy L, Hess SLG.
europepmc   +1 more source

Fast and Scalable Architectures and Algorithms for the Computation of the Forward and Inverse Discrete Periodic Radon Transform with Applications to 2D Convolutions and Cross-Correlations

, 2016
The Discrete Radon Transform (DRT) is an essential component of a wide range of applications in image processing, e.g. image denoising, image restoration, texture analysis, line detection, encryption, compressive sensing and reconstructing objects from ...
Carranza, Cesar
core