Share Email Print

Proceedings Paper

Simple stretching and compression algorithm using Lagrange's polynomials
Author(s): Alfredo J. Ramirez
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Most implementations of Fast Fourier Transform (FFT) algorithms available in software packages and libraries require the number of points on the input to be an integral power of two. However most digital images especially those obtained in PC based systems will seldom meet this requirement. This paper will present a simple computational technique to adjust image dimensions to an appropriate size. Nonlinear polynomials are used as the basis for the scheme. The derivation of the basic interpolation functions is presented and a basic three by three mask is obtained. Observations regarding properties of image and mask are made which lead to the reduction of the mask to a three by one. An optimal procedure for utilizing the mask is also presented.

Paper Details

Date Published: 1 November 1990
PDF: 5 pages
Proc. SPIE 1349, Applications of Digital Image Processing XIII, (1 November 1990); doi: 10.1117/12.23525
Show Author Affiliations
Alfredo J. Ramirez, Memphis State Univ. (United States)

Published in SPIE Proceedings Vol. 1349:
Applications of Digital Image Processing XIII
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?