论文信息 - Piecewise linear mapping functions for image registration

Piecewise linear mapping functions for image registration

Abstract A new approach to determination of mapping functions for registration of digital images is presented. Given the coordinates of corresponding control points in two images of the same scene, first the images are divided into triangular regions by triangulating the control points. Then a linear mapping function is obtained by registering each pair of corresponding triangular regions in the images. The overall mapping function is then obtained by piecing together the linear mapping functions.

A. Ardeshir Goshtasby | Ardeshir Goshtasby

[1] Charles T. Zahn,et al. An Algorithm for Noisy Template Matching , 1974, IFIP Congress.

[2] Robin Sibson,et al. Computing Dirichlet Tessellations in the Plane , 1978, Comput. J..

[3] Ardeshir Goshtasby,et al. A Region-Based Approach to Digital Image Registration with Subpixel Accuracy , 1986, IEEE Transactions on Geoscience and Remote Sensing.

[4] Azriel Rosenfeld,et al. Point pattern matching by relaxation , 1980, Pattern Recognit..

[5] D. Steiner,et al. Geometrical referencing of Landsat images by affine transformation and overlaying of map data , 1977 .

[6] C. Lawson. Software for C1 Surface Interpolation , 1977 .

[7] Peter Van Wie,et al. Purdue e-Pubs , 2013 .

[8] A. Ardeshir Goshtasby,et al. Point pattern matching using convex hull edges , 1985, IEEE Transactions on Systems, Man, and Cybernetics.

[9] C. D. McGillem,et al. Machine processing of remotely sensed data , 1975 .

[10] M. L. Nack. Rectification and Registration of Digital Images and the Effect of Cloud Detection , 1977 .

[11] George C. Stockman,et al. Matching Images to Models for Registration and Object Detection via Clustering , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.