By Topic

Fast First-Order Polynomials Convolution Interpolation for Real-Time Digital Image Reconstruction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chung-chi Lin ; Dept. of Comput. Sci., Tunghai Univ., Taichung, Taiwan ; Ming-hwa Sheu ; Chishyan Liaw ; Huann-Keng Chiang

This letter presents a high-performance architecture of a novel first-order polynomial convolution interpolation for digital image scaling. A better quality of interpolation is achieved by using higher order model that requires complex computations. The kernel of the proposed method is built up of first-order polynomials and approximates the ideal sinc-function in the interval [-2, 2]. The proposed architecture reduces the computational complexity of generating weighting coefficients and provides a simple hardware architecture design and low computation cost, and easily meets real-time requirements. The architecture is implemented on the Virtex-II FPGA, and the high-performance very-large-scale integration architecture has been successfully designed and implemented with the TSMC 0.13 μm standard cell library. The simulation results indicate that the interpolation quality of the proposed architecture is mostly better than cubic convolution interpolations, and is able to process varying-ratio image scaling for high-definition television in real-time.

Published in:

Circuits and Systems for Video Technology, IEEE Transactions on  (Volume:20 ,  Issue: 9 )