Sigma-Delta Stable Matching for Computational Stereopsis ( Version 1 . 5 ) Radim Šára

@inproceedings{2001SigmaDeltaSM,
  title={Sigma-Delta Stable Matching for Computational Stereopsis ( Version 1 . 5 ) Radim {\vS}{\'a}ra},
  author={},
  year={2001}
}
  • Published 2001
In this paper we explore stability principle applied to the problem of stereoscopic matching. Stability is based on competition among candidate matches. It is not an optimality condition, it is a matching property, much like ordering or uniqueness. Unlike the latter two it guarantees the existence of a unique solution to a matching problem. Very roughly speaking, stable matching is one in which each selected match dominates its potential competitors in some property. Great versatility is… CONTINUE READING

Similar Papers

Loading similar papers…