Fundamental performance limits in image registration

The task of image registration is fundamental in image processing. It often is a critical preprocessing step to many modern image processing and computer vision tasks, and many algorithms and techniques have been proposed to address the registration problem. Often, the performances of these techniques have been presented using a variety of relative measures comparing different estimators, leaving open the critical question of overall optimality. In this paper, we present the fundamental performance limits for the problem of image registration as derived from the Cramer-Rao inequality. We compare the experimental performance of several popular methods with respect to this performance bound, and explain the fundamental tradeoff between variance and bias inherent to the problem of image registration. In particular, we derive and explore the bias of the popular gradient-based estimator showing how widely used multiscale methods for improving performance can be explained with this bias expression. Finally, we present experimental simulations showing the general rule-of-thumb performance limits for gradient-based image registration techniques.

[1]  Hans-Hellmut Nagel,et al.  Bias-corrected optical flow estimation for road vehicle tracking , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

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

[3]  Peyman Milanfar,et al.  Fast Local and Global Projection-Based Methods for Affine Motion Estimation , 2004, Journal of Mathematical Imaging and Vision.

[4]  M. Orchard,et al.  Subpixel registration of images , 1999, Conference Record of the Thirty-Third Asilomar Conference on Signals, Systems, and Computers (Cat. No.CH37020).

[5]  Rudy Moddemeijer.  On the determination of the position of extrema of sampled correlators , 1991, IEEE Trans. Signal Process..

[6]  S. Kay.  Fundamentals of statistical signal processing: estimation theory , 1993 .

[7]  W. Walker,et al.  A fundamental limit on the performance of correlation based phase correction and flow estimation techniques , 1994, IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control.

[8]  Joseph K. Kearney,et al.  Optical Flow Estimation: An Error Analysis of Gradient-Based Methods with Local Optimization , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  D J Heeger,et al.  Robust multiresolution alignment of MRI brain volumes , 2000, Magnetic resonance in medicine.

[10]  Berthold K. P. Horn.  Robot vision , 1986, MIT electrical engineering and computer science series.

[11]  S. R. Dooley,et al.  Comparison of discrete subsample time delay estimation methods applied to narrowband signals , 1998 .

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

[13]  P. Milanfar,et al.  Efficiency and accuracy tradeoffs in using projections for motion estimation , 2001, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).

[14]  Steven P. Auerbach,et al.  Cramer-Rao bound on image registration accuracy , 1997, Optics & Photonics.

[15]  Gaetano Scarano,et al.  Discrete time techniques for time delay estimation , 1993, IEEE Trans. Signal Process..

[16]  D J Field,et al.  Relations between the statistics of natural images and the response properties of cortical cells. , 1987, Journal of the Optical Society of America. A, Optics and image science.

[17]  Yiannis Aloimonos,et al.  The Statistics of Optical Flow , 2001, Comput. Vis. Image Underst..

[18]  D. M. Freeman,et al.  Statistics of subpixel registration algorithms based on spatiotemporal gradients or block matching , 1998 .

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

[20]  Qi Tian,et al.  Algorithms for subpixel registration , 1986 .

[21]  David J. Fleet,et al.  Performance of optical flow techniques , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[22]  V. N. Dvornychenko,et al.  Bounds on (Deterministic) Correlation Functions with Application to Registration , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[23]  J. Brandt.  Analysis of bias in gradient-based optical-flow estimation , 1994, Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers.

[24]  Arye Nehorai,et al.  Performance bounds for estimating vector systems , 2000, IEEE Trans. Signal Process..