In this paper we study the performance of the sampling Kantorovich (S–K) algorithm for image processing with other well-known interpolation and quasi-interpolation methods. The S-K algorithm has been implemented with three different families of kernels: cen- tral B-splines, Jackson type and Bochner–Riesz. The above method is compared, in term of PSNR (Peak Signal-to-Noise Ratio) and CPU time, with the bilinear and bicubic interpo- lation, the quasi FIR (Finite Impulse Response) and quasi IIR (Infinite Impulse Response) approximation. Experimental results show better performance of S-K algorithm than the considered other ones.
A comparison between the sampling Kantorovich algorithm for digital image processing with some interpolation and quasi-interpolation methods
Danilo Costarelli
;Marco Seracini;Gianluca Vinti
2020
Abstract
In this paper we study the performance of the sampling Kantorovich (S–K) algorithm for image processing with other well-known interpolation and quasi-interpolation methods. The S-K algorithm has been implemented with three different families of kernels: cen- tral B-splines, Jackson type and Bochner–Riesz. The above method is compared, in term of PSNR (Peak Signal-to-Noise Ratio) and CPU time, with the bilinear and bicubic interpo- lation, the quasi FIR (Finite Impulse Response) and quasi IIR (Infinite Impulse Response) approximation. Experimental results show better performance of S-K algorithm than the considered other ones.| File | Dimensione | Formato | |
|---|---|---|---|
|
REV-Numeric_Comparison_KANTO_2019_DOI.pdf
Open Access dal 26/01/2022
Tipologia di allegato:
Post-print
Licenza:
Creative commons
Dimensione
1.13 MB
Formato
Adobe PDF
|
1.13 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
