Journal of South China University of Technology(Natural Science Edition) ›› 2019, Vol. 47 ›› Issue (2): 50-58.doi: 10.12141/j.issn.1000-565X.180278

• Electronics, Communication & Automation Technology • Previous Articles     Next Articles

Image Matching Algorithm Based on Directed Hypergraph
 

 ZHU Ming1, 2, 3 ZHANG Jian2 LIANG Dong1, 2, 3 TANG Jun1, 2 ZHANG Yan1, 2   

  1.  1. National Engineering Research Center for Agro-Ecological Big Data Analysis and Application,Anhui University,Hefei 230601, Anhui,China; 2. School of Electronics and Information Engineering,Anhui University,Hefei 230601,Anhui,China; 3. Key Laboratory of Polarization Imaging Detection Technology in Anhui Province,Hefei 230031,Anhui,China
  • Received:2018-06-08 Revised:2018-09-28 Online:2019-02-25 Published:2019-01-02
  • Contact: 梁栋( 1963-) ,男,教授,博士生导师,主要从事计算机视觉、图像处理、模式识别研究 E-mail:dliang@ahu.edu.cn
  • About author:朱明( 1984-) ,男,博士,讲师,主要从事计算机视觉、图像处理、模式识别研究
  • Supported by:
     Supported by the National Natural Science Foundation of China( 61501003, 61772032, 61672032) 

Abstract: An algorithm for images matching based on directed hypergraph was proposed to improve the matching accuracy of graph model under the complex transformation. Firstly,3-uniform hypergraphs in the two feature points set to be matched was constructed by the algorithm,and the weights of the triples contained in each hyperedge was calculated, then these weights were used to construct weighted adjacency tensors. Finally,image matching was achieved by convex-concave relaxation algorithm. The experiments with both simulate and real results show that the proposed algorithm can achieve higher matching accuracy and good matching effect for complex transformed images. 

Key words:

 

CLC Number: