Two-Pass Warp Algorithm For Hardware Implementation

Michael Shantz

doi:10.1117/12.934315

8 April 1983 Two-Pass Warp Algorithm For Hardware Implementation

Michael Shantz

Proceedings Volume 0367, Processing and Display of Three-Dimensional Data; (1983) https://doi.org/10.1117/12.934315
Event: 26th Annual Technical Symposium, 1982, San Diego, United States

Abstract

A common requirement in remote sensing and cartography applications is that of warping an image to register with a reference image. A second order polynomial coordinate transformation on two-dimensional images embodies translation, rotation, scaling, and several types of warping. To perform this operation efficiently and with minimal hardware, the transformation is separated into a line operation followed by a column operation. These two transformations are computed using a least square fit algorithm. Resampling with bilinear or cubic convolution interpolation is also separable into the two-pass technique. This algorithm is suitable for hardware implementation of current image processing systems.

Citation Download Citation

Michael Shantz "Two-Pass Warp Algorithm For Hardware Implementation", Proc. SPIE 0367, Processing and Display of Three-Dimensional Data, (8 April 1983); https://doi.org/10.1117/12.934315

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available