The polynomial discrete Radon transform

This paper presents a new approach called polynomial discrete Radon transform (PDRT), regarded as a generalization of the classical finite discrete Radon transform. Specifically, the PDRT transforms an image into Radon space by summing the pixels according to polynomial curves. The PDRT can be applied on square p×p\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p \times p$$\end{document} images where p\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p$$\end{document} is assumed to be a prime number. It is based on a simple arithmetic operations and requires no data interpolation. An interesting property of the PDRT is its exact inversion. This means that an image can be transformed and then perfectly reconstructed. Through this study, we show that the new approach can be applied for some pattern recognition applications.