A New Algorithm for Graph Matching with Application to Content-Based Image Retrieval

Authors:
Adel Hlaoui;Shengrui Wang
Affiliations:
-;-
Venue:
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Year:
2002

Citing 5
Cited 2

A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Efficient Algorithm for Graph Isomorphism

Journal of the ACM (JACM)
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
On Median Graphs: Properties, Algorithms, and Applications

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Genetic-based search for error-correcting graph isomorphism

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

PatchNet: a patch-based image representation for interactive library-driven image editing

ACM Transactions on Graphics (TOG)
A new proposal for graph-based image classification using frequent approximate subgraphs

Pattern Recognition

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we propose a new efficient algorithm for the inexact matching problem. The algorithm decomposes the matching process into K phases, each exploiting a different part of solution space. With most plausible parts being searched first, only a small number of phases is required in order to produce very good matching (most of them optimal). A Content-based image retrieval application using the new matching algorithm is described in the second part of this paper.