Most existing template matching algorithms are global matching between the template target and the search region, which makes the matching process retain a lot of unfavourable background information and ignore the structure and local information of the template target. To address this problem, a template matching algorithm based on bipartite graph and graph attention mechanism is proposed in this paper. The algorithm models the similarity matching problem between template features and search region features as a complete bipartite graph, realises local‐to‐local information transfer between the two, and uses the graph attention mechanism to apply weights between local information to obtain a learnable embedding network module. In addition, in terms of feature representation, a multi‐level feature fusion module based on CNN is introduced, which improves the representation of a target by fusing features with different representational meanings of the target. Experimental results on several typical datasets show that the proposed algorithm achieves leading performance in terms of accuracy and efficiency compared to the two state‐of‐the‐art CNN‐based template matching algorithms, Deep‐DIM and QATM.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.