Abstract
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 language | English (US) |
|---|---|
| Pages (from-to) | 361-366 |
| Number of pages | 6 |
| Journal | Pattern Recognition Letters |
| Volume | 9 |
| Issue number | 5 |
| DOIs | |
| State | Published - Jun 1989 |
All Science Journal Classification (ASJC) codes
- Software
- Signal Processing
- Computer Vision and Pattern Recognition
- Artificial Intelligence
Fingerprint
Dive into the research topics of 'Correspondence of 2-D projections by bipartite matching'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver