Share Email Print
cover

Proceedings Paper

How fast can one arbitrarily and precisely scale images?
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Image scaling is a frequent operation in video processing for optical metrology. In the paper, results of comparative study of computational complexity of different algorithms for scaling digital images with arbitrary scaling factors are presented and discussed. The following algorithms were compared: different types of spatial domain processing algorithms (linear, cubic, cubic spline interpolation) and a new DCT-based algorithm, which implements perfect (interpolation error free) scaling through discrete sinc-interpolation and is virtually free of boundary effects (characteristic for the DFT-based scaling algorithms). The comparison results enable evaluation of the feasibility of realtime implementation of the algorithms for arbitrary image scaling.

Paper Details

Date Published: 19 February 2013
PDF: 6 pages
Proc. SPIE 8656, Real-Time Image and Video Processing 2013, 865605 (19 February 2013); doi: 10.1117/12.2008675
Show Author Affiliations
Leonid Bilevich, Tel Aviv Univ. (Israel)
Leonid Yaroslavsky, Tel Aviv Univ. (Israel)


Published in SPIE Proceedings Vol. 8656:
Real-Time Image and Video Processing 2013
Nasser Kehtarnavaz; Matthias F. Carlsohn, Editor(s)

© SPIE. Terms of Use
Back to Top