亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

HLDD: Hierarchically Learned Detector and Descriptor for Robust Image Matching

过度拟合 人工智能 计算机科学 探测器 匹配(统计) 模式识别(心理学) 特征(语言学) 最佳显著性理论 计算机视觉 特征提取 图像(数学) 数学 人工神经网络 电信 统计 哲学 语言学 心理治疗师 心理学
作者
M. Hu,Bin Sun,F. Zhang,Shutao Li
出处
期刊:IEEE transactions on image processing [Institute of Electrical and Electronics Engineers]
卷期号:34: 3123-3138
标识
DOI:10.1109/tip.2025.3568310
摘要

Image matching is a critical task in computer vision research, focusing on aligning two or more images with similar features. Feature detection and description constitute the core of image matching. Handcrafted detectors are capable of obtaining distinctive points but these points may not be repeatable on the image pairs especially those with dramatic appearance changes. On the contrary, the learned detectors can extract a large number of repeatable points but many of them tend to be ambiguous points with low distinctiveness. Moreover, in the scenarios of dramatic appearance change, commonly used contrast or triplet loss in the training of descriptors employ the hard negative mining strategy, which may obtain overly challenging negative samples by global sampling, resulting in sluggish convergence or even overfitting. Those learned descriptors may not guarantee that the corresponding points enjoy larger similarities than unmatched ones, leading to inaccurate matches. To address those issues, we propose a hierarchically learned detector and descriptor (HLDD) for robust image matching, which contains three modules: a handcrafted-learned detector, a hierarchically learned descriptor, and a coarse-to-fine matching strategy. The handcrafted-learned detector integrates the advantages of handcrafted and learned detectors. It extracts distinctive feature points from a learned repeatability map robust to image changes and eliminates the ambiguous ones according to a learned distinctiveness map. The descriptor is trained by a proposed hierarchical triplet loss, which employs a dual window strategy. It can obtain the hardest negative samples in local windows, which are comparatively easier over global sampling, ensuring the effective training of descriptors. The coarse-to-fine matching strategy performs global and local mutual nearest neighbor matching on the coarse and fine descriptor maps respectively to improve the matching accuracy progressively. By comparing with other matching methods, experimental results demonstrate the superiority of the proposed method in the task of image matching, homography estimation, visual localization, and relative pose estimation. Moreover, ablation studies illustrate the effectiveness of the three proposed modules.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
月烟发布了新的文献求助10
3秒前
j7完成签到,获得积分10
9秒前
13秒前
null的应助被单薄酸奶采纳,获得10
14秒前
王拥军发布了新的文献求助10
17秒前
lbmedicine完成签到 ,获得积分10
18秒前
西吴完成签到 ,获得积分0
19秒前
香蕉觅云的应助被科研通管家采纳,获得10
21秒前
21秒前
21秒前
21秒前
酷酷的安柏完成签到 ,获得积分10
21秒前
迷人悒完成签到,获得积分10
21秒前
CipherSage的应助被香蕉保温杯采纳,获得10
22秒前
24秒前
26秒前
26秒前
30秒前
30秒前
二丙发布了新的文献求助30
31秒前
32秒前
35秒前
36秒前
淡然的易槐完成签到,获得积分10
37秒前
38秒前
46秒前
风11发布了新的文献求助20
46秒前
46秒前
简单往事完成签到,获得积分10
51秒前
52秒前
Orange的应助被二丙采纳,获得10
53秒前
CodeCraft的应助被二丙采纳,获得10
53秒前
科目三的应助被二丙采纳,获得10
54秒前
Orange的应助被二丙采纳,获得10
54秒前
华仔的应助被二丙采纳,获得10
54秒前
情怀的应助被二丙采纳,获得10
54秒前
Orange的应助被二丙采纳,获得10
54秒前
Seven发布了新的文献求助10
55秒前
56秒前
小蘑菇的应助被阿康学科研采纳,获得10
58秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Les Mantodea De Guyane 2000
Energie-Contracting 1500
Stochastic Models in Operations Research,Vol. 2 600
Organizational Behavior 510
Critical Bildung: Hegel and the Logic of Diremption 500
Stell & Maran's Head and Neck Surgery and Oncology 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8032701
求助须知:如何正确求助?哪些是违规求助? 9470825
关于积分的说明 21246340
捐赠科研通 7602396
什么是DOI,文献DOI怎么找? 3389096
关于科研通互助平台的介绍 2521285
邀请新用户注册赠送积分活动 2426209