An improved linear image interpolation algorithm
Jie Zhao
Abstract
Jie Zhao
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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