Affiliation:
1. Department of Civil Engineering, University of the Peloponnese, 26334 Patras, Greece
2. Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Cambridge CB3 0WA, UK
3. Mathematics Research Center, Academy of Athens, 11527 Athens, Greece
4. Institute of Nuclear and Radiological Science and Technology, Energy and Safety (INRASTES), National Center for Scientific Research “Demokritos”, 15310 Aghia Paraskevi, Greece
Abstract
Since their introduction, Chebyshev polynomials of the first kind have been extensively investigated, especially in the context of approximation and interpolation. Although standard interpolation methods usually employ equally spaced points, this is not the case in Chebyshev interpolation. Instead of equally spaced points along a line, Chebyshev interpolation involves the roots of Chebyshev polynomials, known as Chebyshev nodes, corresponding to equally spaced points along the unit semicircle. By reviewing prior research on the applications of Chebyshev interpolation, it becomes apparent that this interpolation is rather impractical for medical imaging. Especially in clinical positron emission tomography (PET) and in single-photon emission computerized tomography (SPECT), the so-called sinogram is always calculated at equally spaced points, since the detectors are almost always uniformly distributed. We have been able to overcome this difficulty as follows. Suppose that the function to be interpolated has compact support and is known at q equally spaced points in −1,1. We extend the domain to −a,a, a>1, and select a sufficiently large value of a, such that exactlyq Chebyshev nodes are included in −1,1, which are almost equally spaced. This construction provides a generalization of the concept of standard Chebyshev interpolation to almost equally spaced points. Our preliminary results indicate that our modification of the Chebyshev method provides comparable, or, in several cases including Runge’s phenomenon, superior interpolation over the standard Chebyshev interpolation. In terms of the L∞ norm of the interpolation error, a decrease of up to 75% was observed. Furthermore, our approach opens the way for using Chebyshev polynomials in the solution of the inverse problems arising in PET and SPECT image reconstruction.
Funder
European Union and Greek national funds Operational Program Competitiveness, Entrepreneurship and Innovation, under the call RESEARCH -- CREATE -- INNOVATE
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference31 articles.
1. Théorie des mécanismes connus sous le nom de parallélogrammes;Chebyshev;Mém. Acad. Imp. Sci. St.-Pétersbg.,1854
2. Szegő, G. (1975). Orthogonal Polynomials, American Mathematical Society. [4th ed.]. American Mathematical Society Colloquium Publications.
3. Rivlin, T.J. (2020). Chebyshev Polynomials, Dover Publications.
4. Sparse interpolation in terms of multivariate Chebyshev polynomials;Hubert;Found. Comput. Math.,2022
5. Chebyshev polynomials and r-circulant matrices;Appl. Math. Comput.,2023