Feature Correspondence: A Markov Chain Monte Carlo Approach

Frank Dellaert, Steven Seitz, Chuck Thorpe, and Sebastian Thrun
Advances in Neural Information Processing Systems 13 (NIPS 2000), 2001.


Download
  • Adobe portable document format (pdf) (191KB)
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract
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.

Notes

Text Reference
Frank Dellaert, Steven Seitz, Chuck Thorpe, and Sebastian Thrun, "Feature Correspondence: A Markov Chain Monte Carlo Approach," Advances in Neural Information Processing Systems 13 (NIPS 2000), 2001.

BibTeX Reference
@inproceedings{Dellaert_2001_3429,
   author = "Frank Dellaert and Steven Seitz and Chuck Thorpe and Sebastian Thrun",
   title = "Feature Correspondence: A Markov Chain Monte Carlo Approach",
   booktitle = "Advances in Neural Information Processing Systems 13 (NIPS 2000)",
   year = "2001",
}