Fast Algorithm of Modified Cubic Convolution Interpolation
Cubic convolution interpolation algorithm is one of the most widely used image interpolation methods. Compared with the linear interpolation, it has a more accurate result, but a lower interpolation speed due to its computational complexity. The cubic convolution algorithm needs sixteen points in twodimensional image interpolation. The new algorithm proposed in this paper reduces the necessary points to nine by using the correlation among neighboring pixels. Furthermore, the times of multiplication and addition involved in interpolation can be reduced to 53% and 48% respectively of those by original cubic convolution. So the new algorithm achieved lower computational complexity and a higher interpolation speed.
cubic convolution interpolation fast algorithm correlation among neighboring pixels interpolation precision
Jin-tai SHANGGUAN Yan-ling LI Yong-gang WANG Hui-Hng LI
Dept. of Computer Science and Technology Changzhi College Changzhi, Shanxi province, China
国际会议
2011 4th International Congress on Image and Signal Processing(第四届图像与信号处理国际学术会议 CISP 2011)
上海
英文
1086-1089
2011-10-15(万方平台首次上网日期,不代表论文的发表时间)