The Community for Technology Leaders
Green Image
Issue No. 10 - October (2011 vol. 33)
ISSN: 0162-8828
pp: 2081-2092
Chen Xing , University of Minnesota, Minneapolis
Peihua Qiu , University of Minnesota, Minneapolis
Image registration is used widely in applications for mapping one image to another. Existing image registration methods are either feature-based or intensity-based. Feature-based methods first extract relevant image features and then find the geometrical transformation that best matches the two corresponding sets of features extracted from the two images. Because identification and extraction of image features is often a challenging and time-consuming process, intensity-based image registration, by which the mapping transformation is estimated directly from the observed image intensities of the two images, has received much attention recently. In the literature, most existing intensity-based image registration methods estimate the mapping transformation globally by solving a minimization/maximization problem defined by the two entire images to register. To this end, it needs to be assumed that the mapping transformation has a certain type of parametric form or it is a continuous bivariate function satisfying certain regularity conditions. In this paper, we propose a novel intensity-based image registration method using nonparametric local smoothing. By this method, the mapping transformation at a given pixel is estimated locally in a neighborhood after certain image features are accommodated in the estimation. Due to the flexibility of local smoothing, this method does not require any parametric form for the mapping transformation. It even allows the transformation to be a discontinuous function. Numerical examples show that it is effective in various applications.
Degeneration, discontinuity, edge detection, local smoothing, mapping, nonparametric transformation, weighted least squares estimation.

P. Qiu and C. Xing, "Intensity-Based Image Registration by Nonparametric Local Smoothing," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 33, no. , pp. 2081-2092, 2011.
81 ms
(Ver 3.3 (11022016))