University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Unified graph matching in Euclidean spaces and applications to image comparison and retrieval

UNSPECIFIED (2011) Unified graph matching in Euclidean spaces and applications to image comparison and retrieval US 2011/0082670.

Full text not available from this repository.

Abstract

A first graph embedded in a Euclidean space is modeled by a globally rigid first model graph that includes all vertices and edges of the first graph and has a preselected maximum clique size. The modeling is configured to maintain the preselected maximum clique size by employing an edge adding process that replicates a vertex of a vertex pair connected by an edge. A mapping between vertices of the first graph and vertices of a second graph is computed by optimizing a mapping between vertices of the first model graph and vertices of the second graph.

Item Type: Patent
Authors :
NameEmailORCID
McAuley, JUNSPECIFIEDUNSPECIFIED
de Campos, TEt.decampos@surrey.ac.ukUNSPECIFIED
Date : 7 April 2011
Identification Number : US 2011/0082670
Uncontrolled Keywords : Graph Matching, Computer Vision, Structured Learning
Depositing User : Symplectic Elements
Date Deposited : 17 May 2017 12:12
Last Modified : 17 May 2017 15:02
URI: http://epubs.surrey.ac.uk/id/eprint/834443

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800