Likelihood functions and confidence bounds for total-least-squares problems

This paper addresses the derivation of likelihood functions and confidence bounds for problems involving over-determined linear systems with noise in all measurements, often referred to as total-least-squares (TLS). It has been shown previously that TLS provides maximum likelihood estimates. But rather than being a function solely of the variables of interest, the associated likelihood functions increase in dimensionality with the number of equations. This has made it difficult to derive suitable confidence bounds, and impractical to use these probability functions with Bayesian belief propagation or Bayesian tracking. This paper derives likelihood functions that are defined only on the parameters of interest. This has two main advantages. First, the likelihood functions are much easier to use within a Bayesian framework; and second it is straightforward to obtain a reliable confidence bound on the estimates. We demonstrate the accuracy of our confidence bound in relation to others that have been proposed. Also, we use our theoretical results to obtain likelihood functions for estimating the direction of 3D camera translation.

[1]  L. Gleser Estimation in a Multivariate "Errors in Variables" Regression Model: Large Sample Results , 1981 .

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

[3]  Y. J. Tejwani,et al.  Robot vision , 1989, IEEE International Symposium on Circuits and Systems,.

[4]  Stephen F. Gull,et al.  Bayesian Data Analysis: Straight-line fitting , 1989 .

[5]  Sabine Van Huffel,et al.  Total least squares problem - computational aspects and analysis , 1991, Frontiers in applied mathematics.

[6]  A. Jepson,et al.  A fast subspace algorithm for recovering rigid motion , 1991, Proceedings of the IEEE Workshop on Visual Motion.

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

[8]  R. Bracewell Two-dimensional imaging , 1994 .

[9]  Allan D. Jepson,et al.  Linear subspace methods for recovering translational direction , 1994 .

[10]  W. Clem Karl,et al.  Efficient multiscale regularization with applications to the computation of optical flow , 1994, IEEE Trans. Image Process..

[11]  Kenichi Kanatani,et al.  Optimal Conic Fitting and Reliability Evaluation , 1996 .

[12]  Naoya Ohta Optical Flow Detection Using a General Noise Model for Gradient Constraint , 1997, CAIP.

[13]  Victor Solo,et al.  Errors-in-variables modelling in optical flow problems , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[14]  David Suter,et al.  Robust Total least Squares Based Optic Flow Computation , 1998, ACCV.

[15]  W. James MacLean Removal of translation bias when using subspace methods , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[16]  Oscar Nestares,et al.  Probabilistic multichannel optical flow analysis based on a multipurpose visual representation of image sequences , 1999, Electronic Imaging.