Recursive estimation with implicit constraints

  • Authors:
  • Richard Steffen;Christian Beder

  • Affiliations:
  • Department of Photogrammetry, Bonn University, Germany;Computer Science Department, Kiel University, Germany

  • Venue:
  • Proceedings of the 29th DAGM conference on Pattern recognition
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recursive estimation or Kalman filtering usually relies on explicit model functions, that directly and explicitly describe the effect of the parameters on the observations. However, many problems in computer vision, including all those resulting in homogeneous equation systems, are easier described using implicit constraints between the observations and the parameters. By implicit we mean, that the constraints are given by equations, that are not easily solvable for the observation vector. We present a framework, that allows to incorporate such implicit constraints as measurement equations into a Kalman filter. The algorithm may be used as a black-box, simplifying the process of specifying suitable measurement equations for many problems. As a byproduct, the possibility of specifying model equations non-explicitly, some non-linearities may be avoided and better results can be achieved for certain problems.