DMCA
2002, ‘A New Algorithm for Graph Matching with Application to Content-Based Image Retrieval (2002)
| Venue: | In: Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition |
| Citations: | 7 - 0 self |
BibTeX
@INPROCEEDINGS{Hlaoui022002,‘a,
author = {Adel Hlaoui and Shengrui Wang},
title = {2002, ‘A New Algorithm for Graph Matching with Application to Content-Based Image Retrieval},
booktitle = {In: Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition},
year = {2002},
pages = {291--300}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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. 1
