We have witnessed great interest and a wealth of promise in content-based image retrieval
as an emerging technology. While the last decade laid foundation to such promise, it also …

We present a line matching algorithm which utilizes both the local appearance of lines and
their geometric attributes. To overcome the problem of segment fragmentation and …

The field of pattern recognition is usually subdivided into the statistical and the structural
approach. Structural pattern recognition allows one to use powerful and flexible …

Presents a review of 200 references in content-based image retrieval. The paper starts with
discussing the working conditions of content-based retrieval: patterns of use, types of …

A recent paper posed the question:" Graph Matching: What are we really talking about?". Far
from providing a definite answer to that question, in this paper we will try to characterize the …

Inexact graph matching has been one of the significant research foci in the area of pattern
analysis. As an important way to measure the similarity between pairwise graphs error …

In recent years the use of graph based representation has gained popularity in pattern
recognition and machine learning. As a matter of fact, object representation by means of …

Graph data have become ubiquitous and manipulating them based on similarity is essential
for many applications. Graph edit distance is one of the most widely accepted measures to …

As a fundamental problem in pattern recognition, graph matching has applications in a
variety of fields, from computer vision to computational biology. In graph matching, patterns …

This paper describes an efficient algorithm for inexact graph matching. The method is purely
structural, that is, it uses only the edge or connectivity structure of the graph and does not …