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

Danilo Costarelli, Marco Seracini and Gianluca Vinti

Applied Mathematics and Computation, 2020, vol. 374, issue C

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.

Keywords: Sampling Kantorovich; Interpolation; Quasi-interpolation; Image processing; PSNR; CPU time (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320300151
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:374:y:2020:i:c:s0096300320300151

DOI: 10.1016/j.amc.2020.125046

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().