A comparison between the sampling Kantorovich algorithm for digital image processing with some interpolation and quasi-interpolation methods

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: central 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 interpolation, 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.