arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1611.07571cs.CVcs.LGcs.NE
收藏

Quad-networks:无监督学习对兴趣点检测进行排序

Quad-networks: unsupervised learning to rank for interest point detection

ETH Zurich(苏黎世联邦理工学院);Toshiba Corporation(东芝公司);Microsoft(微软)

Nikolay Savinov, Akihito Seki, Lubor Ladicky, Torsten Sattler, Marc Pollefeys

摘要:

几个机器学习任务需要仅使用稀疏的兴趣点集来表示数据。一个理想的检测器是能够找到相应的兴趣点,即使数据经历了一个典型的给定域的变换。由于该任务在计算机视觉中具有很高的实际意义,因此提出了许多手工制作的解决方案。在本文中,我们提出了一个基本问题:我们可以从头开始学习这样的检测器吗?由于通常不清楚哪些点是“有趣的”,因此无法使用人为标签来找到真正无偏见的解决方案。因此,这项任务需要一个无监督的制定。我们是第一个提出这样一个公式:训练一个神经网络以变换不变的方式对点进行排名。然后从该排名的顶部/底部分位数中提取兴趣点。我们验证了我们的方法上的两个任务:标准的RGB图像兴趣点检测和具有挑战性的跨模态RGB和深度图像之间的兴趣点检测。我们定量地表明,我们的无监督方法的性能更好或与基线相当。

英文摘要:

Several machine learning tasks require to represent the data using only a sparse set of interest points. An ideal detector is able to find the corresponding interest points even if the data undergo a transformation typical for a given domain. Since the task is of high practical interest in computer vision, many hand-crafted solutions were proposed. In this paper, we ask a fundamental question: can we learn such detectors from scratch? Since it is often unclear what points are "interesting", human labelling cannot be used to find a truly unbiased solution. Therefore, the task requires an unsupervised formulation. We are the first to propose such a formulation: training a neural network to rank points in a transformation-invariant manner. Interest points are then extracted from the top/bottom quantiles of this ranking. We validate our approach on two tasks: standard RGB image interest point detection and challenging cross-modal interest point detection between RGB and depth images. We quantitatively show that our unsupervised method performs better or on-par with baselines.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑