3-D object recognition using bipartite matching embedded in discrete relaxation
Authors:
- W.-Y. KimWKW.-Y. Kim
- A.C. KakAKA.C. Kak
- 1 March 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 13 (3) , 224-251
Abstract
No abstract availableThis publication has 32 references indexed in Scilit:
- On the recognition of parameterized 2D objectsInternational Journal of Computer Vision, 1989
- Model-based recognition using 3D shape aloneComputer Vision, Graphics, and Image Processing, 1987
- Three-dimensional object recognition from single two-dimensional imagesArtificial Intelligence, 1987
- The Representation, Recognition, and Locating of 3-D ObjectsThe International Journal of Robotics Research, 1986
- Efficient algorithms for finding maximum matching in graphsACM Computing Surveys, 1986
- Structural Descriptions and Inexact MatchingIEEE Transactions on Pattern Analysis and Machine Intelligence, 1981
- Representations for Rigid Solids: Theory, Methods, and SystemsACM Computing Surveys, 1980
- Scene Labeling by Relaxation OperationsIEEE Transactions on Systems, Man, and Cybernetics, 1976
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955