Harmonizing real time data using maximum weighted graph matching
| Author(s) | : | R.Pavithra, Dr.R.Prabhakar |
| Institution | : | PG Scholar, Department of Computer Science and Engineering, Coimbatore Institute Of Technology, Coimbatore |
| Published In | : | Vol. 4, Issue 4 — April 2017 |
| Page No. | : | 969-976 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computervision, and facility allocation. In this paper, we consider the optimal graph matching problem for real time dataset likefish, house, and bird. Weighted graph matching algorithm is efficient for large number of dataset. The WGMP is theproblem of finding the optimum matching between two weighted graphs, which are graphs with weights at each arc. Theproposed method employs an analytic, instead of a combinatorial or iterative, approach to the optimum matchingproblem of such graphs. By using the eigendecompositions of the adjacency matrices (in the case of the undirected graphmatching problem) or some Hermitian matrices derived from the adjacency matrices (in the case of the directed graphmatching problem), a matching close to the optimum one can be found efficiently when the graphs are sufficiently closeto each other. Simulation experiments are also given to evaluate the performance of the proposed method.
R.Pavithra, Dr.R.Prabhakar, “Harmonizing real time data using maximum weighted graph matching”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 4, Issue 4, pp. 969-976, April 2017.
