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.
CITATION STYLE
Hlaoui, A., & Wang, S. (2002). A new algorithm for graph matching with application to content-based image retrieval. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2396, pp. 291–300). Springer Verlag. https://doi.org/10.1007/3-540-70659-3_30
Mendeley helps you to discover research relevant for your work.