Graph matching with a dual-step EM algorithm

Cross, A.D.J. and Hancock, E.R. orcid.org/0000-0003-4496-2028 (1998) Graph matching with a dual-step EM algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence. pp. 1236-1253. ISSN 0162-8828

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: Copyright © 1998 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords: EM algorithm,graph-matching,affine geometry,perspective geometry,relational constraints,Delaunay graph,discrete relaxation,DELAUNAY TRIANGULATION,WEAK-PERSPECTIVE,SHAPE MODELS,POINT,POSE,RECOGNITION,IMAGES,PARAPERSPECTIVE,REPRESENTATION,PATTERNS
Institution: The University of York
Academic Units: The University of York > Computer Science (York)
Depositing User: Repository Officer
Date Deposited: 21 Feb 2007
Last Modified: 13 Nov 2016 04:37
Published Version: http://dx.doi.org/10.1109/34.730557
Status: Published
Refereed: Yes

Download

Filename: hancocker2.pdf

Description: hancocker2.pdf

Share / Export