Correspondence of 2-D projections by bipartite matching

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


A method is presented to determine the correspondence between 2-D projections of a 3-D scene. The problem is formulated as a maximum cardinality with minimum weight matching of a bipartite graph and is solved by a network flow algorithm.

Original languageEnglish (US)
Pages (from-to)361-366
Number of pages6
JournalPattern Recognition Letters
Issue number5
StatePublished - Jun 1989

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Cite this