Interpolated Algorithm Research in Digital Image Processing
Ding Yu-sheng
Abstract
Ding Yu-sheng
Abstract
Geometric computing requires the image gray value interpolation,nearest neighbor interpolation method is simple,but the picture will have a clearly enlarged teeth.Bilinear interpolation can produce satisfactory results,but the procedure is more complicated to run a long time.In this paper,two basic algorithms,and actual results through nearest neighbor interpolation describing bilinear interpolation algorithm with the difference in image processing.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
Geometric computing requires the image gray value interpolation,nearest neighbor interpolation method is simple,but the picture will have a clearly enlarged teeth.Bilinear interpolation can produce satisfactory results,but the procedure is more complicated to run a long time.In this paper,two basic algorithms,and actual results through nearest neighbor interpolation describing bilinear interpolation algorithm with the difference in image processing.
Key concepts: Bilinear interpolation, Stairstep interpolation, Computer science, Interpolation (computer graphics), Image scaling, Bicubic interpolation, Nearest-neighbor interpolation, Algorithm