Correspondence of 2-D projections by bipartite matching

Paul M. Griffin

doi:10.1016/0167-8655(89)90065-2

Correspondence of 2-D projections by bipartite matching

Paul M. Griffin

Marcus Department of Industrial and Manufacturing Engineering

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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	https://doi.org/10.1016/0167-8655(89)90065-2
State	Published - Jun 1989

All Science Journal Classification (ASJC) codes

Software
Signal Processing
Computer Vision and Pattern Recognition
Artificial Intelligence

Access to Document

10.1016/0167-8655(89)90065-2

Cite this

@article{2a37dccab8d042ef88e07060429d0481,

title = "Correspondence of 2-D projections by bipartite matching",

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.",

author = "Griffin, {Paul M.}",

year = "1989",

month = jun,

doi = "10.1016/0167-8655(89)90065-2",

language = "English (US)",

volume = "9",

pages = "361--366",

journal = "Pattern Recognition Letters",

issn = "0167-8655",

publisher = "Elsevier",

number = "5",

}

TY - JOUR

T1 - Correspondence of 2-D projections by bipartite matching

AU - Griffin, Paul M.

PY - 1989/6

Y1 - 1989/6

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

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

UR - http://www.scopus.com/inward/record.url?scp=38249022419&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38249022419&partnerID=8YFLogxK

U2 - 10.1016/0167-8655(89)90065-2

DO - 10.1016/0167-8655(89)90065-2

M3 - Article

AN - SCOPUS:38249022419

SN - 0167-8655

VL - 9

SP - 361

EP - 366

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

IS - 5

ER -

Correspondence of 2-D projections by bipartite matching

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this