Sciweavers

Share
CVPR
2000
IEEE

Likelihood Functions and Confidence Bounds for Total-Least-Squares Problems

8 years 6 months ago
Likelihood Functions and Confidence Bounds for Total-Least-Squares Problems
This paper addresses the derivation of likelihood functions and confidence bounds for problems involving overdetermined 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 tha...
Oscar Nestares, David J. Fleet, David J. Heeger
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where CVPR
Authors Oscar Nestares, David J. Fleet, David J. Heeger
Comments (0)
books