Results 1  10
of
114
Image registration methods: a survey
 IMAGE AND VISION COMPUTING
, 2003
"... This paper aims to present a review of recent as well as classic image registration methods. Image registration is the process of overlaying images (two or more) of the same scene taken at different times, from different viewpoints, and/or by different sensors. The registration geometrically align t ..."
Abstract

Cited by 734 (9 self)
 Add to MetaCart
(Show Context)
This paper aims to present a review of recent as well as classic image registration methods. Image registration is the process of overlaying images (two or more) of the same scene taken at different times, from different viewpoints, and/or by different sensors. The registration geometrically align two images (the reference and sensed images). The reviewed approaches are classified according to their nature (areabased and featurebased) and according to four basic steps of image registration procedure: feature detection, feature matching, mapping function design, and image transformation and resampling. Main contributions, advantages, and drawbacks of the methods are mentioned in the paper. Problematic issues of image registration and outlook for the future research are discussed too. The major goal of the paper is to provide a comprehensive reference source for the researchers involved in image registration, regardless of particular application areas.
A Theory of Networks for Approximation and Learning
 Laboratory, Massachusetts Institute of Technology
, 1989
"... Learning an inputoutput mapping from a set of examples, of the type that many neural networks have been constructed to perform, can be regarded as synthesizing an approximation of a multidimensional function, that is solving the problem of hypersurface reconstruction. From this point of view, t ..."
Abstract

Cited by 237 (25 self)
 Add to MetaCart
Learning an inputoutput mapping from a set of examples, of the type that many neural networks have been constructed to perform, can be regarded as synthesizing an approximation of a multidimensional function, that is solving the problem of hypersurface reconstruction. From this point of view, this form of learning is closely related to classical approximation techniques, such as generalized splines and regularization theory. This paper considers the problems of an exact representation and, in more detail, of the approximation of linear and nonlinear mappings in terms of simpler functions of fewer variables. Kolmogorov's theorem concerning the representation of functions of several variables in terms of functions of one variable turns out to be almost irrelevant in the context of networks for learning. Wedevelop a theoretical framework for approximation based on regularization techniques that leads to a class of threelayer networks that we call Generalized Radial Basis Functions (GRBF), since they are mathematically related to the wellknown Radial Basis Functions, mainly used for strict interpolation tasks. GRBF networks are not only equivalent to generalized splines, but are also closely related to pattern recognition methods suchasParzen windows and potential functions and to several neural network algorithms, suchas Kanerva's associative memory,backpropagation and Kohonen's topology preserving map. They also haveaninteresting interpretation in terms of prototypes that are synthesized and optimally combined during the learning stage. The paper introduces several extensions and applications of the technique and discusses intriguing analogies with neurobiological data.
Interpolation by Regularized Spline with Tension: II. Application to Terrain Modeling and Surface Geometry Analysis
, 1993
"... A general approach to the computation of basic topographic parameters independent of the spatial distribution of given elevation data is developed. The approach is based on an interpolation function with regular first and second order derivatives and on application of basic principles of differentia ..."
Abstract

Cited by 98 (7 self)
 Add to MetaCart
A general approach to the computation of basic topographic parameters independent of the spatial distribution of given elevation data is developed. The approach is based on an interpolation function with regular first and second order derivatives and on application of basic principles of differential geometry. General equations for computation of profile, plan, and tangential curvatures are derived. A new algorithm for construction of slope curves is developed using a combined grid and vector approach. Resulting slope curves better fulfil the condition of orthogonality to contours than standard grid algorithms. Presented methods are applied to topographic analysis of a watershed in central Illinois.
An Algorithmic Overview of Surface Registration . . .
 MEDICAL IMAGE ANALYSIS
, 2000
"... This paper presents a literature survey of automatic 3D surface registration techniques emphasizing the mathematical and algorithmic underpinnings of the subject. The relevance of surface registration to medical imaging is that there is much useful anatomical information in the form of collected ..."
Abstract

Cited by 91 (1 self)
 Add to MetaCart
This paper presents a literature survey of automatic 3D surface registration techniques emphasizing the mathematical and algorithmic underpinnings of the subject. The relevance of surface registration to medical imaging is that there is much useful anatomical information in the form of collected surface points which originate from complimentary modalities and which must be reconciled. Surface registration
Multistep scattered data interpolation using compactly supported radial basis functions
 J. Comp. Appl. Math
, 1996
"... Abstract. A hierarchical scheme is presented for smoothly interpolating scattered data with radial basis functions of compact support. A nested sequence of subsets of the data is computed efficiently using successive Delaunay triangulations. The scale of the basis function at each level is determine ..."
Abstract

Cited by 80 (12 self)
 Add to MetaCart
(Show Context)
Abstract. A hierarchical scheme is presented for smoothly interpolating scattered data with radial basis functions of compact support. A nested sequence of subsets of the data is computed efficiently using successive Delaunay triangulations. The scale of the basis function at each level is determined from the current density of the points using information from the triangulation. The method is rotationally invariant and has good reproduction properties. Moreover the solution can be calculated and evaluated in acceptable computing time. During the last two decades radial basis functions have become a well established tool for multivariate interpolation of both scattered and gridded data; see [2,7,8,22,25] for some surveys. The major part
Landmarkbased elastic registration using approximating thinplate splines
 IEEE Trans. Med. Imag
, 2001
"... Abstract—We consider elastic image registration based on a set of corresponding anatomical point landmarks and approximating thinplate splines. This approach is an extension of the original interpolating thinplate spline approach and allows to take into account landmark localization errors. The ..."
Abstract

Cited by 69 (0 self)
 Add to MetaCart
(Show Context)
Abstract—We consider elastic image registration based on a set of corresponding anatomical point landmarks and approximating thinplate splines. This approach is an extension of the original interpolating thinplate spline approach and allows to take into account landmark localization errors. The extension is important for clinical applications since landmark extraction is always prone to error. Our approach is based on a minimizing functional and can cope with isotropic as well as anisotropic landmark errors. In particular, in the latter case it is possible to include different types of landmarks, e.g., unique point landmarks as well as arbitrary edge points. Also, the scheme is general with respect to the image dimension and the order of smoothness of the underlying functional. Optimal affine transformations as well as interpolating thinplate splines are special cases of this scheme. To localize landmarks we use a semiautomatic approach which is based on threedimensional (3D) differential operators. Experimental results are presented for two–dimensional as well as 3D tomographic images of the human brain. Index Terms—Anatomical landmarks, image matching, segmentation, splines. I.
Pointbased elastic registration of medical image data using approximating thinplate splines
, 1996
"... Abstract. We consider elastic registration of medical image data based on thinplate splines using a set of corresponding anatomical point landmarks. Previous work on this topic has concentrated on using interpolation schemes. Such schemes force the corresponding landmarks to exactly match each othe ..."
Abstract

Cited by 64 (25 self)
 Add to MetaCart
(Show Context)
Abstract. We consider elastic registration of medical image data based on thinplate splines using a set of corresponding anatomical point landmarks. Previous work on this topic has concentrated on using interpolation schemes. Such schemes force the corresponding landmarks to exactly match each other and assume that the landmark positions are known exactly. However, in real applications the localization of landmarks is always prone to some error. Therefore, to take into account these localization errors, we have investigated the application of an approximation scheme which is based on regularization theory. This approach generally leads to a more accurate and robust registration result. In particular, outliers do not disturb the registration result as much asisthecase with an interpolation scheme. Also, it is possible to individually weight the landmarks according to their localization uncertainty. In addition to this study, we report on investigations into semiautomatic extraction of anatomical point landmarks. 1
A review of geometric transformations for nonrigid body registration
 IEEE TRANSACTIONS ON MEDICAL IMAGING
, 2007
"... ..."