TY - JOUR

T1 - Noise reduction in computerized tomography images by means of polynomial transforms

AU - Escalante Ramírez, B.

AU - Martens, J.B.

PY - 1992

Y1 - 1992

N2 - We present two related algorithms for reducing noise in computerized tomography images. The algorithms are based on a recently developed technique for image representation called a polynomial transform. With this technique it is possible to decompose the image into local components, perform nonlinear and adaptive processing on these components, and resynthesize the image from the processed components. In this paper we describe how this can be applied to adapt the amount of noise reduction to the local image content. In the first algorithm, a single polynomial transform is used to perform the noise reduction. A critical parameter of this algorithm is the size of the local components. No single size is optimal for the entire image, so a compromise has to be made. An alternative approach is adopted in the second algorithm, where several polynomial transforms are used in parallel at different resolutions. This allows for a better adaptation of the size of the image components used in the reconstruction to the original image. For instance, uniform regions containing only noise are described with large-sized components. Low-contrast edges are restored with medium-sized components, while high-contrast edges contain high-resolution components.

AB - We present two related algorithms for reducing noise in computerized tomography images. The algorithms are based on a recently developed technique for image representation called a polynomial transform. With this technique it is possible to decompose the image into local components, perform nonlinear and adaptive processing on these components, and resynthesize the image from the processed components. In this paper we describe how this can be applied to adapt the amount of noise reduction to the local image content. In the first algorithm, a single polynomial transform is used to perform the noise reduction. A critical parameter of this algorithm is the size of the local components. No single size is optimal for the entire image, so a compromise has to be made. An alternative approach is adopted in the second algorithm, where several polynomial transforms are used in parallel at different resolutions. This allows for a better adaptation of the size of the image components used in the reconstruction to the original image. For instance, uniform regions containing only noise are described with large-sized components. Low-contrast edges are restored with medium-sized components, while high-contrast edges contain high-resolution components.

U2 - 10.1016/1047-3203(92)90023-M

DO - 10.1016/1047-3203(92)90023-M

M3 - Article

SN - 1047-3203

VL - 3

SP - 272

EP - 285

JO - Journal of Visual Communication and Image Representation

JF - Journal of Visual Communication and Image Representation

IS - 3

ER -