Graph matching Research Papers - Academia.edu (original) (raw)

Graphs are widely used to model complicated structures and link them with each other. Some of such structures are XML documents, social networks, and computer networks. Information and model extraction from graph databases is a graph... more

Graphs are widely used to model complicated structures and link them with each other. Some of such structures are XML documents, social networks, and computer networks. Information and model extraction from graph databases is a graph mining process. Efficient query search in graph databases, known as query processing, is one of the heated debates in the field of graph mining. One of the query processing techniques is sequential search over the whole dataset and isomorphism test on all sub-graphs in the database, which is not an optimal technique as to response time and storage. This problem brought in the issues of indexing graph databases to improve query processing performance. As the method implies, part of the database where the answer is expected to be found there is pruned and the number of needed isomorphism tests decreases. It might not be easy to compare the methods and techniques of graph query techniques as different techniques have different objectives. For instance, similarity search techniques reduce query time, while they cannot compete with exact matching techniques as to accuracy and vice versa. Input data volume might be also effective on query time as with immense datasets, similarity search techniques are more preferred than exact matching techniques. The present study is a survey of graph query processing techniques with emphasis on similarity search and exact matching.

We propose a new approach for stereo matching in Autonomous Mobile Robot applications. In this framework an accurate but slow reconstruction of the 3D scene is not needed; rather, it is more important to have a fast localization of the... more

We propose a new approach for stereo matching in Autonomous Mobile Robot applications. In this framework an accurate but slow reconstruction of the 3D scene is not needed; rather, it is more important to have a fast localization of the obstacles to avoid them. All the methods in the literature are based on a punctual correspondence, but they are inefficient

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 role that graphs play within the Pattern... more

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 role that graphs play within the Pattern Recognition field. To this aim two taxonomies are ...

An overview of selected topics in face recognition is first presented in this chapter. The BioSecure 2D-face Benchmarking Framework is also described, com-posed of open-source software, publicly available databases and protocols. Three... more

An overview of selected topics in face recognition is first presented in this chapter. The BioSecure 2D-face Benchmarking Framework is also described, com-posed of open-source software, publicly available databases and protocols. Three methods for 2D-face ...

Recent studies have shown that the operational modules of an Energy Management System (EMS) are vulnerable to the anomalies that exist in an electric topological and configuration database (DB). In this paper, we focus on the security of... more

Recent studies have shown that the operational modules of an Energy Management System (EMS) are vulnerable to the anomalies that exist in an electric topological and configuration database (DB). In this paper, we focus on the security of EMS modules by detecting anomalies in an electric network DB. Firstly, we explain how an EMS's Optimal Power Flow (OPF) module can be exploited by accidental or deliberate changes in a power system model. As a defense mechanism, for the first time, we propose a graph comparison-based approach for identifying anomalies in an electric network DB. In this study, we formulate the problem as a Quadratic Assignment Problem (QAP) and use the Graduated Assignment algorithm to perform graph matching. To evaluate the effectiveness of the proposed method, we consider different test scenarios considering the IEEE benchmark 24-bus, 30-bus and 118-bus test systems. The results obtained from this analysis show that the proposed method successfully captures DB anomalies at very high detection rates with a smaller time complexity than those obtained from studies published in relevant literature.

In this paper, we consider the Capacitated Arc Routing Problem (CARP), in which a fleet of vehicles, based on a specified vertex (the depot) and with a known capacity Q, must service a subset of the edges of a graph, with minimum total... more

In this paper, we consider the Capacitated Arc Routing Problem (CARP), in which a fleet of vehicles, based on a specified vertex (the depot) and with a known capacity Q, must service a subset of the edges of a graph, with minimum total cost and such that the load assigned to each vehicle does not exceed its capacity. New lower bounds are developed for this problem, producing at least as good results as the already existing ones. Three of the proposed lower bounds are obtained from the resolution of a minimum cost perfect matching problem. The fourth one takes into account the vehicle capacity and is computed using a dynamic programming algorithm. Computational results, in which these bounds are compared on a set of test problems, are included.

Task assignment is one of the most challenging problems in distributed computing environment. An optimal task assignment guarantees minimum turnaround time for a given architecture. Several approaches of optimal task assignment have been... more

Task assignment is one of the most challenging problems in distributed computing environment. An optimal task assignment guarantees minimum turnaround time for a given architecture. Several approaches of optimal task assignment have been proposed by various researchers ranging from graph partitioning based tools to heuristic graph matching. Using heuristic graph matching, it is often impossible to get optimal task assignment for practical test cases within an acceptable time limit. In this paper, we have parallelized the basic heuristic graph-matching algorithm of task assignment which is suitable only for cases where processors and inter processor links are homogeneous. This proposal is a derivative of the basic task assignment methodology using heuristic graph matching. The results show that near optimal assignments are obtained much faster than the sequential program in all the cases with reasonable speed-up.