Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Engineering
A New Computational Framework For Efficient Parallelization And Optimization Of Large Scale Graph Matching, Sahar Marefat Navaz
A New Computational Framework For Efficient Parallelization And Optimization Of Large Scale Graph Matching, Sahar Marefat Navaz
LSU Doctoral Dissertations
There are so many applications in data fusion, comparison, and recognition that require a robust and efficient algorithm to match features of multiple images. To improve accuracy and get a more stable result is important to take into consideration both local appearance and the pairwise relationship of features. Graphs are a powerful and flexible data structure, allowing for the description of complex relationships between data elements, whose nodes correspond to salient features and edges correspond to relational aspects between features. Therefore, the problem of graph matching is to find a mapping between the two sets of nodes that preserves the …