Note: This page has been translated by MathWorks. Click here to see

To view all translated materials including this page, select Country from the country navigator on the bottom of this page.

To view all translated materials including this page, select Country from the country navigator on the bottom of this page.

Radon transform

`R = radon(I)`

`R = radon(I,theta)`

`[R,xp] = radon(___)`

`[gpuarrayR,gpuarrayXp] = radon(gpuarrayI,theta)`

`[`

performs the Radon transform on a GPU. This syntax requires the Parallel
Computing Toolbox™.`gpuarrayR`

,`gpuarrayXp`

] = radon(`gpuarrayI`

,`theta`

)

The Radon transform of an image is the sum of the Radon transforms of each individual pixel.

The algorithm first divides pixels in the image into four subpixels and projects each subpixel separately, as shown in the following figure.

Each subpixel's contribution is proportionally split into the two nearest bins, according to the distance between the projected location and the bin centers. If the subpixel projection hits the center point of a bin, the bin on the axes gets the full value of the subpixel, or one-fourth the value of the pixel. If the subpixel projection hits the border between two bins, the subpixel value is split evenly between the bins.

[1] Bracewell, Ronald N., *Two-Dimensional
Imaging*, Englewood Cliffs, NJ, Prentice Hall, 1995, pp.
505-537.

[2] Lim, Jae S., *Two-Dimensional Signal and Image Processing*,
Englewood Cliffs, NJ, Prentice Hall, 1990, pp. 42-45.

Was this topic helpful?