Graph edit distance from spectral seriation

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

Abstract

Metadata

Authors/Creators:
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
Dates:
  • Published: March 2005
Institution: The University of York
Academic Units: The University of York > Computer Science (York)
The University of York > Faculty of Sciences (York) > Computer Science (York)
Depositing User: Repository Officer
Date Deposited: 21 Feb 2007
Last Modified: 28 May 2017 00:15
Published Version: http://dx.doi.org/10.1109/TPAMI.2005.56
Status: Published
Refereed: Yes
Identification Number: https://doi.org/10.1109/TPAMI.2005.56

Download

Filename: hancocker9.pdf

Description: hancocker9.pdf

Share / Export

Statistics