Share Email Print

Proceedings Paper

Gram polynomial image decimation and its application to non-rigid registration
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper presents a new approach to non-rigid registration. A hierarchical subdivision approach is applied, with local normalized phase correlation for patch registration. The major improvement is achieved by implementing a suitable decimation at each level. The decimation is implemented via a Gram polynomial basis. Both global and local polynomial approximation are considered and compared with the use of a Fourier basis. The issue of Gibbs error in polynomial decimation is examined. It is shown that the Gram basis is superior when applied to signals with strong gradient, i.e., a gradient which generates a significant Gibbs error with a Fourier basis. A bivariate Gram polynomial tensor product approximation is used to implement regularization. It is demonstrated that the new method performs well on both synthetic and real image data. The procedure requires approximately 1.3 sec. to register an image with 800 × 500 pixels.

Paper Details

Date Published: 7 February 2011
PDF: 8 pages
Proc. SPIE 7877, Image Processing: Machine Vision Applications IV, 787707 (7 February 2011); doi: 10.1117/12.876665
Show Author Affiliations
Amir Badshah, Montan Univ. Leoben (Austria)
Paul O'Leary, Montan Univ. Leoben (Austria)
Matthew Harker, Montan Univ. Leoben (Austria)

Published in SPIE Proceedings Vol. 7877:
Image Processing: Machine Vision Applications IV
David Fofi; Philip R. Bingham, 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?