2012Electronic Design EngineeringRequires access

An improved linear image interpolation algorithm

Jie Zhao

Open publisher page 0 citations

Abstract

In this paper an improved method of linear interpolation to solve the problem of the traditional bilinear interpolation which will inevitably generate edge blurring after interpolated is improved.The algorithm first converts the interpolated point is divided into three categories,and then select the appropriate known point interpolation.The experimental results of two classic images called Lena and pepper show that,the algorithm is similar with the bicubic,but the amount of calculation is much smaller than the bicubic method,it can effectively maintain the image edge information and improve the image quality.

About this research paper

What this paper is about

In this paper an improved method of linear interpolation to solve the problem of the traditional bilinear interpolation which will inevitably generate edge blurring after interpolated is improved.The algorithm first converts the interpolated point is divided into three categories,and then select the appropriate known point interpolation.The experimental results of two classic images called Lena and pepper show that,the algorithm is similar with the bicubic,but the amount of calculation is much smaller than the bicubic method,it can effectively maintain the image edge information and improve the image quality.

Why it matters

A significance statement is not available in the OpenAlex record.

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

In this paper an improved method of linear interpolation to solve the problem of the traditional bilinear interpolation which will inevitably generate edge blurring after interpolated is improved.The algorithm first converts the interpolated point is divided into three categories,and then select the appropriate known point interpolation.The experimental results of two classic images called Lena and pepper show that,the algorithm is similar with the bicubic,but the amount of calculation is much smaller than the bicubic method,it can effectively maintain the image edge information and improve the image quality.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
An improved linear image interpolation algorithm — Research Paper | ScholarLens