Paper
1 November 1990 Simple stretching and compression algorithm using Lagrange's polynomials
Author Affiliations +
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.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Alfredo J. Ramirez "Simple stretching and compression algorithm using Lagrange's polynomials", Proc. SPIE 1349, Applications of Digital Image Processing XIII, (1 November 1990); https://doi.org/10.1117/12.23525
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Digital image processing

Fourier transforms

Image processing

Image compression

Software development

Spatial frequencies

Yield improvement

RELATED CONTENT

Image quality evaluation using generalized natural image
Proceedings of SPIE (January 28 2008)
Frequency characterization of the discrete cosine transform
Proceedings of SPIE (November 01 1990)
Review Of Image Processing Fundamentals
Proceedings of SPIE (July 22 1985)
Novel auto-focusing method
Proceedings of SPIE (October 11 2010)

Back to Top