Feature correspondence: A markov chain monte carlo approach.

F. Dellaert, S. Seitz, S. Thrun, and C. Thorpe.

When trying to recover 3D structure from a set of images, the most difficult problem is establishing the correspondence between the measurements. Most existing approaches assume that features can be tracked across frames, whereas methods that exploit rigidity constraints to facilitate matching do so only under restricted camera motion. In this paper we propose a Bayesian approach that avoids the brittleness associated with singling out one "best" correspondence, and instead consider the distribution over all possible correspondences. We treat both a fully Bayesian approach that yields a posterior distribution, and a MAP approach that makes use of EM to maximize this posterior. We show how Markov chain Monte Carlo methods can be used to implement these techniques in practice, and present experimental results on real data.

The full paper is available in PDF and gzipped Postscript

@INPROCEEDINGS{Dellaert00b,
  AUTHOR	= {Dellaert, F. and Seitz, S. and Thrun, S. and Thorpe, C.},
  TITLE		= {Feature Correspondence: A Markov Chain Monte Carlo Approach},
  booktitle = {Advances in Neural Information Processing Systems 13},
  year      = {2001},
  editor    = {T.K.~Leen and T.~Dietterich and B.~Van Roy},
  publisher = {MIT Press}
}