跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1111新增论文
+874其中 AI 相关
+133已有论文修订
+97新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-19 19:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-19 09:26 — 2026-11-20 09:26(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-20 08:48最近发现新增版本:2026-11-19 19:09库内论文最新更新时间:2026-11-19 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

27,982 已收录论文23,249 AI 相关8,559 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
版本更新 · v2arXiv:2610.09459

An Invariant Tangent-Angle Descriptor and a Band U-Net for 2D Fragment Adjacency Prediction

Guillaume Brouillette, Alain Goupil, Pierre-Olivier Parisé, Fadel Touré

原文摘要

Reassembling a broken artefact begins with deciding which fragments are adjacent. This paper addresses adjacency prediction for pairs of 2D fragments by analysing their contours. We propose a two-stage pipeline. In the first stage, each contour point is encoded using a tangent-angle profile, a descriptor that does not depend on rotation, translation or the choice of starting point. Pairs of profiles are then used to build an adjacency matrix, each entry computed either from a log-likelihood ratio or using a small 1D convolutional network. In the second stage, a U-Net classifies this matrix to predict whether the two fragments are adjacent. We compared our pipeline with two approaches from the literature using their own datasets. The results show that our approach outperforms them by reaching a Recall@10 of 0.823 versus 0.564 on the real dataset of PairingNet, and an accuracy of 0.979 versus 0.916 on Beaulac's dataset.

cs.CV · cs.LG