等变映射
稳健性(进化)
计算机科学
人工智能
旋转(数学)
卷积神经网络
瓶颈
匹配(统计)
模式识别(心理学)
卷积(计算机科学)
算法
机器人学
计算机视觉
数学
人工神经网络
机器人
纯数学
生物化学
化学
统计
基因
嵌入式系统
作者
Shuai Su,Ronghao Dang,Rui Fan,Chengju Liu,Qijun Chen
标识
DOI:10.1016/j.neucom.2023.127053
摘要
Learning-based correspondence matching methods have become the mainstream techniques in many computer vision and robotics applications due to their robustness to large illumination and viewpoint changes. However, it is difficult for conventional convolutional neural networks (CNNs) to extract rotation-equivariant local features. Recent work has shown that CNNs combined with group-equivariant architectures are surprisingly effective at matching correspondences even when the images are rotated to a dramatic extent. However, the inherent shape (square) of convolution kernels causes the performance bottleneck of such rotation-equivariant CNNs. To address this issue, we propose an adaptive dual rotation-equivariant correspondence matching algorithm, which performs stably at all angles. We mathematically analyze the effectiveness of our proposed rotation-equivariant correspondence matching approach and its performance with respect to different convolution kernels. Extensive experiments on the Rotated-HPatches, SIM2E, and MegaDepth datasets demonstrate the effectiveness of our proposed algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI