2006Unpublished venueRequires access

Sectioned implementation of regularized image interpolation

S.E. El-Khamy, Mohiy M. Hadhoud, Moawad I. Dessouky, B. M. Salam, F.E.A. El-Samie

Open publisher page 23 citations

Abstract

This paper presents a noniterative regularized inverse solution to the image interpolation problem. The suggested solution is based on the segmentation of the image to be interpolated to overlapping blocks and interpolating each block separately. The purpose of the overlapping of blocks is to avoid edge effects. A global regularization parameter is used in interpolating each block. In this suggested implementation, a single matrix inversion process of moderate dimensions is required in the whole interpolation process. The suggested solution avoids the large computational complexity due to the matrices of large dimensions involved in the interpolation process. The performance of this suggested image interpolation algorithm is compared to the standard iterative regularized interpolation scheme and to polynomial interpolation schemes such as the cubic spline image interpolation algorithm.

About this research paper

What this paper is about

This paper presents a noniterative regularized inverse solution to the image interpolation problem. The suggested solution is based on the segmentation of the image to be interpolated to overlapping blocks and interpolating each block separately. The purpose of the overlapping of blocks is to avoid edge effects. A global regularization parameter is used in interpolating each block. In this suggested implementation, a single matrix inversion process of moderate dimensions is required in the whole interpolation process. The suggested solution avoids the large computational complexity due to the matrices of large dimensions involved in the interpolation process. The performance of this suggested image interpolation algorithm is compared to the standard iterative regularized interpolation scheme and to polynomial interpolation schemes such as the cubic spline image interpolation algorithm.

Why it matters

OpenAlex reports 23 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper presents a noniterative regularized inverse solution to the image interpolation problem. The suggested solution is based on the segmentation of the image to be interpolated to overlapping blocks and interpolating each block separately. The purpose of the overlapping of blocks is to avoid edge effects. A global regularization parameter is used in interpolating each block. In this suggested implementation, a single matrix inversion process of moderate dimensions is required in the whole interpolation process. The suggested solution avoids the large computational complexity due to the matrices of large dimensions involved in the interpolation process. The performance of this suggested image interpolation algorithm is compared to the standard iterative regularized interpolation scheme and to polynomial interpolation schemes such as the cubic spline image interpolation algorithm.

Key concepts: Stairstep interpolation, Nearest-neighbor interpolation, Spline interpolation, Interpolation (computer graphics), Bicubic interpolation, Bilinear interpolation, Image scaling, Trilinear interpolation

Related papers

Back to paper searchBrowse research topicsOriginal source
Sectioned implementation of regularized image interpolation — Research Paper | ScholarLens