Control point assessment for image registration

Presents several extensions of the basic control point assessment (CPA) algorithm. First, we compare CPA to standard corner detection algorithms and then turn to the question of selecting control points with adequate dispersion, since this is crucial for accurate registration. Two selection methods are proposed. The first consists of clustering the control points via the Lloyd algorithm (S.P. Lloyd, 1957, 1982) followed by selecting the dominant control point in each cluster. This "gold standard" approach produces excellent dispersion but is costly in terms of computational effort. The second selection method consists of subdividing the image and then selecting dominant control points in each subdivision. This is extremely fast and produces results comparable to the Lloyd selection method. The paper concludes with a discussion of how least-squares operator norm information can be coupled with anisotropic diffusion to produce smoothed images without corner degradation.

[1]  Murray Eden,et al.  Linear and Rank Adaptive Filters for Picture Processing , 1996 .

[2]  Jean-Michel Morel,et al.  Variational methods in image segmentation , 1995 .

[3]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[4]  L. Rudin,et al.  Feature-oriented image enhancement using shock filters , 1990 .

[5]  Edward H. Adelson,et al.  Probability distributions of optical flow , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[6]  B. S. Manjunath,et al.  Peer group filtering and perceptual color image quantization , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[7]  Charles S. Kenney,et al.  Applied partial differential variational techniques , 1997, Proceedings of International Conference on Image Processing.

[8]  Stanley Osher,et al.  Shocks and other nonlinear filtering applied to image processing , 1991, Optics & Photonics.

[9]  B. S. Manjunath,et al.  Variational image segmentation using boundary functions , 1998, IEEE Trans. Image Process..

[10]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[11]  Charles Kenney,et al.  Registration and fusion of multispectral images using a new control point assessment method derived from optical flow ideas , 1999, Defense, Security, and Sensing.

[12]  William Equitz,et al.  A new vector quantization clustering algorithm , 1989, IEEE Trans. Acoust. Speech Signal Process..

[13]  Carlo Tomasi,et al.  Good features to track , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[14]  Takeo Kanade,et al.  An Iterative Image Registration Technique with an Application to Stereo Vision , 1981, IJCAI.

[15]  Jitendra Malik,et al.  Scale-Space and Edge Detection Using Anisotropic Diffusion , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Lisa M. Brown,et al.  A survey of image registration techniques , 1992, CSUR.

[17]  Berthold K. P. Horn,et al.  Determining Optical Flow , 1981, Other Conferences.

[18]  P. Anandan,et al.  Hierarchical Model-Based Motion Estimation , 1992, ECCV.

[19]  W. Equitz.  Fast algorithms for vector quantization picture coding , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[20]  Robert M. Gray,et al.  An Algorithm for Vector Quantizer Design , 1980, IEEE Trans. Commun..

[21]  Emanuele Trucco,et al.  Computer and Robot Vision , 1995 .

[22]  D. Mumford,et al.  Optimal approximations by piecewise smooth functions and associated variational problems , 1989 .

[23]  Linda G. Shapiro,et al.  Computer and Robot Vision , 1991 .