Paper
7 February 2011 Gram polynomial image decimation and its application to non-rigid registration
Author Affiliations +
Proceedings Volume 7877, Image Processing: Machine Vision Applications IV; 787707 (2011) https://doi.org/10.1117/12.876665
Event: IS&T/SPIE Electronic Imaging, 2011, San Francisco Airport, California, United States
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.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Amir Badshah, Paul O'Leary, and Matthew Harker "Gram polynomial image decimation and its application to non-rigid registration", Proc. SPIE 7877, Image Processing: Machine Vision Applications IV, 787707 (7 February 2011); https://doi.org/10.1117/12.876665
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image registration

Signal to noise ratio

Image restoration

Distortion

Biomedical optics

Feature extraction

Gaussian filters

Back to Top