A PCA approach for fast retrieval of structural patterns inattributed graphs

Authors:
Lei Xu;I. King
Affiliations:
Dept. of Comput. Sci. & Eng., Chinese Univ. of Hong Kong, Shatin;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Year:
2001

Citing 0
Cited 12

A comparative study on attributed relational gra matching algorithms for perceptual 3-D shape descriptor in MPEG-7

Proceedings of the 12th annual ACM international conference on Multimedia
Fundamental study: A concise functional neural network computing the largest modulus eigenvalues and their corresponding eigenvectors of a real skew matrix

Theoretical Computer Science
A recurrent neural network computing the largest imaginary or real part of eigenvalues of real matrices

Computers & Mathematics with Applications
Structural Object Recognition Using Entropy Correspondence Measure of Line Features

IEICE - Transactions on Information and Systems
Fuzzy lattice reasoning (FLR) type neural computation for weighted graph partitioning

Neurocomputing
Graph Matching Based on Node Signatures

GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Attributed relational graph matching based on the nested assignment structure

Pattern Recognition
Solving inexact graph isomorphism problems using neural networks

Neurocomputing
Machine learning problems from optimization perspective

Journal of Global Optimization
Synthesis of median spectral graph

IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
High efficiency and quality: large graphs matching

The VLDB Journal — The International Journal on Very Large Data Bases
A graph matching algorithm based on concavely regularized convex relaxation

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An attributed graph (AG) is a useful data structure for representing complex patterns in a wide range of applications such as computer vision, image database retrieval, and other knowledge representation tasks where similar or exact corresponding structural patterns must be found. Existing methods for attributed graph matching (AGM) often suffer from the combinatorial problem whereby the execution cost for finding an exact or similar match is exponentially related to the number of nodes the AG contains. The square matching error of two AGs subject to permutations is approximately relaxed to a square matching error of two AGs subject to orthogonal transformations. Hence, the principal component analysis (PCA) algorithm can be used for the fast computation of the approximate matching error, with a considerably reduced execution complexity. Experiments demonstrate that this method works well and is robust against noise and other simple types of transformations