Exact image representation via a number‐theoretic Radon transform
IET Computer Vision, 2014 This study presents an integer‐only algorithm to exactly recover an image from its discrete projected views that can be computed with the same computational complexity as the fast Fourier transform (FFT). Most discrete transforms for image reconstruction
Shekhar Chandra, Imants Svalbe
doaj +2 more sources
Recovering Missing Slices of the Discrete Fourier Transform using Ghosts [PDF]
, 2012 International audienceThe Discrete Fourier Transform (DFT) underpins the solution to many inverse problems commonly possessing missing or un-measured frequency information.
Chandra, Shekhar +2 more
core +3 more sources
Analyse des signaux multicomposante à modulation de fréquence linéaire par la transformation de Teager-Huang-Hough [PDF]
, 2014 A novel detection approach of linear FM (LFM) signals, with single or multiple components, in the time-frequency plane of Teager-Huang (TH) transform is presented.
BOUDRAA, Abdelouahab +4 more
core +1 more source
Multiresolution analysis using wavelet, ridgelet, and curvelet transforms for medical image segmentation [PDF]
, 2011 Copyright @ 2011 Shadi AlZubi et al. This article has been made available through the Brunel Open Access Publishing Fund.The experimental study presented in this paper is aimed at the development of an automatic image segmentation system for classifying ...
Alzubi, S +5 more
core +1 more source
Curvelets, Wave Atoms, and Wave Equations [PDF]
, 2006 We argue that two specific wave packet families---curvelets and wave atoms---provide powerful tools for representing linear systems of hyperbolic differential equations with smooth, time-independent coefficients.
Demanet, Laurent
core +1 more source
A fast but ill-conditioned formal inverse to Radon transforms in 2D and 3D [PDF]
, 2022 We present a formal inversion of the multiscale discrete Radon trasform, valid both for 2D and 3D. With the transformed data from just one of the four quadrants of the direct 2D Radon transform, or one of the twelve dodecants, in case of 3D Radon ...
Marichal Hernández, José Gil +4 more
core +1 more source
New fast discrete radon transform for enhancing linear features in noisy images
Electronics Letters, 1988 A new fast discrete Radon transform method for enhancement of lines in noisy images is described. It is based on the Fourier slice theorem, with variable length slices to utilise all of the frequency domain data. It is shown that this new method achieves a significant increase in computational speed compared with an existing technique.
G. Hall +3 more
openaire +1 more source
Generalizing the Brady-Yong Algorithm: Efficient Fast Hough Transform for Arbitrary Image Sizes
IEEE AccessThe Hough (discrete Radon) transform (HT/DRT) is a digital image processing tool that has become indispensable in many application areas, ranging from general image processing to neural networks and X-ray computed tomography. The utilization of the HT in
Danil D. Kazimirov +5 more
doaj +1 more source
Fast discrete Radon transform and 2-D discrete Fourier transform
Electronics Letters, 1990 The discrete Radon transform (DRT) has been known to convert two-dimensional discrete Fourier transforms (2-D DFTs) into 1-D DFTs. A fast discrete Radon transform (FDRT) algorithm is presented. A FDRT-based algorithm is presented for computing 2-D DFTs, which has the advantages of having the lowest number of multiplications and being more suitable for ...
openaire +1 more source
Discrete Radon transform has an exact, fast inverse and generalizes to operations other than sums along lines [PDF]
Proceedings of the National Academy of Sciences, 2006 Götz, Druckmüller, and, independently, Brady have defined a discrete Radon transform (DRT) that sums an image's pixel values along a set of aptly chosen discrete lines, complete in slope and intercept. The transform is fast, O ( N 2 log N ) for an
openaire +2 more sources