Title: Efficient implementation of higher order image interpolation
Authors: Perko, Roland
Bischof, Horst
Citation: WSCG '2004: Short Communications: the 12-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2004, 2.-6. February 2004 Plzeň, p. 213-218.
Issue Date: 2010
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
URI: http://wscg.zcu.cz/wscg2004/Papers_2004_Short/J47.pdf
ISBN: 80-903100-5-2
Keywords: interpolace obrazů;rekonstrukce obrazů
Keywords in different language: image interpolation;image reconstruction
Abstract: This work presents a new method of fast cubic and higher order image interpolation. The evaluation of the piecewise n-th order polynomial kernels is accelerated by transforming the polynomials into the interval [0,1], which has the advantage that some terms of the polynomials disappear, and that several coefficients could be precalculated, which is proven in the paper. The results are exactly the same as using standard n-th order interpolation, but the computational complexity is reduced. Calculating the interpolation weights for the cubic convolution only needs about 60% of the time compared to the classical method optimized by the Horner's rule. This allows a new efficient implementation for image interpolation.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG '2004: Short Communications

Files in This Item:
File Description SizeFormat 
J47.pdfPlný text210,07 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/6248

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.