计算机科学
超图
人工智能
理论计算机科学
特征(语言学)
自然语言处理
对应问题
域代数上的
电子邮件
算法
模式识别(心理学)
矩阵代数
可视化
计算学习理论
特征提取
算法设计
作者
Xiaojie Li,Xu Cheng,Jingtao Wang,Xin Jiang,Zechao Li
标识
DOI:10.1109/tmm.2026.3732960
摘要
Learning reliable correspondences (inliers) and removing unreliable correspondences (outliers) is a fundamental task in computer vision. However, previous works based on local pairwise relationships fail to effectively capture high-order consistency constraints among nodes, multi-node geometric or structural relationships. To address these, we propose an Energy-Guided Hypergraph Network (EGH-Net), which decomposes high-order consistency constraints into the multinode consistency within each hypergraph and the structural relationship across graphs, thereby achieving more effective outlier rejection. Specifically, we first construct the hypergraph to capture group-wise relations among nodes, which enables a more expressive modeling of structural relationships among multiple nodes, compared to conventional local pairwise relations. Then, we design the intra-graph energy function to compute feature differences among multiple nodes to model the consistency constraints within each hypergraph. We also design an inter-graph energy function to capture structural consistency across different hypergraphs, where a Graph Structural Alignment Block is proposed to align features from different hypergraphs, considering they are graph-specific and not directly comparable. Finally, we optimize both intra- and inter-graph energy via gradient descent to encourage node features toward high-order consistency, thereby achieving more accurate inlier identification. Extensive experiments demonstrate that the EGH-Net achieves superior performance compared to methods across various visual tasks.
科研通智能强力驱动
Strongly Powered by AbleSci AI