@article{R.Pavithra_Dr.R.Prabhakar_2017, title={Harmonizing real time data using maximum weighted graph matching}, volume={4}, url={https://ijaerd.com/index.php/IJAERD/article/view/2746}, abstractNote={<p>Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer<br>vision, and facility allocation. In this paper, we consider the optimal graph matching problem for real time dataset like<br>fish, house, and bird. Weighted graph matching algorithm is efficient for large number of dataset. The WGMP is the<br>problem of finding the optimum matching between two weighted graphs, which are graphs with weights at each arc. The<br>proposed method employs an analytic, instead of a combinatorial or iterative, approach to the optimum matching<br>problem of such graphs. By using the eigendecompositions of the adjacency matrices (in the case of the undirected graph<br>matching problem) or some Hermitian matrices derived from the adjacency matrices (in the case of the directed graph<br>matching problem), a matching close to the optimum one can be found efficiently when the graphs are sufficiently close<br>to each other. Simulation experiments are also given to evaluate the performance of the proposed method.</p>}, number={4}, journal={International Journal of Advance Engineering and Research Development (IJAERD)}, author={R.Pavithra and Dr.R.Prabhakar}, year={2017}, month={Apr.}, pages={969–976} }