Rationalising the Renormalisation Method of Kanatani

The renormalisation technique of Kanatani is intended to iteratively minimise a cost function of a certain form while avoiding systematic bias inherent in the common method of minimisation due to Sampson. Within the computer vision community, the technique has generally proven difficult to absorb. This work presents an alternative derivation of the technique, and places it in the context of other approaches. We first show that the minimiser of the cost function must satisfy a special variational equation. A Newton-like, fundamental numerical scheme is presented with the property that its theoretical limit coincides with the minimiser. Standard statistical techniques are then employed to derive afresh several renormalisation schemes. The fundamental scheme proves pivotal in the rationalising of the renormalisation and other schemes, and enables us to show that the renormalisation schemes do not have as their theoretical limit the desired minimiser. The various minimisation schemes are finally subjected to a comparative performance analysis under controlled conditions.

[1]  W. Gander,et al.  Least-squares fitting of circles and ellipses , 1994 .

[2]  Geoff A. W. West,et al.  Nonparametric Segmentation of Curves into Various Representations , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Tim J. Ellis,et al.  Ellipse detection and matching with uncertainty , 1992, Image Vis. Comput..

[4]  F. Bookstein Fitting conic sections to scattered data , 1979 .

[5]  Olivier D. Faugeras,et al.  Motion analysis with a camera with unknown, and possibly varying intrinsic parameters , 1995, Proceedings of IEEE International Conference on Computer Vision.

[6]  B. Triggs A New Approach to Geometric Fitting , 1996 .

[7]  Andrew W. Fitzgibbon,et al.  Direct Least Square Fitting of Ellipses , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Wojciech Chojnacki,et al.  Fitting surfaces to data with covariance information: Fundamental methods applicable to computer vision , 1999 .

[9]  Zhengyou Zhang,et al.  On the Optimization Criteria Used in Two-View Motion Analysis , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Rudolf Mester,et al.  The Role of Total Least Squares in Motion Analysis , 1998, ECCV.

[11]  S. P. Mudur,et al.  Three-dimensional computer vision: a geometric viewpoint , 1993 .

[12]  Gabriel Taubin,et al.  Estimation of Planar Curves, Surfaces, and Nonplanar Space Curves Defined by Implicit Equations with Applications to Edge and Range Image Segmentation , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Philip H. S. Torr,et al.  The Development and Comparison of Robust Methods for Estimating the Fundamental Matrix , 1997, International Journal of Computer Vision.

[14]  Olivier D. Faugeras,et al.  The fundamental matrix: Theory, algorithms, and stability analysis , 2004, International Journal of Computer Vision.

[15]  Bill Triggs Optimal Estimation of Matching Constraints , 1998, SMILE.

[16]  Kenichi Kanatani,et al.  Statistical optimization for geometric computation - theory and practice , 1996, Machine intelligence and pattern recognition.

[17]  Wojciech Chojnacki,et al.  Determining the egomotion of an uncalibrated camera from instantaneous optical flow , 1997 .

[18]  Zhengyou Zhang,et al.  Parameter estimation techniques: a tutorial with application to conic fitting , 1997, Image Vis. Comput..

[19]  Kenichi Kanatani,et al.  Statistical Bias of Conic Fitting and Renormalization , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Paul L. Rosin A note on the least squares fitting of ellipses , 1993, Pattern Recognit. Lett..

[21]  Peter Meer,et al.  Heteroscedastic Regression in Computer Vision: Problems with Bilinear Constraint , 2000, International Journal of Computer Vision.

[22]  Janet E. Rogers,et al.  Orthogonal Distance Regression ∗ , 2009 .

[23]  John Porrill,et al.  Fitting ellipses and predicting confidence envelopes using a bias corrected Kalman filter , 1990, Image Vis. Comput..

[24]  金谷 健一 Statistical optimization for geometric computation : theory and practice , 2005 .

[25]  PAUL D. SAMPSON,et al.  Fitting conic sections to "very scattered" data: An iterative refinement of the bookstein algorithm , 1982, Comput. Graph. Image Process..

[26]  Andrew W. Fitzgibbon,et al.  A Buyer's Guide to Conic Fitting , 1995, BMVC.

[27]  John Porrill Fitting ellipses and predicting confidence envelopes using a bias corrected Kalman filter , 1990, Image Vis. Comput..

[28]  A. Satorra,et al.  Measurement Error Models , 1988 .