Construction and optimization of the fourth-order polynomial convolution 1P kernel

The paper describes the construction of two the fourth-order polynomial interpolation convolution kernels. The first kernel is without parameterization, while the second kernel is with parameterization. The parameterized kernel was optimized with the aim of approximating the ideal interpolation kernel sinc. The optimizations were performed according to two interpolation criteria. The first criterion implies the equation of the slope of the amplitude characteristic of the kernel in the node x = 1. The second criterion refers to the continuity of the third-order derivative of the amplitude characteristic in the node x = 1. The precision of the interpolation was tested by an experiment, in which some test images were interpolated. The results of the experiment showed that the precision of interpolation when applying the kernel, which is optimized by equalizing the slope, is higher in relation to the precision of the kernel with the optimization of the continuity of the third-order derivative of the amplitude characteristic. In addition, it was shown that the optimized kernel has a higher interpolation precision compared to the kernel without optimization.

Authors

Institutions

Publication Details

Published
2025-02-19
DOI
https://doi.org/10.1109/it64745.2025.10930308
Primary Topic
Advanced Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Construction and optimization of the fourth-order polynomial convolution 1P kernel

Zoran Milivojević, Bojan Prlinčević, Dijana Kostić, Zoran Veličković et al.
Advanced Algorithms and Applications
article

Construction and optimization of the fourth-order polynomial convolution 1P kernel

Zoran Milivojević, Bojan Prlinčević, Dijana Kostić, Zoran Veličković, Violeta Stojanović
article en

Abstract

The paper describes the construction of two the fourth-order polynomial interpolation convolution kernels. The first kernel is without parameterization, while the second kernel is with parameterization. The parameterized kernel was optimized with the aim of approximating the ideal interpolation kernel sinc. The optimizations were performed according to two interpolation criteria. The first criterion implies the equation of the slope of the amplitude characteristic of the kernel in the node x = 1. The second criterion refers to the continuity of the third-order derivative of the amplitude characteristic in the node x = 1. The precision of the interpolation was tested by an experiment, in which some test images were interpolated. The results of the experiment showed that the precision of interpolation when applying the kernel, which is optimized by equalizing the slope, is higher in relation to the precision of the kernel with the optimization of the continuity of the third-order derivative of the amplitude characteristic. In addition, it was shown that the optimized kernel has a higher interpolation precision compared to the kernel without optimization.

Technical College of Applied Sciences (RS)
Openalex Percentile: Top 94%
Advanced Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Construction and optimization of the fourth-order polynomial convolution 1P kernel — Zoran Milivojević, Bojan Prlinčević, et al. · (2025) | TGRS Research Map | TGRS