Graph edit distance from spectral seriation

Robles-Kelly, A and Hancock, E R (2005) Graph edit distance from spectral seriation. IEEE Transactions on Pattern Analysis and Machine Intelligence. pp. 365-378. ISSN 0162-8828



Copyright, Publisher and Additional Information: Copyright © 2005 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: graph edit distance,graph seriation,maximum a posteriori probability (MAP),graph-spectral methods,OBJECT RECOGNITION,ALGORITHM,SHAPE,RELAXATION
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: 24 Oct 2016 17:37
Published Version:
Status: Published
Refereed: Yes


Filename: hancocker9.pdf

Description: hancocker9.pdf

Share / Export