稳健性(进化)
正确性
计算机科学
线性规划
图形
人工智能
匹配(统计)
数学优化
特征向量
数学
算法
理论计算机科学
模式识别(心理学)
统计
基因
生物化学
化学
作者
Xingyu Jiang,Yifan Xia,Xiao-Ping Steven Zhang,Jiayi Ma
标识
DOI:10.1016/j.patcog.2022.108588
摘要
Image matching plays a vital role in many computer vision tasks, and this paper focuses on the mismatch removal problem of feature-based matching. We formulate the problem into a general yet effective optimization framework based on graph matching by combining integer quadratic programming with a compensation term for discouraging matches, termed as Local Graph Structure Consensus (LGSC). Considering the local area similarity of those potential true matches, we design a local graph structure for preserving geometric topology, which contains a local indicator vector and a local affinity vector for each correspondence. The local indicator vector is utilized for edge construction, while the local affinity vector represents the match correctness of the nodes and edges between two graphs. In particular, the ranking shift with scale and rotation invariance is exploited to represent the node affinity. Ultimately, we derive a closed-form solution with linearithmic time and linear space complexity. Moreover, a multi-scale and iterative graph construction strategy is proposed to promote the performance of our method in terms of robustness and effectiveness. Extensive experiments on various real image datasets demonstrate that our LGSC can achieve superior performance over current state-of-the-art approaches.
科研通智能强力驱动
Strongly Powered by AbleSci AI